Skip to main content
Kent Academic Repository

Exact and Heuristic Methods for a Full-Load, Multi-Terminal Vehicle Scheduling Problem with Backhauling and Time Windows

Currie, Robert H., Salhi, Said (2003) Exact and Heuristic Methods for a Full-Load, Multi-Terminal Vehicle Scheduling Problem with Backhauling and Time Windows. Journal of the Operational Research Society, 54 (4). pp. 390-400. ISSN 0160-5682. (doi:10.1057/palgrave.jors.2601534) (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:5219)

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.2601534

Abstract

The problem considered is the full-load pickup and delivery problem with time windows (PDPTW), and heterogeneous products and vehicles, where the assignment of pickup points to requests is not predetermined. The problem is first formulated as a 0-1 LP, then a hybrid algorithm is developed, which chooses dynamically between a Greedy heuristic and one based on Regret costs. A multi-level constructive heuristic that consists of three post-optimizers is presented. Two lower bounds are used to evaluate the performance of the proposed heuristics when tested on random instances and selected data from a construction company

Item Type: Article
DOI/Identification number: 10.1057/palgrave.jors.2601534
Subjects: H Social Sciences
Divisions: Divisions > Kent Business School - Division > Department of Analytics, Operations and Systems
Depositing User: Said Salhi
Date Deposited: 22 Sep 2008 22:01 UTC
Last Modified: 05 Nov 2024 09:37 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/5219 (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.