Artificial Intelligence
A Note on the Complexity of Dijkstra's Algorithm for Graphs with Weighted Vertices
IEEE Transactions on Computers
A cellular automaton traffic flow model for online simulation of traffic
Parallel Computing - Special issue on cellular automata: from modeling to applications
Finding shortest paths in large network systems
Proceedings of the 9th ACM international symposium on Advances in geographic information systems
An Introduction to Genetic Algorithms for Scientists and Engineers
An Introduction to Genetic Algorithms for Scientists and Engineers
IEEE Transactions on Intelligent Transportation Systems
Planning multiple paths with evolutionary speciation
IEEE Transactions on Evolutionary Computation
A genetic algorithm for shortest path routing problem and the sizing of populations
IEEE Transactions on Evolutionary Computation
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Virus Evolution Strategy for Vehicle Routing Problems with Time Windows
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Knowledge-based genetic algorithm for university course timetabling problems
International Journal of Knowledge-based and Intelligent Engineering Systems
Route optimisation using evolutionary approaches for on-demand pickup problem
International Journal of Advanced Intelligence Paradigms
Solving real-world vehicle routing problems with time windows using virus evolution strategy
International Journal of Knowledge-based and Intelligent Engineering Systems
UbiPaPaGo: Context-aware path planning
Expert Systems with Applications: An International Journal
Multiobjective heuristic search in road maps
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
This paper describes a practical dynamic route planning method using real road maps in a wide area. The maps include traffic signals, road classes, and the number of lanes. The proposed solution is using a genetic algorithm adopting viral infection. The method is to use viruses as domain specific knowledge. A part of an arterial road is regarded as a virus. A population of viruses is generated in addition to a population of routes. Crossover and infection determine the near-optimal combination of viruses. When traffic congestion frequently changes during driving, an alternative route can be selected using viruses and other routes in the population in a real time. Experiments in dynamic environments using a real road map with 28000 cars show that the proposed method is superior to the Dijkstra algorithm for use in practical car navigation devices.