Applying evolutionary programming to selected traveling salesman problems (1993)
| Venue: | Cybernetics f!Y Systems |
| Citations: | 38 - 0 self |
BibTeX
@ARTICLE{Fogel93applyingevolutionary,
author = {D. B. Fogel},
title = {Applying evolutionary programming to selected traveling salesman problems},
journal = {Cybernetics f!Y Systems},
year = {1993},
pages = {27--36}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract-Evolutionary programming is a stochastic optimization procedure that can be applied to difficult combinatorial problems. Experiments are conducted with three standard optimal control problems (linear-quadratic, harvest, and push-cart). The results are compared to those obtained with genetic algorithms and the General Algebraic Modeling System (GAMS), a numerical optimization software package. The results indicate that evolutionary programming generally outperforms genetic algorithms. Evolutionary programming also compares well with GAMS on certain problems for which GAMS is specifically designed and outperforms GAMS on other problems. The computational requirements for each procedure are briefly discussed.
