A method for solving optimization problem in continuous space using improved ant colony algorithm

Authors:
Ling Chen;Jie Shen;Ling Qin;Jin Fan
Affiliations:
Department of Computer Science, Yangzhou University, Yangzhou;Department of Computer Science, Yangzhou University, Yangzhou;Department of Computer Science, Yangzhou University, Yangzhou;Department of Computer Science, Yangzhou University, Yangzhou
Venue:
CASDMKM'04 Proceedings of the 2004 Chinese academy of sciences conference on Data Mining and Knowledge Management
Year:
2004

Citing 9
Cited 1

An Ants heuristic for the frequency assignment problem

Future Generation Computer Systems
A parallel implementation of ant colony optimization

Journal of Parallel and Distributed Computing - Problems in parallel and distributed computing: Solutions based on evolutionary paradigms
A Study of Some Properties of Ant-Q

PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
The Ant Colony Metaphor for Searching Continuous Design Spaces

Selected Papers from AISB Workshop on Evolutionary Computing
Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem

INFORMS Journal on Computing
HAS-SOP: Hybrid Ant System for the Sequential Ordering Problem

HAS-SOP: Hybrid Ant System for the Sequential Ordering Problem
Multi-agent coordination and control using stigmergy

Computers in Industry
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

ACO-based hybrid classification system with feature subset selection and model parameters optimization

Neurocomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A method for solving optimization problem with continuous parameters using improved ant colony algorithm is presented. In the method, groups of candidate values of the components are constructed, and each value in the group has its trail information. In each iteration of the ant colony algorithm, the method first chooses initial values of the components using the trail information. Then, crossover and mutation can determine the values of the components in the solution. Our experimental results of the problem of nonlinear programming show that our method has much higher convergence speed and stability than that of GA, and the drawback of ant colony algorithm of not being suitable for solving continuous optimization problems is overcome.