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

Currie, R. and Salhi, S. (2003) Exact and Heuristic Methods for a Full-Load, Multi-Terminal Vehicle Scheduling Problem with Backhauling and Time Windows. JORS, 54 (4). pp. 390-400. ISSN 0160-5682 . (The full text of this publication is not available from this repository)

The full text of this publication is not available from this repository. (Contact us about this Publication)

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
Subjects: H Social Sciences
Divisions: Faculties > Social Sciences > Kent Business School > Management Science
Depositing User: Said Salhi
Date Deposited: 22 Sep 2008 22:01
Last Modified: 06 Feb 2014 16:20
Resource URI: http://kar.kent.ac.uk/id/eprint/5219 (The current URI for this page, for reference purposes)
  • Depositors only (login required):