Model and algorithms for multi-period sea cargo mix problem

European Journal of Operational Research

Volumn 180, Issue 3, 2007, Pages 1381-1393

  Ang, James S K ^a   Cao, Chengxuan ^a   Ye, Heng Qing ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

0 1 integer program; Heuristic algorithm; Logistics; Sea cargo mix

Indexed keywords

FREIGHT TRANSPORTATION; HEURISTIC METHODS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; STRATEGIC PLANNING;

0-1 INTEGER PROGRAM; HEURISTIC ALGORITHM; SEA CARGO MIX;

ALGORITHMS;

EID: 33847067096     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.05.012     Document Type: Article

References (18)

1. Cheung R.K., and Chen C.-Y. A two-stage stochastic network model and solution methods for the dynamic empty container allocation problem. Transportation Science 32 2 (1998) 142-162
2. Cho S.-C., and Perakis A.N. Optimal liner fleet routing strategies. Maritime Policy & Management 23 3 (1996) 249-259
3. Choong S.T., Cole M.H., and Kutanoglu E. Empty container management for intermodal transportation networks. Transportation Research Part E 38 (2002) 423-438
4. Crainic T.G., Gendreau M., and Dejax P. Dynamic and stochastic models for the allocation of empty containers. Operations Research 41 1 (1993) 102-126
5. Evans J.J., and Marlow P. Quantitative Methods in Maritime Economics (1985), Fairplay Publications
6. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman, New York
7. S. Khan, K.F. Li, E.G. Manning, The utility model for adaptive multimedia system, in: International Workshop on Multimedia Modeling, 1997, pp. 111-126 .
8. Koleser P. A branch and bound algorithm for knapsack problem. Management Science 13 (1967) 723-735
9. Lai K.K., Lam K., and Chan W.K. Ship container logistics and allocation. Journal of the Operational Research Society 46 6 (1995) 687-697
10. E.F. Magirou, H.N. Psaraftis, N.M. Christodoulakis, Quantitative methods in shipping: A survey of current use and future trends, Athens University of Economics and Business, Report No. E115, 1992.
11. Martello S., and Toth P. Knapsack Problems: Algorithms and Computer Implementation (1990), Wiley & Sons, New York
12. Nauss R.M. The knapsack problem with multiple choice constraints. European Journal of Operational Research 2 (1978) 125-131
13. Pisinger D. A minimal algorithm for the 0-1 Knapsack problem. Operations Research 45 (1997) 758-767
14. Pisinger D. Core problems in Knapsack algorithms. Operations Research 47 (1999) 570-575
15. Pisinger D. An exact algorithm for large multiple knapsack problems. European Journal of Operational Research 114 (1999) 528-541
16. Rana K., and Vickson R.G. Routing container ships using Lagrangean relaxation and decomposition. Transportation Science 25 3 (1991) 201-214
17. Shih W. A branch and bound method for the multiconstraint zero-one knapsack problem. Journal of the Operational Society 30 4 (1979) 369-378
18. Toyoda Y. A simplified algorithm for obtaining approximate solution to zero-one programming problems. Management Science 21 (1975) 1417-1427