Skip to main content

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

Salhi, Said, Nagy, Gábor (1999) A Cluster Insertion Heuristic for Single and Multiple Depot Vehicle Routing Problems with Backhauling. Journal of the Operational Research Society, 50 (10). pp. 1034-1042. ISSN 0160-5682. (doi:10.1057/palgrave.jors.2600808) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:9934)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided.
Official URL:
http://dx.doi.org/10.1057/palgrave.jors.2600808

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.

Item Type: Article
DOI/Identification number: 10.1057/palgrave.jors.2600808
Uncontrolled keywords: routing; heuristic; insertion; clustering; backhauling
Subjects: Q Science > Operations Research - Theory
Divisions: Divisions > Kent Business School - Division > Department of Analytics, Operations and Systems
Depositing User: Gabor Nagy
Date Deposited: 14 Jun 2009 16:36 UTC
Last Modified: 19 Sep 2023 15:04 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/9934 (The current URI for this page, for reference purposes)

University of Kent Author Information

  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.