engleski

Hybrid method for solving time limited routing problems

The routing problem wit time limitations can be mathematically modelled and solved for a smaller number of nodes. In real applicattions routing needs performed for great number of nodes and then heuristic methods have to be used. Expansion of heuristics methods of iterative search using genetic algorithms significantly improves the convergence towards an optimal solution but does not necessarily provide it. The paper analyses the hybrid approach of the already known methods that have been modified and that are expected in further research to provide better results then the existing ones.

routing problem; heuristics; hybrid methids

nije evidentirano