A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping

DOI10.1016/j.cor.2016.07.017zbMath1391.90398OpenAlexW2486387210WikidataQ59166715 ScholiaQ59166715MaRDI QIDQ1652016

Magnhild Gjestvang, Kjetil Fagerholt, Mari Jevne Arnesen, Kristian Thun, Xin Wang, Jørgen Glomvik Rakke

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.07.017

zbMATH Keywords

dynamic programmingmaritime transportationdraft limittraveling salesman problem with pickup and delivery

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Case-oriented studies in operations research (90B90) Dynamic programming (90C39)

Related Items (7)

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 ⋮ Multi‐objective optimization of the maritime cargo routing and scheduling 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 ⋮ Inventory routing with pickups and deliveries ⋮ The heterogeneous fleet vehicle routing problem with draft limits

Uses Software

• VRP

Cites Work

• Unnamed Item
• A maritime inventory routing problem: practical approach
• The pickup and delivery problem with time windows
• The vehicle routing problem: An overview of exact and approximate algorithms
• Heuristics for the traveling salesman problem with pickup and delivery
• The travelling salesman problem with pick-up and delivery
• A heuristic for the pickup and delivery traveling salesman problem
• Perturbation heuristics for the pickup and delivery traveling salesman problem
• The traveling salesman problem with draft limits
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
• One-to-Many-to-One Single Vehicle Pickup and Delivery Problems
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
• Survey Paper—Time Window Constrained Routing and Scheduling Problems
• State-space relaxation procedures for the computation of bounds to routing problems
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
• An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections
• The General Pickup and Delivery Problem
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows

This page was built for publication: A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping