A metaheuristic for the vehicle-routeing problem with soft time windows

This paper develops a metaheuristic for the vehicle-routeing and scheduling problem with soft time window constraints. A tabu search solution method is developed, which utilizes a mixed neighbourhood structure and an advanced recovery procedure to generate high-quality solutions. Computational resul...

Full description

Saved in:
Bibliographic Details
Published in:The Journal of the Operational Research Society 2004-12, Vol.55 (12), p.1298-1310
Main Authors: Chiang, W-C, Russell, R A
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
Business and Management
Cost control
Customer services
Datasets
Exact sciences and technology
Flows in networks. Combinatorial problems
Heuristic
Heuristics
Logistics
Management
metaheuristics
Neighborhoods
Operational research and scientific management
Operational research. Management science
Operations research
Operations Research/Decision Theory
Scheduling
Taboos
Tabu search
Theoretical Paper
Theoretical Papers
Time windows
Travel time
Vehicle operation
vehicle routeing
Vehicles
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper develops a metaheuristic for the vehicle-routeing and scheduling problem with soft time window constraints. A tabu search solution method is developed, which utilizes a mixed neighbourhood structure and an advanced recovery procedure to generate high-quality solutions. Computational results on test problems from the literature are reported. The metaheuristic achieves solutions that compare favourably with previously reported results.
ISSN:0160-5682
1476-9360
DOI:10.1057/palgrave.jors.2601791