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.
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.