Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
Vehicle Routing and Time Deadlines Using Genetic and Local Algorithms
Proceedings of the 5th International Conference on Genetic Algorithms
A Comparison of Nature Inspired Heuristics on the Traveling Salesman Problem
PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
New Genetic Local Search Operators for the Traveling Salesman Problem
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
A Genetic Algorithm for Job-Shop Problems with Various Schedule Quality Criteria
Selected Papers from AISB Workshop on Evolutionary Computing
Improving Street Based Routing Using Building Block Mutations
Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Solving a Real World Routing Problem Using Multiple Evolutionary Agents
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Routing using evolutionary agents and proactive transactions
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
| Hi-index | 0.00 |
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.