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

Chiang W-C () and R A Russell
Additional contact information
Chiang W-C: Operations Management, University of Tulsa
R A Russell: Operations Management, University of Tulsa

Journal of the Operational Research Society, 2004, vol. 55, issue 12, 1298-1310

Abstract: Abstract 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.

Keywords: vehicle routeing; metaheuristics; logistics (search for similar items in EconPapers)
Date: 2004
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (14)

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2601791 Abstract (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:55:y:2004:i:12:d:10.1057_palgrave.jors.2601791

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2601791

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().