On local optima in multiobjective combinatorial optimization problems

DOI10.1007/s10479-007-0230-0zbMath1145.90067MaRDI QIDQ2468765

Thomas Stützle, Luís Paquete, Tommaso Schiavinotto

Publication date: 25 January 2008

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-007-0230-0

zbMATH Keywords

local search; local optima; multiobjective combinatorial optimization

Mathematics Subject Classification ID

90C29: Multi-objective and goal programming

90C27: Combinatorial optimization

Related Items

A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems, Two-phase Pareto local search for the biobjective traveling salesman problem, Greedy algorithms for a class of knapsack problems with binary weights, On a particular case of the multi-criteria unconstrained optimization problem

Uses Software

• PAES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
• \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows
• On spanning tree problems with multiple objectives
• On bicriterion minimal spanning trees: An approximation
• Multicriteria optimization
• Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
• A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices
• Approximating Multiobjective Knapsack Problems
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• On cardinality of the set of alternatives in discrete many-criterion problems
• On Finding the Maxima of a Set of Vectors
• Variable Neighborhood Search