A two-phase heuristic for an in-port ship routing problem with tank allocation

DOI10.1016/j.cor.2017.11.005zbMath1391.90101OpenAlexW2767630565WikidataQ59166712 ScholiaQ59166712MaRDI QIDQ1652535

Magnhild Gjestvang, Kjetil Fagerholt, Xin Wang, Mari Jevne Arnesen, Kristian Thun

Publication date: 11 July 2018

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

Full work available at URL: http://hdl.handle.net/11250/2465438

zbMATH Keywords

dynamic programmingmaritime transportationship routingtank allocationtraveling salesman problem with pickup and delivery

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Dynamic programming (90C39)

Related Items (5)

A revised formulation, library and heuristic for a chemical tanker scheduling problem ⋮ A traveling salesman problem with pickups and deliveries and stochastic travel times: an application from chemical shipping ⋮ An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports ⋮ Scheduling ships movements within a canal harbor ⋮ Models and algorithms for an integrated vessel scheduling and tug assignment problem within a canal harbor

Cites Work

• Unnamed Item
• A heuristic and hybrid method for the tank allocation problem in maritime bulk shipping
• Optimization of stowage plans for RoRo ships
• Tank allocation problems in maritime bulk shipping
• The pickup and delivery problem with time windows
• A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping
• The traveling salesman problem with draft limits
• A combined ship scheduling and allocation problem
• Container stowage planning: a methodology for generating computerised solutions
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows

This page was built for publication: A two-phase heuristic for an in-port ship routing problem with tank allocation