publication . Article . 2015

Model and Algorithm for Container Allocation Problem with Random Freight Demands in Synchromodal Transportation

Yan Xu; Chengxuan Cao; Bin Jia; Guangzhi Zang;
Open Access English
  • Published: 03 Nov 2015 Journal: Mathematical Problems in Engineering, volume 2,015 (issn: 1563-5147, Copyright policy)
  • Publisher: Hindawi Limited
This paper aims to investigate container allocation problem with random freight demands in synchromodal transportation network from container carriers’ perspective. Firstly, the problem is formulated as a stochastic integer programming model where the overall objective is to determine a container capacity allocation plan at operational level, so that the expected total transportation profit is maximized. Furthermore, by integrating simulated annealing with genetic algorithm, a problem-oriented hybrid algorithm with a novel gene encode method is designed to solve the optimization model. Some numerical experiments are carried out to demonstrate the effectiveness a...
Persistent Identifiers
free text keywords: Article Subject, General Engineering, General Mathematics, lcsh:Engineering (General). Civil engineering (General), lcsh:TA1-2040, lcsh:Mathematics, lcsh:QA1-939, Stochastic integer programming, ENCODE, Flow network, Engineering, business.industry, business, Genetic algorithm, Novel gene, Hybrid algorithm, Mathematical optimization, Simulated annealing, Algorithm
Related Organizations
24 references, page 1 of 2

[1] M. Steadiesei,fi N. P. Dellaert, W. Nuijten, T. Van Woensel, and R. Raou,fi “Multimodal freight transportation planning: a literature review,” European Journal of Operational Research, vol.

[3] T. G. Crainic and K. H. Kim, “Intermodal transportation,” Transportation, vol. 14, pp. 467-537, 2006.

[4] A. M. Newman and C. A. Yano, “Scheduling direct and indirect trains and containers in an intermodal setting,” Transportation Science, vol. 34, no. 3, pp. 256-270, 2000.

[5] N. Bostel and P. Dejax, “Models and algorithms for container allocation problems on trains in a rapid transshipment shunting yard,” Transportation Science, vol. 32, no. 4, pp. 370-379, 1998.

[6] O. C. Demirag and J. L. Swann, “Capacity allocation to sales agents in a decentralized logistics network,” Naval Research Logistics, vol. 54, no. 7, pp. 796-810, 2007.

[7] M. G. H. Bell, X. Liu, P. Angeloudis, A. Fonzone, and S. H. Hosseinloo, “A frequency-based maritime container assignment model,” Transportation Research Part B: Methodological, vol. 45, no. 8, pp. 1152-1161, 2011.

[8] M. Arnone, S. Mancini, and A. Rosa, “Formulating a mathematical model for container assignment optimization on an intermodal network,” Procedia-Social and Behavioral Sciences, vol. 111, pp. 1063-1072, 2014.

[9] C. Cao, Z. Gao, and K. Li, “Capacity allocation problem with random demands for the rail container carrier,” European Journal of Operational Research, vol. 217, no. 1, pp. 214-221, 2012.

[10] C. Cao, Z. Gao, and K. Li, “Optimal rail container shipment planning problem in multimodal transportation,” Engineering Optimization, vol. 44, no. 9, pp. 1057-1071, 2012.

[11] P. Jacko, “Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and indexknapsack heuristic,” Annals of Operations Research, pp. 1-25, 2013. [OpenAIRE]

[12] J. R. Birge and F. Louveaux, Introduction to Stochastic Programming, Springer Science & Business Media, 2011.

[13] M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the eThory of NP-Completeness , W.H. Freeman Publishers, San Francisco, Calif, USA, 1979.

[14] J. Holland, Adaption in Natural and Articfiial Systems , eTh University of Michigan Press, Ann Arbor, Mich, USA, 1975.

[15] L. Yang, Z. Gao, and K. Li, “Railway freight transportation planning with mixed uncertainty of randomness and fuzziness,” Applied Soft Computing Journal , vol. 11, no. 1, pp. 778-792, 2011.

[16] S. Siva Sathya and S. Kuppuswami, “Gene silencing-a genetic operator for constrained optimization,” Applied Soft Computing Journal, vol. 11, no. 8, pp. 5801-5808, 2011. [OpenAIRE]

24 references, page 1 of 2
Any information missing or wrong?Report an Issue