Multi-objective genetic algorithm and its applications to flowshop scheduling |
| |
Authors: | Tadahiko Murata Hisao Ishibuchi Hideo Tanaka |
| |
Affiliation: | Department of Industrial Engineering, Osaka Prefecture University, Gakuen-cho I-1, Sakai, Osaka 593, Japan |
| |
Abstract: | In this paper, we propose a multi-objective genetic algorithm and apply it to flowshop scheduling. The characteristic features of our algorithm are its selection procedure and elite preserve strategy. The selection procedure in our multi-objective genetic algorithm selects individuals for a crossover operation based on a weighted sum of multiple objective functions with variable weights. The elite preserve strategy in our algorithm uses multiple elite solutions instead of a single elite solution. That is, a certain number of individuals are selected from a tentative set of Pareto optimal solutions and inherited to the next generation as elite individuals. In order to show that our approach can handle multi-objective optimization problems with concave Pareto fronts, we apply the proposed genetic algorithm to a two-objective function optimization problem with a concave Pareto front. Last, the performance of our multi-objective genetic algorithm is examined by applying it to the flowshop scheduling problem with two objectives: to minimize the makespan and to minimize the total tardiness. We also apply our algorithm to the flowshop scheduling problem with three objectives: to minimize the makespan, to minimize the total tardiness, and to minimize the total flowtime. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|