Speed-up techniques for solving large-scale biobjective TSP

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 wi...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computers & operations research Ročník 37; číslo 3; s. 521 - 533
Hlavní autoři: Lust, T., Jaszkiewicz, A.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Elsevier Ltd 01.03.2010
Pergamon Press Inc
Témata:
Approximation
Heuristic
Hybrid metaheuristics
Local search
Multiobjective combinatorial optimization
Optimization techniques
Speed-up techniques
Studies
Traveling salesman problem
TSP
TSP
Local search
Hybrid metaheuristics
Multiobjective combinatorial optimization
Speed-up techniques
ISSN:0305-0548, 1873-765X, 0305-0548
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2009.01.005