By Topic

Hybridizing fast taboo search with ant colony optimization algorithm for solving large scale permutation flow shop scheduling problem

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

2 Author(s)

In order to solve the time over-consuming problem caused by max-min ant system (MMAS) for solving large scale permutation flow shop scheduling problem (PFSP), a hybrid ant colony algorithm is proposed by incorporating the MMAS with taboo search algorithm based on PFSP's block properties. The new algorithm can reduce neighborhood by eliminating quantity of inferior solutions and can enhance global optimization ability by applying taboo search algorithm. Results of experiments on larger scale PFSP instances show that TB-MMAS obviously reduces the calculation time and effectively eliminates the premature convergence compared with MMAS.

Published in:

Granular Computing, 2009, GRC '09. IEEE International Conference on

Date of Conference:

17-19 Aug. 2009