Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints

DOI10.1016/j.ejor.2012.06.019zbMath1253.90190OpenAlexW1965723631MaRDI QIDQ1926986

Wenbin Zhu, Hu Qin, Andrew E. B. Lim, Xiang Gao, Brenda Cheang

Publication date: 29 December 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.2012.06.019

zbMATH Keywords

traveling salesmanmetaheuristicpickup and deliverylast-in-first-out loadingdistance constraint

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (11)

The multiple vehicle pickup and delivery problem with LIFO constraints ⋮ A tabu search algorithm for the multi-period inspector scheduling problem ⋮ A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading ⋮ Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading ⋮ Exact algorithms for the double vehicle routing problem with multiple stacks ⋮ 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 ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem ⋮ Vehicle routing problems with loading constraints: state-of-the-art and future directions ⋮ A mathematical model and algorithms for the aircraft hangar maintenance scheduling problem

Uses Software

• TSPLIB

Cites Work

• The tree representation for the pickup and delivery traveling salesman problem with LIFO loading
• Routing problems with loading constraints
• Heuristic and exact algorithms for the multi-pile vehicle routing problem
• Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
• A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
• New neighborhood structures for the double traveling salesman problem with multiple stacks
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
• A general heuristic for vehicle routing problems
• The pickup and delivery traveling salesman problem with first-in-first-out loading
• The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
• The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
• A powerful route minimization heuristic for the vehicle routing problem with time windows
• 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
• A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
• Optimal routing of multiple-load AGV subject to LIFO loading constraints
• Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints
• A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
• The Vehicle Routing Problem
• A Two-Stage Heuristic with Ejection Pools and Generalized Ejection Chains for the Vehicle Routing Problem with Time Windows
• Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
• An exact method for the double TSP with multiple stacks
• A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
• Exact solutions to the double travelling salesman problem with multiple stacks
• A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
• Optimal Routing under Capacity and Distance Restrictions
• TSPLIB—A Traveling Salesman Problem Library
• On the Distance Constrained Vehicle Routing Problem
• A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks
• Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
• 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: Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints