Cart (Loading....) | Create Account
Close category search window

Similarity based ant-colony algorithm for permutation flowshop scheduling problems with total flowtime minimization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Yi Zhang ; Sch. of Comput. Sci. &Eng., Southeast Univ., Nanjing ; Xiaoping Li ; Qian Wang ; Jie Zhu

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 rho has hardly impact on the ACO evolutionary availability, and rho = 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.

Published in:

Computer Supported Cooperative Work in Design, 2009. CSCWD 2009. 13th International Conference on

Date of Conference:

22-24 April 2009

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.