Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
A new pheromone design in ACS for solving JSP
- Authors
- Zhuo, Xiao-Lan; Zhang, Jun; Cheng, Wei-neng
- Issue Date
- Sep-2007
- Publisher
- IEEE
- Keywords
- ant colony system; job-shop scheduling problem
- Citation
- 2007 IEEE Congress on Evolutionary Computation, pp 1963 - 1969
- Pages
- 7
- Indexed
- SCIE
SCOPUS
- Journal Title
- 2007 IEEE Congress on Evolutionary Computation
- Start Page
- 1963
- End Page
- 1969
- Abstract
- Job Shop Scheduling Problem (JSP) is one of the most difficult NP-hard combinatorial optimization problems due to the "Combination Explosion" effect. This paper presents the implementation of Ant Colony System on JSP by proposing a novel combination of path-construction and pheromone-representation. Based oil the simple traditional path-construction, a kind of more effective pheromone is employed to improve the optimization performance. Numerical experiment is executed on several benchmark JSP cases, and yields favorable results compared with results obtained by traditional implementation of ACS for JSP.
- Files in This Item
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Related Researcher
- ZHANG, Jun
- ERICA 공학대학 (SCHOOL OF ELECTRICAL ENGINEERING)