메뉴 건너뛰기




Volumn 31, Issue 4, 2005, Pages 167-178

Ant algorithms: Theory and applications

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; MULTI AGENT SYSTEMS; ONLINE SYSTEMS; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING; TELECOMMUNICATION NETWORKS;

EID: 23944497083     PISSN: 03617688     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11086-005-0029-1     Document Type: Article
Times cited : (89)

References (46)
  • 2
  • 4
    • 1942534112 scopus 로고    scopus 로고
    • Ant colony algorithm and simulated annealing for the problem of p-median
    • Levanova, T.V. and Loresh, M.A., Ant Colony Algorithm and Simulated Annealing for the Problem of p-Median, Avtom. Telemekh., 2004, no. 3, pp. 80-88.
    • (2004) Avtom. Telemekh. , Issue.3 , pp. 80-88
    • Levanova, T.V.1    Loresh, M.A.2
  • 7
    • 33645448195 scopus 로고    scopus 로고
    • Swarm intelligence, ant algorithms and ant colony optimization
    • Budapest: Central European University
    • Dorigo, M., Swarm Intelligence, Ant Algorithms and Ant Colony Optimization, Reader for CEU Summer University Course "Complex System," Budapest: Central European University, 2001, pp. 1-38.
    • (2001) Reader for CEU Summer University Course "Complex System," , pp. 1-38
    • Dorigo, M.1
  • 10
    • 33645439017 scopus 로고    scopus 로고
    • TSPLIB
    • TSPLIB, http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/.
  • 12
    • 0001822278 scopus 로고    scopus 로고
    • A new rank-based version of the ant system: A computational study
    • Bullnheimer, B., Hartl, R.F., and Strauss, C., A New Rank-Based Version of the Ant System: A Computational Study, Cent. Eur. J. Oper. Res. Econ., 1999, vol. 7, no. 1, pp. 25-38.
    • (1999) Cent. Eur. J. Oper. Res. Econ. , vol.7 , Issue.1 , pp. 25-38
    • Bullnheimer, B.1    Hartl, R.F.2    Strauss, C.3
  • 13
    • 0031122887 scopus 로고    scopus 로고
    • Ant colony system: A cooperative learning approach to the traveling salesman problem
    • Dorigo, M., and Gambardella, L.M., Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem, IEEE Trans. Evolutionary Computation, 1997, vol. 1, no. 1, pp. 53-66.
    • (1997) IEEE Trans. Evolutionary Computation , vol.1 , Issue.1 , pp. 53-66
    • Dorigo, M.1    Gambardella, L.M.2
  • 16
    • 84974686421 scopus 로고    scopus 로고
    • Analysis of the best-worst ant systems and its variants on the QAP
    • (Proc. Ill Int. Workshop on Ant Algorithms ANTS 2002), Berlin: Springer
    • Cordon, O., Fernandez de Viana, I., and Herrera, F., Analysis of the Best-Worst Ant Systems and Its Variants on the QAP, Lecture Notes in Computer Science (Proc. Ill Int. Workshop on Ant Algorithms ANTS 2002), Berlin: Springer, 2002, no. 2463, pp. 228-234.
    • (2002) Lecture Notes in Computer Science , Issue.2463 , pp. 228-234
    • Cordon, O.1    Fernandez De Viana, I.2    Herrera, F.3
  • 17
    • 21844527073 scopus 로고
    • The traveling salesman: Computational solutions for TSP applications
    • Berlin: Springer
    • Reinelt, G., The Traveling Salesman: Computational Solutions for TSP Applications, Lecture Notes in Computer Science, Berlin: Springer, 1994, vol. 840.
    • (1994) Lecture Notes in Computer Science , vol.840
    • Reinelt, G.1
  • 19
    • 33645432470 scopus 로고    scopus 로고
    • A hybrid ant colony optimization and genetic algorithm approach for vehicle routing problems solving
    • Budapest
    • Reimann, M., Shtovba, S., and Nepomuceno, E., A Hybrid Ant Colony Optimization and Genetic Algorithm Approach for Vehicle Routing Problems Solving, Student Papers of Complex Systems Summer School-2001, Budapest, 2001, pp. 134-141.
    • (2001) Student Papers of Complex Systems Summer School-2001 , pp. 134-141
    • Reimann, M.1    Shtovba, S.2    Nepomuceno, E.3
  • 20
    • 84974697709 scopus 로고    scopus 로고
    • Using genetic algorithm to optimize ACS-TSP
    • (Proc. III Int. Workshop on Ant Algorithms ANTS 2002), Berlin: Springer
    • Pilat, M. and White, T., Using Genetic Algorithm to Optimize ACS-TSP, Lecture Notes in Computer Science (Proc. III Int. Workshop on Ant Algorithms ANTS 2002), Berlin: Springer, 2002, no. 2463, pp. 282-287.
    • (2002) Lecture Notes in Computer Science , Issue.2463 , pp. 282-287
    • Pilat, M.1    White, T.2
  • 21
    • 84974729343 scopus 로고    scopus 로고
    • GAACO: A GA + AGO hybrid for faster and better search capability
    • (Proc. Ill Int. Workshop on Ant Algorithms ANTS 2002), Berlin: Springer
    • Acan, A., GAACO: A GA + AGO Hybrid for Faster and Better Search Capability, Lecture Notes in Computer Science (Proc. Ill Int. Workshop on Ant Algorithms ANTS 2002), Berlin: Springer, 2002, no. 2463, pp. 300-301.
    • (2002) Lecture Notes in Computer Science , Issue.2463 , pp. 300-301
    • Acan, A.1
  • 24
    • 35248846073 scopus 로고    scopus 로고
    • A converging ACO algorithm for stochastic combinatorial optimization
    • (Proc. of SAFA-2003 (Stochastic Algorithms: Foundations and Applications)), Berlin: Springer
    • Gutiahr, W.J., A Converging ACO Algorithm for Stochastic Combinatorial Optimization, Lecture Notes in Computer Science (Proc. of SAFA-2003 (Stochastic Algorithms: Foundations and Applications)), Berlin: Springer, 2003, no. 2827, pp. 10-25.
    • (2003) Lecture Notes in Computer Science , Issue.2827 , pp. 10-25
    • Gutiahr, W.J.1
  • 30
    • 0037411859 scopus 로고    scopus 로고
    • Optimization of the keyboard arrangement problem using an ant colony algorithm
    • Eggers, J., Feillet, D., Kehl, S., Wagner, M.O., and Yannou, B., Optimization of the Keyboard Arrangement Problem Using an Ant Colony Algorithm, Eur. J. Operational Res., 2003, no. 148, pp. 672-686.
    • (2003) Eur. J. Operational Res. , Issue.148 , pp. 672-686
    • Eggers, J.1    Feillet, D.2    Kehl, S.3    Wagner, M.O.4    Yannou, B.5
  • 31
    • 33645430930 scopus 로고    scopus 로고
    • Application of ant colony optimization to data distribution in memory in computer systems
    • Notre Dame, USA
    • Rodrigues, A., Application of Ant Colony Optimization to Data Distribution in Memory in Computer Systems, Proc. VII Annual Swarm Researchers Meeting "Swarm-Fest-2003," Notre Dame, USA, 2003, http://www.nd.edu/arodrig6/.
    • (2003) Proc. VII Annual Swarm Researchers Meeting "Swarm-Fest-2003,"
    • Rodrigues, A.1
  • 32
    • 0034740043 scopus 로고    scopus 로고
    • Dynamic optimization of chemical processes using ant colony framework
    • Rajesh, J., Gupta, K., Kusumakar, H.S., Jayaraman, V.K., and Kulkarni, B.D., Dynamic Optimization of Chemical Processes Using Ant Colony Framework, Comput. Chem., 2001, vol. 25, no. 6, pp. 583-595.
    • (2001) Comput. Chem. , vol.25 , Issue.6 , pp. 583-595
    • Rajesh, J.1    Gupta, K.2    Kusumakar, H.S.3    Jayaraman, V.K.4    Kulkarni, B.D.5
  • 33
    • 84974697699 scopus 로고    scopus 로고
    • A MAX-MIN ant system for the university course timetabling problem
    • (Proc. III Int. Workshop on Ant Algorithms ANTS 2002), Berlin: Springer
    • Socha, K., Knowles, J., and Samples, M., A MAX-MIN Ant System for the University Course Timetabling Problem, Lecture Notes in Computer Science (Proc. III Int. Workshop on Ant Algorithms ANTS 2002), Berlin: Springer, 2002, no. 2463, pp. 1-13.
    • (2002) Lecture Notes in Computer Science , Issue.2463 , pp. 1-13
    • Socha, K.1    Knowles, J.2    Samples, M.3
  • 36
    • 23944479623 scopus 로고    scopus 로고
    • Ants can play music
    • (Proc. of IV Int. Workshop on Ant Colony Optimization and Swarm Intelligence ANTS-2004), Berlin: Springer
    • Gueret, C., Monmarche, N., and Slimane, M., Ants Can Play Music, Lecture Notes in Computer Science (Proc. of IV Int. Workshop on Ant Colony Optimization and Swarm Intelligence ANTS-2004), Berlin: Springer, 2004, no. 3172, pp. 310-317.
    • (2004) Lecture Notes in Computer Science , Issue.3172 , pp. 310-317
    • Gueret, C.1    Monmarche, N.2    Slimane, M.3
  • 38
    • 33645423346 scopus 로고    scopus 로고
    • Learning bayesian networks by ant colony optimization: Searching in two different spaces
    • De Campos, L.M., Gamez, J.A., and Puerta, J.M., Learning Bayesian Networks by Ant Colony Optimization: Searching in Two Different Spaces, Mathware & Soft Computing, 2002, no. 9.
    • (2002) Mathware & Soft Computing , Issue.9
    • De Campos, L.M.1    Gamez, J.A.2    Puerta, J.M.3
  • 41
    • 17644387146 scopus 로고    scopus 로고
    • Learning cooperative linguistic fuzzy rules using the best-worst ant system algorithm
    • Cassillas, J., Cordon, O., Fernandez de Viana, I., and Herrera, F., Learning Cooperative Linguistic Fuzzy Rules Using the Best-Worst Ant System Algorithm, Int. J. Intelligent Sys., 2005, vol. 20, pp. 433-452.
    • (2005) Int. J. Intelligent Sys. , vol.20 , pp. 433-452
    • Cassillas, J.1    Cordon, O.2    Fernandez De Viana, I.3    Herrera, F.4
  • 43
    • 0003889181 scopus 로고    scopus 로고
    • Anet: A mobile agents approach to adaptive routing
    • Brussels: Univ. Libre de Brusseles
    • Caro, G.D. and Dorigo, M., Anet: A Mobile Agents Approach to Adaptive Routing, Tech. Rep. IRIDA 97-12, Brussels: Univ. Libre de Brusseles, 1997.
    • (1997) Tech. Rep. IRIDA 97-12 , vol.IRIDA 97 , Issue.12
    • Caro, G.D.1    Dorigo, M.2
  • 44
    • 33846295159 scopus 로고    scopus 로고
    • The ant colony optimization metaheuristic: Algorithms, applications, and advances
    • Glover, F. and Kochenberger, G., Eds., Norwell: Kluwer
    • Dorigo, M. and Stutzle, T., The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances, in Handbook of Metaheuristics, Glover, F. and Kochenberger, G., Eds., Norwell: Kluwer, 2002.
    • (2002) Handbook of Metaheuristics
    • Dorigo, M.1    Stutzle, T.2
  • 45
    • 17644410562 scopus 로고    scopus 로고
    • A review on the ant colony optimization metaheuristic: Basis, models and new trends
    • Cordon, O., Herrera, F., and Stutzle, T., A Review on the Ant Colony Optimization Metaheuristic: Basis, Models and New Trends, Mathware & Soft Computing, 2002, no. 9.
    • (2002) Mathware & Soft Computing , Issue.9
    • Cordon, O.1    Herrera, F.2    Stutzle, T.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.