Automated design of relocation rules for minimising energy consumption in the container relocation problem
Authors: 
Marko Đurasević, Mateja Đumić, Rebeka Čorić, Francisco Javier Gil-GalaAuthors Info & Claims
Marko Đurasević, Mateja Đumić, Rebeka Čorić, Francisco Javier Gil-GalaAuthors Info & ClaimsAbstract
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.
References
[1]
Jürgen Branke, Su Nguyen, Christoph W. Pickardt, and Mengjie Zhang. 2016. Automated Design of Production Scheduling Heuristics: A Review. IEEE Transactions on Evolutionary Computation 20, 1 (2016), 110--124.
[2]
Marco Caserta, Silvia Schwarze, and Stefan Voß. 2012. A mathematical formulation and complexity considerations for the blocks relocation problem. European Journal of Operational Research 219, 1 (2012), 96--104.
[3]
Marco Caserta, Stefan Voß, and Moshe Sniedovich. 2011. Applying the corridor method to a blocks relocation problem. OR Spectrum 33, 4 (2011), 915--929.
[4]
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.
[5]
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.
[6]
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.
[7]
Raka Jovanovic, Shunji Tanaka, Tatsushi Nishi, and Stefan Voß. 2019. A GRASP approach for solving the Blocks Relocation Problem with Stowage Plan. Flexible Services and Manufacturing Journal 31, 3 (2019), 702--729.
[8]
Kap Hwan Kim and Gyu Pyo Hong. 2006. A heuristic rule for relocating blocks. Computers and Operations Research 33, 4 (2006), 940--954.
[9]
Israel López-Plata, Christopher Expósito-Izquierdo, and J. Marcos Moreno-Vega. 2019. Minimizing the operating cost of block retrieval operations in stacking facilities. Computers & Industrial Engineering 136 (2019), 436--452.
[10]
Su Nguyen, Yi Mei, and Mengjie Zhang. 2017. Genetic programming for production scheduling: a survey with a unified framework. Complex & Intelligent Systems 3, 1 (Feb. 2017), 41--66.
[11]
Riccardo Poli, William B. Langdon, and Nicholas Freitag McPhee. 2008. A field guide to genetic programming.
[12]
Kun-Chih Wu and Ching-Jung Ting. 2010. A beam search algorithm for minimizing reshuffle operations at container yards., 703--710 pages.
[13]
Wenbin Zhu, 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 (2012), 710--722.
[14]
Marko Ðurasević and Domagoj Jakobović. 2022. Heuristic and metaheuristic methods for the parallel unrelated machines scheduling problem: a survey. Artificial Intelligence Review (Aug. 2022).
[15]
Marko Ðurasević and Mateja Ðumić. 2022. Automated design of heuristics for the container relocation problem using genetic programming. Applied Soft Computing 130 (2022), 109696.
Index Terms
- Automated design of relocation rules for minimising energy consumption in the container relocation problem
Recommendations
Automated design of relocation rules for minimising energy consumption in the container relocation problem
AbstractThe container relocation problem (CRP) is a combinatorial optimisation problem in which the sequence of container relocations must be determined to retrieve all containers from the yard while optimising a given objective. Prior to now, the ...
Highlights- Considering energy optimisation in container relocation problems.
- Automated design of relocation rules for energy optimisation.
- Automated design of rules for optimising energy and number of relocations.
- Genetic programming ...
Designing relocation rules with genetic programming for the container relocation problem with multiple bays and container groups
AbstractThe container relocation problem (CRP) is an NP-hard combinatorial optimisation problem that arises in yard management. The problem is concerned with loading all containers from the storage yard to the ship in a certain order. The yard layout ...
Highlights- Non standard problems are more difficult to solve with manual relocation rules.
- Genetic programming can automatically generate new relocation rules.
- Better results obtained as the number of duplicate containers increases.
- Crane ...
Automated design of heuristics for the container relocation problem using genetic programming
AbstractThe container relocation problem is a challenging combinatorial optimisation problem tasked with finding a sequence of container relocations required to retrieve all containers by a given order. Due to the complexity of this problem, ...
Highlights- Automated generation of heuristics for the container relocation problem.
- ...
Comments
Information & Contributors
Information
Published In
July 2023
2519 pages
Copyright © 2023 Owner/Author(s).
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the owner/author(s).
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 24 July 2023
Check for updates
Author Tags
Qualifiers
- Poster
Funding Sources
- Croatian Science Foundation
Conference
GECCO '23 Companion
Sponsor:
GECCO '23 Companion: Companion Conference on Genetic and Evolutionary Computation
July 15 - 19, 2023
Lisbon, Portugal
Acceptance Rates
Overall Acceptance Rate 1,669 of 4,410 submissions, 38%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 42Total Downloads
- Downloads (Last 12 months)18
- Downloads (Last 6 weeks)3
Reflects downloads up to 23 Dec 2024
Other Metrics
Citations
Cited By
View allView Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in