Share Email Print

Proceedings Paper

Genetic algorithm to solve constrained routing problem with applications for cruise missile routing
Author(s): James L. Latourell; Bradley C. Wallet; Bruce Copeland
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

In this paper the use of a Genetic Algorithm to solve a constrained vehicle routing problem is explored. The problem is two-dimensional with obstacles represented as ellipses of uncertainty surrounding each obstacle point. A route is defined as a series of points through which the vehicle sequentially travels from the starting point to the ending point. The physical constraints of total route length and maximum turn angle are included and appear in the fitness function. In order to be valid, a route must go from start to finish without violating any constraint. The effects that different mutation rates and population sizes have on the algorithm's computation speed and ability to find a high quality route are also explored. Finally, possible applications of this algorithm to the problem of route planning for cruise missiles are discussed.

Paper Details

Date Published: 25 March 1998
PDF: 11 pages
Proc. SPIE 3390, Applications and Science of Computational Intelligence, (25 March 1998); doi: 10.1117/12.304839
Show Author Affiliations
James L. Latourell, Naval Surface Warfare Ctr. (United States)
Bradley C. Wallet, Naval Surface Warfare Ctr. (United States)
Bruce Copeland, Naval Surface Warfare Ctr. (United States)

Published in SPIE Proceedings Vol. 3390:
Applications and Science of Computational Intelligence
Steven K. Rogers; David B. Fogel; James C. Bezdek; Bruno Bosacchi, Editor(s)

© SPIE. Terms of Use
Back to Top