Abstract
We state our algorithm using the nonlinear programming (NLP) problem, objective function G is a given non-linear function. Constraint conditions that represented by a set of inequalities form a convex domain of R n. We can obtain the minimal n-d hypercube that can be defined as the following inequalities: l i≤x i≤U i (I = 1, 2, …, n). Let the total number of ants be m and the m initial solution vectors are chosen at random. All the ith components of these initial solution vectors construct a group of candidate values of the ith component of solution vector. If we use n vertices to represent the n components and the edges between vertex i and vertex i+1 to represent the candidate values of component i, a path from the start vertex to the last vertex represents a solution vector whose n edges represent n components. We denote the jth edge between vertices i and i+1 as (i ,j) and its intensity of trail information at time t as τij(t).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Dorigo M., Maniezzo V., Colorni A. Ant system: Optimization by a Colony of Coorperating Agents, IEEE Transactions on Systems, Man, and Cybernetics, 26(1): 28–41, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ling, C., Jie, S., Ling, Q., Hongjian, C. (2002). A Method for Solving Optimization Problems in Continuous Space Using Ant Colony Algorithm. In: Dorigo, M., Di Caro, G., Sampels, M. (eds) Ant Algorithms. ANTS 2002. Lecture Notes in Computer Science, vol 2463. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45724-0_29
Download citation
DOI: https://doi.org/10.1007/3-540-45724-0_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44146-5
Online ISBN: 978-3-540-45724-4
eBook Packages: Springer Book Archive