Skip to main content
Log in

A dynamic-edge ACS algorithm for continuous variables problems

  • Published:
Natural Computing Aims and scope Submit manuscript

Abstract

Ant colony systems (ACS) have been successfully applied to solving optimization problems. Especially, they are efficient and effective in finding nearly optimal solutions to discrete search spaces. When the solution spaces of the problems to be solved are continuous, it is not so appropriate to use the original ACS to solve it. This paper thus proposes a dynamic-edge ACS algorithm for solving continuous variables problems. It can dynamically generate edges between two nodes and give a pheromone measures for them in a continuous solution space through distribution functions. In addition, it maps the encoding representation and the operators of the original ACS into continuous spaces easily. The proposed algorithm thus provides a simple and standard approach for applying ACS to a problem that has a continuous solution space, and retains the original process and characteristics of the traditional ACS. Several constrained functions are also evaluated to demonstrate the performance of the proposed algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18

Similar content being viewed by others

Abbreviations

AS:

Ant system

ACS:

Ant colony system

ACOR :

Ant colony optimization for continuous domains

DEACS:

Dynamic-edge ant colony system

CACO:

Continuous ant colony optimization

API:

Pachycondyla apicalis

GA:

Genetic algorithm

CIAC:

Continuous interacting ant colony

References

  • Bilchev G, Parmee IC (1995) The ant colony metaphor for searching continuous design spaces. In: The AISB workshop on evolutionary computation, vol 993, pp 25–39

  • Chang MS, Lin HY (2013) An immunized ant colony system algorithm to solve unequal area facility layout problems using flexible bay structure. In: The Institute of Industrial Engineers Asian Conference, pp 9–17

  • Colorni A, Dorigo M, Maniezzo V (1991) Distributed optimization by ant colonies. In: European Conference on Artificial Life, Paris, France, pp 134–142

  • Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1(1):53–66

    Article  Google Scholar 

  • Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern Part B 26(1):29–41

    Article  Google Scholar 

  • Dreo J, Siarry P (2004) Continuous interacting ant colony algorithm based on dense hierarchy. Future Gener Comput Syst 20(5):841–856

    Article  Google Scholar 

  • Gambardella LM, Montemanni R, Weyland D (2012) An enhanced ant colony system for the sequential ordering problem. In: Operations research, pp 355–360

  • Hong TP, Tung YF, Wang SL, Wu MT, Wu YL (2009a) An ACS-based framework for fuzzy data mining. Expert Syst Appl 36(9):11844–11852

    Article  Google Scholar 

  • Hong TP, Tung YF, Wang SL, Wu YL (2009b) Multi-level ant-based algorithm for fuzzy data mining. In: North American Fuzzy Information Processing Society Annual Conference

  • Jiang WJ, Xu YH, Xu YS (2005) A novel data mining algorithm based on ant colony system. In: International conference on machine learning and cybernetics, Guangzhou, vol 3, pp 1919–1923

  • Kuhn L (2002) Ant colony optimization for continuous space. A thesis submitted to The Department of Information Technology and Electrical Engineering The University of Queensland

  • Li H, Xiong S (2008) On ant colony algorithm for solving continuous optimization problem. In: International conference on intelligent information hiding and multimedia signal processing, pp 1450–1453

  • Madureira A, Falcao D, Pereira I (2012) Ant colony system based approach on single machine scheduling problems: weighted tardiness scheduling problem. In: Nature and biologically inspired computing, pp 86–91

  • Monmarche N, Venturini G, Slimane M (2000) On how Pachycondyla apicalis ants suggest a new search algorithm. Future Gener Comput Syst 16(8):937–946

    Article  Google Scholar 

  • Pourtakdoust SH, Nobahari H (2004) An extension of ant colony system to continuous optimization problems. In: Lecture Notes in Computer Science, vol 3172/2004, pp 158–173

  • Socha K, Dorigo M (2008) Ant colony optimization for continuous domains. Eur J Oper Res 185(3):1155–1173

    Article  MathSciNet  MATH  Google Scholar 

  • Verma OP, Kumar P, Hanmandlu M, Chhabra S (2012) High dynamic range optimal fuzzy color image enhancement using artificial ant colony system. Appl Soft Comput 12:394–404

    Article  Google Scholar 

  • Yan S, Shih YL (2012) An ant colony system-based hybrid algorithm for an emergency roadway repair time-space network flow problem. Transportmetrica 8:356–361

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Min-Thai Wu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wu, MT., Hong, TP. & Lee, CN. A dynamic-edge ACS algorithm for continuous variables problems. Nat Comput 16, 339–352 (2017). https://doi.org/10.1007/s11047-015-9537-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11047-015-9537-y

Keywords

Navigation