Citations (26)
Keep up to date with the latest research on this topic with citation updates for this article.
Read on this site (2)
A Subramanian & M Battarra. (2013) An iterated local search algorithm for the Travelling Salesman Problem with Pickups and Deliveries. Journal of the Operational Research Society 64:3, pages 402-409.
Read now
Read now
Francesco Carrabs, Raffaele Cerulli & Jean-François Cordeau. (2007) An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading. INFOR: Information Systems and Operational Research 45:4, pages 223-238.
Read now
Read now
Articles from other publishers (24)
Blas Mardones, Gustavo Gatica & Carlos Contreras‐Bolton. (2022) A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints. International Transactions in Operational Research 30:6, pages 3904-3929.
Crossref
Crossref
Devaraj Radha Krishnan & Tieming Liu. (2022) A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs. Networks 80:3, pages 297-313.
Crossref
Crossref
Jonatas B. C. Chagas, Túlio A. M. Toffolo, Marcone J. F. Souza & Manuel Iori. (2020) The double traveling salesman problem with partial last‐in‐first‐out loading constraints. International Transactions in Operational Research 29:4, pages 2346-2373.
Crossref
Crossref
Armando Honorio Pereira, Geraldo Robson Mateus & Sebastián Alberto Urrutia. (2022) Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks. European Journal of Operational Research 300:1, pages 207-220.
Crossref
Crossref
Armando H. Pereira & Sebastián Urrutia. (2018) Formulations and algorithms for the Pickup and Delivery Traveling Salesman Problem with Multiple Stacks. Computers & Operations Research 93, pages 1-14.
Crossref
Crossref
Wuhua Hu, Jianfeng Mao & Keji Wei. (2017) Energy-efficient rail guided vehicle routing for two-sided loading/unloading automated freight handling system. European Journal of Operational Research 258:3, pages 943-957.
Crossref
Crossref
Afonso H. Sampaio & Sebastián Urrutia. (2016) New formulation and branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks. International Transactions in Operational Research 24:1-2, pages 77-98.
Crossref
Crossref
Anouar Annouch, Adil Bellabdaoui & Jawad Minkhar. (2016) Split delivery and pickup vehicle routing problem with two-dimensional loading constraints. Split delivery and pickup vehicle routing problem with two-dimensional loading constraints.
Hanne Pollaris, Kris Braekers, An Caris, Gerrit K. Janssens & Sabine Limbourg. (2014) Vehicle routing problems with loading constraints: state-of-the-art and future directions. OR Spectrum 37:2, pages 297-330.
Crossref
Crossref
Canhong Lin, K.L. Choy, G.T.S. Ho, S.H. Chung & H.Y. Lam. (2014) Survey of Green Vehicle Routing Problem: Past and future trends. Expert Systems with Applications 41:4, pages 1118-1138.
Crossref
Crossref
Wuhua Hu, Jianfeng Mao & Keji Wei. (2013) Energy-efficient dispatching solution in an automated air cargo terminal. Energy-efficient dispatching solution in an automated air cargo terminal.
Qingfang Ruan, Zhengqian Zhang, Lixin Miao & Haitao Shen. (2013) A hybrid approach for the vehicle routing problem with three-dimensional loading constraints. Computers & Operations Research 40:6, pages 1579-1589.
Crossref
Crossref
Jean‐François Côté, Claudia Archetti, Maria Grazia Speranza, Michel Gendreau & Jean‐Yves Potvin. (2012) A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks. Networks 60:4, pages 212-226.
Crossref
Crossref
Brenda Cheang, Xiang Gao, Andrew Lim, Hu Qin & Wenbin Zhu. (2012) Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints. European Journal of Operational Research 223:1, pages 60-75.
Crossref
Crossref
Jean‐François Côté, Michel Gendreau & Jean‐Yves Potvin. (2012) Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks. Networks 60:1, pages 19-30.
Crossref
Crossref
Fabien Tricoire, Karl F. Doerner, Richard F. Hartl & Manuel Iori. (2009) Heuristic and exact algorithms for the multi-pile vehicle routing problem. OR Spectrum 33:4, pages 931-959.
Crossref
Crossref
Yongquan Li, Andrew Lim, Wee-Chong Oon, Hu Qin & Dejian Tu. (2011) The tree representation for the pickup and delivery traveling salesman problem with LIFO loading. European Journal of Operational Research 212:3, pages 482-496.
Crossref
Crossref
Stephen C.H. Leung, Xiyue Zhou, Defu Zhang & Jiemin Zheng. (2011) Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem. Computers & Operations Research 38:1, pages 205-215.
Crossref
Crossref
Xiang Gao, Andrew Lim, Hu Qin & Wenbin Zhu. 2011. Modern Approaches in Applied Intelligence. Modern Approaches in Applied Intelligence
193
202
.
Maria Battarra, Güneş Erdoǧan, Gilbert Laporte & Daniele Vigo. (2010) The Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs. Transportation Science 44:3, pages 383-399.
Crossref
Crossref
Manuel Iori & Silvano Martello. (2010) Routing problems with loading constraints. TOP 18:1, pages 4-27.
Crossref
Crossref
Jean‐François Cordeau, Manuel Iori, Gilbert Laporte & Juan José Salazar González. (2009) A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading. Networks 55:1, pages 46-59.
Crossref
Crossref
Güneş Erdoğan, Jean-François Cordeau & Gilbert Laporte. (2009) The pickup and delivery traveling salesman problem with first-in-first-out loading. Computers & Operations Research 36:6, pages 1800-1808.
Crossref
Crossref
Francesco Carrabs, Jean-François Cordeau & Gilbert Laporte. (2007) Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading. INFORMS Journal on Computing 19:4, pages 618-632.
Crossref
Crossref