Dynamic container slot allocation for a liner shipping service

In this paper, the authors study a dynamic container slot allocation problem (DCSAP) for a liner container shipping company that aims to make an acceptance or rejection decision to each dynamically arriving container slot booking request. To capture the dynamic arrival feature and real-time acceptance/rejection decision of the booking request, the authors formulate the DCSAP as a dynamic programming (DP) model with the objective of maximizing the total revenues generated by accepted container booking requests over the entire booking horizon. Due to the well-known curse of dimensionality of solving a DP model, the authors develop a series of models to transform the intractable DP model into a solvable approximate linear programming (ALP) model. The authors further propose a spatiotemporal-heterogeneity-based (STH-based) decomposition preprocessor by identifying the spatiotemporal property of the DCSAP before solving the ALP model. Extensive numerical experiments are conducted to assess the applicability of the developed research methodology.

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01905820
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Jan 26 2024 10:02AM