A modified sailfish optimizer to solve dynamic berth allocation problem in conventional container terminal

Hammouti, I.; Lajjam, A.; Merouani, M.; Tabaa, Y.

Growing Science » International Journal of Industrial Engineering Computations » A modified sailfish optimizer to solve dynamic berth allocation problem in conventional container terminal

Journals

IJIEC Volumes

Volume 1 (17)
- Issue 1 (9)
- Issue 2 (8)

Volume 2 (68)
- Issue 1 (12)
- Issue 2 (20)
- Issue 3 (20)
- Issue 4 (16)

Volume 3 (76)
- Issue 1 (9)
- Issue 2 (15)
- Issue 3 (20)
- Issue 4 (12)
- Issue 5 (20)

Volume 4 (50)
- Issue 1 (14)
- Issue 2 (10)
- Issue 3 (12)
- Issue 4 (14)

Volume 5 (47)
- Issue 1 (13)
- Issue 2 (12)
- Issue 3 (12)
- Issue 4 (10)

Volume 6 (39)
- Issue 1 (7)
- Issue 2 (12)
- Issue 3 (10)
- Issue 4 (10)

Volume 7 (47)
- Issue 1 (10)
- Issue 2 (14)
- Issue 3 (10)
- Issue 4 (13)

Volume 8 (30)
- Issue 1 (9)
- Issue 2 (7)
- Issue 3 (8)
- Issue 4 (6)

Volume 9 (32)
- Issue 1 (9)
- Issue 2 (6)
- Issue 3 (7)
- Issue 4 (10)

Volume 10 (34)
- Issue 1 (8)
- Issue 2 (10)
- Issue 3 (8)
- Issue 4 (8)

Volume 11 (36)
- Issue 1 (9)
- Issue 2 (8)
- Issue 3 (9)
- Issue 4 (10)

Volume 12 (29)
- Issue 1 (9)
- Issue 2 (6)
- Issue 3 (8)
- Issue 4 (6)

Volume 13 (41)
- Issue 1 (10)
- Issue 2 (8)
- Issue 3 (10)
- Issue 4 (13)

Volume 14 (50)
- Issue 1 (11)
- Issue 2 (15)
- Issue 3 (9)
- Issue 4 (15)

Volume 15 (55)
- Issue 1 (19)
- Issue 2 (15)
- Issue 3 (12)
- Issue 4 (9)

Volume 16 (75)
- Issue 1 (12)
- Issue 2 (15)
- Issue 3 (19)
- Issue 4 (29)

Volume 17 (51)
- Issue 1 (21)
- Issue 2 (30)

Countries

International Journal of Industrial Engineering Computations

ISSN 1923-2934 (Online) - ISSN 1923-2926 (Print) Quarterly Publication Volume 10 Issue 4 pp. 491-504 , 2019

A modified sailfish optimizer to solve dynamic berth allocation problem in conventional container terminal Pages 491-504 Download PDF

Authors: Issam El Hammouti, Azza Lajjam, Mohamed El Merouani, Yassine Tabaa

DOI: 10.5267/j.ijiec.2019.4.002

Keywords: Modified sailfish optimizer algorithm, Meta-heuristic, Container Terminal, Berth Allocation Problem, Optimization

Abstract: During the past two decades, there has been an increase on maritime freight traffic particularly in container flow. Thus, the Berth Allocation Problem (BAP) can be considered among the primary optimization problems encountered in port terminals. In this paper, we address the Dynamic Berth Allocation Problem (DBAP) in a conventional layout terminal which differs from the popular discrete layout terminal in that each berth can serve multiple vessels simultaneously if their total length is equal or less than the berth length. Then, a Modified Sailfish Optimizer (MSFO) meta-heuristic based on hunting sailfish behavior is developed as an alternative for solving this problem. Finally, computational experiments and comparisons are presented to show the efficiency of our method against other methods presented in the literature in one hand. We also discuss the productivity of a container terminal based on different scenarios which can happen.

How to cite this paper

 Hammouti, I., Lajjam, A., Merouani, M & Tabaa, Y. (2019). A modified sailfish optimizer to solve dynamic berth allocation problem in conventional container terminal.International Journal of Industrial Engineering Computations , 10(4), 491-504.

Refrences

Avriel, M., Penn, M., Shpirer, N. and Witteboon, S. (1998). Stowage planning for container ships to reduce the number of shifts. Annals of Operations Research, 76, 55-71.
Arango, C., Cortés, P., Muñuzuri, J. and Onieva, L. (2011). Berth allocation planning in Seville inland port by simulation and optimisation. Advanced Engineering Informatics, 25(3), 452-461.
Budipriyanto, A., Wirjodirdjo, B., Pujawan, N., & Gurning, S. (2015). Berth allocation problem under uncertainty: A conceptual model using collaborative approach. Procedia Manufacturing, 4, 429-437.
Budipriyanto, A., Wirjodirdjo, B., Pujawan, I. N. and Gurning, S. (2017). A Simulation Study of Collaborative Approach to Berth Allocation Problem under Uncertainty. The Asian Journal of Shipping and Logistics, 33(3), 127-139.
Buhrkal, K., Zuglian, S., Ropke, S., Larsen, J. and Lusby, R. (2011). Models for the discrete berth allocation problem:A computational comparison. Transportation Research Part E Logistics and Transportation Review, 47(4), 461-473.
Cordeau, J.F., Laporte, G., Legato, P. and Moccia, L. (2005). Models and tabu search heuristics for the berth-allocation problem. Transportation Science, 39, 526-538.
de Oliveira, R. M., Mauri, G. R., & Lorena, L. A. N.(2012). Clustering search for the berth allocation problem. Expert Systems with Applications, 39(5), 5499-5505.
El hammouti, I., Lajjam, A. and El merouani, M. (2018). Solving the hybrid berth allocation problem using a bat-inspired algorithm. In Optimization and Applications (ICOA), 4th International Conference on (pp. 1-6). IEEE.
Imai, A., Nishimura, E., & Papadimitriou, S. (2001). The dynamic berth allocation problem for a container port. Transportation Research Part B: Methodological, 35(4), 401-417.
Imai, A., Nishimura, E., & Papadimitriou, S. (2003). Berth allocation with service priority. Transportation Research Part B: Methodological, 37(5), 437-457.
Imai, A., Nishimura, E., & Papadimitriou, S. (2013). Marine container terminal configurations for efficient handling of mega-containerships. Transportation Research Part E: Logistics and Transportation Review, 49(1), 141-158.
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220(4598), 671-680.
Lajjam, A., El Merouani, M., Tabaa, Y., & Medouri, A. (2014). A new approach for sequencing loading and unloading operations in the seaside area of a container terminal. International Journal of Supply and Operations Management, 1(3), 328.
Lai, K. K., & Shih, K. (1992). A study of container berth allocation. Journal of Advanced Transportation, 26(1), 45-60.
Lalla Ruiz, E., Izquierdo, C. E., Batista, B. M. and MorenoVega, J. M. (2015). Decentralized Cooperative Metaheuristic for the Dynamic Berth Allocation Problem. Inteligencia Artificial, 18(55), 1-11.
Lin, S. W., Ting, C. J., & Wu, K. C. (2018). Simulated annealing with different vessel assignment strategies for the continuous berth allocation problem. Flexible Services and Manufacturing Journal, 30(4), 740-763.
Liu, C., Xiang, X. and Zheng, L. (2017). Two decision models for berth allocation problem under uncertainty considering service level. Flexible Services and Manufacturing Journal, 29(3-4), 312-344.
López-Plata, I., Expósito-Izquierdo, C., Lalla-Ruiz, E., Melián-Batista, B., & Moreno-Vega, J. M. (2015, February). A Greedy Randomized Adaptive Search Procedure for Solving the Uncapacitated Plant Cycle Problem. In International Conference on Computer Aided Systems Theory (pp. 263-270). Springer, Cham.
Meisel, F. (2009). Seaside operations planning in container terminals. Berlin: Physica-Verlag
Nishi,T., Okura, T., Lalla-Ruiz, E. and Voß, S. (2016). A dynamic programming-based matheuristic for the dynamic berth allocation problem. Annals of Operations Research, pp 1-20.
Nishimura, E., Imai, A., & Papadimitriou, S. (2001). Berth allocation planning in the public berth system by genetic algorithms. European Journal of Operational Research, 131(2), 282-292.
Shadravan, S., Naji, H. R. and Bardsiri, V. K. (2019). The Sailfish Optimizer: A novel nature-inspired metaheuristic algorithm for solving constrained engineering optimization problems. Engineering Applications of Artificial Intelligence, 80, 20-34
Theofanis, S., Boile, M. and Golias, M. (2007). An optimization based genetic algorithm heuristic for the berth allocation problem. IEEE international conference one Evolutionary Computation. pp. 4439-4445.