The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
From MaRDI portal
Publication:1025245
DOI10.1016/j.cor.2009.01.015zbMath1162.90353MaRDI QIDQ1025245
M. Teresa Ortuño, Gregorio Tirado, Angel Felipe
Publication date: 18 June 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.01.015
90C35: Programming involving graphs or networks
90B06: Transportation, logistics and supply chain management
90B10: Deterministic network models in operations research
Related Items
Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks, 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 branch‐and‐bound algorithm for the double travelling salesman problem with two stacks, 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, The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach, Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems, Exact algorithms for the double vehicle routing problem with multiple stacks, The tree representation for the pickup and delivery traveling salesman problem with LIFO loading, 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, Variable neighbourhood search: methods and applications, Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review, The traveling salesman problem with draft limits, Efficient algorithms for the double traveling salesman problem with multiple stacks, Variable neighbourhood structures for cycle location problems, 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, Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints, 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, New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks, Improved exact method for the double TSP with multiple stacks
Cites Work
- Unnamed Item
- Unnamed Item
- The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
- Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
- 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
- The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
- Variable neighborhood search: Principles and applications
