4.7 Article

A parallel hybrid PSO-GA algorithm for the flexible flow-shop scheduling with transportation

期刊

COMPUTERS & INDUSTRIAL ENGINEERING
卷 173, 期 -, 页码 -

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2022.108672

关键词

Flexible flow shop scheduling; Metaheuristics; Mixed-integer linear programming; Parallel computing; Hybrid parallel PSO-GA algorithm

资金

  1. Institutional Fund Projects [IFPDP-274-22]
  2. Ministry of Education and Deanship of Scientific Research (DSR), King Abdulaziz University, Jeddah, Saudi Arabia

向作者/读者索取更多资源

This paper proposes a Mixed-Integer Linear Programming (MILP) model to schedule jobs and transporters in a flexible flow shop system simultaneously. By employing parallel computing methods, the run time can be significantly reduced. The results show that the PPSOGA algorithm outperforms other algorithms in terms of solution quality, efficiency, and reliability.
In this paper, a Mixed-Integer Linear Programming (MILP) model to simultaneously schedule jobs and transporters in a flexible flow shop system is suggested. Wherein multiple jobs, finite transporters, and stages with parallel unrelated machines are considered. In addition to the mentioned technicalities, the jobs are able to omit one or more stages, and may not be executable by all the machines, and similarly, transportable by all the transporters. To the best of our knowledge, no study in the literature has featured efficacy of the parallel computing in simultaneous scheduling of jobs and transporters in the flexible flow shop system which remarkably shortens run time if the solution approaches are designed accordingly. To this end, we employ Gurobi solver, Parallel Genetic Algorithm (PGA), Parallel Particle Swarm Optimization (PPSO) and hybrid Parallel PSO-GA Algorithm (PPSOGA) to deal with the problem instances. Furthermore, a parallel version of Ant Colony Optimization (ACO) algorithm adapted from the state-of-the-art literature is developed to verify the performance of our suggested solution methods. Using 60 problem instances generated via uniform distribution, the suggested solution approaches are compared against one another. After assessing the results of the computational experiments, it is deduced that PPSOGA algorithm outperforms PGA, PPSO, Parallel Ant Colony Optimization (PACO) and Gurobi solver in terms of the quality of the solutions. The efficiency and run time of the suggested approaches are then assessed through two prominent statistical tests (i.e., Wald and Analysis of Variance (ANOVA)). Eventually, it comes to spotlight that PPSOGA algorithm is computationally rewarding and dependable.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据