Optimal rail container shipment planning problem in multimodal transportation

The optimal rail container shipment planning problem in multimodal transportation is studied in this article. The characteristics of the multi-period planning problem is presented and the problem is formulated as a large-scale 0-1 integer programming model, which maximizes the total profit generated by all freight bookings accepted in a multi-period planning horizon subject to the limited capacities. Two heuristic algorithms are proposed to obtain an approximate optimal solution of the problem. Finally, numerical experiments are conducted to demonstrate the proposed formulation and heuristic algorithms.

[1]  David Pisinger,et al.  Core Problems in Knapsack Algorithms , 1999, Oper. Res..

[2]  Frank Southworth,et al.  Intermodal and international freight network modeling , 2000 .

[3]  Rumen Andonov,et al.  A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem , 2008, Eur. J. Oper. Res..

[4]  A. Fréville,et al.  Heuristics and reduction methods for multiple constraints 0-1 linear programming problems , 1986 .

[5]  H. Martin Weingartner,et al.  Methods for the Solution of the Multidimensional 0/1 Knapsack Problem , 1967, Operational Research.

[6]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[7]  Y. Toyoda.  A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems , 1975 .

[8]  Raymond R. Hill,et al.  Problem reduction heuristic for the 0-1 multidimensional knapsack problem , 2012, Comput. Oper. Res..

[9]  Jae Sik Lee,et al.  An approximate algorithm for multidimensional zero-one knapsack problems , 1988 .

[10]  Erhan Kozan,et al.  An assignment model for dynamic load planning of intermodal trains , 2006, Comput. Oper. Res..

[11]  Sameh Al-Shihabi,et al.  A hybrid of Nested Partition, Binary Ant System, and Linear Programming for the multidimensional knapsack problem , 2010, Comput. Oper. Res..

[12]  Didier El Baz,et al.  Heuristics for the 0-1 multidimensional knapsack problem , 2009, Eur. J. Oper. Res..

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

[14]  Zhi-Hua Hu,et al.  A container multimodal transportation scheduling approach based on immune affinity model for emergency relief , 2011, Expert Syst. Appl..

[15]  Wei Shih,et al.  A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem , 1979 .

[16]  Pamela H. Vance,et al.  Knapsack Problems: Algorithms and Computer Implementations (S. Martello and P. Toth) , 1993, SIAM Rev..

[17]  Hasan Pirkul,et al.  Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality , 1985, Math. Program..

[18]  Arnaud Fréville,et al.  The multidimensional 0-1 knapsack problem: An overview , 2004, Eur. J. Oper. Res..

[19]  Cathy Macharis,et al.  Opportunities for OR in intermodal freight transport research: A review , 2004, Eur. J. Oper. Res..

[20]  David Pisinger.  An exact algorithm for large multiple knapsack problems , 1999, Eur. J. Oper. Res..

[21]  Min Kong,et al.  A new ant colony optimization algorithm for the multidimensional Knapsack problem , 2008, Comput. Oper. Res..

[22]  Philippe Michelon,et al.  A multi-level search strategy for the 0-1 Multidimensional Knapsack Problem , 2010, Discret. Appl. Math..

[23]  Maria Grazia Speranza,et al.  Kernel search: A general heuristic for the multi-dimensional knapsack problem , 2010, Comput. Oper. Res..

[24]  David Pisinger,et al.  A Minimal Algorithm for the 0-1 Knapsack Problem , 1997, Oper. Res..

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

[26]  A Volgenant,et al.  An Improved Heuristic for Multidimensional 0-1 Knapsack Problems , 1990 .

[27]  Richard Loulou,et al.  New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem , 1979, Oper. Res..

[28]  Mohammadreza Razzazi,et al.  Development of core to solve the multidimensional multiple-choice knapsack problem , 2011, Comput. Ind. Eng..

[29]  Erhan Kozan,et al.  Genetic algorithms to schedule container transfers at multimodal terminals , 1999 .