ABSTRACT
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.
