Model and algorithms for multi-period sea cargo mix problem

James S.K. Ang, Chengxuan Cao, Hengqing Ye

Research output: Journal article publicationJournal articleAcademic researchpeer-review

21 Citations (Scopus)

Abstract

In this paper, we consider the sea cargo mix problem in international ocean container shipping industry. We describe the characteristics of the cargo mix problem for the carrier in a multi-period planning horizon, and formulate it as a multi-dimensional multiple knapsack problem (MDMKP). In particular, the MDMKP is an optimization model that maximizes the total profit generated by all freight bookings accepted in a multi-period planning horizon subject to the limited shipping capacities. We propose two heuristic algorithms that can solve large scale problems with tens of thousands of decision variables in a short time. Finally, numerical experiments on a wide range of randomly generated problem instances are conducted to demonstrate the efficiency of the algorithms.
Original languageEnglish
Pages (from-to)1381-1393
Number of pages13
JournalEuropean Journal of Operational Research
Volume180
Issue number3
DOIs
Publication statusPublished - 1 Aug 2007
Externally publishedYes

Keywords

  • 0-1 integer program
  • Heuristic algorithm
  • Logistics
  • Sea cargo mix

ASJC Scopus subject areas

  • Modelling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Cite this