Research Output

Street-based routing using an evolutionary algorithm.

  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.

  • Type:

    Book Chapter

  • Date:

    30 November 2000

  • 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

Citation

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

Authors

Keywords

Computer programming; Street based routing; Algorithm; Evolutionary computing; EvoCOP; EvoFlight EvoIASP EvoLearn EvoSTIM

Available Documents