Logistics optimisation of slab pre-marshalling problem in steel industry

References

• Bortfeldt, Andreas. 2004. “A Heuristic for the Container pre-Marshalling Problem.” In Proceedings of the third International Conference on computer and IT Applications in the Maritime Industries, 419–429.
   Google Scholar
• Bortfeldt, Andreas, and Florian Forster. 2012. “A Tree Search Procedure for the Container pre-Marshalling Problem.” European Journal of Operational Research 217: 531–540. doi: 10.1016/j.ejor.2011.10.005
   Web of Science ®Google Scholar
• Braune, Roland, Günther Zäpfel, and Michael Affenzeller. 2012. “An Exact Approach for Single Machine Subproblems in Shifting Bottleneck Procedures for job Shops with Total Weighted Tardiness Objective.” European Journal of Operational Research 218 (1): 76–85. doi: 10.1016/j.ejor.2011.10.020
   Web of Science ®Google Scholar
• Caserta, Marco, Silvia Schwarze, and Stefan Voß. 2011. “Container Rehandling at Maritime Container Terminals.” In Handbook of Terminal Planning, Operations Research/Computer Science Interfaces Series, edited by J. W. Böse. New York: Springer.
   Google Scholar
• Caserta, Marco, Stefan Voß. 2009. “A Corridor Method-Based Algorithm for the pre-Marshalling Problem.” In Applications of Evolutionary Computing. In Lecture Notes in Computer Science, edited by M. Giacobini, A. Brabazon, S. Cagnoni, G. Di Caro, A. Ekart, and A. Espacia-Alcázar et al. Berlin: Springer.
   Google Scholar
• Caserta, Marco, Stefan Voß, and Moshe Sniedovich. 2011. “Applying the Corridor Method to a Blocks Relocation Problem.” Operations Research Spectrum 33 (4): 915–929. doi: 10.1007/s00291-009-0176-5
   Web of Science ®Google Scholar
• Dumas, Yvan, Jacques Desrosiers, Eric Gelinas, and M.-Marius Solomon. 1995. “An Optimal Algorithm for the Traveling Salesman Problem with Time Windows.” Operations Research 43 (2): 367–371. doi: 10.1287/opre.43.2.367
   Web of Science ®Google Scholar
• Expósito-Izquierdo, Christopher, Belén Melián-Batista, and Marcos Moreno-Vega. 2012. “Pre-marshalling Problem: Heuristic Solution Method and Instances Generator.” Expert Systems with Applications 39 (9): 8337–8349. doi: 10.1016/j.eswa.2012.01.187
   Web of Science ®Google Scholar
• Forster, Florian, and Andreas Bortfeld. 2012. “A Tree Search Procedure for the Container Relocation Problem.” Computer & Operations Research 39: 299–309. doi: 10.1016/j.cor.2011.04.004
   Web of Science ®Google Scholar
• Gheith, Mohamed, Amr Eltawil, B. and Harraz, and A. Nermine. 2016. “Solving the Container pre-Marshalling Problem Using Variable Length Genetic Algorithms.” Engineering Optimization 48 (4): 687–705. doi: 10.1080/0305215X.2015.1031661
   Web of Science ®Google Scholar
• Hottung, André, Shunji Tanaka, and Kevin Tierney. 2017. “Deep Learning Assisted Heuristic Tree Search for the Container Pre-marshalling Problem.” arXiv:1709.09972v1.
   Google Scholar
• Hottung, André, and Kevin Tierney. 2016. “A Biased Random-key Genetic Algorithm for the Container pre-Marshalling Problem.” Computer & Operations Research 75: 83–102. doi: 10.1016/j.cor.2016.05.011
   Web of Science ®Google Scholar
• Huang, Shan-Huen, and Tsan-Hwan Lin. 2012. “Heuristic Algorithms for Container pre-Marshalling Problems.” Computer & Industry Engineering 62 (1): 13–20. doi: 10.1016/j.cie.2011.08.010
   Web of Science ®Google Scholar
• Jovanovic, Raka, Milan Tuba, and Stefan Voß. 2017. “A Multi-Heuristic Approach for Solving the pre-Marshalling Problem.” Central European Journal of Operations Research 25: 1–28. doi: 10.1007/s10100-015-0410-y
   Web of Science ®Google Scholar
• Kellegöz, Talip, and Bilal Toklu. 2012. “An Efficient Branch and Bound Algorithm for Assembly Line Balancing Problems with Parallel Multi-Manned Workstations.” Computers & Operations Research 39 (12): 3344–3360. doi: 10.1016/j.cor.2012.04.019
   Web of Science ®Google Scholar
• Lee, Yusin, and Shih-Liang Chao. 2009. “A Neighborhood Search Heuristic for pre-Marshalling Export Containers.” European Journal of Operational Research 196: 468–475. doi: 10.1016/j.ejor.2008.03.011
   Web of Science ®Google Scholar
• Lee, Yusin, and Nai-Yun Hsu. 2007. “An Optimization Model for the Container pre-Marshalling Problem.” Computers and Operations Research 34: 3295–3313. doi: 10.1016/j.cor.2005.12.006
   Web of Science ®Google Scholar
• Mingozzi, Aristide, Lucio Bianco, and Salvatore Ricciardelli. 1997. “Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints.” Operations Research 45 (3): 365–377. doi: 10.1287/opre.45.3.365
   Web of Science ®Google Scholar
• Prandtstetter, Matthias. 2013. “A Dynamic Programming Based Branch-and-Bound Algorithm for the Container pre-Marshalling Problem.” (PhD diss). AIT Austrian Institute of Technology Technical.
   Google Scholar
• Ranjbar, Mohammad, Morteza Davari, and Roel Leus. 2012. “Two Branch-and-Bound Algorithms for the Robust Parallel Machine Scheduling Problem.” Computers & Operations Research 39 (7): 1652–1660. doi: 10.1016/j.cor.2011.09.019
   Web of Science ®Google Scholar
• Rendl, Andrea, and Matthias Prandtstetter. 2013. “Constraint Models for the Container pre-Marshaling Problem.” In Proceedings of the Twelfth International Workshop on constraint Modelling and Reformulation (Mod-ref 2013), edited by G. Katsirelos and C.-G. Quimper, 44–56.
   Google Scholar
• Rong, Aiying, and José-Rui Figueira. 2013. “A Reduction Dynamic Programming Algorithm for the bi-Objective Integer Knapsack Problem.” European Journal of Operational Research 231 (2): 299–313. doi: 10.1016/j.ejor.2013.05.045
   Web of Science ®Google Scholar
• Scholl, Joachim, David Boywitz, and Nils Boysen. 2017. “On the Quality of Simple Measures Predicting Block Relocations in Container Yards.” International Journal of Production Research 56: 1–12.
   Web of Science ®Google Scholar
• Singh, Kumar-Ashutosh, Srinivas, and Manoj-Kumar Tiwari. 2004. “Modelling the Slab Stack Shuffling Problem in Developing Steel Rolling Schedules and its Solution Using Improved Parallel Genetic Algorithms.” International Journal of Production Economics 91 (2): 135–147. doi: 10.1016/j.ijpe.2003.07.005
   Web of Science ®Google Scholar
• Tanaka, Shunji, and Fumitaka Mizuno. 2015. “Dominance Properties for the Unrestricted Block Relocation Problem and Their Application to a Branch-and-Bound Algorithm.” In Proceedings of the IEEE International Conference on Automation Science and Engineering (CASE), August 24–28.
   Google Scholar
• Tanaka, Shunji, and Fumitaka Mizuno. 2016. “An Exact Algorithm for the Unrestricted Block Relocation Problem.” Computers & Operations Research. Forthcoming.
   Google Scholar
• Tanaka, Shunji, and Kenta Takii. 2016. “A Faster Branch-and-Bound Algorithm for the Block Relocation Problem.” IEEE Transactions on Automation Science and Engineering 13 (1): 181–190. doi: 10.1109/TASE.2015.2434417
   Web of Science ®Google Scholar
• Tanaka, Shunji, and Kevin Tierney. 2018. “Solving Real-World Sized Container pre-Marshalling Problems with an Iterative Deepening Branch-and-Bound Algorithm.” European Journal of Operational Research 264: 165–180. doi: 10.1016/j.ejor.2017.05.046
   Web of Science ®Google Scholar
• Tang, Lixin, Jiyin Liu, Aiying Rong, and Zihou Yang. 2002. “Modelling and a Genetic Algorithm Solution for the Slab Stack Shuffling Problem When Implementing Steel Rolling Schedules.” International Journal of Production Research 40 (7): 1583–1595. doi: 10.1080/00207540110110118424
   Web of Science ®Google Scholar
• Tang, Lixin, and Huizhi Ren. 2010. “Modelling and a Segmented Dynamic Programming-Based Heuristic Approach for the Slab Stack Shuffling Problem.” Computers & Operations Research 37 (2): 368–375. doi: 10.1016/j.cor.2009.05.011
   Web of Science ®Google Scholar
• Tang, Lixin, Ren Zhao, and Jiyin Liu. 2012. “Models and Algorithms for Shuffling Problems in Steel Plants.” Naval Research Logistics (NRL) 59 (7): 502–524. doi: 10.1002/nav.21503
   Web of Science ®Google Scholar
• Tierney, Kevin, Dario Pacino, and Stefan Voß. 2017. “Solving the pre-Marshalling Problem to Optimality with A* and IDA*.” Flexible Services and Manufacturing Journal 29 (2): 223–259. doi: 10.1007/s10696-016-9246-6
   Web of Science ®Google Scholar
• Tierney, Kevin, and Stefan Voß. 2016. “Solving the Robust Container pre-Marshalling Problem.” In Proceedings of the 2016 international conference on computational logistics (pp. 131–145). Springer.
   Google Scholar
• Wang, Ning, Bo Jin, and Andrew Lim. 2015. “Target-guided Algorithms for the Container pre-Marshalling Problem.” Omega 53: 67–77. doi: 10.1016/j.omega.2014.12.002
   Web of Science ®Google Scholar
• Wang, Ning, Bo Jin, Zizhen Zhang, and Andrew Lim. 2017. “A Feasibility-Based Heuristic for the Container pre-Marshalling Problem.” European Journal of Operational Research 256 (1): 90–101. doi: 10.1016/j.ejor.2016.05.061
   Web of Science ®Google Scholar
• Zehendner, Elisabeth, Marco Caserta, Dominique Feillet, Silvia Schwarze, and Stefan Voß. 2015. “An Improved Mathematical Formulation for the Blocks Relocation Problem.” European Journal of Operational Research 245 (2): 415–422. doi: 10.1016/j.ejor.2015.03.032
   Web of Science ®Google Scholar
• Zehendner, Elisabeth, and Dominique Feillet. 2014. “A Branch and Price Approach for the Container Relocation Problem.” International Journal of Production Research 52 (24): 7159–7176. doi: 10.1080/00207543.2014.965358
   Web of Science ®Google Scholar
• Zhang, Huidong, Songshan Guo, Wenbin Zhu, Andrew Lim, and Brenda Cheang. 2010. “An Investigation of IDA* Algorithms for the Container Relocation Problem.” In Trends in Applied Intelligent Systems, Lecture notes in computer science, Vol. 6096, edited by N. Garca-Pedrajas, F. Herrera, C. Fyfe, J. Bentez, and M. Ali, 31–40. Berlin Heidelberg: Springer.
   Google Scholar
• Zhang, Ruiyou, Zhong-Zhong Jiang, and Wong-Young Yun. 2015. “Stack pre-Marshalling Problem: A Heuristic-Guided Branch-and-Bound Algorithm.” International Journal of Industrial Engineering: Theory, Applications and Practice 22 (5): 509–523.
   Web of Science ®Google Scholar
• Zhang, Zizhen, Hu Qin, Wenbin Zhu, and Andrew Lim. 2012. “The Single Vehicle Routing Problem with Toll-by-Weight Scheme: A Branch-and-Bound Approach.” European Journal of Operational Research 220 (2): 295–304. doi: 10.1016/j.ejor.2012.01.035
   Web of Science ®Google Scholar
• Zhu, Xiaojin. 2005. Semi-Supervised Learning Literature Survey. Tech. Rep. 1530. Madison, WI: Computer Sciences, University of Wisconsin-Madison.
   Google Scholar
• Zhu, Wenbin, Hu Qin, Andrew Lim, and Huidong Zhang. 2012. “Iterative Deepening A* Algorithms for the Container Relocation Problem.” IEEE Transactions on Automation Science and Engineering 9 (4): 710–722. doi: 10.1109/TASE.2012.2198642
   Web of Science ®Google Scholar