Abstract
A pickup and delivery vehicle routing problem from a real-world bottled-beverage distribution company is addressed. The problem consists of deciding how to load every trailer, how to configure the vehicles in terms of the trailers, and how to route the vehicles, so as to minimize routing and fixed costs. The problem includes several features such as time windows on both customers and vehicles, multiple depots, multiple product delivery, split delivery, heterogeneous fleet, and dock capacity, to name a few. To solve this problem a GRASP-based heuristic is proposed. Problem decomposition, vehicle composition and route construction mechanisms, and local search procedures for different types of neighborhoods are developed. The heuristic is empirically assessed over a wide set of instances. Empirical results show that the proposed method obtains solutions of better quality than those reported by the company.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Berbeglia, G., Cordeau, J.F., Gribkovskaia, I., Laporte, G.: Static pickup and delivery problems: A classification scheme and survey. TOP 15(1), 1–31 (2007)
Castrillón-Escobar, A.: Una Metaheurística para un Problema de Carga y Descarga en la Repartición de Bebidas Embotelladas. Master thesis, Universidad Autónoma de Nuevo León, San Nicolás de los Garza, Mexico (March 2013) (in Spanish)
Derigs, U., Gottlieb, J., Kalkoff, J., Piesche, M., Rothlauf, F., Vogel, U.: Vehicle routing with compartments: Applications, modelling and heuristics. OR Spectrum 33(4), 885–914 (2011)
Drexl, M.: Applications of the vehicle routing problem with trailers and transshipments. European Journal of Operational Research 227(2), 275–283 (2013)
Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. Journal of Global Optimization 6(2), 109–133 (1995)
Mitrović-Minić, S., Laporte, G.: Waiting strategies for the dynamic pickup and delivery problem with time windows. Transportation Research 38(7), 635–655 (2004)
Parragh, S.N., Doerner, K.F., Hartl, R.F.: A survey on pickup and delivery problems, part II: Transportation between pickup and delivery locations. Journal für Betriebswirtschaft 58(2), 81–117 (2008)
Qu, Y., Bard, J.F.: The heterogeneous pickup and delivery problem with configurable vehicle capacity. Transportation Research Part C: Emerging Technologies 32(1), 1–20 (2013)
Ropke, S., Cordeau, J.F.: Branch and cut and price for the pickup and delivery problem with time windows. Transportation Science 43(3), 267–286 (2009)
Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science 40(4), 455–472 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ríos-Mercado, R.Z., López-Pérez, J.F., Castrillón-Escobar, A. (2013). A GRASP for a Multi-depot Multi-commodity Pickup and Delivery Problem with Time Windows and Heterogeneous Fleet in the Bottled Beverage Industry. In: Pacino, D., Voß, S., Jensen, R.M. (eds) Computational Logistics. ICCL 2013. Lecture Notes in Computer Science, vol 8197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41019-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-41019-2_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41018-5
Online ISBN: 978-3-642-41019-2
eBook Packages: Computer ScienceComputer Science (R0)