The full text of this article

 

A hybrid ant colony optimisation algorithm for job shop problems and its convergence analysis
by Yang Cao; Haibo Shi
International Journal of Modelling, Identification and Control (IJMIC), Vol. 23, No. 3, 2015

 

Abstract: This paper presents a hybrid ant colony optimisation (HACO) algorithm for solving job shop problems. The criterion considered is the maximum completion time, the so-called makespan. The HACO algorithm improves the performance of intelligence optimisation algorithm, which adopts ant colony optimisation (ACO) algorithm to search in the global solution space, and tabu search (TS) algorithm is utilised as the local algorithm in each generation. The global asymptotic convergence of the hybrid algorithm is proved by Markov chain theory in the paper. By testing 13 hard benchmarks instance, the results demonstrate that the HACO algorithm is effective.

Online publication date: Tue, 16-Jun-2015

 

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 Modelling, Identification and Control (IJMIC):
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