Stochastic hydrology is an essential base of water resources systems analysis, due to the inherent randomness of the input, and consequently of the results. These results have to be incorporated in a decision-making process regarding the planning and management of water systems. It is through this application that stochastic hydrology finds its true meaning, otherwise it becomes merely an academic exercise. A set of well known specialists from both stochastic hydrology and water resources systems present a synthesis of the actual knowledge currently used in real-world planning and management. The book is intended for both practitioners and researchers who are willing to apply advanced approaches for incorporating hydrological randomness and uncertainty into the simulation and optimization of water resources systems. (abstract) Stochastic hydrology is a basic tool for water resources systems analysis, due to inherent randomness of the hydrologic cycle. This book contains actual techniques in use for water resources planning and management, incorporating randomness into the decision making process. Optimization and simulation, the classical systems-analysis technologies, are revisited under up-to-date statistical hydrology findings backed by real world applications.

This work results from my interest in the field of vector optimiza tion. I stumbled first upon this subject in 1982 during my six months visit to the Istituto di Elaborazione della Informazione in Pisa, Italy, supported by a fellowship of the (Italian) Consiglio Nationale delle Richerche. I was attracted then by a gap between vector optimiza tion used to serve as a formal model for multiple objective decision problems and the decision problems themselves, the gap nonexis tent in scalar optimization. Roughly speaking, vector optimization provides methods for ranking decisions according to a partial order whereas decision making requires a linear ordering of decisions. The book deals with vector optimization. However, vector opti mization is considered here not only as a topic of research in itself but also as a basic tool for decision making. In consequence, all results presented here are aimed at exploiting and understanding the structure of elements (decisions) framed by a vector optimiza tion problem with the underlying assumption that the results should be interpretable in terms and applicable in the context of decision making. Computational tractability of results is therefore of special concern throughout this book. A unified framework for presentation is offered by the Cone Sep aration Technique (CST) founded on the notion of cone separation.

Since the introduction of genetic algorithms in the 1970s, an enormous number of articles together with several significant monographs and books have been published on this methodology. As a result, genetic algorithms have made a major contribution to optimization, adaptation, and learning in a wide variety of unexpected fields. Over the years, many excellent books in genetic algorithm optimization have been published; however, they focus mainly on single-objective discrete or other hard optimization problems under certainty. There appears to be no book that is designed to present genetic algorithms for solving not only single-objective but also fuzzy and multiobjective optimization problems in a unified way. Genetic Algorithms And Fuzzy Multiobjective Optimization introduces the latest advances in the field of genetic algorithm optimization for 0-1 programming, integer programming, nonconvex programming, and job-shop scheduling problems under multiobjectiveness and fuzziness. In addition, the book treats a wide range of actual real world applications. The theoretical material and applications place special stress on interactive decision-making aspects of fuzzy multiobjective optimization for human-centered systems in most realistic situations when dealing with fuzziness. The intended readers of this book are senior undergraduate students, graduate students, researchers, and practitioners in the fields of operations research, computer science, industrial engineering, management science, systems engineering, and other engineering disciplines that deal with the subjects of multiobjective programming for discrete or other hard optimization problems under fuzziness. Real world research applications are used throughout the book to illustrate the presentation. These applications are drawn from complex problems. Examples include flexible scheduling in a machine center, operation planning of district heating and cooling plants, and coal purchase planning in an actual electric power plant.

The book Scatter Search by Manuel Laguna and Rafael Marti represents a long-awaited "missing link" in the literature of evolutionary methods. Scatter Search (SS)-together with its generalized form called Path Relinking-constitutes the only evolutionary approach that embraces a collection of principles from Tabu Search (TS), an approach popularly regarded to be divorced from evolutionary procedures. The TS perspective, which is responsible for introducing adaptive memory strategies into the metaheuristic literature (at purposeful level beyond simple inheritance mechanisms), may at first seem to be at odds with population-based approaches. Yet this perspective equips SS with a remarkably effective foundation for solving a wide range of practical problems. The successes documented by Scatter Search come not so much from the adoption of adaptive memory in the range of ways proposed in Tabu Search (except where, as often happens, SS is advantageously coupled with TS), but from the use of strategic ideas initially proposed for exploiting adaptive memory, which blend harmoniously with the structure of Scatter Search. From a historical perspective, the dedicated use of heuristic strategies both to guide the process of combining solutions and to enhance the quality of offspring has been heralded as a key innovation in evolutionary methods, giving rise to what are sometimes called "hybrid" (or "memetic") evolutionary procedures. The underlying processes have been introduced into the mainstream of evolutionary methods (such as genetic algorithms, for example) by a series of gradual steps beginning in the late 1980s.

Mathematical Programming and Financial Objectives for Scheduling Projects focuses on decision problems where the performance is measured in terms of money. As the title suggests, special attention is paid to financial objectives and the relationship of financial objectives to project schedules and scheduling. In addition, how schedules relate to other decisions is treated in detail. The book demonstrates that scheduling must be combined with project selection and financing, and that scheduling helps to give an answer to the planning issue of the amount of resources required for a project. The author makes clear the relevance of scheduling to cutting budget costs. The book is divided into six parts. The first part gives a brief introduction to project management. Part two examines scheduling projects in order to maximize their net present value. Part three considers capital rationing. Many decisions on selecting or rejecting a project cannot be made in isolation and multiple projects must be taken fully into account. Since the requests for capital resources depend on the schedules of the projects, scheduling taken on more complexity. Part four studies the resource usage of a project in greater detail. Part five discusses cases where the processing time of an activity is a decision to be made. Part six summarizes the main results that have been accomplished.

Nonstandard Methods of Analysis is concerned with the main trends in this field; infinitesimal analysis and Boolean-valued analysis. The methods that have been developed in the last twenty-five years are explained in detail, and are collected in book form for the first time. Special attention is paid to general principles and fundamentals of formalisms for infinitesimals as well as to the technique of descents and ascents in a Boolean-valued universe. The book also includes various novel applications of nonstandard methods to ordered algebraic systems, vector lattices, subdifferentials, convex programming etc. that have been developed in recent years. For graduate students, postgraduates and all researchers interested in applying nonstandard methods in their work.

Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimizations comprises a carefully refereed selection of extended versions of the best papers presented at the Second Meta-Heuristics Conference (MIC 97). The selected articles describe the most recent developments in theory and applications of meta-heuristics, heuristics for specific problems, and comparative case studies. The book is divided into six parts, grouped mainly by the techniques considered. The extensive first part with twelve papers covers tabu search and its application to a great variety of well-known combinatorial optimization problems (including the resource-constrained project scheduling problem and vehicle routing problems). In the second part we find one paper where tabu search and simulated annealing are investigated comparatively and two papers which consider hybrid methods combining tabu search with genetic algorithms. The third part has four papers on genetic and evolutionary algorithms. Part four arrives at a new paradigm within meta-heuristics. The fifth part studies the behavior of parallel local search algorithms mainly from a tabu search perspective. The final part examines a great variety of additional meta-heuristics topics, including neural networks and variable neighbourhood search as well as guided local search. Furthermore, the integration of meta-heuristics with the branch-and-bound paradigm is investigated.

Strategies for Quasi-Monte Carlo builds a framework to design and analyze strategies for randomized quasi-Monte Carlo (RQMC). One key to efficient simulation using RQMC is to structure problems to reveal a small set of important variables, their number being the effective dimension, while the other variables collectively are relatively insignificant. Another is smoothing. The book provides many illustrations of both keys, in particular for problems involving Poisson processes or Gaussian processes. RQMC beats grids by a huge margin. With low effective dimension, RQMC is an order-of-magnitude more efficient than standard Monte Carlo. With, in addition, certain smoothness - perhaps induced - RQMC is an order-of-magnitude more efficient than deterministic QMC. Unlike the latter, RQMC permits error estimation via the central limit theorem. For random-dimensional problems, such as occur with discrete-event simulation, RQMC gets judiciously combined with standard Monte Carlo to keep memory requirements bounded. This monograph has been designed to appeal to a diverse audience, including those with applications in queueing, operations research, computational finance, mathematical programming, partial differential equations (both deterministic and stochastic), and particle transport, as well as to probabilists and statisticians wanting to know how to apply effectively a powerful tool, and to those interested in numerical integration or optimization in their own right. It recognizes that the heart of practical application is algorithms, so pseudocodes appear throughout the book. While not primarily a textbook, it is suitable as a supplementary text for certain graduate courses. As a reference, it belongs on the shelf of everyone with a serious interest in improving simulation efficiency. Moreover, it will be a valuable reference to all those individuals interested in improving simulation efficiency with more than incremental increases.

This special volume focuses on optimization and control of processes governed by partial differential equations. The contributors are mostly participants of the DFG-priority program 1253: Optimization with PDE-constraints which is active since 2006. The book is organized in sections which cover almost the entire spectrum of modern research in this emerging field. Indeed, even though the field of optimal control and optimization for PDE-constrained problems has undergone a dramatic increase of interest during the last four decades, a full theory for nonlinear problems is still lacking. The contributions of this volume, some of which have the character of survey articles, therefore, aim at creating and developing further new ideas for optimization, control and corresponding numerical simulations of systems of possibly coupled nonlinear partial differential equations. The research conducted within this unique network of groups in more than fifteen German universities focuses on novel methods of optimization, control and identification for problems in infinite-dimensional spaces, shape and topology problems, model reduction and adaptivity, discretization concepts and important applications. Besides the theoretical interest, the most prominent question is about the effectiveness of model-based numerical optimization methods for PDEs versus a black-box approach that uses existing codes, often heuristic-based, for optimization.

Project management has become a widespread instrument enabling organizations to efficiently master the challenges of steadily shortening product life cycles, global markets and decreasing profit margins. With projects increasing in size and complexity, their planning and control represents one of the most crucial management tasks. This is especially true for scheduling, which is concerned with establishing execution dates for the sub-activities to be performed in order to complete the project. The ability to manage projects where resources must be allocated between concurrent projects or even sub-activities of a single project requires the use of commercial project management software packages. However, the results yielded by the solution procedures included are often rather unsatisfactory. Scheduling of Resource-Constrained Projects develops more efficient procedures, which can easily be integrated into software packages by incorporated programming languages, and thus should be of great interest for practitioners as well as scientists working in the field of project management. The book is divided into two parts. In Part I, the project management process is described and the management tasks to be accomplished during project planning and control are discussed. This allows for identifying the major scheduling problems arising in the planning process, among which the resource-constrained project scheduling problem is the most important. Part II deals with efficient computer-based procedures for the resource-constrained project scheduling problem and its generalized version. Since both problems are NP-hard, the development of such procedures which yield satisfactory solutions in a reasonable amount of computation time is very challenging, and a number of new and very promising approaches are introduced. This includes heuristic procedures based on priority rules and tabu search as well as lower bound methods and branch and bound procedures which can be applied for computing optimal solutions.

This book contains translations of papers from the second volume of the new Russian-language journal published at the Sobolev Institute of Mathematics (Sibe- rian Branch of the Russian Academy of Sciences, Novosibirsk) since 1994. In 1994 the journal was titled Sibirskil Zhurnal Issledovaniya Oper- atsil. Since 1995 this journal has the title Diskretny'l Analiz i Issledovanie Operatsi'l (Discrete Analysis and Operations Research). The aim of this journal is to bring together research papers in different areas of discrete mathematics and computer science. The journal DiskretnYl Analiz i Issledovanie Operatsil covers the following fields: * discrete optimization * synthesis and complexity * discrete structures and * of control systems extremal problems * automata * combinatorics * graphs * control and reliability * game theory and its of discrete devices applications * mathematical models and * coding theory methods of decision making * scheduling theory * design and analysis * functional systems theory of algorithms Contributions presented to the journal can be original research papers and occasional survey articles of moderate length. The journal is published in one volume of four issues per year that appear in March, June, September, and December. Each volume contains approximately 400 pages. I express my sincere gratitude to Professor S. S. Kutateladze for his help in editing the English translation.

Real life phenomena in engineering, natural, or medical sciences are often described by a mathematical model with the goal to analyze numerically the behaviour of the system. Advantages of mathematical models are their cheap availability, the possibility of studying extreme situations that cannot be handled by experiments, or of simulating real systems during the design phase before constructing a first prototype. Moreover, they serve to verify decisions, to avoid expensive and time consuming experimental tests, to analyze, understand, and explain the behaviour of systems, or to optimize design and production. As soon as a mathematical model contains differential dependencies from an additional parameter, typically the time, we call it a dynamical model. There are two key questions always arising in a practical environment: 1 Is the mathematical model correct? 2 How can I quantify model parameters that cannot be measured directly? In principle, both questions are easily answered as soon as some experimental data are available. The idea is to compare measured data with predicted model function values and to minimize the differences over the whole parameter space. We have to reject a model if we are unable to find a reasonably accurate fit. To summarize, parameter estimation or data fitting, respectively, is extremely important in all practical situations, where a mathematical model and corresponding experimental data are available to describe the behaviour of a dynamical system.

Constraint and Integer Programming presents some of the basic ideas of constraint programming and mathematical programming, explores approaches to integration, brings us up to date on heuristic methods, and attempts to discern future directions in this fast-moving field.

This book has been written to address the increasing number of Operations Research and Management Science problems (that is, applications) that involve the explicit consideration of time and of gaming among multiple agents. It is a book that will be used both as a textbook and as a reference and guide by those whose work involves the theoretical aspects of dynamic optimization and differential games.

This introductory textbook adopts a practical and intuitive approach, rather than emphasizing mathematical rigor. Computationally oriented books in this area generally present algorithms alone, and expect readers to perform computations by hand, and are often written in traditional computer languages, such as Basic, Fortran or Pascal. This book, on the other hand, is the first text to use Mathematica to develop a thorough understanding of optimization algorithms, fully exploiting Mathematica's symbolic, numerical and graphic capabilities.

One service mathematics has rendered the 'Et moi, ... si j'avait su comment en revenir. je n'y serais point aIle.' human mee. It has put common sense back Jules Verne where it belongs, on the topmost shelf next to the dusty canister labelled 'discarded non The series is divergent; therefore we may be sense'. Eric T. Bell able to do something with it. O. Heaviside Mathematics is a tool for thought. A highly necessary tool in a world where both feedback and non linearities abound. Similarly, all kinds of parts of mathematics serve as tools for other parts and for other sciences. Applying a simple rewriting rule to the quote on the right above one finds such statements as: 'One service topology has rendered mathematical physics .. .'; 'One service logic has rendered com puter science .. .'; 'One service category theory has rendered mathematics .. .'. All arguably true. And all statements obtainable this way form part of the raison d'etre of this series."

Entropy optimization is a useful combination of classical engineering theory (entropy) with mathematical optimization. The resulting entropy optimization models have proved their usefulness with successful applications in areas such as image reconstruction, pattern recognition, statistical inference, queuing theory, spectral analysis, statistical mechanics, transportation planning, urban and regional planning, input-output analysis, portfolio investment, information analysis, and linear and nonlinear programming. While entropy optimization has been used in different fields, a good number of applicable solution methods have been loosely constructed without sufficient mathematical treatment. A systematic presentation with proper mathematical treatment of this material is needed by practitioners and researchers alike in all application areas. The purpose of this book is to meet this need. Entropy Optimization and Mathematical Programming offers perspectives that meet the needs of diverse user communities so that the users can apply entropy optimization techniques with complete comfort and ease. With this consideration, the authors focus on the entropy optimization problems in finite dimensional Euclidean space such that only some basic familiarity with optimization is required of the reader.

Semi-infinite optimization is a vivid field of active research. Recently semi infinite optimization in a general form has attracted a lot of attention, not only because of its surprising structural aspects, but also due to the large number of applications which can be formulated as general semi-infinite programs. The aim of this book is to highlight structural aspects of general semi-infinite programming, to formulate optimality conditions which take this structure into account, and to give a conceptually new solution method. In fact, under certain assumptions general semi-infinite programs can be solved efficiently when their bi-Ievel structure is exploited appropriately. After a brief introduction with some historical background in Chapter 1 we be gin our presentation by a motivation for the appearance of standard and general semi-infinite optimization problems in applications. Chapter 2 lists a number of problems from engineering and economics which give rise to semi-infinite models, including (reverse) Chebyshev approximation, minimax problems, ro bust optimization, design centering, defect minimization problems for operator equations, and disjunctive programming."

OmeGA: A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems addresses two increasingly important areas in GA implementation and practice. OmeGA, or the ordering messy genetic algorithm, combines some of the latest in competent GA technology to solve scheduling and other permutation problems. Competent GAs are those designed for principled solutions of hard problems, quickly, reliably, and accurately. Permutation and scheduling problems are difficult combinatorial optimization problems with commercial import across a variety of industries. This book approaches both subjects systematically and clearly. The first part of the book presents the clearest description of messy GAs written to date along with an innovative adaptation of the method to ordering problems. The second part of the book investigates the algorithm on boundedly difficult test functions, showing principled scale up as problems become harder and longer. Finally, the book applies the algorithm to a test function drawn from the literature of scheduling.

The symposiumwas motivatedby theincreasing need for modelling of material behaviourundervarious mechan icalconditions. This need is driven by the evolut ion ofcomputer capac ityand the resulting ability for engineers and scien tiststo address complexproblems . Reliable models formaterialbehaviour, including accurate numericalvalues of parameters ,are necessary for a continued beneficial development ofthe computational side of solid mechanics .High rate plasticity ,thermally assisted creep and phasetransformationsare only a fewexamplesof areas where more accurate modelsare needed. Experiments are necessary for the establishment ofmodels and parameters , and modified versionsof conventional test methods can make important contributions . Also modern optical methodsoffer a highpotentialfor futureexperimental development. Numerical simulations ofexperiments and so-called inverse modelling arealso frequentlyused techniques. The aim of the symposium was to bring together researchers with an interest in the areaofexperimental and computational aspects ofmaterial modelling for exchange and discussionofpromising methodsandresults. Abisko,a national park in the Swedish mountain district about 200 km north of the arctic circle and about one hourve dri from the airport ofKiruna,was chosen for the symposium. The tourist hotel in the park , overlookinga beautiful lake , offered a suitablevenue for the symposium. This environment with tracks for short walks (and long hikes),goals for small excursions and a hotel with restaurant and bar ve the ga delegatesmany opportunitiesto meet , socialiseand discuss during breaks and evenings.

Dynamic Portfolio Strategies: Quantitative Methods and Empirical Rules for Incomplete Information investigates optimal investment problems for stochastic financial market models. It is addressed to academics and students who are interested in the mathematics of finance, stochastic processes, and optimal control, and also to practitioners in risk management and quantitative analysis who are interested in new strategies and methods of stochastic analysis. While there are many works devoted to the solution of optimal investment problems for various models, the focus of this book is on analytical strategies based on "technical analysis" which are model-free. The technical analysis of these strategies has a number of characteristics. Two of the more important characteristics are: (1) they require only historical data, and (2) typically they are more widely used by traders than analysis based on stochastic models. Hence it is the objective of this book to reduce the gap between model-free strategies and strategies that are "optimal" for stochastic models. We hope that researchers, students and practitioners will be interested in some of the new empirically based methods of "technical analysis" strategies suggested in this book and evaluated via stochastic market models.

Noise is a common factor in most real-world optimization problems. Sources of noise can include physical measurement limitations, stochastic simulation models, incomplete sampling of large spaces, and human-computer interaction. Evolutionary algorithms are general, nature-inspired heuristics for numerical search and optimization that are frequently observed to be particularly robust with regard to the effects of noise. Noisy Optimization with Evolution Strategies contributes to the understanding of evolutionary optimization in the presence of noise by investigating the performance of evolution strategies, a type of evolutionary algorithm frequently employed for solving real-valued optimization problems. By considering simple noisy environments, results are obtained that describe how the performance of the strategies scales with both parameters of the problem and of the strategies considered. Such scaling laws allow for comparisons of different strategy variants, for tuning evolution strategies for maximum performance, and they offer insights and an understanding of the behavior of the strategies that go beyond what can be learned from mere experimentation. This first comprehensive work on noisy optimization with evolution strategies investigates the effects of systematic fitness overvaluation, the benefits of distributed populations, and the potential of genetic repair for optimization in the presence of noise. The relative robustness of evolution strategies is confirmed in a comparison with other direct search algorithms. Noisy Optimization with Evolution Strategies is an invaluable resource for researchers and practitioners of evolutionary algorithms.

Evolutionary Algorithms for Embedded System Design describes how Evolutionary Algorithm (EA) concepts can be applied to circuit and system design - an area where time-to-market demands are critical. EAs create an interesting alternative to other approaches since they can be scaled with the problem size and can be easily run on parallel computer systems. This book presents several successful EA techniques and shows how they can be applied at different levels of the design process. Starting on a high-level abstraction, where software components are dominant, several optimization steps are demonstrated, including DSP code optimization and test generation. Throughout the book, EAs are tested on real-world applications and on large problem instances. For each application the main criteria for the successful application in the corresponding domain are discussed. In addition, contributions from leading international researchers provide the reader with a variety of perspectives, including a special focus on the combination of EAs with problem specific heuristics. Evolutionary Algorithms for Embedded System Design is an excellent reference for both practitioners working in the area of circuit and system design and for researchers in the field of evolutionary concepts.

"Data Correcting Approaches in Combinatorial Optimization" focuses on algorithmic applications of thewell known polynomially solvable special cases of computationally intractable problems. The purpose of this text is to design practically efficient algorithms for solving wide classes of combinatorial optimization problems. Researches, students and engineers will benefit from new bounds and branching rules in development efficient branch-and-bound type computational algorithms. This book examines applications for solving the Traveling Salesman Problem and its variations, Maximum Weight Independent Set Problem, Different Classes of Allocation and Cluster Analysis as well as some classes of Scheduling Problems. Data Correcting Algorithms in Combinatorial Optimization introduces the data correcting approach to algorithms which provide an answer to the following questions: how to construct a bound to the original intractable problem and findwhich element of the corrected instance one should branch such that the total size of search tree will be minimized. The PC time needed for solving intractable problems will be adjusted with the requirements for solving real world problems. "

Sample-Path Analysis of Queueing Systems uses a deterministic (sample-path) approach to analyze stochastic systems, primarily queueing systems and more general input-output systems. Among other topics of interest it deals with establishing fundamental relations between asymptotic frequencies and averages, pathwise stability, and insensitivity. These results are utilized to establish useful performance measures. The intuitive deterministic approach of this book will give researchers, teachers, practitioners, and students better insights into many results in queueing theory. The simplicity and intuitive appeal of the arguments will make these results more accessible, with no sacrifice of mathematical rigor. Recent topics such as pathwise stability are also covered in this context. The book consistently takes the point of view of focusing on one sample path of a stochastic process. Hence, it is devoted to providing pure sample-path arguments. With this approach it is possible to separate the issue of the validity of a relationship from issues of existence of limits and/or construction of stationary framework. Generally, in many cases of interest in queueing theory, relations hold, assuming limits exist, and the proofs are elementary and intuitive. In other cases, proofs of the existence of limits will require the heavy machinery of stochastic processes. The authors feel that sample-path analysis can be best used to provide general results that are independent of stochastic assumptions, complemented by use of probabilistic arguments to carry out a more detailed analysis. This book focuses on the first part of the picture. It does however, provide numerous examples that invoke stochastic assumptions, which typically are presented at the ends of the chapters.