The tree representation for the pickup and delivery traveling salesman problem with LIFO loading
DOI10.1016/J.EJOR.2011.02.008zbMATH Open1237.90203OpenAlexW1964847870MaRDI QIDQ421561FDOQ421561
Authors: Yongquan Li, Wee-Chong Oon, Hu Qin, Dejian Tu, Andrew Lim 
Publication date: 14 May 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.02.008
Recommendations
- Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
- The pickup and delivery traveling salesman problem with first-in-first-out loading
- Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints
- The pickup and delivery traveling salesman problem with handling costs
pickup and deliveryvariable neighborhood searchtraveling salesmanlast-in-first-out loadingtree data structure
Cites Work
- TSPLIB—A Traveling Salesman Problem Library
- Routing problems with loading constraints
- Heuristic and exact algorithms for the multi-pile vehicle routing problem
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- Variable neighborhood search
- Variable neighborhood search: Principles and applications
- A new extension of local search applied to the Dial-A-Ride problem
- An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
- Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
- The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
- The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
- Local search with annealing-like restarts to solve the VRPTW
- An algorithm for the traveling salesman problem with pickup and delivery customers
- A heuristic for the pickup and delivery traveling salesman problem
- Perturbation heuristics for the pickup and delivery traveling salesman problem
- Title not available (Why is that?)
- An Additive Bounding Procedure for Combinatorial Optimization Problems
Cited In (11)
- Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
- Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
- A metaheuristic algorithm for a locomotive routing problem arising in the steel industry
- Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading
- The pickup and delivery traveling salesman problem with handling costs
- The double traveling salesman problem with partial last‐in‐first‐out loading constraints
- A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints
- A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
- Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints
- Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
Uses Software
This page was built for publication: The tree representation for the pickup and delivery traveling salesman problem with LIFO loading
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q421561)
