Exact algorithms for the double vehicle routing problem with multiple stacks

DOI10.1016/j.cor.2015.04.016zbMath1349.90090OpenAlexW2216725884MaRDI QIDQ342039

Manuel Iori, Jorge Riera-Ledesma

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2015.04.016

zbMATH Keywords

vehicle routing problembranch-and-cutlast-in-first-outbranch-and-price-and-cutone-to-one pickup-and-delivery

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Related Items (10)

Thirty years of heterogeneous vehicle routing ⋮ Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks ⋮ What are the worst cases in constrained last-in-first-out pick-up and delivery problems? ⋮ An exact decomposition method to save trips in cooperative pickup and delivery based on scheduled trips and profit distribution ⋮ The consistent vehicle routing problem with heterogeneous fleet ⋮ The double traveling salesman problem with partial last‐in‐first‐out loading constraints ⋮ A nonlinear optimization model for the balanced vehicle routing problem with loading constraints ⋮ A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ Approximation of the double traveling salesman problem with multiple stacks

Uses Software

• VRP

Cites Work

• Unnamed Item
• A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
• Routing problems with loading constraints
• Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
• An adapted heuristic approach for a clustered traveling salesman problem with loading constraints
• New neighborhood structures for the double traveling salesman problem with multiple stacks
• 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
• Stabilized column generation
• Efficient algorithms for the double traveling salesman problem with multiple stacks
• Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
• An annotated bibliography of combined routing and loading problems
• Vehicle Routing
• 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
• Decomposition Principle for Linear Programs
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• Recent Models and Algorithms for One-to-One Pickup and Delivery Problems
• On the Complexity of the Multiple Stack TSP, kSTSP
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• Solving the Orienteering Problem through Branch-and-Cut
• A Computational Study of Search Strategies for Mixed Integer Programming
• Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks
• A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
• A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks
• Shortest Path Problems with Resource Constraints

This page was built for publication: Exact algorithms for the double vehicle routing problem with multiple stacks