The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
From MaRDI portal
Publication:1027598
DOI10.1016/j.ejor.2008.08.009zbMath1163.90816OpenAlexW2020737022MaRDI QIDQ1027598
Oli B. G. Madsen, Hanne L. Petersen
Publication date: 30 June 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2008.08.009
Related Items (43)
New neighborhood structures for the double traveling salesman problem with multiple stacks ⋮ On some applications of the selective graph coloring problem ⋮ The pickup and delivery problem with time windows, multiple stacks, and handling operations ⋮ Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks ⋮ A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints ⋮ A hybrid approach for the vehicle routing problem with three-dimensional loading constraints ⋮ The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach ⋮ What are the worst cases in constrained last-in-first-out pick-up and delivery problems? ⋮ Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks ⋮ Exact algorithms for the double vehicle routing 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 ⋮ Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints ⋮ Routing problems with loading 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 variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks ⋮ A branch-and-cut algorithm for factory crane scheduling problem ⋮ Coordinating Particle Swarm Optimization, Ant Colony Optimization and K-Opt Algorithm for Traveling Salesman Problem ⋮ New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks ⋮ Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem ⋮ Heuristic and exact algorithms for the multi-pile vehicle routing problem ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ An exact method for the double TSP with multiple stacks ⋮ Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks ⋮ Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks ⋮ The traveling purchaser problem and its variants ⋮ An adapted heuristic approach for a clustered traveling salesman problem with loading constraints ⋮ The traveling salesman problem with draft limits ⋮ Efficient algorithms for the double traveling salesman problem with multiple stacks ⋮ Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs ⋮ Unnamed Item ⋮ Vehicle routing problems with loading constraints: state-of-the-art and future directions ⋮ Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints ⋮ Exact solutions to the double travelling salesman problem with multiple stacks ⋮ Approximation of the double traveling salesman problem with multiple stacks ⋮ Synchronized pickup and delivery problems with connecting FIFO stack ⋮ The double traveling salesman problem with multiple stacks: A variable neighborhood search approach ⋮ A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks ⋮ Metaheuristics for vehicle routing problems with three-dimensional loading constraints ⋮ Improved exact method for the double TSP with multiple stacks ⋮ A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithm for the traveling salesman problem with pickup and delivery customers
- Variable neighborhood search
- Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
- The Vehicle Routing 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
- The General Pickup and Delivery Problem
- Metaheuristics for the vehicle routing problem with loading constraints
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
This page was built for publication: The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
