Stochastic Local Search Algorithms for Multiobjective Combinatorial Optimization: A Review

Authored by: Luís Paquete , Thomas Stützle

Handbook of Approximation Algorithms and Metaheuristics, Second Edition

Print publication date:  May  2018
Online publication date:  May  2018

Print ISBN: 9781498770118
eBook ISBN: 9781351236423
Adobe ISBN:


 Download Chapter



Multiobjective combinatorial optimization problems (MCOPs) are combinatorial problems that involve the optimization of several, typically conflicting objectives. An MCOP arises, for example, when planning a holiday trip from a city A to some city B. Besides the minimization of the overall distance between the two sites, one may also be interested in minimizing the cost, the overall travel time, and so on. An unequivocal solution to such problems is the one which is optimal with respect to all objectives. But is there such a solution? The shortest tour is not necessarily the fastest nor the fastest needs to be the cheapest one—just consider tolled highways.

Search for more...
Back to top

Use of cookies on this website

We are using cookies to provide statistics that help us give you the best experience of our site. You can find out more in our Privacy Policy. By continuing to use the site you are agreeing to our use of cookies.