Language:   Search:   Contact
Zentralblatt MATH has released its new interface!
For an improved author identification, see the new author database of ZBMATH.

Query:
Fill in the form and click »Search«...
Format:
Display: entries per page entries
Zbl 1213.90253
Giardini, Giovanni; Kalmár-Nagy, Tamás
Genetic algorithm for combinatorial path planning: the subtour problem.
(English)
[J] Math. Probl. Eng. 2011, Article ID 483643, 31 p. (2011). ISSN 1024-123X; ISSN 1563-5147/e

Summary: 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 $n$ possible goals/targets, the optimal strategy is sought that connects $k \leq n$ 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.
MSC 2000:
*90C35 Network programming
90C59 Approximation methods and heuristics

Highlights
Master Server