A discrete Water Wave Optimization algorithm for no-wait flow shop scheduling problem

•A Discrete Water Wave Optimization (DWWO) Algorithm is proposed.•An Improved Iterated greedy algorithm is integrated into the framework of DWWO.•A modified initialization strategy is proposed to generate the initial population.•A ruling out inferior solution mechanism is added to improve the conver...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Expert systems with applications Ročník 91; s. 347 - 363
Hlavní autoři: Zhao, Fuqing, Liu, Huan, Zhang, Yi, Ma, Weimin, Zhang, Chuck
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Elsevier Ltd 01.01.2018
Elsevier BV
Témata:
Breaking
Combinatorial analysis
Convergence
Effectiveness
Global optimization
Greedy algorithms
Iterated greedy algorithm
Job shop scheduling
Makespan
Markov chains
No-wait flow shop scheduling problem
Operators
Optimization algorithms
Performance assessment
Refraction
Scheduling algorithms
Searching
Shallow water
Studies
Water Wave Optimization (WWO)
Wave propagation
Iterated greedy algorithm
Makespan
Water Wave Optimization (WWO)
No-wait flow shop scheduling problem
ISSN:0957-4174, 1873-6793
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:•A Discrete Water Wave Optimization (DWWO) Algorithm is proposed.•An Improved Iterated greedy algorithm is integrated into the framework of DWWO.•A modified initialization strategy is proposed to generate the initial population.•A ruling out inferior solution mechanism is added to improve the convergence speed.•The convergence of the DWWO algorithm has been proved theoretically. In this paper, a discrete Water Wave Optimization algorithm (DWWO) is proposed to solve the no-wait flowshop scheduling problem (NWFSP) with respect to the makespan criterion. Inspired by the shallow water wave theory, the original Water Wave Optimization (WWO) is constructed for global optimization problems with propagation, refraction and breaking operators. The operators to adapt to the combinatorial optimization problems are redefined. A dynamic iterated greedy algorithm with a changing removing size is employed as the propagation operator to enhance the exploration ability. In refraction operator, a crossover strategy is employed by DWWO to avoid the algorithm falling into local optima. To improve the exploitation ability of local search, an insertion-based local search scheme which is utilized as breaking operator, is applied to search for a better solution around the current optimal solution. A ruling out inferior solution operator is also introduced to improve the convergence speed. The global convergence performance of the DWWO is analyzed with the Markov model. In addition, the computational results based on well-known benchmarks and statistical performance comparisons are presented. Experimental results demonstrate the effectiveness and efficiency of the proposed DWWO algorithm for solving NWFSP.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0957-4174
1873-6793
DOI:10.1016/j.eswa.2017.09.028