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

DOI10.1007/S11750-009-0080-9zbMATH Open1170.90464OpenAlexW1524324026MaRDI QIDQ839902FDOQ839902

M. T. 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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimization by Simulated Annealing
• 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
• Variable neighborhood search: Principles and applications
• A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
• The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
• Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading

Cited In (14)

• Approximation of the double traveling salesman 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
• Routing problems with loading constraints
• Approximability of the multiple stack TSP
• 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
• Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints
• Exact algorithms for the double vehicle routing 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
• Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
• Effectiveness of carbon pricing policies for promoting urban freight electrification: analysis of last mile delivery in Madrid
• The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
• Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints

Uses Software

• VRP
• Tabu search

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q839902)