Genetic Algorithm for Combinatorial Path Planning: The Subtour Problem

Giovanni Giardini and Tamás Kalmár-Nagy

Mathematical Problems in Engineering, 2011, vol. 2011, 1-31

Abstract:

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.

Date: 2011
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2011/483643.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2011/483643.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:483643

DOI: 10.1155/2011/483643

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().