Description:
This project is part of the paper [Jin, B. & Tanaka, S. (2023). An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules. European Journal of Operational Research, 304(2), 494–514].
This project is written in C99.
Versions:
main: Official versiontest: Simplified version for beginners
Remark on the name of the JZW heuristic:
The JZW heuristic, originally developed in Jin, Zhu, & Lim (2015), could technically have been named JZL based on the authors’ surnames’ initials. However, Tricoire, Scagnetti, & Beham (2018) and Feillet, Parragh, & Tricoire (2019) opted to use the name JZW, with ‘J’ from the first author Bo Jin’s surname, and ‘Z’ and ‘W’ from the second author Wenbin Zhu’s surname and given name. In this project, we adhere to this naming convention to avoid confusion among readers.
References:
- Jin, B., Zhu, W., & Lim, A. (2015). Solving the container relocation problem by an improved greedy look-ahead heuristic. European Journal of Operational Research, 240(3), 837–847.
- Tricoire, F., Scagnetti, J., & Beham, A. (2018). New insights on the block relocation problem. Computers & Operations Research, 89, 127–139.
- Feillet, D., Parragh, S. N., & Tricoire, F. (2019). A local-search based heuristic for the unrestricted block relocation problem. Computers & Operations Research, 108, 44–56.