Skip to main content
SpringerLink
Log in

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

  • Theoretical Paper
  • Published:
Journal of the Operational Research Society

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.

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

Author information

Authors and Affiliations

  1. University of Birmingham,

    S Salhi

  2. University of Greenwich,

    G Nagy

Authors
  1. S Salhi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G Nagy
    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

Salhi, S., Nagy, G. A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling. J Oper Res Soc 50, 1034–1042 (1999). https://doi.org/10.1057/palgrave.jors.2600808

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/palgrave.jors.2600808

Keywords

Search

Navigation