메뉴 건너뛰기




Volumn 40, Issue 5, 2009, Pages 341-349

An interactive simulation and analysis software for solving TSP using Ant Colony Optimization algorithms

Author keywords

Ant Colony Optimization; Combinatorial optimization, visualization; Local search heuristics; Simulation software; Traveling salesman problem

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; COMPUTER SOFTWARE; CONSTRAINED OPTIMIZATION; HEURISTIC ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING; VISUALIZATION;

EID: 60249086880     PISSN: 09659978     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.advengsoft.2008.05.004     Document Type: Article
Times cited : (67)

References (48)
  • 1
    • 33644774507 scopus 로고    scopus 로고
    • A genetic algorithm for finding a salesman's route
    • Kureichik V.V., and Kureichik V.M. A genetic algorithm for finding a salesman's route. J Comput Syst Sci Int 45 1 (2006) 89-95
    • (2006) J Comput Syst Sci Int , vol.45 , Issue.1 , pp. 89-95
    • Kureichik, V.V.1    Kureichik, V.M.2
  • 4
    • 0001067326 scopus 로고
    • A parallel tabu search algorithm for large traveling salesman problems
    • Fiechter L. A parallel tabu search algorithm for large traveling salesman problems. Dis Appl Math Combinat Operat Res Comput Sci 51 (1994) 243-267
    • (1994) Dis Appl Math Combinat Operat Res Comput Sci , vol.51 , pp. 243-267
    • Fiechter, L.1
  • 5
    • 0004061426 scopus 로고
    • Positive feedback as a search strategy
    • Technical report, Dipartimento di Elettronica, Politecnico di Milano;
    • Dorigo M, Maniezzo V, Colorni A. Positive feedback as a search strategy. Technical report, Dipartimento di Elettronica, Politecnico di Milano; 1991.
    • (1991)
    • Dorigo, M.1    Maniezzo, V.2    Colorni, A.3
  • 7
    • 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 Evol Comput 1 (1997) 53-66
    • (1997) IEEE Trans Evol Comput , vol.1 , pp. 53-66
    • Dorigo, M.1    Gambardella, L.M.2
  • 8
    • 0036670452 scopus 로고    scopus 로고
    • A short convergence proof for a class of ant colony optimization algorithms
    • Stützle T., and Dorigo M. A short convergence proof for a class of ant colony optimization algorithms. IEEE Trans Evol Comput 6 4 (2002) 358-365
    • (2002) IEEE Trans Evol Comput , vol.6 , Issue.4 , pp. 358-365
    • Stützle, T.1    Dorigo, M.2
  • 9
    • 0345258465 scopus 로고    scopus 로고
    • An efficient self-organizing map designed by genetic algorithms for the traveling salesman problem
    • Jin H.D., Leung K.S., Wong M.L., and Xu Z.B. An efficient self-organizing map designed by genetic algorithms for the traveling salesman problem. IEEE Trans Syst Man Cyber Part-B 33 6 (2003) 877-887
    • (2003) IEEE Trans Syst Man Cyber Part-B , vol.33 , Issue.6 , pp. 877-887
    • Jin, H.D.1    Leung, K.S.2    Wong, M.L.3    Xu, Z.B.4
  • 11
    • 0035696799 scopus 로고    scopus 로고
    • A hybrid heuristic for the traveling salesman problem
    • Baraglia R., Hidalgo J.I., and Perego R. A hybrid heuristic for the traveling salesman problem. IEEE Trans Evol Comput 5 (2001) 613-622
    • (2001) IEEE Trans Evol Comput , vol.5 , pp. 613-622
    • Baraglia, R.1    Hidalgo, J.I.2    Perego, R.3
  • 12
    • 0023313723 scopus 로고
    • Optimization of a 532-city symmetric genetic traveling salesman problem by branch and cut
    • Padberg M., and Rinaldi G. Optimization of a 532-city symmetric genetic traveling salesman problem by branch and cut. Oper Res Lett 6 1 (1987) 1-7
    • (1987) Oper Res Lett , vol.6 , Issue.1 , pp. 1-7
    • Padberg, M.1    Rinaldi, G.2
  • 13
    • 33644924645 scopus 로고    scopus 로고
    • Solving the feeder bus network design problem by genetic algorithms and ant colony optimization
    • Kuan S.N., Ong H.L., and Ng K.M. Solving the feeder bus network design problem by genetic algorithms and ant colony optimization. Adv Eng Software 37 6 (2006) 351-359
    • (2006) Adv Eng Software , vol.37 , Issue.6 , pp. 351-359
    • Kuan, S.N.1    Ong, H.L.2    Ng, K.M.3
  • 14
    • 37449007513 scopus 로고    scopus 로고
    • Use of chaotic sequences in a biologically inspired algorithm for engineering design optimization
    • Coelho L.D.S., and Mariani V.C. Use of chaotic sequences in a biologically inspired algorithm for engineering design optimization. Expert Syst Appl 34 3 (2008) 1905-1913
    • (2008) Expert Syst Appl , vol.34 , Issue.3 , pp. 1905-1913
    • Coelho, L.D.S.1    Mariani, V.C.2
  • 15
    • 38749152903 scopus 로고    scopus 로고
    • Ant colony optimization for power plant maintenance scheduling optimization - a five-station hydropower system
    • Foong W.K., Simpson A.R., Maier H.R., et al. Ant colony optimization for power plant maintenance scheduling optimization - a five-station hydropower system. Ann Oper Res 159 1 (2008) 433-450
    • (2008) Ann Oper Res , vol.159 , Issue.1 , pp. 433-450
    • Foong, W.K.1    Simpson, A.R.2    Maier, H.R.3
  • 16
    • 2442612945 scopus 로고    scopus 로고
    • An ant colony classifier system: application to some process engineering problems
    • Shelokar P.S., Jayaraman V.K., and Kulkarni B.D. An ant colony classifier system: application to some process engineering problems. Comput Chem Eng 28 9 (2004) 1577-1584
    • (2004) Comput Chem Eng , vol.28 , Issue.9 , pp. 1577-1584
    • Shelokar, P.S.1    Jayaraman, V.K.2    Kulkarni, B.D.3
  • 17
    • 36448957975 scopus 로고    scopus 로고
    • Parameter's setting of the ant colony algorithm applied in preventive maintenance optimization
    • Samrout M., Kouta R., Yalaoui F., et al. Parameter's setting of the ant colony algorithm applied in preventive maintenance optimization. J Int Manuf 18 6 (2007) 663-677
    • (2007) J Int Manuf , vol.18 , Issue.6 , pp. 663-677
    • Samrout, M.1    Kouta, R.2    Yalaoui, F.3
  • 18
    • 0035330723 scopus 로고    scopus 로고
    • An educational genetic algorithms learning tool
    • Liao Y.H., and Sun C.T. An educational genetic algorithms learning tool. IEEE Trans Education 44 (2001) 20
    • (2001) IEEE Trans Education , vol.44 , pp. 20
    • Liao, Y.H.1    Sun, C.T.2
  • 19
    • 0037376079 scopus 로고    scopus 로고
    • Applying software visualization technology to support the use of evolutionary algorithms
    • Collins T.D. Applying software visualization technology to support the use of evolutionary algorithms. J Visual Languages Comput 14 (2003) 123-150
    • (2003) J Visual Languages Comput , vol.14 , pp. 123-150
    • Collins, T.D.1
  • 20
    • 34547697204 scopus 로고    scopus 로고
    • A framework for visually interactive decision-making and design using evolutionary multi-objective optimization (VIDEO)
    • Kollat J.B., and Reed P. A framework for visually interactive decision-making and design using evolutionary multi-objective optimization (VIDEO). Environ Modell Software 22 (2007) 1691-1704
    • (2007) Environ Modell Software , vol.22 , pp. 1691-1704
    • Kollat, J.B.1    Reed, P.2
  • 21
    • 0036858916 scopus 로고    scopus 로고
    • Computer-aided learning in artificial neural networks
    • Ringwood J.V., and Galvin G. Computer-aided learning in artificial neural networks. IEEE Trans Education 45 (2002) 380-387
    • (2002) IEEE Trans Education , vol.45 , pp. 380-387
    • Ringwood, J.V.1    Galvin, G.2
  • 24
    • 60249095503 scopus 로고    scopus 로고
    • Teaching meta-heuristics within virtual learning environments
    • Reiners T., and Vob T. Teaching meta-heuristics within virtual learning environments. Int Trans Oper Res 11 (2004) 225-238
    • (2004) Int Trans Oper Res , vol.11 , pp. 225-238
    • Reiners, T.1    Vob, T.2
  • 26
    • 85009501745 scopus 로고    scopus 로고
    • Effective Interactive AI Resources Workshop. IJCAI; 2001.
    • Effective Interactive AI Resources Workshop. IJCAI; 2001.
  • 27
    • 85009488732 scopus 로고    scopus 로고
    • Symposium on Improving Instruction of Introductory AI. AAAI; 1994.
    • Symposium on Improving Instruction of Introductory AI. AAAI; 1994.
  • 28
    • 0343441395 scopus 로고
    • Dorigo M. Ottimizzazione, Apprendimento Automatico, ed, Ph.D. thesis, Politecnico di Milano;
    • Dorigo M. Ottimizzazione, Apprendimento Automatico, ed Algoritmi Basati su Metafora Naturale. Ph.D. thesis, Politecnico di Milano; 1992.
    • (1992) Algoritmi Basati su Metafora Naturale
  • 29
    • 84901418243 scopus 로고    scopus 로고
    • Ant colony optimization: a new meta-heuristic
    • Angeline P.J., Michalewicz Z., Schoenauer M., Yao X., and Zalzala A. (Eds), IEEE Press
    • Dorigo M., and Di Caro G. Ant colony optimization: a new meta-heuristic. In: Angeline P.J., Michalewicz Z., Schoenauer M., Yao X., and Zalzala A. (Eds). Proceedings of the congress on evolutionary computation vol. 2 (1999), IEEE Press 1470-1477
    • (1999) Proceedings of the congress on evolutionary computation , vol.2 , pp. 1470-1477
    • Dorigo, M.1    Di Caro, G.2
  • 30
    • 33846280533 scopus 로고    scopus 로고
    • Ant colony optimization: Artificial ants as a computational intelligence technique
    • Dorigo M, Birattari M, Stützle T. Ant colony optimization: artificial ants as a computational intelligence technique. IEEE Comput Intell Mag; 2006. p. 28-38.
    • (2006) IEEE Comput Intell Mag , pp. 28-38
    • Dorigo, M.1    Birattari, M.2    Stützle, T.3
  • 31
    • 0031103969 scopus 로고    scopus 로고
    • Ants can colour graphs
    • Costa H.A. Ants can colour graphs. J Oper Res Soc 48 (1997) 295-305
    • (1997) J Oper Res Soc , vol.48 , pp. 295-305
    • Costa, H.A.1
  • 33
    • 0036670449 scopus 로고    scopus 로고
    • Ant can solve constraint satisfaction problems
    • Solnon. Ant can solve constraint satisfaction problems. IEEE Trans Evol Comput 6 (2002) 347-357
    • (2002) IEEE Trans Evol Comput , vol.6 , pp. 347-357
    • Solnon1
  • 35
    • 77049127356 scopus 로고    scopus 로고
    • A comparison between ACO algorithms for the set covering problem
    • Proceeding of the ANTS
    • Lessing L, Dumitrescu I, Stützle T. A comparison between ACO algorithms for the set covering problem. In: Proceeding of the ANTS'2004, ser. LNCS 3172; 2004. p. 1-12.
    • (2004) ser. LNCS , vol.3172 , pp. 1-12
    • Lessing, L.1    Dumitrescu, I.2    Stützle, T.3
  • 36
    • 0346009088 scopus 로고    scopus 로고
    • D-ants: saving based ants divide and conquer the vehicle routing problem
    • Reimann M., Doerner K., and Hartl R.F. D-ants: saving based ants divide and conquer the vehicle routing problem. Comput Oper Res 31 (2004) 237-255
    • (2004) Comput Oper Res , vol.31 , pp. 237-255
    • Reimann, M.1    Doerner, K.2    Hartl, R.F.3
  • 37
    • 33751358567 scopus 로고    scopus 로고
    • Application of ant colony optimization to structure-based drug design
    • Proceeding of the ANTS
    • Korb O, Stützle T, Exner TE. Application of ant colony optimization to structure-based drug design. In: Proceeding of the ANTS 2006, ser. LNCS 4150; 2006. p. 247-58.
    • (2006) ser. LNCS , vol.4150 , pp. 247-258
    • Korb, O.1    Stützle, T.2    Exner, T.E.3
  • 38
    • 34250608222 scopus 로고
    • La reconstruction dun id et les coordinations interindividuelles chez bellicosimetes natalensis et cubitemes sp. la théorie de la stigmerie: essai d'Inrprétation du comportement des termites constructeurs
    • Grassé P.P. La reconstruction dun id et les coordinations interindividuelles chez bellicosimetes natalensis et cubitemes sp. la théorie de la stigmerie: essai d'Inrprétation du comportement des termites constructeurs. Insectes Sociaux 6 (1959) 41-81
    • (1959) Insectes Sociaux , vol.6 , pp. 41-81
    • Grassé, P.P.1
  • 39
    • 84908780328 scopus 로고
    • Computer solutions for the traveling salesman problem
    • Lin S. Computer solutions for the traveling salesman problem. Bell Syst J 44 (1965) 2245-2269
    • (1965) Bell Syst J , vol.44 , pp. 2245-2269
    • Lin, S.1
  • 40
    • 0015604699 scopus 로고
    • An effective heuristic algorithm for the travelling salesman problem
    • Lin S., and Kernighan B.W. An effective heuristic algorithm for the travelling salesman problem. Oper Res 21 (1973) 498-516
    • (1973) Oper Res , vol.21 , pp. 498-516
    • Lin, S.1    Kernighan, B.W.2
  • 41
    • 0030759617 scopus 로고    scopus 로고
    • Ant colonies for the traveling salesman problem
    • Dorigo M., and Gambardella L.M. Ant colonies for the traveling salesman problem. Bio Syst 43 (1997) 73-81
    • (1997) Bio Syst , vol.43 , pp. 73-81
    • Dorigo, M.1    Gambardella, L.M.2
  • 42
    • 0001822278 scopus 로고    scopus 로고
    • A new ranked-based version of the ant system: a computational study
    • Bullnheimer, Hartl R.F., and Strauss C. A new ranked-based version of the ant system: a computational study. Central Eur J Oper Res 7 (1999) 25-38
    • (1999) Central Eur J Oper Res , vol.7 , pp. 25-38
    • Bullnheimer1    Hartl, R.F.2    Strauss, C.3
  • 43
    • 11144352255 scopus 로고    scopus 로고
    • New ACO model integrating evolutionary computation concepts: The best-worst ant system
    • Brussels;
    • Cordon O, Viana IF, Moreno L. New ACO model integrating evolutionary computation concepts: the best-worst ant system. In: Proceeding of the ANTS 2000, Brussels; 2000. p. 22-9.
    • (2000) Proceeding of the ANTS , pp. 22-29
    • Cordon, O.1    Viana, I.F.2    Moreno, L.3
  • 45
    • 23944497083 scopus 로고    scopus 로고
    • Ant algorithms: theory and applications
    • Shtovba S.D. Ant algorithms: theory and applications. Program Comput Software 31 (2005) 167-178
    • (2005) Program Comput Software , vol.31 , pp. 167-178
    • Shtovba, S.D.1
  • 46
    • 0026923887 scopus 로고
    • Fast algorithms for geometric traveling salesman problems
    • Bentley J.L. Fast algorithms for geometric traveling salesman problems. ORSA J Comput 4 (1992) 387-411
    • (1992) ORSA J Comput , vol.4 , pp. 387-411
    • Bentley, J.L.1
  • 47
    • 0001193147 scopus 로고
    • The traveling salesman problem: a case study in local optimization
    • Aarts E.H.L., and Lenstra J.K. (Eds), Wiley and Sons
    • Johnson D.S., and McGeoch L.A. The traveling salesman problem: a case study in local optimization. In: Aarts E.H.L., and Lenstra J.K. (Eds). Local search in combinatorial optimization (1995), Wiley and Sons
    • (1995) Local search in combinatorial optimization
    • Johnson, D.S.1    McGeoch, L.A.2


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