Dynamic programming algorithms for selection of waste disposal ports in cruise shipping

•Static/dynamic itinerary and deterministic/stochastic amount of waste.•Polynomial-time solution algorithm for the static deterministic model.•Identify the optimal policy to the dynamic stochastic problem. The cruise industry has maintained a steady growth in the past 20 years. Due to the large numb...

Full description

Saved in:
Bibliographic Details
Published in:Transportation research. Part B: methodological Vol. 108; pp. 235 - 248
Main Authors: Wang, Shuaian, Zhen, Lu, Zhuge, Dan
Format: Journal Article
Language:English
Published: Oxford Elsevier Ltd 01.02.2018
Elsevier Science Ltd
Subjects:
Algorithms
Cruise ship
Dynamic programming
Environmental protection
Mathematical models
Ports
Shipping
Stochastic control theory
Stochastic models
Waste disposal
Water transportation
Dynamic programming
Waste disposal
Water transportation
Cruise ship
ISSN:0191-2615, 1879-2367
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:•Static/dynamic itinerary and deterministic/stochastic amount of waste.•Polynomial-time solution algorithm for the static deterministic model.•Identify the optimal policy to the dynamic stochastic problem. The cruise industry has maintained a steady growth in the past 20 years. Due to the large number of cruise passengers and regulations on sea environment protection, determining at which ports to dispose of the waste generated onboard a cruise ship is a key decision to reduce the cost for a cruise company. We address four versions of the problem: the cruise itinerary is either static or dynamic and the amount of waste generated on each voyage leg is either deterministic or stochastic. We propose a polynomial-time solution algorithm for the static deterministic model, and the idea of the algorithm can also be used to solve the static stochastic model and the dynamic deterministic model. Second, we identify the structure of the optimal policy to the dynamic stochastic problem, based on which an efficient dynamic programming algorithm is developed. Extensive numerical experiments derived from problems of real-case scales demonstrate the efficiency of the proposed algorithms.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0191-2615
1879-2367
DOI:10.1016/j.trb.2017.12.016