Genetic algorithm approach for multiple depot capacitated vehicle routing problem solving with heuristic improvements

International Journal of Modelling and Simulation

Volumn 20, Issue 4, 2000, Pages 320-328

  Filipec, M ^a,b   Skrlec D ^a,b   Krajcar, S ^a,b  

^a UNIVERSITY OF ZAGREB   (Croatia)

^b UNIVERSITY OF ZAGREB   (Croatia)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; CORRELATION METHODS; GENETIC ALGORITHMS; HEURISTIC METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING;

MULTIPLE DEPOT CAPACITATED VEHICLE ROUTING PROBLEMS (MDCVRP);

ROUTERS;

EID: 0034476303     PISSN: 02286203     EISSN: None     Source Type: None    
DOI: 10.1080/02286203.2000.11442173     Document Type: Article

References (20)

1. M. Fisher, Vehicle routing in: Network routing, Handbooks in Operations Research and Management Sci., 8, 1995.
2. M.O. Ball, T.L. Magnanti, C.L. Monma, & G.L. Nemhauser, Network routing, Handbooks in Operations Research and Management Sci., 8, 1995.
3. L. Bodin, B.L. Golden, A. Assad, & M.O. Ball, The state of the art in the routing and scheduling of vehicles and crews, Computer & Operations Res., 10, 1983, 69-221.
4. N Christofides, Vehicle routing: The travelling salesman problem: A guided tour of combinatorial optimization (Chichester: John Wiley & Sons Ltd., 1985), 431-448.
5. J. Desrosiers, Y. Dumas, M. Solomon, & F Soumis, Time constrained routing and scheduling in. network routing, Handbooks in Operations Res. and Management Sci., 8, 1995.
6. B.L. Golden & A. Addad, The vehicle routing problem in: Network routing, Handbooks in Operations Res. and Management Sci., 8, 1995.
7. B.L. Golden, T.L. Magnanti, & H.Q. Bguyen, Implementing vehicle routing algorithms, Networks, 7, 1977, 113-148
8. G. Laporte, The vehicle routing problem An overview of exact and approximate algorithms, European J. of Operational Res., 59, 1992.
9. G Laporte, Y. Nobert, & D. Arpin, Optimal solutions of capacitated multi-depot vehicle routing problem, Congressus Numeratium, 44, 1984, 283-292.
10. I.H. Osman, Vehicle routing and scheduling: applications, algorithms and developments, Proc. of the Int. Conf. on Industrial Logistics, Rennes, France, 1993
11. E. Taillard, Parallel iterative search methods for vehicle routing problems, Networks, 23(8), 1993, 661-674.
12. F. A. Tillman & R.W. Hering, A study of look-ahead procedure for solving the multi-terminal delivery problem , Trans. Res., 5, 1971, 225-229.
13. A. Wren & A. Holliday, Computer scheduling of vehicles from one or more delivery points, Operational Res. Quarterly, 23, 1972, 333-334.
14. B.E. Gillet & J.G. Johnson, Multi-terminal vehicle dispatch algorithm, Omega, 4, 1976, 711-718.
15. J. Renaud, F.F. Boctor, & G. Laporte, An improved petal heuristic for the vehicle routing problem, J. of the Operational Res. Soc., 47, 1996, 329-336
16. D. Skrlec, S. Krajcar, M Filipec, & S. Blagajac, How can we best route the electric energy in distribution networks, Proc. 5th Int. Middle East Power Conf., Alexandria, Egypt, January 1997, 468-472.
17. L.R. Ford & D. Fulkerson, Solving the transportation problem, Management Sci., 3, 1956, 24-32.
18. J.H Holland, Adaptation in natural and artificial systems (Boston: MIT Press Edition, 1992), 186-199.
19. D Skrlec, Optimal planning of distribution networks using the genetic algorithms, doctoral thesis, Faculty of Electrical Engineering and Computing, University of Zagreb, 1996
20. D. Whitley, The genitor algorithm and selection pressure: Why rank-based allocation of reproductive trials is best, Proc. of ICGA, 1989, 116-121.