A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling

S Salhi and G Nagy
Additional contact information
S Salhi: University of Birmingham
G Nagy: University of Greenwich

Journal of the Operational Research Society, 1999, vol. 50, issue 10, 1034-1042

Abstract: 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.

Keywords: routing; heuristic; insertion; clustering; backhauling (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (55)

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2600808 Abstract (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:50:y:1999:i:10:d:10.1057_palgrave.jors.2600808

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2600808

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().