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

DOI10.1016/J.EJOR.2011.02.008MaRDI QIDQ421561zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

pickup and deliveryvariable neighborhood searchtraveling salesmanlast-in-first-out loadingtree data structure

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

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

Cites work

• scientific article; zbMATH DE number 3831308 (Why is no real title available?)
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
• A heuristic for the pickup and delivery traveling salesman problem
• A new extension of local search applied to the Dial-A-Ride problem
• An Additive Bounding Procedure for Combinatorial Optimization Problems
• An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading
• An algorithm for the traveling salesman problem with pickup and delivery customers
• Heuristic and exact algorithms for the multi-pile vehicle routing problem
• Local search with annealing-like restarts to solve the VRPTW
• Perturbation heuristics for the pickup and delivery traveling salesman problem
• Routing problems with loading constraints
• TSPLIB—A Traveling Salesman Problem Library
• The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
• Variable neighborhood search
• Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
• Variable neighborhood search: Principles and applications

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

Describes a project that uses

Uses Software

• Concorde
• TSPLIB

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)