A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping
type: Item
instance of: scholarly article
title: A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping
zbMATH Open document ID: 1391.90398
author: Mari Jevne Arnesen
author: Magnhild Gjestvang
author: Xin Wang
author: Kjetil Fagerholt
author: Kristian Thun
author: Jørgen Glomvik Rakke
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90B90
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6901259
zbMATH Keywords: maritime transportation
zbMATH Keywords: traveling salesman problem with pickup and delivery
zbMATH Keywords: draft limit
zbMATH Keywords: dynamic programming
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.cor.2016.07.017
OpenAlex ID: W2486387210
Wikidata QID: Q59166715
cites work: Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
cites work: An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections
cites work: Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
cites work: State-space relaxation procedures for the computation of bounds to routing problems
cites work: Q5687193
cites work: A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
cites work: An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
cites work: The pickup and delivery problem with time windows
cites work: Heuristics for the traveling salesman problem with pickup and delivery
cites work: One-to-Many-to-One Single Vehicle Pickup and Delivery Problems
cites work: The vehicle routing problem: An overview of exact and approximate algorithms
cites work: Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
cites work: The travelling salesman problem with pick-up and delivery
cites work: The traveling salesman problem with draft limits
cites work: Perturbation heuristics for the pickup and delivery traveling salesman problem
cites work: A heuristic for the pickup and delivery traveling salesman problem
cites work: The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
cites work: The General Pickup and Delivery Problem
cites work: Survey Paper—Time Window Constrained Routing and Scheduling Problems
cites work: A maritime inventory routing problem: practical approach
DOI: 10.1016/J.COR.2016.07.017
Recommended article: A traveling salesman problem with pickups and deliveries and stochastic travel times: an application from chemical shipping
Recommended article: The traveling salesman problem with pickup, delivery, and ride-time constraints
Recommended article: The Pickup And Delivery Problem With Time Windows And Transshipment
Recommended article: The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
Recommended article: The multi-commodity pickup-and-delivery traveling salesman problem
Recommended article: A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources
Recommended article: The pickup and delivery traveling salesman problem with handling costs
Recommended article: A heuristic for the pickup and delivery traveling salesman problem
Recommended article: Q3151784
Recommended article: Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
description: scientific article; zbMATH DE number 6901259