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

DOI10.1016/J.COR.2016.07.017MaRDI QIDQ1652016zbMATH OpenOpenAlexWikidataFDO

Authors Mari Jevne Arnesen, Magnhild Gjestvang, Xin Wang, Kjetil Fagerholt, Kristian Thun, 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) Approximation methods and heuristics in mathematical programming (90C59) Case-oriented studies in operations research (90B90) Combinatorial optimization (90C27) Dynamic programming (90C39) Transportation, logistics and supply chain management (90B06)

Recommendations

• A traveling salesman problem with pickups and deliveries and stochastic travel times: an application from chemical shipping
• The traveling salesman problem with pickup, delivery, and ride-time constraints
• The Pickup And Delivery Problem With Time Windows And Transshipment
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
• The multi-commodity pickup-and-delivery traveling salesman problem
• A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources
• The pickup and delivery traveling salesman problem with handling costs
• A heuristic for the pickup and delivery traveling salesman problem
• scientific article; zbMATH DE number 1816805
• Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries

Cites work

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

Cited in

(10)

• Cargo routing and scheduling problem in deep-sea transportation: case study from a fertilizer company
• A two-phase heuristic for an in-port ship routing problem with tank allocation
• The traveling salesman problem with draft limits
• Exact algorithms 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
• The heterogeneous fleet vehicle routing problem with draft limits
• Tight lower bounds for the traveling salesman problem with draft limits
• A revised formulation, library and heuristic for a chemical tanker scheduling problem
• Multi‐objective optimization of the maritime cargo routing and scheduling problem
• Inventory routing with pickups and deliveries

Describes a project that uses

Uses Software

• VRP

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

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