Two-phase Pareto local search for the biobjective traveling salesman problem

2009 ◽  
Vol 16 (3) ◽  
pp. 475-510 ◽  
Author(s):  
Thibaut Lust ◽  
Jacques Teghem
Keyword(s):  
Local Search ◽  
Traveling Salesman Problem ◽  
Traveling Salesman ◽  
Two Phase ◽  
Pareto Local Search

scholarly journals Genetic Algorithm for Combinatorial Path Planning: The Subtour Problem

2011 ◽  
Vol 2011 ◽  
pp. 1-31 ◽  
Author(s):  
Giovanni Giardini ◽  
Tamás Kalmár-Nagy
Keyword(s):  
Genetic Algorithm ◽  
Path Planning ◽  
Local Search ◽  
Traveling Salesman Problem ◽  
Optimal Strategy ◽  
Numerical Experiments ◽  
Solution Method ◽  
Autonomous Systems ◽  
Traveling Salesman ◽  
Optimal Solutions

The purpose of this paper is to present a combinatorial planner for autonomous systems. The approach is demonstrated on the so-called subtour problem, a variant of the classical traveling salesman problem (TSP): given a set of possible goals/targets, the optimal strategy is sought that connects goals. The proposed solution method is a Genetic Algorithm coupled with a heuristic local search. To validate the approach, the method has been benchmarked against TSPs and subtour problems with known optimal solutions. Numerical experiments demonstrate the success of the approach.

Sign in / Sign up

Export Citation Format

Share Document