New neighborhood structures for the double traveling salesman problem with multiple stacks

DOI10.1007/s11750-009-0080-9zbMath1170.90464OpenAlexW1524324026MaRDI QIDQ839902

M. Teresa Ortuño, Angel Felipe, Gregorio Tirado

Publication date: 3 September 2009

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-009-0080-9

zbMATH Keywords

metaheuristicstraveling salesman problemprecedence constraintsneighborhood structuresLIFO loading

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (13)

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 ⋮ Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints ⋮ Routing problems with loading constraints ⋮ A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints ⋮ Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ Effectiveness of carbon pricing policies for promoting urban freight electrification: analysis of last mile delivery in Madrid ⋮ Unnamed Item ⋮ Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints ⋮ Approximation of the double traveling salesman problem with multiple stacks ⋮ 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

• VRP
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
• Variable neighborhood search
• 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
• Metaheuristics for the vehicle routing problem with loading constraints
• A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
• Variable neighborhood search: Principles and applications

This page was built for publication: New neighborhood structures for the double traveling salesman problem with multiple stacks