Speed-up techniques for solving large-scale biobjective TSP

Authors:
T. Lust;A. Jaszkiewicz
Affiliations:
Faculté Polytechnique de Mons, Laboratory of Mathematics and Operational Research, 9, rue de Houdain, 7000 Mons, Belgium;Poznań University of Technology, Institute of Computing Science, Ul. Piotrowo 3A, 60-965 Poznań, Poland
Venue:
Computers and Operations Research
Year:
2010

Citing 10
Cited 3

Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Multi-Objective Optimization Using Evolutionary Algorithms

Multi-Objective Optimization Using Evolutionary Algorithms
Why Quality Assessment Of Multiobjective Optimizers Is Difficult

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Chained Lin-Kernighan for Large Traveling Salesman Problems

INFORMS Journal on Computing
Multicriteria Optimization

Multicriteria Optimization
First vs. best improvement: an empirical study

Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Bound sets for biobjective combinatorial optimization problems

Computers and Operations Research
A two-phase local search for the biobjective traveling salesman problem

EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
Two-phase Pareto local search for the biobjective traveling salesman problem

Journal of Heuristics
On the performance of multiple-objective genetic local search onthe 0/1 knapsack problem - a comparative experiment

IEEE Transactions on Evolutionary Computation

An analysis of algorithmic components for multiobjective ant colony optimization: a case study on the biobjective TSP

EA'09 Proceedings of the 9th international conference on Artificial evolution
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

In this paper, we present the Two-Phase Pareto Local Search (2PPLS) method with speed-up techniques for the heuristic resolution of the biobjective traveling salesman problem. The 2PPLS method is a state-of-the-art method for this problem. However, because of its running time that strongly grows with the instances size, the method can be hardly applied to instances with more than 200 cities. We thus adapt some speed-up techniques used in single-objective optimization to the biobjective case. The proposed method is able to solve instances with up to 1000 cities in a reasonable time with no, or very small, reduction of the quality of the generated approximations.