کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
483104 | 1446195 | 2007 | 13 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Model and algorithms for multi-period sea cargo mix problem Model and algorithms for multi-period sea cargo mix problem](/preview/png/483104.png)
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.
Journal: European Journal of Operational Research - Volume 180, Issue 3, 1 August 2007, Pages 1381–1393