A parallel membrane inspired harmony search for optimization problems

A case study based on a flexible job shop scheduling problem

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

Harmony search is an emerging meta-heuristic optimization algorithm that is inspired by musical improvisation processes, and it can solve various optimization problems. Membrane computing is a distributed and parallel model for solving hard optimization problems. First, we employed some previously proposed approaches to improve standard harmony search by allowing its parameters to be adaptive during the processing steps. Information from the best solutions was used to improve the speed of convergence while preventing premature convergence to a local minimum. Second, we introduced a parallel framework based on membrane computing to improve the harmony search. Our approach utilized the parallel membrane computing model to execute parallelized harmony search efficiently on different cores, where the membrane computing communication characteristics were used to exchange information between the solutions on different cores, thereby increasing the diversity of harmony search and improving the performance of harmony search. Our simulation results showed that the application of the proposed approach to different variants of harmony search yielded better performance than previous approaches. Furthermore, we applied the parallel membrane inspired harmony search to the flexible job shop scheduling problem. Experiments using well-known benchmark instances showed the effectiveness of the algorithm.

Original languageEnglish
Pages (from-to)120-136
Number of pages17
JournalApplied Soft Computing Journal
Volume49
DOIs
Publication statusPublished - 1 Dec 2016

Fingerprint

Membranes
Ion exchange
Job shop scheduling
Communication
Processing
Experiments

Keywords

  • Evolutionary algorithms
  • Flexible job shop scheduling
  • Harmony search
  • Membrane computing
  • Parallel membrane inspired harmony search

ASJC Scopus subject areas

  • Software

Cite this

@article{ccd23bef9cb5445c8d49a8d770aabb27,
title = "A parallel membrane inspired harmony search for optimization problems: A case study based on a flexible job shop scheduling problem",
abstract = "Harmony search is an emerging meta-heuristic optimization algorithm that is inspired by musical improvisation processes, and it can solve various optimization problems. Membrane computing is a distributed and parallel model for solving hard optimization problems. First, we employed some previously proposed approaches to improve standard harmony search by allowing its parameters to be adaptive during the processing steps. Information from the best solutions was used to improve the speed of convergence while preventing premature convergence to a local minimum. Second, we introduced a parallel framework based on membrane computing to improve the harmony search. Our approach utilized the parallel membrane computing model to execute parallelized harmony search efficiently on different cores, where the membrane computing communication characteristics were used to exchange information between the solutions on different cores, thereby increasing the diversity of harmony search and improving the performance of harmony search. Our simulation results showed that the application of the proposed approach to different variants of harmony search yielded better performance than previous approaches. Furthermore, we applied the parallel membrane inspired harmony search to the flexible job shop scheduling problem. Experiments using well-known benchmark instances showed the effectiveness of the algorithm.",
keywords = "Evolutionary algorithms, Flexible job shop scheduling, Harmony search, Membrane computing, Parallel membrane inspired harmony search",
author = "Ali Maroosi and Muniyandi, {Ravie Chandren} and {A Sundararajan}, Elankovan and {Mohd. Zin}, Abdullah",
year = "2016",
month = "12",
day = "1",
doi = "10.1016/j.asoc.2016.08.007",
language = "English",
volume = "49",
pages = "120--136",
journal = "Applied Soft Computing",
issn = "1568-4946",
publisher = "Elsevier BV",

}

TY - JOUR

T1 - A parallel membrane inspired harmony search for optimization problems

T2 - A case study based on a flexible job shop scheduling problem

AU - Maroosi, Ali

AU - Muniyandi, Ravie Chandren

AU - A Sundararajan, Elankovan

AU - Mohd. Zin, Abdullah

PY - 2016/12/1

Y1 - 2016/12/1

N2 - Harmony search is an emerging meta-heuristic optimization algorithm that is inspired by musical improvisation processes, and it can solve various optimization problems. Membrane computing is a distributed and parallel model for solving hard optimization problems. First, we employed some previously proposed approaches to improve standard harmony search by allowing its parameters to be adaptive during the processing steps. Information from the best solutions was used to improve the speed of convergence while preventing premature convergence to a local minimum. Second, we introduced a parallel framework based on membrane computing to improve the harmony search. Our approach utilized the parallel membrane computing model to execute parallelized harmony search efficiently on different cores, where the membrane computing communication characteristics were used to exchange information between the solutions on different cores, thereby increasing the diversity of harmony search and improving the performance of harmony search. Our simulation results showed that the application of the proposed approach to different variants of harmony search yielded better performance than previous approaches. Furthermore, we applied the parallel membrane inspired harmony search to the flexible job shop scheduling problem. Experiments using well-known benchmark instances showed the effectiveness of the algorithm.

AB - Harmony search is an emerging meta-heuristic optimization algorithm that is inspired by musical improvisation processes, and it can solve various optimization problems. Membrane computing is a distributed and parallel model for solving hard optimization problems. First, we employed some previously proposed approaches to improve standard harmony search by allowing its parameters to be adaptive during the processing steps. Information from the best solutions was used to improve the speed of convergence while preventing premature convergence to a local minimum. Second, we introduced a parallel framework based on membrane computing to improve the harmony search. Our approach utilized the parallel membrane computing model to execute parallelized harmony search efficiently on different cores, where the membrane computing communication characteristics were used to exchange information between the solutions on different cores, thereby increasing the diversity of harmony search and improving the performance of harmony search. Our simulation results showed that the application of the proposed approach to different variants of harmony search yielded better performance than previous approaches. Furthermore, we applied the parallel membrane inspired harmony search to the flexible job shop scheduling problem. Experiments using well-known benchmark instances showed the effectiveness of the algorithm.

KW - Evolutionary algorithms

KW - Flexible job shop scheduling

KW - Harmony search

KW - Membrane computing

KW - Parallel membrane inspired harmony search

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

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

U2 - 10.1016/j.asoc.2016.08.007

DO - 10.1016/j.asoc.2016.08.007

M3 - Article

VL - 49

SP - 120

EP - 136

JO - Applied Soft Computing

JF - Applied Soft Computing

SN - 1568-4946

ER -