Multi-objectives memetic discrete differential evolution algorithm for solving the container Pre-marshalling problem

Hossam M.J. Mustafa, Masri Ayob, Mohd Zakree Ahmad Nazri, Sawsan Abu-Taleb

Research output: Contribution to journalArticle

1 Citation (Scopus)

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.

Original languageEnglish
Pages (from-to)77-96
Number of pages20
JournalJournal of Information and Communication Technology
Volume18
Issue number1
Publication statusPublished - 1 Jan 2019

Fingerprint

Differential Evolution Algorithm
Container
Containers
Memetic Algorithm
Differential Evolution
Evolutionary algorithms
Mutation
Benchmark
Premature Convergence
Function evaluation
Evaluation Function
Ship
Exploitation
Convergence Rate
Layout
Ships
Objective function
Evaluate
Experimental Results
Demonstrate

Keywords

  • Container pre-marshalling problem
  • Differential evolution algorithm
  • Memetic algorithms
  • Multi-objectives optimization algorithm

ASJC Scopus subject areas

  • Computer Science(all)
  • Mathematics(all)

Cite this

Multi-objectives memetic discrete differential evolution algorithm for solving the container Pre-marshalling problem. / Mustafa, Hossam M.J.; Ayob, Masri; Ahmad Nazri, Mohd Zakree; Abu-Taleb, Sawsan.

In: Journal of Information and Communication Technology, Vol. 18, No. 1, 01.01.2019, p. 77-96.

Research output: Contribution to journalArticle

@article{d00eda6aefc7448388c18c406e5798fc,
title = "Multi-objectives memetic discrete differential evolution algorithm for solving the 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.",
keywords = "Container pre-marshalling problem, Differential evolution algorithm, Memetic algorithms, Multi-objectives optimization algorithm",
author = "Mustafa, {Hossam M.J.} and Masri Ayob and {Ahmad Nazri}, {Mohd Zakree} and Sawsan Abu-Taleb",
year = "2019",
month = "1",
day = "1",
language = "English",
volume = "18",
pages = "77--96",
journal = "Journal of Information and Communication Technology",
issn = "1675-414X",
publisher = "Universiti Utara Malaysia Press",
number = "1",

}

TY - JOUR

T1 - Multi-objectives memetic discrete differential evolution algorithm for solving the container Pre-marshalling problem

AU - Mustafa, Hossam M.J.

AU - Ayob, Masri

AU - Ahmad Nazri, Mohd Zakree

AU - Abu-Taleb, Sawsan

PY - 2019/1/1

Y1 - 2019/1/1

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

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

KW - Container pre-marshalling problem

KW - Differential evolution algorithm

KW - Memetic algorithms

KW - Multi-objectives optimization algorithm

UR - http://www.scopus.com/inward/record.url?scp=85058136493&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85058136493&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:85058136493

VL - 18

SP - 77

EP - 96

JO - Journal of Information and Communication Technology

JF - Journal of Information and Communication Technology

SN - 1675-414X

IS - 1

ER -