Use of substitute scalarizing functions to guide a local search based heuristic: the case of moTSP

DOI10.1023/A:1009690717521zbMath1071.90577OpenAlexW1834369771MaRDI QIDQ2567892

Michael Pilegaard Hansen

Publication date: 13 October 2005

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009690717521

zbMATH Keywords

scalarizing functionstabu searchlocal searchmultiple criteria decision makingmultiple objective combinatorial optimization

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (9)

Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems ⋮ Design of a heuristic algorithm for the generalized multi-objective set covering problem ⋮ Multi-objectives tabu search based algorithm for progressive resource allocation ⋮ A hybrid approach for biobjective optimization ⋮ An interactive approach for biobjective integer programs under quasiconvex preference functions ⋮ Multi-objective vehicle routing problems ⋮ Improving convergence of evolutionary multi-objective optimization with local search: a concurrent-hybrid algorithm ⋮ Genetic local search for multi-objective combinatorial optimization ⋮ Design and analysis of stochastic local search for the multiobjective traveling salesman problem

This page was built for publication: Use of substitute scalarizing functions to guide a local search based heuristic: the case of moTSP