Genetic algorithm for multi-objective flowshop scheduling problem
| Autor: | Zhi-Yu Lin, 林志諭 |
|---|---|
| Rok vydání: | 2009 |
| Druh dokumentu: | 學位論文 ; thesis |
| Popis: | 97 This paper explores the Pareto optimal solutions for solving multi-objective combinatorial optimization problems. It is necessary to consider the convergence and diversity. This paper proposes a heuristic, LH algorithm, based on Genetic algorithm (GA) for flowshop scheduling problem with multiple objectives of minimizing makespan, total tardiness and total flow time. The algorithm can provide efficient Pareto optimal solutions for decision makers’ reference. Firstly, it refers NEH and modified NEH algorithms to produce several good initial solutions. For searching the whole solution space, the paper applies the gradual-priority weighting approach to determine the objective function and fitness value. Meanwhile, the algorithm avoids the generation converge too early, so presents an intensification mechanism of some new solutions generation. This paper constructs three solution sets to record three objectives individually. The experimental results show that the proposed algorithm can find more effective solutions than an existed GA-based algorithm. The related error percentages of individual objective and combined objectives are superior. |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|