The multi-pickup and delivery problem with time windows
Author
Abstract
Suggested Citation
DOI: 10.1016/j.ejor.2018.01.035
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Grangier, Philippe & Gendreau, Michel & Lehuédé, Fabien & Rousseau, Louis-Martin, 2016. "An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization," European Journal of Operational Research, Elsevier, vol. 254(1), pages 80-91.
- Stefan Ropke & David Pisinger, 2006. "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 40(4), pages 455-472, November.
- Gerardo Berbeglia & Jean-François Cordeau & Irina Gribkovskaia & Gilbert Laporte, 2007. "Rejoinder on: Static pickup and delivery problems: a classification scheme and survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 45-47, July.
- Savelsbergh, M. W. P., 1990. "An efficient implementation of local search algorithms for constrained routing problems," European Journal of Operational Research, Elsevier, vol. 47(1), pages 75-85, July.
- Muller, Laurent Flindt & Spoorendonk, Simon & Pisinger, David, 2012. "A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times," European Journal of Operational Research, Elsevier, vol. 218(3), pages 614-623.
- Roberto Baldacci & Enrico Bartolini & Aristide Mingozzi, 2011. "An Exact Algorithm for the Pickup and Delivery Problem with Time Windows," Operations Research, INFORMS, vol. 59(2), pages 414-426, April.
- Gerardo Berbeglia & Jean-François Cordeau & Irina Gribkovskaia & Gilbert Laporte, 2007. "Static pickup and delivery problems: a classification scheme and survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 1-31, July.
- Dirk Männel & Andreas Bortfeldt, 2015. "A Hybrid Algorithm for the Vehicle Routing Problem with Pickup and Delivery and 3D Loading Constraints," FEMM Working Papers 150015, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
- Bortfeldt, Andreas & Hahn, Thomas & Männel, Dirk & Mönch, Lars, 2015. "Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints," European Journal of Operational Research, Elsevier, vol. 243(1), pages 82-96.
- M. T. Fiala Timlin & W. R. Pulleyblank, 1992. "Precedence Constrained Routing and Helicopter Scheduling: Heuristic Design," Interfaces, INFORMS, vol. 22(3), pages 100-111, June.
- Luo, Zhixing & Qin, Hu & Zhang, Dezhi & Lim, Andrew, 2016. "Adaptive large neighborhood search heuristics for the vehicle routing problem with stochastic demands and weight-related cost," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 85(C), pages 69-89.
- Letchford, Adam N. & Salazar-González, Juan-José, 2016. "Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem," European Journal of Operational Research, Elsevier, vol. 251(1), pages 74-84.
- Stefan Ropke & Jean-François Cordeau, 2009. "Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 43(3), pages 267-286, August.
- Lee, Y.C.E. & Chan, Chi Kin & Langevin, A. & Lee, H.W.J., 2016. "Integrated inventory-transportation model by synchronizing delivery and production cycles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 91(C), pages 68-89.
- Antonio Alonso-Ayuso & Paolo Detti & Laureano Escudero & M. Ortuño, 2003. "On Dual Based Lower Bounds for the Sequential Ordering Problem with Precedences and Due Dates," Annals of Operations Research, Springer, vol. 124(1), pages 111-131, November.
- The Jin Ai & Voratas Kachitvichyanukul, 2009. "A Particle Swarm Optimisation for Vehicle Routing Problem with Time Windows," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 6(4), pages 519-537.
- Escudero, L. F., 1988. "An inexact algorithm for the sequential ordering problem," European Journal of Operational Research, Elsevier, vol. 37(2), pages 236-249, November.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Ali, Ousmane & Côté, Jean-François & Coelho, Leandro C., 2021. "Models and algorithms for the delivery and installation routing problem," European Journal of Operational Research, Elsevier, vol. 291(1), pages 162-177.
- Côté, Jean-François & Alves de Queiroz, Thiago & Gallesi, Francesco & Iori, Manuel, 2023. "A branch-and-regret algorithm for the same-day delivery problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).
- Hammami, Farouk & Rekik, Monia & Coelho, Leandro C., 2019. "Exact and heuristic solution approaches for the bid construction problem in transportation procurement auctions with a heterogeneous fleet," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 127(C), pages 150-177.
- Aziez, Imadeddine & Côté, Jean-François & Coelho, Leandro C., 2020. "Exact algorithms for the multi-pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 284(3), pages 906-919.
- Kohar, Amit & Jakhar, Suresh Kumar & Agarwal, Yogesh K., 2023. "Strong cutting planes for the capacitated multi-pickup and delivery problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 176(C).
- Si, Jinhua & He, Fang & Lin, Xi & Tang, Xindi, 2024. "Vehicle dispatching and routing of on-demand intercity ride-pooling services: A multi-agent hierarchical reinforcement learning approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 186(C).
- Qin Song, 2023. "Semi-Open Multi-Distribution Center Path Planning with Time Windows," Sustainability, MDPI, vol. 15(6), pages 1-14, March.
- Guo, Jiaqi & Long, Jiancheng & Xu, Xiaoming & Yu, Miao & Yuan, Kai, 2022. "The vehicle routing problem of intercity ride-sharing between two cities," Transportation Research Part B: Methodological, Elsevier, vol. 158(C), pages 113-139.
- Cui, Haipeng & Chen, Shukai & Chen, Rui & Meng, Qiang, 2022. "A two-stage hybrid heuristic solution for the container drayage problem with trailer reposition," European Journal of Operational Research, Elsevier, vol. 299(2), pages 468-482.
- Jie Xiong & Biao Chen & Xiangnan Li & Zhengbing He & Yanyan Chen, 2020. "Demand Responsive Service-based Optimization on Flexible Routes and Departure Time of Community Shuttles," Sustainability, MDPI, vol. 12(3), pages 1-20, January.
- Yang Xia & Tingying Wu & Beixin Xia & Junkang Zhang, 2023. "Truck-Drone Pickup and Delivery Problem with Drone Weight-Related Cost," Sustainability, MDPI, vol. 15(23), pages 1-15, November.
- Wang, Yuan & Lei, Linfei & Zhang, Dongxiang & Lee, Loo Hay, 2020. "Towards delivery-as-a-service: Effective neighborhood search strategies for integrated delivery optimization of E-commerce and static O2O parcels," Transportation Research Part B: Methodological, Elsevier, vol. 139(C), pages 38-63.
- Yong Wang & Yingying Yuan & Xiangyang Guan & Haizhong Wang & Yong Liu & Maozeng Xu, 2019. "Collaborative Mechanism for Pickup and Delivery Problems with Heterogeneous Vehicles under Time Windows," Sustainability, MDPI, vol. 11(12), pages 1-30, June.
- Asghari, Mohammad & Mirzapour Al-e-hashem, S. Mohammad J., 2020. "A green delivery-pickup problem for home hemodialysis machines; sharing economy in distributing scarce resources," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 134(C).
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Aziez, Imadeddine & Côté, Jean-François & Coelho, Leandro C., 2020. "Exact algorithms for the multi-pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 284(3), pages 906-919.
- Männel, Dirk & Bortfeldt, Andreas, 2016. "A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 254(3), pages 840-858.
- Dirk Männel & Andreas Bortfeldt, 2015. "A Hybrid Algorithm for the Vehicle Routing Problem with Pickup and Delivery and 3D Loading Constraints," FEMM Working Papers 150015, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
- Michael Drexl, 2021. "On the one-to-one pickup-and-delivery problem with time windows and trailers," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(3), pages 1115-1162, September.
- Yuan Qu & Jonathan F. Bard, 2015. "A Branch-and-Price-and-Cut Algorithm for Heterogeneous Pickup and Delivery Problems with Configurable Vehicle Capacity," Transportation Science, INFORMS, vol. 49(2), pages 254-270, May.
- Albert H. Schrotenboer & Evrim Ursavas & Iris F. A. Vis, 2019. "A Branch-and-Price-and-Cut Algorithm for Resource-Constrained Pickup and Delivery Problems," Transportation Science, INFORMS, vol. 53(4), pages 1001-1022, July.
- Capelle, Thomas & Cortés, Cristián E. & Gendreau, Michel & Rey, Pablo A. & Rousseau, Louis-Martin, 2019. "A column generation approach for location-routing problems with pickup and delivery," European Journal of Operational Research, Elsevier, vol. 272(1), pages 121-131.
- Luciano Costa & Claudio Contardo & Guy Desaulniers, 2019. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing," Transportation Science, INFORMS, vol. 53(4), pages 946-985, July.
- Masson, Renaud & Ropke, Stefan & Lehuédé, Fabien & Péton, Olivier, 2014. "A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes," European Journal of Operational Research, Elsevier, vol. 236(3), pages 849-862.
- Michael Drexl, 2018. "On the One-to-One Pickup-and-Delivery Problem with Time Windows and Trailers," Working Papers 1816, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
- Sophie N. Parragh & Jorge Pinho de Sousa & Bernardo Almada-Lobo, 2015. "The Dial-a-Ride Problem with Split Requests and Profits," Transportation Science, INFORMS, vol. 49(2), pages 311-334, May.
- Qiu, Xiaoqiu & Feuerriegel, Stefan & Neumann, Dirk, 2017. "Making the most of fleets: A profit-maximizing multi-vehicle pickup and delivery selection problem," European Journal of Operational Research, Elsevier, vol. 259(1), pages 155-168.
- Zhu, Lin & Sheu, Jiuh-Biing, 2018. "Failure-specific cooperative recourse strategy for simultaneous pickup and delivery problem with stochastic demands," European Journal of Operational Research, Elsevier, vol. 271(3), pages 896-912.
- Ting, Chuan-Kang & Liao, Xin-Lan, 2013. "The selective pickup and delivery problem: Formulation and a memetic algorithm," International Journal of Production Economics, Elsevier, vol. 141(1), pages 199-211.
- Ali Mehsin Alyasiry & Michael Forbes & Michael Bulmer, 2019. "An Exact Algorithm for the Pickup and Delivery Problem with Time Windows and Last-in-First-out Loading," Transportation Science, INFORMS, vol. 53(6), pages 1695-1705, November.
- Cherkesly, Marilène & Gschwind, Timo, 2022. "The pickup and delivery problem with time windows, multiple stacks, and handling operations," European Journal of Operational Research, Elsevier, vol. 301(2), pages 647-666.
- Bolor Jargalsaikhan & Ward Romeijnders & Kees Jan Roodbergen, 2021. "A Compact Arc-Based ILP Formulation for the Pickup and Delivery Problem with Divisible Pickups and Deliveries," Transportation Science, INFORMS, vol. 55(2), pages 336-352, March.
- Cherkesly, Marilène & Desaulniers, Guy & Irnich, Stefan & Laporte, Gilbert, 2016. "Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks," European Journal of Operational Research, Elsevier, vol. 250(3), pages 782-793.
- Aziez, Imadeddine & Côté, Jean-François & Coelho, Leandro C., 2022. "Fleet sizing and routing of healthcare automated guided vehicles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 161(C).
- Renaud Masson & Fabien Lehuédé & Olivier Péton, 2013. "An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers," Transportation Science, INFORMS, vol. 47(3), pages 344-355, August.
More about this item
Keywords
Vehicle routing problem; Multi-pickup and delivery problem; Sequential ordering problem;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:269:y:2018:i:1:p:353-362. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.