Skip to main content
SpringerLink
Log in

A genetic algorithm for vehicle routing with backhauling

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

In this paper, a greedy route construction heuristic for a vehicle routing problem with backhauling is described. This heuristic inserts customers one by one into the routes using a fixed a priori ordering of customers. Then, a genetic algorithm is used to identify an ordering that produces good routes. Numerical comparisons are provided with an exact algorithm and with other heuristic approaches.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J.E. Baker, “Adaptive selection methods for genetic algorithms”, in Proceedings of the Int. Conf. on Genetic Algorithms, Pittsburgh, 1985, pp, 101–111.

  2. J.E. Baker, “Reducing bias and inefficiency in the selection algorithm“, in Proceedings of the Second Int. Conf. on Genetic Algorithms, Cambridge, MA, 1987, pp. 14–21.

  3. J.L. Blanton and R.L. Wainwright, “Multiple vehicle routing with time and capacity constraints using genetic algorithms”, in Proceedings of the Fifth International Conference on Genetic Algorithms, Champaign, IL, 1993, pp. 452–459.

  4. D. Casco, B.L. Golden, and E. Wasil, “Vehicle routing with backhauls: Models, algorithms, and case studies”, in Vehicle Routing: Methods and Studies, edited by B.L. Golden and A.A. Assad, Elsevier, pp. 127–147, 1988.

  5. L. Davis, “Applying adaptive algorithms to epistactic domains”, in Proceedings of the Int. Joint Conf. on Artificial Intelligence, Los Angeles, CA, 1985, pp. 162–164.

  6. L. Davis, Handbook of Genetic Algorithms, Van Nostrand Reinhold, New-York, 1991.

    Google Scholar 

  7. I. Deif and L. Bodin, “Extension of the Clarke and Wright algorithm for solving the vehicle routing problem with backhauling”, in Proceedings of the Conference on Computer Software Uses in Transportation and Logistics Management, edited by A.E. Kidder, Babson Park, MA, 1984, pp. 75–96.

  8. M. Desrochers, J. Desrosiers, and M.M. Solomon, “A new optimization algorithm for the vehicle routing problem with time windows”, Operations Research40, pp. 342–354, 1992.

    Google Scholar 

  9. L.J. Eshelman, “The CHC adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination”, in Foundations of Genetic Algorithms, edited by G.J.E. Rawlins, Morgan Kaufmann, San Mateo, CA, pp. 265–283, 1991.

    Google Scholar 

  10. S. Gélinas, M. Desrochers, J. Desrosiers, and M.M. Solomon, “Vehicle routing with backhauling”, Technical Report G-92-13, Groupe d'études et de recherche en analyse des décisions, Université de Montréal, 1992.

  11. M. Goetschalckx and C. Jacobs-Blecha, “The vehicle routing problem with backhauls”, European Journal of Operational Research, vol. 42, pp. 39–51, 1989.

    Google Scholar 

  12. G. Kontoravdis and J. Bard, “Improved heuristics for the vehicle routing problem with time windows”, Working Paper, Operations Research Group, The University of Texas at Austin, Austin, TX, 1992.

    Google Scholar 

  13. I.M. Oliver, D.J. Smith, and J.R.C. Holland, “A study of permutation crossover operators on the traveling salesman problem”, in Proceedings of the Second Int. Conf. on Genetic Algorithms, Cambridge, MA, 1987, pp. 224–230.

  14. I. Or, “Traveling salesman-type combinatorial problems and their relation to the logistics of blood banking”, Ph.D. Thesis, Dept. of Industrial Engineering and Management Sciences, Northwestern University, 1976.

  15. J.Y. Potvin and J.M. Rousseau, “A parallel route building algorithm for the vehicle routing and scheduling problem with time windows”, European Journal of Operational Research, vol. 66, pp. 331–340, 1993.

    Google Scholar 

  16. D. Smith, “Bin packing with adaptive search”, in Proceedings of the First Int. Conf. on Genetic Algorithms and their Applications, Pittsburgh, PA, 1985, pp. 202–207.

  17. M.M. Solomon, “Algorithms for the vehicle routing and scheduling problems with time window constraints”, Operations Research, vol. 35. pp. 254–265, 1987.

    Google Scholar 

  18. S.R. Thangiah, “Vehicle routing with time windows using genetic algorithms”, Technical Report SRU-CpSc-TR-93–23, Computer Science Department, Slippery Rock University, Slippery Rock, PA, 1993.

    Google Scholar 

  19. P. Thompson and H. Psaraftis, “Cyclic transfer algorithms for multivehicle routing and scheduling problems”, Operations Research, vol. 41, pp. 935–946, 1993.

    Google Scholar 

  20. D. Whitley, “The Genitor algorithm and selection pressure: Why rank-based allocation of reproductive trials is best”, in Proceedings of the Third Int. Conf. on Genetic Algorithms, Fairfax, VA, 1989, pp. 116–121.

Download references

Author information

Authors and Affiliations

  1. Centre de recherche sur les transports, Université de Montréal, Succ. Centre-Ville, C.P. 6128, H3C 3J7, Montréal, (Québec), Canada

    Jean-Yves Potvin

  2. Département d'informatique et de recherche opérationnelle, Université de Montréal, Succ. Centre-Ville, C.P. 6128, H3C 3J7, Montréal, (Québec), Canada

    Jean-Yves Potvin

  3. Laboratoire d'Informatique et de Modélisation des Systèmes, ISIMA, B.P. 125, 63173, Aubière Cedex, France

    Christophe Duhamel

  4. Centre de recherche sur les transports, Université de Montréal, Succ. Centre-Ville, C.P. 6128, H3C 3J7, Montréal, (Québec), Canada

    François Guertin

Authors
  1. Jean-Yves Potvin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christophe Duhamel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. François Guertin
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Potvin, JY., Duhamel, C. & Guertin, F. A genetic algorithm for vehicle routing with backhauling. Appl Intell 6, 345–355 (1996). https://doi.org/10.1007/BF00132738

Download citation

  • Issue Date:

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

Keywords

Search

Navigation