Street-based routing using an evolutionary algorithm

Research Output

Much research has been carried out into solving routing problems using both Evolutionary Techniques and other methods. In this paper the authors investigate the usage of an Evolutionary Algorithms to solve the Street-Based Routing Problem (SBRP). The SBRP is a subset of the Travelling Salesman Problem that deals specifically with a street-based environment. The paper also compares two possible strategies for evolving networks of routes. This paper may be considered introduction to the particular problem, and opens the way for future research into this area.

Date:

06 April 2001
Publication Status:

Published
Publisher

Springer
DOI:

10.1007/3-540-45365-2_51
Library of Congress:

QA76 Computer software
Dewey Decimal Classification:

006 Special Computer Methods

http://researchrepository.napier.ac.uk/output/277024 <p>Urquhart, N. B., Paechter, B., & Chisholm, K. (2001). Street-based routing using an evolutionary algorithm. In E. J. W. Boers, J. Gottlieb, P. L. Lanzi, R. E. Smith, S. Cagnoni, E. Hart, …H. Tijink (Eds.), <i>Applications of Evolutionary Computing: EvoWorkshops 2001: EvoCOP, EvoFlight, EvoIASP, EvoLearn, and EvoSTIM, Proceedings</i>. , (495-504). https://doi.org/10.1007/3-540-45365-2_51</p>

Citation

Urquhart, N. B., Paechter, B., & Chisholm, K. (2001). Street-based routing using an evolutionary algorithm. In E. J. W. Boers, J. Gottlieb, P. L. Lanzi, R. E. Smith, S. Cagnoni, E. Hart, …H. Tijink (Eds.), Applications of Evolutionary Computing: EvoWorkshops 2001: EvoCOP, EvoFlight, EvoIASP, EvoLearn, and EvoSTIM, Proceedings. , (495-504). https://doi.org/10.1007/3-540-45365-2_51