HYBRID METHOD FOR SOLVING TIME LIMITED ROUTING PROBLEMS (ROUTING PROBLEMS WITH TIME LIMITATIONS)
Tonči Carić, N Jelusic, Protega, F Jelusic · 1999
The routing problem with time limitations can be mathematically modeled and solved exactly for smaller numbers of nodes. In real applications, routing needs to be performed for a great number of nodes and then heuristic methods must be used. Expansion of heuristic methods of iterative searches using genetic algorithms significantly improves the convergence toward an optimal solution but does not necessarily provide it. This paper analyzes the hybrid approach of the already known methods that have been modified and that are expected in further research to provide better results than the existing ones.