Name
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.ejor.2006.05.012 | European Journal of Operational Research |
Keywords | Field | DocType |
Logistics,Sea cargo mix,0–1 integer program,Heuristic algorithm | Reservation,Decision variables,Time horizon,Knapsack problem,Operations management,Mathematical optimization,Heuristic,Benefice,Heuristic (computer science),Operations research,Algorithm,Numerical analysis,Mathematics | Journal |
Volume | Issue | ISSN |
180 | 3 | 0377-2217 |
Citations | PageRank | References |
5 | 0.67 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| JAMES S. K. ANG | 1 | 150 | 12.04 |
| Chengxuan Cao | 2 | 10 | 2.57 |
| Hengqing Ye | 3 | 100 | 12.30 |