Router: A Fast and Flexible Local Search Algorithm for a Class of Rich Vehicle Routing Problems

Ulrich Derigs () and Thomas Döhmer ()
Additional contact information
Ulrich Derigs: University of Cologne
Thomas Döhmer: University of Cologne

A chapter in Operations Research Proceedings 2004, 2005, pp 144-149 from Springer

Abstract: Abstract We describe a flexible indirect search procedure which we have applied for solving a special pick-up and delivery vehicle routing problem with time windows. The heuristic is based on an encoding of a solution as a sequence/permutation of tasks, a cheapest insertion decoding procedure, and, a threshold-accepting like local search meta-heuristic.

Date: 2005
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:oprchp:978-3-540-27679-1_18

Ordering information: This item can be ordered from
http://www.springer.com/9783540276791

DOI: 10.1007/3-540-27679-3_18

Access Statistics for this chapter

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