The one‐commodity pickup and delivery travelling salesman problem on a path or a tree
From MaRDI portal
Publication:5487820
DOI10.1002/net.20116zbMath1103.90098OpenAlexW4240858179MaRDI QIDQ5487820
Andrew E. B. Lim, Zhou Xu, Fan Wang
Publication date: 12 September 2006
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20116
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Related Items (9)
An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot ⋮ Mathematical formulations for a 1-full-truckload pickup-and-delivery problem ⋮ Improved algorithms for joint optimization of facility locations and network connections ⋮ Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) ⋮ Pallet location and job scheduling in a twin-robot system ⋮ Polynomially solvable cases of the bipartite traveling salesman problem ⋮ A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem ⋮ Single-commodity vehicle routing problem with pickup and delivery service ⋮ A truck scheduling problem arising in intermodal container transportation
This page was built for publication: The one‐commodity pickup and delivery travelling salesman problem on a path or a tree
