jinboszu/ucrp-java

Stars
5
Rank 2,861,937 (Top 57 %)
Language
Java
License
GNU General Publi...
Created 7 months ago
Updated 4 months ago

jinboszu/ucrp-java

jinboszu

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Iterative deepening branch-and-bound algorithm for the unrestricted container relocation problem with duplicate priorities

mmopp

Jin, B. (2021). Multi-objective A* algorithm for the multimodal multi-objective path planning optimization. In 2021 IEEE Congress on Evolutionary Computation (CEC), pp. 1704–1711

crp-ip

Integer programming models for the container relocation problem

rcrp-idbb

Iterative deepening branch-and-bound algorithm for the restricted container relocation problem with distinct priorities

ucrp-idbb

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

crp-glah

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

lb-lis

Jin, B. (2020). A note on “An exact algorithm for the blocks relocation problem with new lower bounds”. Computers & Operations Research, 124, 105082

cpmp-rule

Jin, B. & Yu, M. (2021). Note on the dominance rules in the exact algorithm for the container pre-marshalling problem by Tanaka & Tierney (2018). European Journal of Operational Research, 293(2), 802–807

crp-irc

Jin, B. (2020). On the integer programming formulation for the relaxed restricted container relocation problem. European Journal of Operational Research, 281(2), 475–482

jinboszu

remarshaling

Jin, B., Yu, Z., Yu, M. (2022). Inbound container remarshaling problem in an automated container terminal. Transportation Research Part E: Logistics and Transportation Review, 168, 102938

ocrp

Dynamic programming and simulation for the online container relocation problem

rcrp

Iterative deepening branch-and-bound algorithm for the restricted container relocation problem with distinct priorities