Storage space allocation problem at inland bulk material stockyard

Abstract We consider the storage space allocation problem at an inland bulk stockyard, which aims to find an effective way to store the shapeless materials. Due to the specific storage and handling means in the stockyard, unloading, stacking and reclaiming operations need to be scheduled in an integrated manner. Viewing the space of each stock pad in the yard as a series of unit slots, we first develop a novel MIP formulation which can avoid generating scattered small fields. We then decompose the model by exploiting the relationships among the above operations, and develop a logic-based Benders approach to solve it optimally.

[1]  Alexandre César Muniz de Oliveira,et al.  Model and heuristic for berth allocation in tidal bulk ports with stock level constraints , 2011, Comput. Ind. Eng..

[2]  Jaap A. Ottjes,et al.  Simulation-based determination of the required stockyard size for dry bulk terminals , 2014, Simul. Model. Pract. Theory.

[3]  Xiangtong Qi,et al.  Storage space allocation models for inbound containers in an automatic container terminal , 2013, Eur. J. Oper. Res..

[4]  Manoj Kumar Tiwari,et al.  Minimizing delay of ships in bulk terminals by simultaneous ship scheduling, stockyard planning and train scheduling , 2015 .

[5]  J. Hooker,et al.  Logic-based Benders decomposition , 2003 .

[6]  Jiyin Liu,et al.  The assignment of storage locations to containers for a container stack , 2009 .

[7]  Martin W. P. Savelsbergh,et al.  A stockyard planning problem , 2012, EURO J. Transp. Logist..

[8]  Zhenqiang Yao,et al.  Stacker-reclaimer scheduling in a dry bulk terminal , 2012, Int. J. Comput. Integr. Manuf..

[9]  Lixin Tang,et al.  Research into container reshuffling and stacking problems in container terminal yards , 2015 .

[10]  Michel Bierlaire,et al.  Exact and heuristic methods to solve the berth allocation problem in bulk ports , 2013 .

[11]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .

[12]  Lixin Tang,et al.  Integrated storage space allocation and ship scheduling problem in bulk cargo terminals , 2016 .

[13]  Geraldo Robson Mateus,et al.  A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports , 2017, Eur. J. Oper. Res..

[14]  Lixin Tang,et al.  A Benders decomposition-based framework for solving quay crane scheduling problems , 2019, Eur. J. Oper. Res..

[15]  Nima Safaei,et al.  A genetic algorithm to solve the storage space allocation problem in a container terminal , 2009, Comput. Ind. Eng..

[16]  Martin W. P. Savelsbergh,et al.  Scheduling reclaimers serving a stock pad at a coal terminal , 2017, J. Sched..

[17]  Shuqin Li,et al.  A Benders decomposition algorithm for the order fulfilment problem of an e-tailer with a self-owned logistics system , 2019 .

[18]  Richard J. Linn,et al.  Storage space allocation in container terminals , 2003 .

[19]  Yung Jae Lee,et al.  A two-level hierarchical approach for raw material scheduling in steelworks , 1997 .

[20]  Martin W. P. Savelsbergh,et al.  A reclaimer scheduling problem arising in coal stockyard management , 2016, J. Sched..

[21]  Ceyda Oguz,et al.  An exact algorithm for integrated planning of operations in dry bulk terminals , 2019 .

[22]  Rudy R. Negenborn,et al.  A Hybrid Dynamical Approach for Allocating Materials in a Dry Bulk Terminal , 2018, IEEE Transactions on Automation Science and Engineering.

[23]  Michel Bierlaire,et al.  A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports , 2014, Eur. J. Oper. Res..