Article thumbnail
Location of Repository

A Cluster Insertion Heuristic for Single and Multiple Depot Vehicle Routing Problems with Backhauling

By Said Salhi and Gábor Nagy

Abstract

We investigate an extension to the classical insertion-based heuristic for the vehicle routing problem with backhauling (VRPB). It is based on the idea of inserting more than one backhaul at a time. This method is tested on data sets with single and multiple depots with encouraging results at no additional computational burden. This approach can also be useful in generating good starting solutions for the more computer-intensive meta-heuristics

Topics: Q510
Publisher: Stockton Press
Year: 1999
DOI identifier: 10.2307/3009928
OAI identifier: oai:kar.kent.ac.uk:9934
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://dx.doi.org/10.1057/palg... (external link)
  • http://www.palgrave-journals.c... (external link)
  • http://www.palgrave-journals.c... (external link)
  • http://www.zentralblatt-math.o... (external link)
  • http://cat.inist.fr/?aModele=a... (external link)
  • http://www.jstor.org/pss/30099... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.