Paper Info
Title
Proper balance between search towards and along Pareto front: biobjective TSP case study.
Abstract
In this paper we propose simple yet efficient version of the two-phase Pareto local search (2PPLS) for solving the biobjective traveling salesman problem (bTSP). In the first phase the powerful Lin–Kernighan heuristic is used to generate some high quality solutions being very close to the Pareto front. Then Pareto local search is used to generate more potentially Pareto efficient solutions along the Pareto front. Instead of previously used method of Aneja and Nair we use uniformly distributed weight vectors in the first phase. We show experimentally that properly balancing the computational effort in the first and second phase we can obtain results better than previous versions of 2PPLS for bTSP and at least comparable to the state-of-the art results of more complex MOMAD method. Furthermore, we propose a simple extension of 2PPLS where some additional solutions are generated by Lin–Kernighan heuristic during the run of PLS. In this way we obtain a method that is more robust with respect to the number of initial solutions generated in the first phase.
Year
DOI
Venue
2017
https://doi.org/10.1007/s10479-017-2415-5
Annals OR
Keywords
Field
DocType
Multiobjective optimization,Pareto local search,Traveling salesman problem
Simple extension,Mathematical optimization,Heuristic,Multi-objective optimization,Travelling salesman problem,Pareto analysis,Pareto local search,Pareto principle,Mathematics
Journal
Volume
Issue
ISSN
254
1-2
0254-5330
Citations 
PageRank 
References 
5
0.42
13
Authors
2
Name
Order
Citations
PageRank
A. Jaszkiewicz166050.68
Thibaut Lust216511.67