DocumentCode
3019694
Title
A Weight-Based Multiobjective Genetic Algorithm for Flowshop Scheduling
Author
Fang, Zhimin
Author_Institution
Zhijiang Coll., Zhejiang Univ. of Technol., Hangzhou, China
Volume
1
fYear
2009
fDate
7-8 Nov. 2009
Firstpage
373
Lastpage
377
Abstract
The study presents a weight-based multiobjective genetic algorithm (WBMOGA). which is modification of a weight-based multiobjective immune genetic algorithm (WBMOIGA) with the following aspects. Firstly, we only use the truncation algorithm with similar individuals (TASI) to eliminate similar individuals in the population and memory and preserve the diversity of the population. Secondly, we modify the local search algorithm by adding the dominated relationship to determine whether the current solution is replaced by a neighborhood solution. Finally, we apply it to the flowshop scheduling problems. Numerical results show WBMOGA can solve the multiobjective optimization problems with multiple variables, and disconnected or nonconvex Pareto-optimal fronts, and demonstrates better performance than the elitist non-dominated sorting genetic algorithm (NSGA-II) and the random weight genetic algorithm (RWGA) when applied to flowshop scheduling.
Keywords
flow shop scheduling; genetic algorithms; flowshop scheduling problem; genetic algorithm; nondominated sorting genetic algorithm; random weight genetic algorithm; truncation algorithm; weight based multiobjective optimization; Artificial intelligence; Computational intelligence; Educational institutions; Genetic algorithms; Genetic mutations; Heuristic algorithms; Processor scheduling; Scheduling algorithm; Sorting; Testing; flowshop scheduling; genetic algorithm; multiobjective;
fLanguage
English
Publisher
ieee
Conference_Titel
Artificial Intelligence and Computational Intelligence, 2009. AICI '09. International Conference on
Conference_Location
Shanghai
Print_ISBN
978-1-4244-3835-8
Electronic_ISBN
978-0-7695-3816-7
Type
conf
DOI
10.1109/AICI.2009.130
Filename
5376231
Link To Document