Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/22859
Title: Model and algorithms for multi-period sea cargo mix problem
Authors: Ang, JSK
Cao, C
Ye, HQ 
Keywords: Logistics
Sea cargo mix
0- 1 integer program
Heuristic algorithm
Issue Date: 2007
Publisher: Elsevier
Source: European journal of operational research, 2007, v. 180, no. 3, p. 1381-1393 How to cite?
Journal: European journal of operational research 
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.
URI: http://hdl.handle.net/10397/22859
ISSN: 0377-2217
EISSN: 1872-6860
DOI: 10.1016/j.ejor.2006.05.012
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

20
Last Week
0
Last month
Citations as of Apr 18, 2018

WEB OF SCIENCETM
Citations

14
Last Week
0
Last month
2
Citations as of Apr 24, 2018

Page view(s)

58
Last Week
0
Last month
Citations as of Apr 23, 2018

Google ScholarTM

Check

Altmetric


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