Open Vehicle Routing Problem with Time Deadlines: Solution Methods and an Application

Zeynep Özyurt, Deniz Aksen and Necati Aras
Additional contact information
Zeynep Özyurt: Koç University
Deniz Aksen: Koç University
Necati Aras: Boğaziçi University

A chapter in Operations Research Proceedings 2005, 2006, pp 73-78 from Springer

Abstract: Abstract In the open route version of the well-known vehicle routing problem, vehicles are not required to return to the depot; or if they are required, then they return by traveling the same route back. In this study, we present a modified Clarke-Wright parallel savings algorithm, a nearest insertion algorithm and a tabu search heuristic for the open vehicle routing problem with time deadlines. Some random test problems and a real-life school bus routing problem are solved by these heuristics, and results are compared.

Keywords: Tabu Search; Open Vehicle; Tabu Search Heuristic; Time Deadline; Tabu Tenure (search for similar items in EconPapers)
Date: 2006
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-32539-0_12

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

DOI: 10.1007/3-540-32539-5_12

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 ().