This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 13th International Conference on Computer Supported Cooperative Work in Design
Similarity based ant-colony algorithm for permutation flowshop scheduling problems with total flowtime minimization
Santiago, Chile
April 22-April 24
ISBN: 978-1-4244-3534-0
ASCII Text
x 
 
Yi Zhang, Xiaoping Li, Qian Wang, Jie Zhu, "Similarity based ant-colony algorithm for permutation flowshop scheduling problems with total flowtime minimization," International Conference on Computer Supported Cooperative Work in Design, pp. 582-589, 2009 13th International Conference on Computer Supported Cooperative Work in Design, 2009.
 
 
BibTex
x
 
@article{ 10.1109/CSCWD.2009.4968122,
author = {Yi Zhang and Xiaoping Li and Qian Wang and Jie Zhu},
title = {Similarity based ant-colony algorithm for permutation flowshop scheduling problems with total flowtime minimization},
journal ={International Conference on Computer Supported Cooperative Work in Design},
volume = {0},
year = {2009},
isbn = {978-1-4244-3534-0},
pages = {582-589},
doi = {http://doi.ieeecomputersociety.org/10.1109/CSCWD.2009.4968122},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - International Conference on Computer Supported Cooperative Work in Design
TI - Similarity based ant-colony algorithm for permutation flowshop scheduling problems with total flowtime minimization
SN - 978-1-4244-3534-0
SP582
EP589
A1 - Yi Zhang,
A1 - Xiaoping Li,
A1 - Qian Wang,
A1 - Jie Zhu,
PY - 2009
VL - 0
JA - International Conference on Computer Supported Cooperative Work in Design
ER -
 
Yi Zhang, 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
Qian Wang, 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
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.
Citation:
Yi Zhang, Xiaoping Li, Qian Wang, Jie Zhu, "Similarity based ant-colony algorithm for permutation flowshop scheduling problems with total flowtime minimization," cscwd, pp.582-589, 2009 13th International Conference on Computer Supported Cooperative Work in Design, 2009
Usage of this product signifies your acceptance of the Terms of Use.