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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6073 LNCS, Issue , 2010, Pages 184-187

  Kobayashi, Kazuhiro ^a  

^a NATIONAL MARITIME RESEARCH INSTITUTE   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE DYNAMIC PROGRAMMING; DECISION PROBLEMS; LINEAR APPROXIMATIONS; NUMERICAL RESULTS; ROUTE GENERATION; SET PARTITIONING PROBLEM; SHIP SCHEDULING; VALUE FUNCTIONS;

NUMERICAL ANALYSIS; OPTIMIZATION; SCHEDULING; SHIPS;

DYNAMIC PROGRAMMING;

EID: 77954606196     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13800-3_14     Document Type: Conference Paper

References (4)

1. Christiansen, M., Fagerholt, K., Ronen, D.: Ship routing and scheduling: status and perspectives. Transp. Sci. 38, 1-18 (2004)
2. Kobayashi, K., Kubo, M.: Optimization of oil tanker schedules by decomposition, column generation, and time-space network techniques. Japan J. Indust. Appl. Math. (to appear)
3. Simão, H.P., George, J.D.A., Gifford, T., Powell, W.B.: An approximate dynamic programming algorithm for large-scale fleet management:a case application. Transp. Sci. 43, 178-197 (2009)
4. Powell, W.B.: Approximate Dynamic Programming: Solving the Curses of Dimensionality. Wiley Interscience, New York (2007)