Street-based routing using an evolutionary algorithm

Urquhart, Neil B; Paechter, Ben; Chisholm, Ken

Abstract

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.

Citation

Urquhart, N. B., Paechter, B., & Chisholm, K. (2001, April). Street-based routing using an evolutionary algorithm. Presented at Workshops on Applications of Evolutionary Computation EvoWorkshops 2001, Como, Italy

• Presentation Conference Type: Conference Paper (Published)
• Conference Name: Workshops on Applications of Evolutionary Computation EvoWorkshops 2001
• Start Date: Apr 18, 2001
• End Date: Apr 20, 2001
• Publication Date: Apr 6, 2001
• Deposit Date: Jun 12, 2009
• Publisher: Springer
• Peer Reviewed: Peer Reviewed
• Volume: 2037
• Pages: 495-504
• Series Title: Lecture Notes in Computer Science
• Series Number: 2037
• Series ISSN: 0302-9743
• Book Title: Applications of Evolutionary Computing: EvoWorkshops 2001: EvoCOP, EvoFlight, EvoIASP, EvoLearn, and EvoSTIM, Proceedings
• ISBN: 9783540419204
• DOI: https://doi.org/10.1007/3-540-45365-2_51
• Keywords: Computer programming; Street based routing; Algorithm; Evolutionary computing; EvoCOP;EvoFlightEvoIASPEvoLearnEvoSTIM
• Public URL: http://researchrepository.napier.ac.uk/id/eprint/2717
• Publisher URL: http://dx.doi.org/10.1007/3-540-45365-2_51