By Topic

An effective GSA based memetic algorithm for permutation flow shop scheduling

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)
Xiangtao Li ; Coll. of Comput. Sci., Northeast Normal Univ., Changchun, China ; Jianan Wang ; Junping Zhou ; Minghao Yin

The permutation flow shop problem (PFSSP) is a well-known difficult combinatorial optimization problem. In this paper, we present a new hybrid optimization algorithm named SIGSA to solve the PFSSP. This algorithm is composed by the LRV rule, SA-based local search and IIS-based local search. First, to make GSA suitable for PFSSP, a new LRV rule based on random key is introduced to convert the continuous position in GSA to the discrete job permutation. Second, to enhance the searching capability, the SA-based local search is designed to help the algorithm to escape from local minimum. Then, the IIS-based local search is used for enhancing the individuals in GSA with a certain probability. Additionally, Comparison with other results in the literature shows that the SIGSA is an efficient and effective approach for the PFSSP.

Published in:

Evolutionary Computation (CEC), 2010 IEEE Congress on

Date of Conference:

18-23 July 2010