Results 1 
1 of
1
Genetic Algorithm for Combinatorial Search Problems
"... This paper describes a genetic algorithm based planning system for a single agent to solve a variant of the Traveling Salesman Problem. Given a set of N locations, the agent has to find the shortest path containing M < N targets. The motivation of this research is to design an efficient planner ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper describes a genetic algorithm based planning system for a single agent to solve a variant of the Traveling Salesman Problem. Given a set of N locations, the agent has to find the shortest path containing M < N targets. The motivation of this research is to design an efficient planner for search&rescue operations. Preliminary results are presented to show the success of the approach.