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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A Hybrid Genetic Algorithm for Multiway Graph Partitioning. So-Jin Kang, Byung-Ro Moon. Proceedings of the Genetic and Evolutionary Computation Conference 2000. Eds D. Whitley, D Goldberg, E Cantu-Paz, Lee Spector, Ian Parmee, Hans-Georg Beyer. Morgan Kaufman Publishers 2000
A Memetic Algorithm With Self-Adaptive Local Search: TSP as a case study. Natalio Krasnogor, Jim Smith. Proceedings of the Genetic and Evolutionary Computation Conference 2000. Eds D. Whitley, D Goldberg, E Cantu-Paz, Lee Spector, Ian Parmee, Hans-Georg Beyer. Morgan Kaufman Publishers 2000.
A Comparison of Nature Inspired Heuristics on the Traveling Salesman Problem. Thomas Stutzle, Andreas Grun, Sebastian Linke, Marco Ruttger. Parallel Problem Solving from Nature VI. Eds Marc Schoenauer, Kalyanmoy Deb, Guenter Rudolph, Xin Yao, Evelyne Lutton, Juan Julian Merelo, Hans-Paul Schwefel Eds. Pub Springer-Verlag 2000.
Evolving Schedule Graphs for the Vehicle Routing Problem with Time Windows. H Timucin Ozdemir, Chilukuri K. Mohan. Congress on Evolutionary Computation 2000. Pub IEEE 2000.
Scheduling Chicken Catching-An Investigation Into The Success Of A Genetic Algorithm On A Real World Scheduling Problem. Hart E, Ross P, Nelson J. Annals Of Operations Research 92 Baltzer Science Publishers 1999.
A Genetic Algorithm for Job-shop problems with various schedule criteria. Hsio-Lan Fang, David Corne, Peter Ross. Evolutionary Computing, AISB Workshop Brighton UK April 1996 Ed. Terence C. Fogarty Pub: Springer-Verlag 1996
Extensions to a Memetic Timetabling System. Paechter B, Norman M, Luchian H. Practice and theory of Automated Timetabling, Burke and Ross Eds. Springer Verlag 1996.
New Genetic Local Search Operators for the Traveling Salesman Problem. Bernd Freisleben and Peter Merz. Parallel Problem Solving from Nature-PPSN IV Eds: Hans-Michael Voigt, Werner Ebeling Ingo Rechenberg, Hans-Paul Schwefel Springer Verlag 1996.
Genetic Algorithms + Data Structures = Evolution Programs (Third, Revised and Extended Edition). Michalewicz Z. Springer-Verlag 1996.
Two Solutions to the General Timetable Problem Using Evolutionary Methods. Peachter B, Cumming A, Luchian H, Petruic. Proceedings of the First IEEE Conference on Evolutionary Computionary Computation 1994.
A Comparison Study of Genetic Codings for the Travelling Salesman Problem. Tamaki H, Kita H, Shimizu N, Maekawa K, Nishikawa Y. Proceedings of the First IEEE Conference on Evolutionary Computionary Computation 1994.
A new Genetic Approach for the Travelling Salesman Problem. Bui T, Moon B. Proceedings of the First IEEE Conference on Evolutionary Computionary Computation 1994.
Vehicle Routing with Time Deadlines using Genetic and Local Algorithms. Thangiah S, Vinayagamoorthy R, Gubbi A. Proceedings of the Fifth International Conference on Genetic Algorithms Forrest S Ed. Morgan Kaufmann 1993.
Multiple Vehicle Routing with Time and Capacity Constraints using Genetic Algorithms.
Proceedings of the Fifth International Conference on Genetic Algorithms Forrest S Ed. Morgan Kaufmann, 1993.
Intelligent Structural Operators for the K-way Graph partitioning Algorithm. Gregor von Laszewski. 4th International Conference on Genetic Algorithms. Morgan Kaufmann 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Urquhart, N., Paechter, B., Chisholm, K. (2001). Street-Based Routing Using an Evolutionary Algorithm. In: Boers, E.J.W. (eds) Applications of Evolutionary Computing. EvoWorkshops 2001. Lecture Notes in Computer Science, vol 2037. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45365-2_51
Download citation
DOI: https://doi.org/10.1007/3-540-45365-2_51
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41920-4
Online ISBN: 978-3-540-45365-9
eBook Packages: Springer Book Archive