A linear approximation of the value function of an approximate dynamic programming approach for the ship scheduling problem

Authors:
Kazuhiro Kobayashi
Affiliations:
Center for Logistics Research, National Maritime Research Institute, Mitaka-shi, Tokyo, Japan
Venue:
LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
Year:
2010

Citing 3
Cited 0

Ship Routing and Scheduling: Status and Perspectives

Transportation Science
Approximate Dynamic Programming: Solving the Curses of Dimensionality (Wiley Series in Probability and Statistics)

Approximate Dynamic Programming: Solving the Curses of Dimensionality (Wiley Series in Probability and Statistics)
An Approximate Dynamic Programming Algorithm for Large-Scale Fleet Management: A Case Application

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

An approximate dynamic programming approach for the ship scheduling problem is studied. The decision problem at each stage is obtained by adding the value function in the set partitioning problem. The decision problem is a modification of the set partitioning problem so that it can be solved by the route generation approach. Numerical results for evaluating this approach is also given.