A parallel algorithm for the vehicle routing problem with time window constraints

J. Schulze and T. Fahle

Annals of Operations Research, 1999, vol. 86, issue 0, 585-607

Abstract: In this paper, we describe a new parallel tabu search heuristic for the vehicle routingproblem with time window constraints (VRPTW). The neighborhood structure we proposeis based on simple customer shifts and allows us to consider infeasible interim‐solutions.Similarly to the column generation approach used in exact algorithms, all routes generatedby the tabu search heuristic are collected in a pool. To obtain a new initial solution forthe tabu search heuristic, a fast set covering heuristic is periodically applied to the routes inthe pool. The parallel heuristic has been implemented on a Multiple‐Instruction Multiple‐Datacomputer architecture with eight nodes. Computational results for Solomon's benchmarkproblems demonstrate that our parallel heuristic can produce high‐quality solutions. Copyright Kluwer Academic Publishers 1999

Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (14)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018948011707 (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:spr:annopr:v:86:y:1999:i:0:p:585-607:10.1023/a:1018948011707

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018948011707

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().