Abstract
This article addresses the Pickup and Delivery Problem with Two Dimensional Loading/Unloading Constraints. In this problem, we are given a weighted complete graph with 2n + 1 vertices, a collection \({\mathcal S} = \{S_1, \ldots, S_n\}\) of sets of rectangular items and a bin B of width W and height H. Vertex 0 is a depot and the remaining vertices are grouped into n pairs (p i ,d i ), 1 ≤ i ≤ n representing a pickup and a delivery point for each costumer. Each set S i corresponds to items that have to be transported from p i to d i . As in the well-known Pickup and Delivery Problem, we have to find the shortest Hamiltonian cycle (route) such that each vertex p i is visited before d i 1 ≤ i ≤ n, but here we have the additional constraint that there must exist a feasible packing of all items from \({\mathcal S}\) into B satisfying loading and unloading constraints. These constraints ensure that exists a free way to insert/remove items into/from B along the route. To the best of our knowledge this is the first work to address this problem, which considers practical constraints of loading and unloading items along a delivery route. Our main contribution is the proposal of two exact algorithms and a GRASP heuristic for the problem, providing an extensive computational experiment with these algorithms showing that they can be effectively used to solve the problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chazelle, B.: The bottom-left bin-packing heuristic: An efficient implementation. IEEE Transactions on Computers 32(8), 697–707 (1983)
da Silveira, J.L.M., Miyazawa, F.K., Xavier, E.C.: Heuristics for the strip packing problem with unloading constraints. Computers & Operations Research 40(4), 991–1003 (2013)
da Silveira, J.L.M., Xavier, E.C., Miyazawa, F.K.: A note on a two dimensional knapsack problem with unloading constraints. RAIRO - Theoretical Informatics and Applications 47(4), 315–324 (2013)
Dolan, E.D., Moré, J.J.: Benchmarking optimization software with performance profiles. Mathematical Programming A 91(2), 201–213 (2002)
Dumitrescu, I., Ropke, S., Cordeau, J., Laporte, G.: The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm. Mathematical Programming A 121(2), 269–305 (2010)
Fuellerer, G., Doerner, K.F., Hartl, R.F., Iori, M.: Ant colony optimization for the two-dimensional loading vehicle routing problem. Computers & Operations Research 36(3), 655–673 (2009)
Gendreau, M., Iori, M., Laporte, G., Martello, S.: A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks 51(2), 4–18 (2008)
Iori, M., Gonzalez, J.J.S., Vigo, D.: An exact approach for the vehicle routing problem with two-dimensional loading constraints. Transportation Science 41(2), 253–264 (2007)
Junqueira, L., Oliveira, J.F., Carravilla, M.A., Morabito, R.: An optimization model for the vehicle routing problem with practical three-dimensional loading constraints. International Transactions in Operational Research 20, 645–666 (2012)
Lodi, A., Martello, S., Vigo, D.: Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS Journal on Computing 11(4), 345–357 (1999)
Malapert, A., Gueret, C., Jussien, N., Langevin, A., Rousseau, L.: Two-dimensional pickup and delivery routing problem with loading constraints. In: First CPAIOR Workshop on Bin Packing and Placement Constraints (2008)
Martello, S., Pisinger, D., Vigo, D.: The three-dimensional bin packing problem. Operations Research 48(2), 256–267 (2000)
Parragh, S.N., Doerner, K.F., Hartl, R.F.: A survey on pickup and delivery problems. Journal für Betriebswirtschaft 58(1), 21–51 (2008)
Renaud, J., Boctor, F.F., Ouenniche, J.: Perturbation heuristics for the pickup and delivery traveling salesman problem. Computers & Operations Research 29(9), 905–916 (2002)
Resende, M.G.C., Ribeiro, C.C.: Greedy randomized adaptive search procedures. In: Handbook of Metaheuristics, pp. 219–249. Springer, New York (2003)
Ruland, K.S., Rodin, E.Y.: The pickup and delivery problem: faces and branch-and-cut algorithm. Computers & Mathematics with Applications 33(12), 1–13 (1997)
Zachariadis, E.E., Tarantilis, C.D., Kiranoudis, C.T.: A guided tabu search for the vehicle routing problem with two-dimensional loading constraints. European Journal of Operational Research 195(3), 729–743 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
da Silveira, J.L.M., Xavier, E.C. (2014). Pickup and Delivery Problem with Two Dimensional Loading/Unloading Constraints. In: González-Ramírez, R.G., Schulte, F., Voß, S., Ceroni Díaz, J.A. (eds) Computational Logistics. ICCL 2014. Lecture Notes in Computer Science, vol 8760. Springer, Cham. https://doi.org/10.1007/978-3-319-11421-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-11421-7_3
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11420-0
Online ISBN: 978-3-319-11421-7
eBook Packages: Computer ScienceComputer Science (R0)