Multi-population genetic algorithm with ER network for solving flexible job shop scheduling problems.
A genetic algorithm (GA) cannot always avoid premature convergence, and multi-population is usually used to overcome this limitation by dividing the population into several sub-populations (sub-population number) with the same number of individuals (sub-population size). In previous research, the qu...
Main Authors: | Xiaoqiu Shi, Wei Long, Yanyan Li, Dingshan Deng |
---|---|
Format: | Article |
Language: | English |
Published: |
Public Library of Science (PLoS)
2020-01-01
|
Series: | PLoS ONE |
Online Access: | https://doi.org/10.1371/journal.pone.0233759 |
Similar Items
-
Unified Genetic Algorithm Approach for Solving Flexible Job-Shop Scheduling Problem
by: Jin-Sung Park, et al.
Published: (2021-07-01) -
An Improved Genetic Algorithm for Solving the Multi-AGV Flexible Job Shop Scheduling Problem
by: Leilei Meng, et al.
Published: (2023-04-01) -
Genetic algorithm for solving job-shop scheduling problem /
by: Nuryasmin Wahida Hamil, et al.
Published: (2010) -
A genetic algorithm approach for solving a flexible job shop scheduling problem
by: Vaghefinezhad, Sayedmohammadreza, et al.
Published: (2012) -
Improved Whale Algorithm for Solving the Flexible Job Shop Scheduling Problem
by: Fei Luan, et al.
Published: (2019-04-01)