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

An effective ant colony optimization-based algorithm for 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)
Ruey-Maw Chen ; Dept. of Comput. Sci. & Inf. Eng., Nat. Chinyi Univ. of Technol., Taichung ; Shih-Tang Lo ; Chung-Lun Wu ; Tsung-Hung Lin

This article presents a modified scheme named local search ant colony optimization algorithm on the basis of alternative ant colony optimization algorithm for solving flow shop scheduling problems. The flow shop problem (FSP) is confirmed to be an NP-hard sequencing scheduling problem, which has been studied by many researchers and applied to plenty of applications. Restated, the flow shop problem is hard to be solved in a reasonable time, therefore many meta-heuristics schemes proposed to obtain the optima or near optima solution efficiently. The ant colony optimization (ACO) is one of the well-applied meta-heuristics algorithms, nature inspired by the foraging behavior of real ants. Different implementations of state transition rules applied in ACO are studied in this work. Meanwhile, a local search mechanism was introduced to increase the probability of escaping from local optimal. Hence, this work integrates the local search mechanism into ant colony optimization algorithm for solving flow shop scheduling problem to improve the quality of solutions. Simulation results demonstrate that the applied ldquorandom orderrdquo state transition rule used in ACO with local search integrated is an effective scheme for the flow shop scheduling problems.

Published in:

Soft Computing in Industrial Applications, 2008. SMCia '08. IEEE Conference on

Date of Conference:

25-27 June 2008

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.