A multi-phase constructive heuristic for the vehicle routing problem with multiple trips

An extension to the classical vehicle routing problem where vehicles can be assigned more than one route within a working time period is investigated. A multi-phase constructive heuristic, which is enhanced by suitable data structure, is proposed. Results are given comparing to benchmarks from the l...

Full description

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics Vol. 133; no. 1; pp. 69 - 92
Main Authors: Petch, R.J, Salhi, S
Format: Journal Article Conference Proceeding
Language:English
Published: Lausanne Elsevier B.V 15.11.2003
Amsterdam Elsevier
New York, NY
Subjects:
Applied sciences
Bin-packing
Calculus of variations and optimal control
Exact sciences and technology
Heuristic
Mathematical analysis
Mathematical programming
Mathematics
Multiple trip
Operational research and scientific management
Operational research. Management science
Population
Scheduling, sequencing
Sciences and techniques of general use
Multiple trip
Population
Bin-packing
Heuristic
Vehicle routing problem
Benchmarks
Period
Routing
Data
Scheduling
Time
Algorithm
Result
Extension
Heuristic method
Bin packing
Population dynamics
Problem
Data structure
ISSN:0166-218X, 1872-6771
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:An extension to the classical vehicle routing problem where vehicles can be assigned more than one route within a working time period is investigated. A multi-phase constructive heuristic, which is enhanced by suitable data structure, is proposed. Results are given comparing to benchmarks from the literature.
ISSN:0166-218X
1872-6771
DOI:10.1016/S0166-218X(03)00434-7