Automated design of relocation rules for minimising energy consumption in the container relocation problem (2307.01513v1)
Abstract: The container relocation problem is a combinatorial optimisation problem aimed at finding a sequence of container relocations to retrieve all containers in a predetermined order by minimising a given objective. Relocation rules (RRs), which consist of a priority function and relocation scheme, are heuristics commonly used for solving the mentioned problem due to their flexibility and efficiency. Recently, in many real-world problems it is becoming increasingly important to consider energy consumption. However, for this variant no RRs exist and would need to be designed manually. One possibility to circumvent this issue is by applying hyperheuristics to automatically design new RRs. In this study we use genetic programming to obtain priority functions used in RRs whose goal is to minimise energy consumption. We compare the proposed approach with a genetic algorithm from the literature used to design the priority function. The results obtained demonstrate that the RRs designed by genetic programming achieve the best performance.
- Automated Design of Production Scheduling Heuristics: A Review. IEEE Transactions on Evolutionary Computation 20, 1 (2016), 110–124. https://doi.org/10.1109/TEVC.2015.2429314
- A mathematical formulation and complexity considerations for the blocks relocation problem. European Journal of Operational Research 219, 1 (2012), 96–104. https://doi.org/10.1016/j.ejor.2011.12.039
- Applying the corridor method to a blocks relocation problem. OR Spectrum 33, 4 (2011), 915–929. https://doi.org/10.1007/s00291-009-0176-5
- Camila Díaz Cifuentes and María Cristina Riff. 2020. G-CREM: A GRASP approach to solve the container relocation problem for multibays. Applied Soft Computing Journal xxxx (2020), 106721. https://doi.org/10.1016/j.asoc.2020.106721
- Tomislav Erdelić and Tonči Carić. 2019. A Survey on the Electric Vehicle Routing Problem: Variants and Solution Approaches. Journal of Advanced Transportation 2019 (May 2019), 1–48. https://doi.org/10.1155/2019/5075671
- Mazen Hussein and Matthew E.H. Petering. 2012. Genetic algorithm-based simulation optimization of stacking algorithms for yard cranes to reduce fuel consumption at seaport container transshipment terminals. 2012 IEEE Congress on Evolutionary Computation, CEC 2012 1 (2012), 10–15. https://doi.org/10.1109/CEC.2012.6256471
- A GRASP approach for solving the Blocks Relocation Problem with Stowage Plan. Flexible Services and Manufacturing Journal 31, 3 (2019), 702–729. https://doi.org/10.1007/s10696-018-9320-3
- Kap Hwan Kim and Gyu Pyo Hong. 2006. A heuristic rule for relocating blocks. Computers and Operations Research 33, 4 (2006), 940–954. https://doi.org/10.1016/j.cor.2004.08.005
- Minimizing the operating cost of block retrieval operations in stacking facilities. Computers & Industrial Engineering 136 (2019), 436–452. https://doi.org/10.1016/j.cie.2019.07.045
- Genetic programming for production scheduling: a survey with a unified framework. Complex & Intelligent Systems 3, 1 (Feb. 2017), 41–66. https://doi.org/10.1007/s40747-017-0036-x
- A field guide to genetic programming.
- Kun-Chih Wu and Ching-Jung Ting. 2010. A beam search algorithm for minimizing reshuffle operations at container yards. , 703–710 pages.
- Iterative deepening A* algorithms for the container relocation problem. IEEE Transactions on Automation Science and Engineering 9, 4 (2012), 710–722. https://doi.org/10.1109/TASE.2012.2198642
- Marko Đurasević and Domagoj Jakobović. 2022. Heuristic and metaheuristic methods for the parallel unrelated machines scheduling problem: a survey. Artificial Intelligence Review (Aug. 2022). https://doi.org/10.1007/s10462-022-10247-9
- Marko Đurasević and Mateja Đumić. 2022. Automated design of heuristics for the container relocation problem using genetic programming. Applied Soft Computing 130 (2022), 109696. https://doi.org/10.1016/j.asoc.2022.109696
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.