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

Application of ACOTS hybrid algorithm for job shop scheduling problems

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)
Cao, Yang ; School of Information and Control Engineering, Shenyang Jianzhu University, CO 110168 CHN ; Xiaoyu Song ; Zhang, Ying ; Han, Zhonghua

In the paper, we propose a hybrid algorithm ACOTS for improving the performance of intelligence optimization algorithm for solving job shop scheduling problems. In ACOTS algorithm, the ACO algorithm was applied to search in the global solution space, and TS algorithm was utilized as the local algorithm. This paper had not only proved the global asymptotic convergence of the hybrid algorithm by Markov chain theory of stochastic processes, but also applied the ACOTS algorithm to 13 hard benchmark problems, which has demonstrated the effectiveness of the hybrid algorithm.

Published in:

Modelling, Identification & Control (ICMIC), 2012 Proceedings of International Conference on

Date of Conference:

24-26 June 2012

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.