The tree representation for the pickup and delivery traveling salesman problem with LIFO loading

DOI10.1016/j.ejor.2011.02.008zbMath1237.90203OpenAlexW1964847870MaRDI QIDQ421561

Dejian Tu, Yongquan Li, Wee-Chong Oon, Hu Qin, Andrew E. B. 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

zbMATH Keywords

traveling salesmanvariable neighborhood searchpickup and deliverylast-in-first-out loadingtree data structure

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading ⋮ Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks ⋮ Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading ⋮ Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints ⋮ Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks ⋮ 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 metaheuristic algorithm for a locomotive routing problem arising in the steel industry ⋮ The pickup and delivery traveling salesman problem with handling costs ⋮ Vehicle routing problems with loading constraints: state-of-the-art and future directions

Uses Software

• TSPLIB
• Concorde

Cites Work

• Unnamed Item
• Routing problems with loading constraints
• Heuristic and exact algorithms for the multi-pile vehicle routing problem
• 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
• An algorithm for the traveling salesman problem with pickup and delivery customers
• Variable neighborhood search
• A new extension of local search applied to the Dial-A-Ride problem
• Local search with annealing-like restarts to solve the VRPTW
• A heuristic for the pickup and delivery traveling salesman problem
• Perturbation heuristics for the pickup and delivery traveling salesman problem
• 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
• An Additive Bounding Procedure for Combinatorial Optimization Problems
• TSPLIB—A Traveling Salesman Problem Library
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• Variable neighborhood search: Principles and applications
• An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading

This page was built for publication: The tree representation for the pickup and delivery traveling salesman problem with LIFO loading