2015
DOI: 10.1007/s10845-015-1099-4
|View full text |Cite
|
Sign up to set email alerts
|

An improved league championship algorithm with free search and its application on production scheduling

Abstract: An improved league championship algorithm with free search (LCAFS) is proposed to avoid the drawbacks of basic LCA, such as premature convergence, slow convergence speed. The parameters of the algorithm vary linearly along with iteration. A novel match schedule is designed to improve the competition capability for the sport teams. Furthermore, the free search operation is introduced to promote the diversity of the league. Inspired by the real league degradation, degradation mechanism is used to preserve the te… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(2 citation statements)
references
References 26 publications
(16 reference statements)
0
2
0
Order By: Relevance
“…It has been proved that manufacturing scheduling problems, essentially belonging to Job shop scheduling problems (JSP), are a class of NP-hard problems [ 59 ]. Many models and algorithms have been proposed to obtain a suboptimal solution, such as PICRO (preference-inspired chemical reaction optimization algorithm) [ 60 ], HPGA (hybrid PSO-GA algorithm) [ 61 ], PRGA-Sched (priority rule-based genetic algorithm scheduling) [ 62 ], LCAFS (league championship algorithm with free search) [ 63 ], MOGA-TIG (multi-objective genetic algorithm with tabu-enhanced iterated greedy local search strategy) [ 64 ], and so on. Though an approximate optimal production plan can be effectively solved by these methods, the availability and reliability of sensor nodes is seldom followed closely.…”
Section: Related Workmentioning
confidence: 99%
“…It has been proved that manufacturing scheduling problems, essentially belonging to Job shop scheduling problems (JSP), are a class of NP-hard problems [ 59 ]. Many models and algorithms have been proposed to obtain a suboptimal solution, such as PICRO (preference-inspired chemical reaction optimization algorithm) [ 60 ], HPGA (hybrid PSO-GA algorithm) [ 61 ], PRGA-Sched (priority rule-based genetic algorithm scheduling) [ 62 ], LCAFS (league championship algorithm with free search) [ 63 ], MOGA-TIG (multi-objective genetic algorithm with tabu-enhanced iterated greedy local search strategy) [ 64 ], and so on. Though an approximate optimal production plan can be effectively solved by these methods, the availability and reliability of sensor nodes is seldom followed closely.…”
Section: Related Workmentioning
confidence: 99%
“…This led us to select LCA to be used as an optimisation algorithm for the weights and biases on ELM. Numerous researchers have applied LCA in many fields [21][22][23][24].…”
Section: Introductionmentioning
confidence: 99%