International Conference on Computer Supported Cooperative Work in Design (2009)

Santiago, Chile

Apr. 22, 2009 to Apr. 24, 2009

ISBN: 978-1-4244-3534-0

pp: 582-589

Yi Zhang , School of Computer Science &Engineering, Southeast University, 210096, Nanjing, China, Key Laboratory of Computer Network and Information Integration (Southeast University), Minist

Jie Zhu , School of Computer Science &Engineering, Southeast University, 210096, Nanjing, China, Key Laboratory of Computer Network and Information Integration (Southeast University), Minist

Qian Wang , School of Computer Science &Engineering, Southeast University, 210096, Nanjing, China, Key Laboratory of Computer Network and Information Integration (Southeast University), Minist

Xiaoping Li , School of Computer Science &Engineering, Southeast University, 210096, Nanjing, China, Key Laboratory of Computer Network and Information Integration (Southeast University), Minist

ABSTRACT

In the paper, a similarity based ant-colony algorithm (SACO) is proposed for the permutation flowshop scheduling problems with total flowtime minimization, which is known as NP-hard. By applying the space mapping method which is testified to be reasonable, it is proved theoretically that the deposit factor ρ has hardly impact on the ACO evolutionary availability, and ρ = 0.5 is reasonable for the ACO. Similarity is defined to discover the promising sequence for solution improvement. A new solution construction method is proposed, which is stated to be better than that of another very effective ant-colony algorithm. Experimental results show that SACO outperforms the other compared seven algorithms, including three rather recent effective algorithms and four famous ant-colony algorithms. The similarity indeed helps the SACO to find the promising sequence for solution improvement, which makes the SACO be effective.

INDEX TERMS

CITATION

Yi Zhang,
Jie Zhu,
Qian Wang,
Xiaoping Li,
"Similarity based ant-colony algorithm for permutation flowshop scheduling problems with total flowtime minimization",

*International Conference on Computer Supported Cooperative Work in Design*, vol. 00, no. , pp. 582-589, 2009, doi:10.1109/CSCWD.2009.4968122