Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.ejor.2006.05.012
Title: Model and algorithms for multi-period sea cargo mix problem
Authors: Ang, J.S.K. 
Cao, C. 
Ye, H.-Q. 
Keywords: 0-1 integer program
Heuristic algorithm
Logistics
Sea cargo mix
Issue Date: 2007
Source: Ang, J.S.K., Cao, C., Ye, H.-Q. (2007). Model and algorithms for multi-period sea cargo mix problem. European Journal of Operational Research 180 (3) : 1381-1393. ScholarBank@NUS Repository. https://doi.org/10.1016/j.ejor.2006.05.012
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. © 2006 Elsevier B.V. All rights reserved.
Source Title: European Journal of Operational Research
URI: http://scholarbank.nus.edu.sg/handle/10635/44078
ISSN: 03772217
DOI: 10.1016/j.ejor.2006.05.012
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

19
checked on Dec 5, 2017

WEB OF SCIENCETM
Citations

14
checked on Nov 16, 2017

Page view(s)

86
checked on Dec 10, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.