ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (44)
  • optimization  (44)
  • Springer  (44)
  • American Chemical Society (ACS)
  • Cell Press
  • 1995-1999  (41)
  • 1980-1984  (3)
  • Mathematics  (37)
  • Economics  (12)
  • 1
    ISSN: 1436-6304
    Keywords: Assignment problem ; computer models ; distribution sampling ; estimation ; integer programming ; large-scale modelling ; Latin hypercube ; optimization ; sampling ; sensitivity analysis ; Stichprobenverfahren ; Permutationsmatrizen ; implizite Funktionen
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Lateinische Hyperwürfel Stichprobenverfahren (LHS) dienen dazu, in geeigneter Weise die Verteilungsfunktion (zumindest angenähert) der Funktionswerte einer komplexen (impliziten) Funktion, in Abhängigkeit ihrer Variablen werte, zu schätzen. Anwendungen finden sich in Modellen, in denen erforderliche Variablenumformungen nicht möglich sind und in denen die Zahl der Simulationsläufe aus zeitlichen Gründen gering zu halten oder fixiert ist. Es stellt sich die Frage, welche Werte in jedem Lauf den Variablen zuzuordnen sind. Herkömmliche Vorgehensweisen benutzen ausgefeilte, geschichtete Stichprobenverfahren, die jedoch Fehler bei der Bestimmung von Varianz und Kovarianz, aufgrund der Korrelation der Stichprobenpaare, beinhalten können. In dieser Arbeit wird eine Methode beschrieben, den absoluten Fehler zwischen dem tatsächlichen und dem korrelierenden Stichprobenpaar so klein wie möglich zu halten. Selbst für kleine Stichprobenumfänge können dabei schon optimale Pläne erzielt werden. Permutationsmatrizen haben die Eigenschaft, die Summe der Korrelationen zwischen Spaltenpaaren zu minimieren. Die vorgestellte Heuristik ist in der Lage, in allen getesteten Fällen das Optimum zu finden.
    Notes: Abstract The objective of Latin Hypercube Sampling is to determine an effective procedure for sampling from a (possibly correlated) multivariate population to estimate the distribution function (or at least a significant number of moments) of a complicated function of its variables. The typical application involves a computer-based model in which it is largely impossible to find a way (closed form or numerical) to do the necessary transformation of variables and where it is expensive to run in terms of computing resources and time. Classical approaches to hypercube sampling have used sophisticated stratified sampling techniques; but such sampling may provide incorrect measures of the output parameters' variances or covariances due to correlation between the sampling pairs. In this work, we offer a strategy which provides a sampling specification minimizing the sum of the absolute values of the pairwise differences between the true and sampled correlation pairs. We show that optimal plans can be obtained for even small sample sizes. We consider the characteristics of permutation matrices which minimize the sum of correlations between column pairs and then present an effective heuristic for solution. This heuristic generally finds plans which match the correlation structure exactly. When it does not, we provide a hybrid lagrangian/heuristic method, which empirically has found the optimal solution for all cases tested.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Journal of heuristics 4 (1998), S. 295-321 
    ISSN: 1572-9397
    Keywords: multi-agent systems ; autonomous agents ; cooperation ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Experiments over a variety of optimization problems indicate that scale-effective convergence is an emergent behavior of certain computer-based agents, provided these agents are organized into an asynchronous team (A-Team). An A-Team is a problem-solving architecture in which the agents are autonomous and cooperate by modifying one another's trial solutions. These solutions circulate continually. Convergence is said to occur if and when a persistent solution appears. Convergence is said to be scale-effective if the quality of the persistent solution increases with the number of agents, and the speed of its appearance increases with the number of computers. This paper uses a traveling salesman problem to illustrate scale-effective behavior and develops Markov models that explain its occurrence in A-Teams, particularly, how autonomous agents, without strategic planning or centralized coordination, can converge to solutions of arbitrarily high quality. The models also perdict two properties that remain to be experimentally confirmed: • construction and destruction are dual processes. In other words, adept destruction can compensate for inept construction in an A-Team, and vice-versa. (Construction refers to the process of creating or changing solutions, destruction, to the process of erasing solutions.) • solution quality is independent of agent-phylum. In other words, A-Teams provide an organizational framework in which humans and autonomous mechanical agents can cooperate effectively.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Potential analysis 5 (1996), S. 183-205 
    ISSN: 1572-929X
    Keywords: Elliptic equations ; Hamilton-Jacobi equations ; optimization ; rearrangements ; 35J25 ; 35J70 ; 49K20 ; 49K30
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper we study the case of equalities in some comparison results for L 1-norm or L ∞-norm of the solutions of Dirichlet elliptic problem or Hamilton-Jacobi equations. We show that equalities are achieved only in spherically symmetric situations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 58 (1995), S. 379-402 
    ISSN: 1572-9338
    Keywords: Optimal control ; stochastic control ; dynamic systems ; economics ; public-sector applications ; optimization ; budgetary policies ; monetary policy
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract In this paper, we determine optimal budgetary and monetary policies for Austria using a small macroeconometric model. We use a Keynesian model of the Austrian economy, called FINPOL1, estimated by ordinary least squares, which relates the main objective variables of Austrian economic policies, such as the growth rate of real gross domestic product, the rate of unemployment, the rate of inflation, the balance of payments, and the ratio of the federal budget deficit to GDP, to fiscal and monetary policy instruments, namely expenditures and revenues of the federal budget and money supply. Optimal fiscal and monetary policies are calculated for the model under a quadratic objective function using the algorithm OPTCON for the optimum control of nonlinear stochastic dynamic systems. Several control experiments are performed in order to assess the influence of different kinds of uncertainty on optimal budgetary and monetary policies. Apart from deterministic optimization runs, different assumptions about parameter uncertainties are introduced; the results of these different stochastic optimum control experiments are compared and interpreted.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 56 (1995), S. 287-311 
    ISSN: 1572-9338
    Keywords: Probability functions ; gradient of integral ; sensitivity analysis ; optimization ; discrete event dynamic systems ; shut-down problem ; probabilistic risk analysis
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Probability functions depending upon parameters are represented as integrals over sets given by inequalities. New derivative formulas for the intergrals over a volume are considered. Derivatives are presented as sums of integrals over a volume and over a surface. Two examples are discussed: probability functions with linear constraints (random right-hand sides), and a dynamical shut-down problem with sensors.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Journal of heuristics 3 (1997), S. 63-81 
    ISSN: 1572-9397
    Keywords: Large-step Markov chain ; optimization ; simulated annealing ; traveling salesman problem
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The large-step Markov chain (LSMC) approach is the most effective known heuristic for large symmetric TSP instances; cf. recent results of [Martin, Otto and Felten, 1991] and [Johnson, 1990]. In this paper, we examine relationships among (i) the underlying local optimization engine within the LSMC approach, (ii) the “kick move” perturbation that is applied between successive local search descents, and (iii) the resulting LSMC solution quality. We find that the traditional “double-bridge” kick move is not necessarily optimum: stronger local optimization engines (e.g., Lin-Kernighan) are best matched with stronger kick moves. We also propose use of an adaptive temperature schedule to allow escape from deep basins of attraction; the resulting hierarchical LSMC variant outperforms traditional LSMC implementations that use uniformly zero temperatures. Finally, a population-based LSMC variant is studied, wherein multiple solution paths can interact to achieve improved solution quality.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 57 (1995), S. 217-232 
    ISSN: 1572-9338
    Keywords: Scheduling ; robotic cell ; tandem machines ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract The paper deals with the scheduling of a robotic cell in which jobs are processed on two tandem machines. The job transportation between the machines is done by a transportation robot. The robotic cell has limitations on the intermediate space between the machines for storing the work-in-process. What complicates the scheduling problem is that the loading/unloading operation times are non-negligible. Given the total number of operationsn, an optimalO(n logn)-time algorithm is proposed together with the proof of optimality.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Journal of heuristics 4 (1998), S. 281-287 
    ISSN: 1572-9397
    Keywords: optimization ; benchmarking ; overfitting ; general and targeted methods ; method applicability ; practical relevance
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Benchmark problems should be hard. True. Methods for solving problems should be useful for more than just “beating” a particular benchmark. Truer still, we believe. In this paper, we examine the worthiness of the approach consisting of concentration on a particular set of benchmark problems, an issue raised by a recent paper by Ian Gent. We find that such a methodology can easily lead to publications of limited general use as far as our ability to solve practical problems is concerned.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 58 (1995), S. 243-260 
    ISSN: 1572-9338
    Keywords: Assignment problem ; computer models ; distribution sampling ; estimation ; integer programming ; large-scale modelling ; latin hypercube ; optimization ; sampling ; sensitivity analysis
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Latin hypercube sampling is often used to estimate the distribution function of a complicated function of many random variables. In so doing, it is typically necessary to choose a permutation matrix which minimizes the correlation among the cells in the hypercube layout. This problem can be formulated as a generalized, multi-dimensional assignment problem. For the two-dimensional case, we provide a polynomial algorithm. For higher dimensions, we offer effective heuristic and bounding procedures.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Journal of heuristics 4 (1998), S. 47-62 
    ISSN: 1572-9397
    Keywords: tabu search ; frequency ; assignment ; constraints ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The main goal of the Frequency Assignment Problem in mobile radio networks consists of assigning a limited number of frequencies to each radio cell in a cellular network while minimizing electromagnetic interference due to the reuse of frequencies. This problem, known to be NP-hard, is of great importance in practice since better solutions will allow a telecommunications operator to manage larger cellular networks. This paper presents a new Tabu Search algorithm for this application. The algorithm is tested on realistic and large problem instances and compared with other methods based on simulated annealing, constraint programming and graph coloring algorithms. Empirical evidence shows that the Tabu algorithm is very competitive by giving the best solutions to the tested instances.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...