An Ant Colony Algorithm Based on Orthogonal Experimental Method for Job-Shop Scheduling
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    In this paper, an orthogonal experimental method is used to set the parameters of Ant Colony Algorithm for solving Job-Shop Scheduling Problem. The performance of Ant Colony Algorithm for Job-Shop Scheduling mostly depends on the parameters settings, the different values of each parameter, the different convergence rates and the solution of Ant Colony Algorithm. The orthogonal experimental method is used to test the parameters on the performance of Ant Colony Algorithm. The best combination of parameters can be drawn by analyzing the experimental results. This best combination of parameters has been tested based on the cases from the JSP classic. The results demonstrate the parameters setting can speed up the convergence rate and the optimal solution or the approximate optimal solution can be achieved.

    Reference
    Related
    Cited by
Get Citation

张晓玲,杨健,杜英国.基于正交实验的蚁群算法在车间调度问题中的应用.计算机系统应用,2010,19(4):152-156

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:July 20,2009
  • Revised:August 22,2009
  • Adopted:
  • Online:
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063