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

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 and efficiency of the proposed model and algorithm.

[1]  Stephen C. H. Leung,et al.  A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem , 2012, Comput. Oper. Res..

[2]  Wpm Wim Nuijten,et al.  Multimodal freight transportation planning: A literature review , 2014, Eur. J. Oper. Res..

[3]  Alexandra M. Newman,et al.  Scheduling Direct and Indirect Trains and Containers in an Intermodal Setting , 2000, Transp. Sci..

[4]  Pierre Dejax,et al.  Models and Algorithms for Container Allocation Problems on Trains in a Rapid Transshipment Shunting Yard , 1998, Transp. Sci..

[5]  In Chan Choi,et al.  A hybrid genetic algorithm for train sequencing in the Korean railway , 2009 .

[6]  S. Siva Sathya,et al.  Gene silencing - A genetic operator for constrained optimization , 2011, Appl. Soft Comput..

[7]  Chengxuan Cao,et al.  Capacity allocation problem with random demands for the rail container carrier , 2012, Eur. J. Oper. Res..

[8]  Kusum Deep,et al.  A real coded genetic algorithm for solving integer and mixed integer optimization problems , 2009, Appl. Math. Comput..

[9]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[10]  Julie L. Swann,et al.  Capacity allocation to sales agents in a decentralized logistics network , 2007 .

[11]  Optimal rail container shipment planning problem in multimodal transportation , 2012 .

[12]  Mitsuo Gen,et al.  Genetic algorithms and engineering optimization , 1999 .

[13]  John M. Wilson,et al.  Introduction to Stochastic Programming , 1998, J. Oper. Res. Soc..

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[15]  Zhan Zhi-gang.  Solving 0-1 Knapsack Problem Based on Genetic Algorithm with Improved Simulated Annealing , 2011 .

[16]  Charles E. Taylor.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. Complex Adaptive Systems.John H. Holland , 1994 .

[17]  Xin Liu,et al.  A frequency-based maritime container assignment model , 2011 .

[18]  Peter Jacko,et al.  Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic , 2016, Ann. Oper. Res..

[19]  Kap-Hwan Kim,et al.  intermodal transportation , 2022, The Fairchild Books Dictionary of Fashion.

[20]  T. Crainic.  Long-Haul Freight Transportation , 1999 .

[21]  Christian Blum,et al.  Hybrid metaheuristics in combinatorial optimization: A survey , 2011, Appl. Soft Comput..

[22]  Christos Koulamas,et al.  A survey of simulated annealing applications to operations research problems , 1994 .

[23]  Ziyou Gao,et al.  Railway freight transportation planning with mixed uncertainty of randomness and fuzziness , 2011, Appl. Soft Comput..

[24]  Simona Mancini,et al.  Formulating a Mathematical Model for Container Assignment Optimization on an Intermodal Network , 2014 .