Multi-Objectives Memetic Discrete Differential Evolution Algorithm for Solving the Container Pre-Marshalling Problem

Authors

  • Hossam M. J. Mustafa Faculty of Information Science and Technology, Universiti Kebangsaan Malaysia, Malaysia
  • Masri Ayob Faculty of Information Science and Technology, Universiti Kebangsaan Malaysia, Malaysia
  • Mohd Zakree Ahmad Nazri Faculty of Information Science and Technology, Universiti Kebangsaan Malaysia, Malaysia
  • Sawsan Abu-Taleb Prince Abdullah Ben Ghazi Faculty of Information Technology, Al-Balqa Applied University, Jordan

DOI:

https://doi.org/10.32890/jict2019.18.1.5

Keywords:

Memetic algorithms, differential evolution algorithm, multi-objectives optimization algorithm, container pre-marshalling problem

Abstract

The Container Pre-marshalling Problem (CPMP) has the significant effect of reducing ship berthing time, and can help in increasing terminal turnover rate. In order to solve the CPMP, this research proposes a Multi-objectives Memetic Discrete Differential Evolution algorithm (MODDE). To date, existing research in CPMP only focuses on single-objective approaches. However, this is not a suitable approach due to the considerable effort required to validate the hard constraints of CPMP. Therefore, this work aims at addressing the effect of minimizing the number of miss-overlaid containers on the total number of movements in building the final feasible bay layout by embedding it in the multi-objectives evaluation function. The proposed algorithm combines the Discrete Differential Evolution mutation with the Memetic Algorithm evolutionary steps in order to find high quality CPMP solutions, achieve high convergence rate and avoid premature convergence and local optima problems. In addition, it improves the exploration and exploitation capabilities of the algorithm. The standard pre-marshalling benchmark dataset (i.e., Bortfeldt-Forster) is used to evaluate the effectiveness of the proposed algorithm. The experimental results reveal that the proposed MODDE algorithm can find good solutions on instances of the standard pre-marshalling benchmarks. This demonstrates that using the multi-objectives approach with a combination of the Discrete Differential Evolution mutation and the Memetic Algorithm evolutionary is a suitable approach for solving multi-objectives CPMP.

 

References

Bortfeldt, A., & Forster, F. (2012). A tree search procedure for the container pre-marshalling problem. European Journal of Operational Research, 217(3), 531–540. doi.org/10.1016/j.ejor.2011.10.005

Caserta, M., Voß, S., & Sniedovich, M. (2009). Applying the corridor method to a blocks relocation problem. OR Spectrum, 33(4), 915–929. doi. org/10.1007/s00291-009-0176-5

Expósito-Izquierdo, C., Melián-Batista, B., & Moreno-Vega, M. (2012). Premarshalling problem: Heuristic solution method and instances generator. Expert Systems with Applications, 39(9), 8337–8349. doi.org/10.1016/j. eswa.2012.01.187

Gheith, Eltawil, A., Harraz, N., & Mizuno, S. (2014). An integer programming formulation and solution for the container pre-marshalling problem. In Proceedings of the 44th International Conference on Computers and Industrial Engineering & the 9th International Symposium on Intellgent

Manufacturing and Service Systems (pp. 2047–2056). Istanbul, Turkey. doi.org/10.13140/2.1.2310.1442 Journal of ICT, 18, No. 1 (January) 2019, pp: 77–

Gheith, M., Eltawil, A. B., & Harraz, N. A. (2016). Solving the container pre-marshalling problem using variable length genetic algorithms. Engineering Optimization, 48(4), 687–705. doi.org/10.1080/0305215X.2015.1031661

Goulart, N., De Souza, S. R., Dias, L. G. S., & Noronha, T. F. (2011). Biased random-key genetic algorithm for fiber installation in optical network optimization. In Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2011) (pp. 2267–2271). New Orleans, USA. doi. org/10.1109/CEC.2011.5949896

Grunow, M., Günther, H. O., & Lehmann, M. (2007). Strategies for dispatching AGVs at automated seaport container terminals. Container Terminals and Cargo Systems: Design, Operations Management, and Logistics Control Issues, 610, 155–178. doi.org/10.1007/978-3-540-49550-5_8

Hottung, A., & Tierney, K. (2016). A biased random-key genetic algorithm for the container pre-marshalling problem. Computers and Operations Research, 75, 83–102. doi.org/10.1016/j.cor.2016.05.011

Jovanovic, R., Tuba, M., & Voß, S. (2015). A multi-heuristic approach for solving the pre-marshalling problem. Central European Journal of Operations Research, 25(1), 1–28. doi.org/10.1007/s10100-0150410-y

Langdon, W., & Poli, R. (2002). Foundations of genetic programming. Springer (1st ed.). Springer-Verlag Berlin Heidelberg. doi.org/10.1162/ evco.1998.6.3.253

Lee, Y., & Chao, S. L. (2009). A neighborhood search heuristic for premarshalling export containers. European Journal of Operational Research, 196(2), 468–475. https://doi.org/10.1016/j.ejor.2008.03.011

Lee, Y., & Hsu, N. Y. (2007). An optimization model for the container premarshalling problem. Computers and Operations Research, 34(11), 3295–3313. doi.org/10.1016/j.cor.2005.12.006

Lehnfeld, J., & Knust, S. (2014). Loading, unloading and premarshalling of stacks in storage areas: Survey and classification. European Journal of Operational Research, 239(2), 297–312. doi.org/10.1016/j. ejor.2014.03.011

Miller, B. L., & Goldberg, D. E. (1995). Genetic algorithms tournament selection and the effects of noise. Complex Systems, 9, 193–212.

Neri, F., Cotta, C., & Moscato, P. (2012). Handbook of memetic algorithms. Studies in Computational Intelligence, 379 (370). doi.org/10.1007/978-3-642-23247-3

Sabar, N. R., Abawajy, J., & Yearwood, J. (2017). Heterogeneous cooperative co-evolution memetic differential evolution algorithm for big data optimization problems. IEEE Transactions on Evolutionary Computation, 21(2), 315–327. doi.org/10.1109/TEVC.2016.2602860

Sabar, N. R., Ayob, M., & Kendall, G. (2013). A hybrid of differential evolution and simulated annealing algorithms for the capacitated ARC routing problems. In Proceedings of the 6th Multidisciplinary Journal of ICT, 18, No. 1 (January) 2019, pp: 77– International Conference on Scheduling:Theory and Applications (pp. 549–554). Gent, Belgium.

Storn, R., & Price, K. (1997). Differential evolution – A simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization, 11(4), 341–359. doi.org/10.1023/ A:1008202821328

Talbi, E.-G. (2009). Metaheuristics : From design to implementation. John Wiley & Sons. http://dx.doi.org/10.1002/9780470496916

Wang, Liu, Y., Liang, X., Guo, H., Chen, Y., & Zhao, Y. (2016). Self-adaptive differential evolution algorithm with hybrid mutation operator for parameters identification of PMSM. Soft Computing, 22(4), 1263–1285. doi.org/10.1007/s00500-016-2413-6

Wang, N., Jin, B., & Lim, A. (2015). Target-guided algorithms for the container pre-marshalling problem. Omega (United Kingdom), 53, 67–77. doi. org/10.1016/j.omega.2014.12.002

Zhang, R., Jiang, Z., & Yun, W. Y. (2015). Stack pre-marshalling problem: A heuristic-guided branch-and-bound algorithm. International Journal of Industrial Engineering, 22(5), 509–523.

Downloads

Published

11-12-2018

Issue

Vol. 18 No. 1 (2019): Journal of Information and Communication Technology (JICT) Vol.18, No.1, January 2019

Section

Articles

How to Cite

Mustafa, H. M. J., Ayob, M., Ahmad Nazri, M. Z., & Abu-Taleb, S. (2018). Multi-Objectives Memetic Discrete Differential Evolution Algorithm for Solving the Container Pre-Marshalling Problem. Journal of Information and Communication Technology, 18(1), 77-96. https://doi.org/10.32890/jict2019.18.1.5

Research impact

Harvested 2026-09-27
3 citations, from OpenAlex — the highest of the sources checked

Counts differ between services because each indexes a different body of literature. None of them is the whole picture.

Identifiers DOI 10.32890/jict2019.18.1.5 OpenAlex W4253224450

Most read articles by the same author(s)