Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

After more than 10 years from the first edition of this book, the need for multi-objective
optimization models in freight logistics is still growing. Companies engineer always more …

Multi-objective combinatorial optimization problems (MOCOPs) widely exist in real
applications, and most of them are computationally difficult or NP-hard. How to solve …

Algorithms for approximating the nondominated set of multiobjective optimization problems
are reviewed. The approaches are categorized into general methods that are applicable …

In the Dial-a-Ride Problem (DARP) the aim is to design vehicle routes for a set of users who
must be transported between given origin and destination pairs, subject to a variety of side …

Multiobjective evolutionary algorithms have been successfully used to deal with
multiobjective combinatorial optimization problems for more than two decades. However, we …

This chapter retraces the joint history of operations research and the traveling salesman
problem. After presenting the problem, it proposes first exact then approximation algorithms …

We give faster and simpler approximation algorithms for the (1, 2)-TSP problem, a well-
studied variant of the traveling salesperson problem where all distances between cities are …

We present approximation algorithms for almost all variants of the multicriteria traveling
salesman problem (TSP). First, we devise randomized approximation algorithms for …

We analyze approximation algorithms for several variants of the traveling salesman problem
with multiple objective functions. First, we consider the symmetric TSP (STSP) with γ-triangle …