Skip to main content

An evolutionary hybrid metaheuristic for solving the vehicle routing problem with heterogeneous fleet

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1391))

Abstract

Nowadays genetic algorithms stand as a trend to solve NP-complete and NP-hard problems. In this paper, we present a new hybrid metaheuristic which combines Genetic Algorithms and Scatter Search coupled with a decomposition-into-petals procedure for solving a class of Vehicle Routing and Scheduling Problems. Its performance is evaluated for a heterogeneous fleet model, which is considered a problem much harder to solve than the homogeneous vehicle routing problem.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. BALL, M.O.; MAGNANTI, T.L.; MONNA, C.L. and NENHAUSER, G.L., 1995, Network Routing, Handbook in Op. Res. and Manag. Science, Vol 8, Elsevier Science.

    Google Scholar 

  2. BODIN, L.D. and GOLDEN, L., 1981, Classification in Vehicle Routing and Scheduling, NETWORKS, Vol 11, 97–108.

    Google Scholar 

  3. BODIN, L.D., 1990, Twenty Years of Routing and Scheduling, Oper. Research, Vol 38(4), 571–579.

    Article  MathSciNet  Google Scholar 

  4. BODIN, L.D.; GOLDEN, L.; ASSAD, A.A. and BALL, M., 1993, Routing and Scheduling of Vehicles and Crews, The State of the Art, Comp. and Op. Res., Vol 10, 63–211.

    MathSciNet  Google Scholar 

  5. DANTZIG, G.B. and RANSER, J.H., 1959, The truck dispatching problem, Management Science, Vol 6, 80–91.

    MATH  MathSciNet  Google Scholar 

  6. FOSTER, B.A. and RYAN, D.M., 1976, An Integer Programming Approach to the Vehicle Scheduling Problem, Op. Res. Quarterly. 27, 367–384.

    MATH  MathSciNet  Google Scholar 

  7. GENDRAU, M.; HERTZ, A. and LAPORTE, G., 1992, New Insertion Post-Optimization Procedures for the Traveling Salesman Problem, Oper. Res. 40, 1086–1094.

    MathSciNet  Google Scholar 

  8. GLOVER, F., 1995, Scatter Search and Star-Paths: Beyond the Genetic Metaphor, OR SPECTRUM, Vol 17, Issue 2/3.

    Google Scholar 

  9. GLOVER, F., 1997, Tabu Search and Adaptive Memory Programming: Advances, Applications and Challenges. In Interfaces in Computer Science and Operations Research, 1–76, Kluwer Academic Publishers.

    Google Scholar 

  10. GOLDEN, B.L., 1993, Special Issue on Vehicle Routing 2000: Advances in Time-Windows, Optimality, Fast Bounds and Mult_Depot Routing, Am. J. Mgmnt. Sci., Vol 13.

    Google Scholar 

  11. GOLDEN, B.; ASSAD, A.; LEVY, L. and GHEYSENS, F.G., 1984, The Fleet Size and Mix Vehicle Routing Problem, Computers and Operations Research, Vol 11, 49–66.

    Article  MATH  Google Scholar 

  12. HOLLAND, J.H., 1976, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor.

    Google Scholar 

  13. OCHI, L.S.; DRUMMOND, L.M.A. and FIGUEIREDO, R.M., 1997, Design and Implementation of a Parallel Genetic Algorithm for the Traveling Purchaser Problem, ACM Symposium on Applied Computing, San Jose — California, 257–263.

    Google Scholar 

  14. OCHI, L.S.; RABELO, P.G. and MACULAN, N., 1997, A New Genetic Meta-heuristic for the Clustered Traveling Salesman Problem, In Proceedings of the II Metaheuristic International Conference (II MIC’97), Sophia-France, 59–64.

    Google Scholar 

  15. REEVES, R., 1993, Modern Heuristic Technics for Combinatorial Problems, Blackwell Scientific Publications.

    Google Scholar 

  16. ROCHAT, Y. and TAILLARD, E.D., 1995, Probabilistic Diversification and Intensification on Local Search for Vehicle Routing, Journal of Heuristics, 147–167.

    Google Scholar 

  17. RYAN, D.M.; HJORRING and GLOVER, F., 1993, Extensions of the Petal Method for Vehicle Routing, J.Op.Res., Vol 44(3), 289–296.

    MATH  Google Scholar 

  18. TAILLARD, E.D., 1996, A Heuristic Column Generation Method for the Heterogeneous Fleet, Publication CRT-03-96, Centre de Recherche sur les transports, Université de Montreal.

    Google Scholar 

  19. WHIYLEY, D.; STARKWEATHER, T. and SHANDER, D., 1991, The traveling Salesman and Sequence Scheduling: Quality Solutions Using Genetic Edge Recombination, Handbook of Genetic Algorithms, Van Nostrand Reinhold, NY.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Wolfgang Banzhaf Riccardo Poli Marc Schoenauer Terence C. Fogarty

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ochi, L.S., Vianna, D.S., Drummond, L.M.A., Victor, A.O. (1998). An evolutionary hybrid metaheuristic for solving the vehicle routing problem with heterogeneous fleet. In: Banzhaf, W., Poli, R., Schoenauer, M., Fogarty, T.C. (eds) Genetic Programming. EuroGP 1998. Lecture Notes in Computer Science, vol 1391. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055938

Download citation

  • DOI: https://doi.org/10.1007/BFb0055938

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64360-9

  • Online ISBN: 978-3-540-69758-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics