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.
|Name|| Lecture Notes in Control and Information Sciences - LNCIS|
|Conference||Advances in Cooperative Control and Optimization|
|Period||6/02/07 → …|
- genetic algorithm
- random keys