A Random Keys Based Genetic Algorithm for the Target Visitation Problem

Ashwin Arulselvan, Clayton W. Commander, Panos M. Pardalos

Research output: Chapter in Book/Report/Conference proceedingChapter

3 Citations (Scopus)


The objective of the target visitation problem is to determine a path for an unmanned aerial vehicle that begins at a point of origin and needs to visit several targets before returning to its starting point. An optimal visitation sequence is one which minimizes the total distance traveled and maximizes the utility of the visitation order. This utility measure is defined for each pair of targets and represents the relative value of visiting a particular target before another. In this chapter, we present the results of a preliminary study investigating the effectiveness of a genetic algorithm for the target visitation problem. The encoding scheme is based on random keys. Numerical results are presented for a set of randomly generated test problems and compared with the optimal solutions as computed by a commercial integer programming package.
Original languageEnglish
Title of host publicationAdvances in Cooperative Control and Optimization
Number of pages9
ISBN (Print)9783540743545
Publication statusPublished - 2007
EventAdvances in Cooperative Control and Optimization - gainesville, United States
Duration: 6 Feb 2007 → …

Publication series

Name Lecture Notes in Control and Information Sciences - LNCIS


ConferenceAdvances in Cooperative Control and Optimization
Country/TerritoryUnited States
Period6/02/07 → …


  • genetic algorithm
  • random keys


Dive into the research topics of 'A Random Keys Based Genetic Algorithm for the Target Visitation Problem'. Together they form a unique fingerprint.

Cite this