Two-stage stochastic integer programming model for multiperiod sea cargo mix problem in container shipping industry

IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans

Volumn 39, Issue 2, 2009, Pages 460-465

  Ang, James S K ^a   Cao, Chengxuan ^b   Parlar, Mahmut ^c   Ye, Heng Qing ^d  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b BEIJING JIAOTONG UNIVERSITY   (China)

^c MCMASTER UNIVERSITY   (Canada)

^d HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Container shipping industry; Heuristic algorithm (HA); Sea cargo mix; Two stage stochastic integer program

Indexed keywords

BIOLOGICAL MATERIALS; CONTAINERS; DYNAMIC PROGRAMMING; FREIGHT TRANSPORTATION; HEURISTIC METHODS; HYDROXYLATION; INTEGER PROGRAMMING; PORTALS; RANDOM PROCESSES; SEAWATER; STOCHASTIC MODELS;

EXPECTED PROFITS; INTEGER PROGRAMMING MODELS; MIX PROBLEMS; NUMERICAL EXPERIMENTS; PLANNING HORIZONS; PROBLEM INSTANCES; SEA CARGO MIX; TWO-STAGE STOCHASTIC INTEGER PROGRAM;

HEURISTIC ALGORITHMS;

EID: 62149139392     PISSN: 10834427     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCA.2008.2010754     Document Type: Article

References (12)

1. D. Bertsimas and R. Demir, "An approximate dynamic programming approach to multidimensional knapsack problems," Manag. Sci., vol. 48, no. 4, pp. 550-565, Apr. 2002.
2. R. Birge and F. Louveaux, Introduction to Stochastic Programming. New York: Springer-Verlag, 1997.
3. S.-C. Cho and A. N. Perakis, "Optimal liner fleet routing strategies," Marit. Policy Manage., vol. 23, no. 3, pp. 249-259, 1996.
4. J. J. Evans and P. Marlow, Quantitative Methods in Maritime Economics Surrey, U.K.: Fairplay Publ., 1985.
5. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP- Completeness. New York: Freeman, 1993.
6. G. Laporte and F. V. Louveaux, "The integer L-shaped method for stochastic integer programs with complete recourse," Oper. Res. Lett., vol. 13, no. 3, pp. 133-142, Apr. 1993.
7. R. Loulou and E. Michaelides, "New greedy-like heuristics for the multidimensional 0-1 knapsack problem," Oper. Res., vol. 27, no. 6, pp. 1101-1114, Nov./Dec. 1979.
8. E. F. Magirou, H. N. Psaraftis, and N. M. Christodoulakis, "Quantitative methods in shipping: A survey of current use and future trends," Athens Univ. Economics Business, Athens, Greece, Report No. E115, 1992.
9. S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementation. New York: Wiley, 1990.
10. R. Parra-Hernandez and N. Dimopoulos, "A new heuristic for solving the multichoice multidimensional knapsack problem," AIEEE Trans. Syst., Man, Cybern. A, Syst., Humans, vol. 35, no. 5, pp. 708-717, Sep. 2005.
11. K. Rana and R. G. Vickson, "Routing container ships using Lagrangean relaxation and decomposition," Transp. Sci., vol. 25, no. 3, pp. 201-214, Aug. 1991.
12. Y. Toyoda, "A simplified algorithm for obtaining approximate solutions to zero-one programming problems," Manag. Sci., vol. 21, no. 12, pp. 1417-1427, Aug. 1975.