Paper Info
Title
Open Vehicle Routing Problem with Time Deadlines: Solution Methods and an Application
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 al- gorithm, a nearest insertion algorithm and a tabu search heuristic for the open vehicle rout- ing 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.
Year
DOI
Venue
2005
10.1007/3-540-32539-5_12
A Quarterly Journal of Operations Research
Keywords
Field
DocType
vehicle routing problem,vehicle routing,random testing,tabu search
Link-state routing protocol,Vehicle routing problem,Mathematical optimization,Dynamic Source Routing,Policy-based routing,Static routing,Enhanced Interior Gateway Routing Protocol,Destination-Sequenced Distance Vector routing,Routing Information Protocol,Mathematics
Conference
Citations 
PageRank 
References 
2
0.56
6
Authors
3
Name
Order
Citations
PageRank
Zeynep Özyurt120.56
Deniz Aksen218911.38
Necati Aras346230.62