An adaptive firefly algorithm for blocking flow shop scheduling problem
by Wenjun Wang
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 13, No. 2, 2017

Abstract: In this paper, we present an Adaptive Firefly Algorithm (AFA) for solving the Blocking Flow Shop Scheduling Problem (BFSSP). It is known that the basic firefly algorithm (FA) works on continuous search space, while the BFSSP is a discrete problem. To handle discrete variables, the Smallest Position Value (SPV) rule is employed. An adaptive parameter strategy is utilised to reduce the dependence on parameters. Furthermore, two local search operators are used to improve the quality of solutions. To save computational time, a random attraction model is used to decrease the number of attractions among fireflies. Experiments are conducted on a set of Taillard's benchmark instances. Simulation results show that the proposed AFA achieves better solutions than the basic FA and four other algorithms.

Online publication date: Tue, 21-Nov-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com