Genetic Algorithm Approach for Multiple Depot Capacitated Vehicle Routing Problem Solving With Heuristic Improvements

M. Filipec, Davor Škrlec, Slavko Krajcar

International Journal of Modelling and Simulation · 2000 · 28 citations · 10 references

Concepts

Abstract

The paper proposes a Genetic Algorithm (GA) in conjunction with handy heuristic techniques to solve the non-fixed destination Multiple Depot Capacitated Vehicle Routing Problem (MDCVRP). New heuristic techniques are added in order to prevent converging to local optima and to speed up the convergence of the algorithm through a reduction of the search space domain. The proposed GA approach has been tested on several instances of practical longterm link distribution network design problems which can be easily correlated with the non-fixed destination MDCVRP. Test results reveal that the features of easy implementation, fast convergence, and a near optimal solution in solving the MDCVRP can be achieved with the proposed GA approach.

References

10