Thecontentofthisbookismotivatedbytherecentchangesinglobalmarketsandthe availability of new transportation services. Indeed, the complexity of current supply chains suggests todecision makers in logisticsto work witha set ofef?cient (Pare- optimal) solutions, mainly to capture different economical aspects that, in general, one optimal solution related to a single objective function is not able to capture - tirely. Motivated by these reasons, we study freight transportation systems with a speci?c focus on multi-objective modelling. The goal is to provide decision m- ers with new methods and tools to implement multi-objective optimization models in logistics. The book combines theoretical aspects with applications, showing the advantages and the drawbacks of adopting scalarization techniques, and when it is worthwhile to reduce the problem to a goal-programming one. Also, we show - plications where more than one decision maker evaluates the effectiveness of the logistic system and thus a multi-level programming is sought to attain meaningful solutions. After presenting the general working framework, we analyze logistic - sues in a maritime terminal. Next, we study multi-objective route planning, relying on the application of hazardous material transportation. Then, we examine freight distribution on a smaller scale, as for the case of goods distribution in metropolitan areas. Finally, we present a human-workforce problem arising in logistic platforms. The general approach followed in the text is that of presenting mathematics, al- rithms and the related experimentations for each problem.

Researchers and practitioners alike are increasingly turning to search, op timization, and machine-learning procedures based on natural selection and natural genetics to solve problems across the spectrum of human endeavor. These genetic algorithms and techniques of evolutionary computation are solv ing problems and inventing new hardware and software that rival human designs. The Kluwer Series on Genetic Algorithms and Evolutionary Computation pub lishes research monographs, edited collections, and graduate-level texts in this rapidly growing field. Primary areas of coverage include the theory, implemen tation, and application of genetic algorithms (GAs), evolution strategies (ESs), evolutionary programming (EP), learning classifier systems (LCSs) and other variants of genetic and evolutionary computation (GEC). The series also pub lishes texts in related fields such as artificial life, adaptive behavior, artificial immune systems, agent-based systems, neural computing, fuzzy systems, and quantum computing as long as GEC techniques are part of or inspiration for the system being described. This encyclopedic volume on the use of the algorithms of genetic and evolu tionary computation for the solution of multi-objective problems is a landmark addition to the literature that comes just in the nick of time. Multi-objective evolutionary algorithms (MOEAs) are receiving increasing and unprecedented attention. Researchers and practitioners are finding an irresistible match be tween the popUlation available in most genetic and evolutionary algorithms and the need in multi-objective problems to approximate the Pareto trade-off curve or surface.

Decision making is the process of selecting a possible course of action from all the available alternatives. In almost all such problems the multiplicity of criteria for judging the alternatives is pervasive. That is, for many such problems, the decision maker (OM) wants to attain more than one objective or goal in selecting the course of action while satisfying the constraints dictated by environment, processes, and resources. Another characteristic of these problems is that the objectives are apparently non commensurable. Mathematically, these problems can be represented as: (1. 1 ) subject to: gi(~) ~ 0, ,', . . . ,. ! where ~ is an n dimensional decision variable vector. The problem consists of n decision variables, m constraints and k objectives. Any or all of the functions may be nonlinear. In literature this problem is often referred to as a vector maximum problem (VMP). Traditionally there are two approaches for solving the VMP. One of them is to optimize one of the objectives while appending the other objectives to a constraint set so that the optimal solution would satisfy these objectives at least up to a predetermined level. The problem is given as: Max f. ~) 1 (1. 2) subject to: where at is any acceptable predetermined level for objective t. The other approach is to optimize a super-objective function created by multiplying each 2 objective function with a suitable weight and then by adding them together.

Building on the author’s earlier Applied Simulation and Optimization, this book presents novel methods for solving problems in industry, based on hybrid simulation-optimization approaches that combine the advantages of both paradigms. The book serves as a comprehensive guide to tackling scheduling, routing problems, resource allocations and other issues in industrial environments, the service industry, production processes, or supply chains and aviation. Logistics, manufacturing and operational problems can either be modelled using optimization techniques or approaches based on simulation methodologies. Optimization techniques have the advantage of performing efficiently when the problems are properly defined, but they are often developed through rigid representations that do not include or accurately represent the stochasticity inherent in real systems. Furthermore, important information is lost during the abstraction process to fit each problem into the optimization technique. On the other hand, simulation approaches possess high description levels, but the optimization is generally performed through sampling of all the possible configurations of the system. The methods explored in this book are of use to researchers and practising engineers in fields ranging from supply chains to the aviation industry.