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

DOI10.1016/J.COR.2016.07.017zbMATH Open1391.90398OpenAlexW2486387210WikidataQ59166715 ScholiaQ59166715MaRDI QIDQ1652016FDOQ1652016

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

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

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

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)

Cites Work

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

Cited In (7)

• A two-phase heuristic for an in-port ship routing problem with tank allocation
• The heterogeneous fleet vehicle routing problem with draft limits
• Cargo routing and scheduling problem in deep-sea transportation: case study from a fertilizer company
• Inventory routing with pickups and deliveries
• Multi‐objective optimization of the maritime cargo routing and scheduling problem
• A traveling salesman problem with pickups and deliveries and stochastic travel times: an application from chemical shipping
• Tight lower bounds for the traveling salesman problem with draft limits

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)