A Genetic Algorithm for Routing with an Upper Bound Constraint
Lists
Only you see this
Abstract
This paper presents a method of searching for the shortest route via the most designated points with the length not exceeding the preset upper bound. The proposed algorithm can obtain the quasi-optimum route efficiently and its effectiveness is verified by applying the algorithm to the actual map data.
BibTeX
@article{inagaki2005genetic,
author = {Jun Inagaki and Miki Haseyama},
title = {{A Genetic Algorithm for Routing with an Upper Bound Constraint}},
journal = {IEICE Trans. Information and Systems},
year = {2005},
url = {https://openreview.net/forum?id=TbMLYozygo},
}Loading related content...