4.7 Article

An improved non-dominated sorting biogeography-based optimization algorithm for the (hybrid) multi-objective flexible job-shop scheduling problem

Journal

APPLIED SOFT COMPUTING
Volume 99, Issue -, Pages -

Publisher

ELSEVIER
DOI: 10.1016/j.asoc.2020.106869

Keywords

Flexible job-shop scheduling problem; Biogeography-based optimization; Multi-objective optimization

Funding

  1. National Key R&D Program of China [2020YFB1711703]
  2. Fundamental Research Funds for the Central Universities [2019CDCGJX214]
  3. Key Projects of National Natural Science Foundation of China [52035002]
  4. National Natural Science Foundation of China [51035008]
  5. Graduate Scientific Research and Innovation Foundation of Chongqing, China [CYB19008]

Ask authors/readers for more resources

With the proposal of an improved non-dominated sorting biogeography-based optimization (INSBBO) algorithm, this paper aims to solve the (hybrid) multi objective flexible job-shop scheduling problem. By introducing the V-dominance principle, HVNS structure and ESS strategy, the algorithm's performance has been enhanced and shows better performance compared to other intelligent algorithms.
With the continuous advancement of intelligent manufacturing and industry 4.0, production scheduling has become a significant problem that most enterprises must deal with. Thereinto, (hybrid) multi objective flexible job-shop scheduling problem, widely existing in the real-life manufacturing systems, is one of the NP-hard problems in various scheduling problems. Consequently, in this paper, an improved non-dominated sorting biogeography-based optimization (INSBBO) algorithm has been proposed to solve the problem. First of all, to overcome the pressure scarcity of individual selection in the Pareto dominance principle, especially in the late iteration of the algorithm, a novel V-dominance principle based on the volume enclosed by the normalized objective function values has been developed to enhance the convergence speed. Then, a hybrid variable neighborhood search (HVNS) structure is designed as a local search algorithm to amend the local search ability. Thereafter, for avoiding the loss of the partial (sub-)optimal solutions in the iteration, an elite storage strategy (ESS) is constructed to store the (sub-)optimal solutions. Additionally, we modify the internal habitat suitability index (HSI), migration and mutation operators of the NSBBO algorithm to further improve its performance. To evaluate the effectiveness of the above improved operations and the robustness of parameter setting, we compare the performances of each modified operation and critical parameter combination through multiple independent running the typical scheduling instance from the literature. The statistical results exhibit that each amended operation has a significant influence on the performance of INSBBO and its key parameter configuration is robust. Meanwhile, INSBBO has a better or similar performance among other state-of-the-art intelligent algorithms by comparing three classical benchmark scheduling datasets. (C) 2020 Published by Elsevier B.V.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available