A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks
From MaRDI portal
Publication:5326779
DOI10.1002/net.21468zbMath1269.90007MaRDI QIDQ5326779
Francesco Carrabs, Raffaele Cerulli, Maria Grazia Speranza
Publication date: 6 August 2013
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21468
branch-and-bound; LIFO; multiple stacks; pickup and delivery problems; double traveling salesman problem
90C35: Programming involving graphs or networks
90B06: Transportation, logistics and supply chain management
Related Items
A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks, A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks, A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints, The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach, Exact algorithms for the double vehicle routing problem with multiple stacks, An adapted heuristic approach for a clustered traveling salesman problem with loading constraints, What are the worst cases in constrained last-in-first-out pick-up and delivery problems?, Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review, Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks, 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, Vehicle routing problems with loading constraints: state-of-the-art and future directions, Approximation of the double traveling salesman problem with multiple stacks, The pickup and delivery problem with time windows, multiple stacks, and handling operations, Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks, A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks
Cites Work
- Heuristic and exact algorithms for the multi-pile vehicle routing problem
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- 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
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
- An additive bounding procedure for the asymmetric travelling salesman problem
- Efficient algorithms for the double traveling salesman problem with multiple stacks
- 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
- On the Complexity of the Multiple Stack TSP, kSTSP
- An Additive Bounding Procedure for Combinatorial Optimization Problems
- Finding optimum branchings
- Metaheuristics for the vehicle routing problem with loading constraints
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- Optimum branchings
