Bee colony optimisation algorithm with big valley landscape exploitation for job shop scheduling problems
by Li-Pei Wong, Chi Yung Puan, Malcolm Yoke Hean Low, Yi Wen Wong, Chin Soon Chong
International Journal of Bio-Inspired Computation (IJBIC), Vol. 2, No. 2, 2010

Abstract: Job shop scheduling problem (JSSP) is an NP-hard problem that is closely related to scheduling activities in manufacturing industry. This paper presents an improved bee colony optimisation algorithm with Big Valley landscape exploitation (BCBV) as a biologically inspired algorithm to solve the JSSP problem. The BCBV algorithm mimics the bee foraging behaviour where information of newly discovered food source is communicated via waggle dances. In the algorithm, the dances are treated as clusters of solutions to the JSSP. These clusters of solutions are distributed as a Big Valley landscape structure. Via a dance accumulation strategy as well as an effective search in multiple clusters in the entire landscape, the proposed algorithm is able to generate relatively good solutions for the JSSP. Experimental results comparing our proposed algorithm with the shifting bottleneck heuristic (SBP), the tabu search algorithm (TS) and the parameter-free genetic algorithm (PfGA) on the Taillard JSSP benchmark show that it is comparable to these approaches.

Online publication date: Wed, 10-Mar-2010

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 Bio-Inspired Computation (IJBIC):
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