Paper
25 March 1998 Genetic algorithm to solve constrained routing problem with applications for cruise missile routing
James L. Latourell, Bradley C. Wallet, Bruce Copeland
Author Affiliations +
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.
© (1998) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
James L. Latourell, Bradley C. Wallet, and Bruce Copeland "Genetic algorithm to solve constrained routing problem with applications for cruise missile routing", Proc. SPIE 3390, Applications and Science of Computational Intelligence, (25 March 1998); https://doi.org/10.1117/12.304839
Lens.org Logo
CITATIONS
Cited by 13 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Missiles

Failure analysis

Genetic algorithms

Defense and security

Gallium

Computer programming

Computer programming languages

RELATED CONTENT


Back to Top