ABSTRACT
Heuristics design, including definitions of heuristic information and parameter settings that control the impact of heuristic information, has significant influence on the performance of ant colony optimization (ACO) algorithms. However, in complex real-world problems, it is difficult or even impossible to find one heuristics design that suits all problem instances. Besides, static heuristics design biases ACO to search certain areas of the solution space constantly, which makes ACO less explorative and increases the risk of prematurity. This paper proposes a heuristics design adaptation scheme (HDAS) for addressing the above problems in ACO. With HDAS, each ant defines a profile of heuristics design to guide its solution construction procedure. Such profiles are adaptively adjusted towards the most suitable heuristic design according to the search experience of ants. The ACO with HDAS (HDA-ACO) is validated on a set of benchmarks of flexible job-shop scheduling problems (FJSP). Experimental results show that the HDA-ACO outperforms the original ACO.
- Zhang, J., Chung, H. S.-H., Lo, A. W. -L., and Huang, T. 2009. Extended ant colony optimization algorithm for power electronic circuit design. IEEE Trans. Power Electronics, 24, 1 (Jan. 2009), 147--162.Google Scholar
- Zhan, Z. -H., Zhang, J., and Li, Y. 2010. An Efficient Ant Colony System Based on Receding Horizon Control for the Aircraft Arrival Sequencing and Scheduling Problem, IEEE Trans. Intelligent Transportation Systems, 11, 2 (Jun. 2010), 399--412. Google ScholarDigital Library
- Chen, W. -N. and Zhang, J. Ant Colony Optimization for Software Project Scheduling and Staffing with an Event-Based Scheduler. IEEE Trans. Software Engineering, 3, 11, (Jan. 2013), 1--17. Google ScholarDigital Library
- Hu, X. -M., Zhang, J., Chung, H., and Xiao, J. 2009. An Intelligent Testing System Embedded with an Ant Colony Optimization Based Test Composition Method. IEEE Trans. Systems, Man, and Cybernetics, Part C, 39, 6 (Dec. 2009), 659--669. Google ScholarDigital Library
- Garey, M. R., Johnson, D. S., and Seithi, R. 1976. The complexity of flowshop and jobshop scheduling. Mathematics of Operational Research, 1, 2(Mar. 1976), 117--129.Google Scholar
- Brandimarte, P. 1993. Routing and Scheduling in a Flexible Job Shop by Taboo Search.Annals of Operations Research, 41, 1, (1993), 157--183. Google ScholarDigital Library
Index Terms
- Ant colony optimization with adaptive heuristics design
Recommendations
On the Invariance of Ant Colony Optimization
Ant colony optimization (ACO) is a promising metaheuristic and a great amount of research has been devoted to its empirical and theoretical analysis. Recently, with the introduction of the hypercube framework, Blum and Dorigo have explicitly raised the ...
A modified ant colony optimization algorithm for dynamic topology optimization
A modified ant colony optimization (MACO) algorithm implementing a new definition of pheromone and a new cooperation mechanism between ants is presented in this paper. The sensitivity of structural response to the presence of each element included in ...
Adaptive Dynamic Probabilistic Elitist Ant Colony Optimization in Traveling Salesman Problem
AbstractThe ant colony optimization (ACO) is a population-based metaheuristic algorithm for the optimization problem, inspired by the foraging behavior of ants in the ant colony. One of its variants, the elitist ACO, further reinforces itself with the ...
Comments