Dynamic route planning for car navigation systems using virus genetic algorithms

  title={Dynamic route planning for car navigation systems using virus genetic algorithms},
  author={Hitoshi Kanoh},
  journal={Int. J. Knowl. Based Intell. Eng. Syst.},
  • H. Kanoh
  • Published 2007
  • Business
  • Int. J. Knowl. Based Intell. Eng. Syst.
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… 

Hybrid genetic algorithm for dynamic multi-objective route planning with predicted traffic in a real-world road network

The proposed method gives the Pareto-optimal set by using both the predicted traffic and a hybrid multi-objective GA (GA + Dijkstra algorithm) so that a driver can choose a favorite route after looking at feasible ones.

A Multi-Criteria Route Selection Method for Vehicles Using Genetic Algorithms Based on Driver’s Preference

Finding the best path between a given source and a destination in a road network is an important problem. It has its applications in various map services and commercial navigation systems. Generally,

Dynamic optimal route search algorithm for car navigation systems with preferences by dynamic programming

A dynamic programming algorithm to find the optimal route considering that it should deal with the changes of the traffic situation and multiple criteria is proposed and results show that the proposed method can find the user‐preferred optimal route.

A new intelligence algorithm for determination of shortest path for dynamic guidance of vehicles based on service level criterion

Ability of the designed algorithm to plan travels, make routing decisions in urban transportation system including effective routing strategies in conformity with dynamic traffic conditions and different candidates of travel for vehicles drivers in order to decrease their travel expenses has been shown through simulation tests.

A comparative study of vehicles' routing algorithms for route planning in smart cities

A classification of the different route planning algorithms, and how they compare and analyze their performance when they are applied in real road networks is presented, and Dijkstra, the most wellknown shortest path algorithm, is chosen to be the first algorithm to be implemented in SUMO.

A genetic-based clustering approach to traffic network design for car navigation system

  • Feng WenM. Gen
  • Computer Science
    2008 IEEE International Conference on Systems, Man and Cybernetics
  • 2008
A multilayer hierarchy network method is proposed to substantially reduce the computation time when solving mRSP in big scale road network by using an efficient genetic-based cluster method to overcome the size limitations with acceptable loss of accuracy.

Multi-objective optimal route search for road networks by dynamic programming

A new dynamic programming method to find the optimal route to the destination considering multiple criteria based on the local information available including other Q values at the adjacent road sections is proposed.

Optimal route calculation of road networks using improved clustering method and genetic algorithm

Simulation results on a large-scale road network show that the proposed methods can effectively solve the above difficulties of the route calculation by the intelligent techniques, such as Genetic Algorithm and Clustering Algorithm.

Fuzzy-genetic approach for incorporation of driver's requirement for route selection in a car navigation system

A fuzzy genetic approach is proposed to generate alternate routes according to driver's requirement and choice with fine tuning by using feed back mechanism and a simple simulation experiment proves the effectiveness and importance of the concept for developing more user friendly car navigation system.

Solving real-world vehicle routing problems with time windows using virus evolution strategy

Experimental results using extended Solomon's benchmark problems with 1000 customers proved that the proposed method is superior to conventional methods in both its rates of searches and the probability of obtaining solutions.



Knowledge based genetic algorithm for dynamic route selection

  • H. KanohTomohiro Nakamura
  • Business
    KES'2000. Fourth International Conference on Knowledge-Based Intelligent Engineering Systems and Allied Technologies. Proceedings (Cat. No.00TH8516)
  • 2000
Experiments using actual road maps show that the infection method is effective for the problem of selecting a route to a given destination on a road map under a dynamic environment using a genetic algorithm adopting viral infection.

Evaluation of GA-based dynamic route guidance for car navigation using cellular automata

Experiments with the system in a dynamic environment built from a real road map show that the GA-based method is superior to the Dykstra algorithm for use in practical car navigation devices.

A practical route planning algorithm for vehicle navigation system

  • M. FuJie LiZ. Deng
  • Computer Science
    Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788)
  • 2004
A practical route planning algorithm for vehicle navigation system that takes advantage of the adjacent list data structure and the mechanism of restricted searching area and uses the spatial distribution feature of the real road network to restrict the searching area in reason is proposed.

Traffic flow simulation using cellular automata under non-equilibrium environment

  • Hideki KozukaYohsuke MatsuiH. Kanoh
  • Computer Science
    2001 IEEE International Conference on Systems, Man and Cybernetics. e-Systems and e-Man for Cybernetics in Cyberspace (Cat.No.01CH37236)
  • 2001
A traffic flow simulator that uses cellular automata in a non-equilibrium environment where traffic congestion occurs frequently to evaluate dynamic route selection methods and confirmed that the simulator works effectively for real road maps.

A genetic algorithm for shortest path routing problem and the sizing of populations

A population-sizing equation based on the gambler ruin model that can be used for determining an adequate population size in the shortest path (SP) routing problem and exhibits a much better quality of solution and a much higher rate of convergence than other algorithms.

Adaptations of the A* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks

It is shown that the computational savings of the A* algorithm for computing fastest paths from one origin node to one destination node, in a class of dynamic networks the link travel times of which satisfy the first-in-first-out property, increase with the size of the network topology.

Planning multiple paths with evolutionary speciation

This paper demonstrates a new approach to multidimensional path planning that is based on multiresolution path representation, where explicit configuration space computation is not required, and

Finding shortest paths in large network systems

The proposed disk-based algorithm is based on new algorithms for graph partitioning and for finding shortest paths that overcome the problem of existing approaches and is scalable to large network systems and is adaptable to different computing environments.