Abstract
The pickup and delivery problem (PDP) asks to find a set of routes with the minimum travel cost to serve a given set of requests. PDP is called the multi-trip PDP with consecutive pickups and deliveries (PDPCMT) if it has an additional requirement such that any vehicle which has begun a delivery action is not allowed to take pickup actions until all of the loads on the vehicle are delivered. In this paper, we are interested in how the least travel cost can be increased by the additional requirement, and examine the maximum ratio of the optimal value of PDPCMT to that of PDP over all instances with p requests. We show that the maximum ratio is bounded from above by O(logp) and from below by Ω(logp/loglogp). © 2009 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Nakao, Y., & Nagamochi, H. (2009). Worst case analysis for pickup and delivery problems with consecutive pickups and deliveries. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5878 LNCS, pp. 554–563). https://doi.org/10.1007/978-3-642-10631-6_57
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
