Solution to Multi-objective Optimization of Flow Shop Problem Based on ACO Algorithm

Author

Li, Jianfu ; Zhang, Wei

Author_Institution

Opto-Electron. Eng. Coll., Chongqing Univ.

Volume

1

fYear

2006

fDate

Nov. 2006

Firstpage

417

Lastpage

420

Abstract

The flow shop problem with multiple objectives is always difficult to find optimal solutions, especially in large-scale problem. However, the ant colony optimization algorithms (ACO) is an effective method for solving hard combinatorial optimization problems. Therefore, we want to use the ACO algorithm to search optimal schedules of two machines flow shop problem under multi-objective constraint. Then our ACO algorithm is proposed to optimize the solutions under multi-objective constraint and the improved performance of solutions from our ACO algorithm will display in our experimental results

Keywords

combinatorial mathematics; flow shop scheduling; optimisation; ant colony optimization; combinatorial optimization; flow shop problem; multiobjective constraint; multiobjective optimization; Ant colony optimization; Computer science education; Constraint optimization; Displays; Educational institutions; Educational technology; Job shop scheduling; Large-scale systems; Optimal scheduling; Scheduling algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Computational Intelligence and Security, 2006 International Conference on

Conference_Location

Guangzhou

Print_ISBN

1-4244-0605-6

Electronic_ISBN

1-4244-0605-6

Type

conf

DOI

10.1109/ICCIAS.2006.294166

Filename

4072119