An approximate dynamic programming algorithm for multi-period maritime fleet renewal problem under uncertain market Online publication date: Thu, 26-Jan-2023
by Tingsong Wang; Xuecheng Tian; Xu Guan
International Journal of Shipping and Transport Logistics (IJSTL), Vol. 16, No. 1/2, 2023
Abstract: This paper studies the maritime fleet renewal problem under an uncertain market, including various uncertain factors such as ship prices, shipping demand, and freight rates. A dynamic programming model for this problem is proposed. However, the traditional methods to solve the dynamic programming model may encounter the challenge of 'curses of dimensionality' due to their backward iterations used in these methods, which makes them cumbersome to be applied in practice. Therefore, an approximate dynamic programming (ADP) algorithm is employed to solve the proposed model in this paper. Finally, a case study is implemented to evaluate the applicability and performance of the ADP algorithm and analyse the impact of the uncertain market on fleet renewal. The fleet renewal plan obtained from our proposed methodology is more robust and adaptable to the uncertain market than that obtained from the deterministic model in which the various uncertain parameters are replaced by their predicted values.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Shipping and Transport Logistics (IJSTL):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook