The traveling salesman problem with draft limits
From MaRDI portal
Publication:1761142
DOI10.1016/j.cor.2011.10.025zbMath1251.90333OpenAlexW2090481597MaRDI QIDQ1761142
Jørgen Glomvik Rakke, Kjetil Fagerholt, Gilbert Laporte, Marielle Christiansen
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.10.025
Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Case-oriented studies in operations research (90B90)
Related Items (12)
A two-stage solution method for the annual dairy transportation problem ⋮ A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping ⋮ A two-phase heuristic for an in-port ship routing problem with tank allocation ⋮ Cargo routing and scheduling problem in deep-sea transportation: case study from a fertilizer company ⋮ A general variable neighborhood search variants for the travelling salesman problem with draft limits ⋮ A branch-and-price approach to the feeder network design problem ⋮ Tight lower bounds for the traveling salesman problem with draft limits ⋮ A traveling salesman problem with pickups and deliveries and stochastic travel times: an application from chemical shipping ⋮ Exact algorithms for the traveling salesman problem with draft limits ⋮ Optimizing ship speed to minimize total fuel consumption with multiple time windows ⋮ CP methods for scheduling and routing with~time-dependent task costs ⋮ The heterogeneous fleet vehicle routing problem with draft limits
Cites Work
- A maritime inventory routing problem: practical approach
- Routing problems with loading constraints
- A large neighbourhood search heuristic for ship routing and scheduling with split loads
- A comparison of five heuristics for the multiple depot vehicle scheduling problem
- An efficient algorithm for the minimum capacity cut problem
- A comparative analysis of several asymmetric traveling salesman problem formulations
- 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
- The precedence-constrained asymmetric traveling salesman polytope
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
- Integer Programming Formulation of Traveling Salesman Problems
- On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems
- Solution of a Large-Scale Traveling-Salesman Problem
- Unnamed Item
This page was built for publication: The traveling salesman problem with draft limits