Design and analysis of stochastic local search for the multiobjective traveling salesman problem

Authors:
Luís Paquete;Thomas Stützle
Affiliations:
CISUC, Department of Informatics Engineering, University of Coimbra, Coimbra, Portugal;IRIDIA, CoDE, Université Libre de Bruxelles (ULB), Bruxelles, Belgium
Venue:
Computers and Operations Research
Year:
2009

Citing 11
Cited 7

Algorithms for solving the two-criterion large-scale travelling salesman problem

Computational Mathematics and Mathematical Physics
CHESS—Changing Horizon Efficient Set Search: A Simple Principle for Multiobjective Optimization

Journal of Heuristics
Use of Substitute Scalarizing Functions to Guide a Local Search Based Heuristic: The Case of moTSP

Journal of Heuristics
Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization

Proceedings of the 5th International Conference on Genetic Algorithms
On the Performance Assessment and Comparison of Stochastic Multiobjective Optimizers

PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem

Theoretical Computer Science
Stochastic Local Search: Foundations & Applications

Stochastic Local Search: Foundations & Applications
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)

The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
A two-phase local search for the biobjective traveling salesman problem

EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
A multi-objective genetic local search algorithm and itsapplication to flowshop scheduling

IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Performance assessment of multiobjective optimizers: an analysis and review

IEEE Transactions on Evolutionary Computation

Graphical tools for the analysis of bi-objective optimization algorithms: [workshop on theoretical aspects of evolutionary multiobjective optimization]

Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
Adaptive "Anytime" two-phase local search

LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems

Computers and Operations Research
A novel Artificial Immune System for fault behavior detection

Expert Systems with Applications: An International Journal
Improving the anytime behavior of two-phase local search

Annals of Mathematics and Artificial Intelligence
On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems

Journal of Heuristics
Pareto local search algorithms for anytime bi-objective optimization

EvoCOP'12 Proceedings of the 12th European conference on Evolutionary Computation in Combinatorial Optimization

Quantified Score

Hi-index	0.01

Visualization

Abstract

Stochastic local search (SLS) algorithms are typically composed of a number of different components, each of which should contribute significantly to the final algorithm's performance. If the goal is to design and engineer effective SLS algorithms, the algorithm developer requires some insight into the importance and the behavior of possible algorithmic components. In this paper, we analyze algorithmic components of SLS algorithms for the multiobjective travelling salesman problem. The analysis is done using a careful experimental design for a generic class of SLS algorithms for multiobjective combinatorial optimization. Based on the insights gained, we engineer SLS algorithms for this problem. Experimental results show that these SLS algorithms, despite their conceptual simplicity, outperform a well-known memetic algorithm for a range of benchmark instances with two and three objectives.