A two-phase heuristic for an in-port ship routing problem with tank allocation
type: Item
instance of: scholarly article
title: A two-phase heuristic for an in-port ship routing problem with tank allocation
zbMATH Open document ID: 1391.90101
author: Xin Wang
author: Mari Jevne Arnesen
author: Kjetil Fagerholt
author: Magnhild Gjestvang
author: Kristian Thun
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
full work available at URL: http://hdl.handle.net/11250/2465438
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 6901547
zbMATH Keywords: maritime transportation
zbMATH Keywords: ship routing
zbMATH Keywords: tank allocation
zbMATH Keywords: traveling salesman problem with pickup and delivery
zbMATH Keywords: dynamic programming
MaRDI profile type: Publication
OpenAlex ID: W2767630565
Wikidata QID: Q59166712
cites work: A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping
cites work: A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
cites work: The pickup and delivery problem with time windows
cites work: A combined ship scheduling and allocation problem
cites work: Tank allocation problems in maritime bulk shipping
cites work: Q4656642
cites work: Optimization of stowage plans for RoRo ships
cites work: The traveling salesman problem with draft limits
cites work: A heuristic and hybrid method for the tank allocation problem in maritime bulk shipping
cites work: Container stowage planning: a methodology for generating computerised solutions
DBLP publication ID: journals/cor/WangAFGT18
DOI: 10.1016/J.COR.2017.11.005
description: scientific article; zbMATH DE number 6901547