메뉴 건너뛰기




Volumn 38, Issue 4, 2011, Pages 3873-3883

Parallelized genetic ant colony systems for solving the traveling salesman problem

Author keywords

Ant colony systems; Genetic algorithms; Parallelization; Parallelized genetic ant colony systems; Traveling salesman problem

Indexed keywords

ANT COLONY SYSTEMS; COMMUNICATION STRATEGY; CROSSOVER OPERATIONS; DATA SETS; MUTATION OPERATIONS; PARALLELIZATIONS; TRAVELING SALESMAN;

EID: 78650698898     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2010.09.048     Document Type: Article
Times cited : (102)

References (35)
  • 5
    • 70350728932 scopus 로고    scopus 로고
    • A new method for solving the traveling salesman problem based on parallelized genetic ant colony systems
    • Baoding, Hebei, China.
    • Chien, C.Y.; Chen, S.M. (2009). A new method for solving the traveling salesman problem based on parallelized genetic ant colony systems. In Proceedings of the 2009 international conference on machine learning and cybernetics (pp. 2828-2833). Baoding, Hebei, China.
    • (2009) Proceedings of the 2009 International Conference on Machine Learning and Cybernetics , pp. 2828-2833
    • Chien, C.Y.1    Chen, S.M.2
  • 6
    • 9544240357 scopus 로고    scopus 로고
    • Ant colony system with communication strategies
    • S.C. Chu, J.F. Roddick, and J.S. Pan Ant colony system with communication strategies Information Sciences 167 1-4 2004 63 76
    • (2004) Information Sciences , vol.167 , Issue.14 , pp. 63-76
    • Chu, S.C.1    Roddick, J.F.2    Pan, J.S.3
  • 9
    • 0006267707 scopus 로고
    • Ph.D. Dissertation, Dipartimento di Electtonica, Politecnico di Milano, Italy
    • Dorigo, M. (1992). Learning and Nature Algorithm (in Italian). Ph.D. Dissertation, Dipartimento di Electtonica, Politecnico di Milano, Italy.
    • (1992) Learning and Nature Algorithm (In Italian)
    • Dorigo, M.1
  • 10
    • 0031122887 scopus 로고    scopus 로고
    • Ant colony system: A cooperative learning approach to the traveling salesman problem
    • M. Dorigo, and L.M. Gambardella Ant colony system: A cooperative learning approach to the traveling salesman problem IEEE Transactions on Evolutionary Computation 1 1 1997 53 66
    • (1997) IEEE Transactions on Evolutionary Computation , vol.1 , Issue.1 , pp. 53-66
    • Dorigo, M.1    Gambardella, L.M.2
  • 11
    • 0030759617 scopus 로고    scopus 로고
    • Ant colonies for the traveling salesman problem
    • M. Dorigo, and L.M. Gambardella Ant colonies for the traveling salesman problem Biosystems 43 2 1997 73 81
    • (1997) Biosystems , vol.43 , Issue.2 , pp. 73-81
    • Dorigo, M.1    Gambardella, L.M.2
  • 14
    • 33845433823 scopus 로고    scopus 로고
    • Exchange strategies for multiple ant colony system
    • I. Ellabib, P. Calamai, and O. Basir Exchange strategies for multiple ant colony system Information Sciences 177 5 2007 1248 1264
    • (2007) Information Sciences , vol.177 , Issue.5 , pp. 1248-1264
    • Ellabib, I.1    Calamai, P.2    Basir, O.3
  • 15
    • 0001067326 scopus 로고
    • A parallel tabu search algorithm for large traveling salesman problems
    • L. Fiechter A parallel tabu search algorithm for large traveling salesman problems Discrete Applied Mathematics 51 3 1994 243 267
    • (1994) Discrete Applied Mathematics , vol.51 , Issue.3 , pp. 243-267
    • Fiechter, L.1
  • 20
    • 0021835689 scopus 로고
    • Computation of decisions in optimization problems
    • J.J. Hopfield, and D.W. Tank computation of decisions in optimization problems Biological Cybernetics 52 3 1985 141 152
    • (1985) Biological Cybernetics , vol.52 , Issue.3 , pp. 141-152
    • Hopfield, J.J.1    Tank, D.W.2
  • 21
    • 26444479778 scopus 로고
    • Optimization by simulated annealing
    • S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi Optimization by simulated annealing Science 220 4598 1983 671 680
    • (1983) Science , vol.220 , Issue.4598 , pp. 671-680
    • Kirkpatrick, S.1    Gelatt, C.D.2    Vecchi, M.P.3
  • 23
    • 34047223805 scopus 로고    scopus 로고
    • Improved ant colony algorithm with pheromone mutation and its application in flow-shop problems
    • Dalian, China.
    • Li, B.; Song, X. (2006). Improved ant colony algorithm with pheromone mutation and its application in flow-shop problems. In Proceedings of the 6th world congress on intelligent control and automation (pp. 3353-3356). Dalian, China.
    • (2006) Proceedings of the 6th World Congress on Intelligent Control and Automation , pp. 3353-3356
    • Li, B.1    Song, X.2
  • 25
    • 58349100863 scopus 로고    scopus 로고
    • Study of genetic algorithm with reinforcement learning to solve the TSP
    • F. Liu, and G. Zeng Study of genetic algorithm with reinforcement learning to solve the TSP Expert Systems with Applications 36 3 2009 6995 7001
    • (2009) Expert Systems with Applications , vol.36 , Issue.3 , pp. 6995-7001
    • Liu, F.1    Zeng, G.2
  • 26
    • 0012703811 scopus 로고    scopus 로고
    • Combining simulated annealing with local search heuristics
    • O.C. Martin, and S.W. Otto Combining simulated annealing with local search heuristics Annals of Operations Research 63 1 1996 57 75
    • (1996) Annals of Operations Research , vol.63 , Issue.1 , pp. 57-75
    • Martin, O.C.1    Otto, S.W.2
  • 27
    • 0036672003 scopus 로고    scopus 로고
    • Ant colony optimization for resource-constrained project scheduling
    • DOI 10.1109/TEVC.2002.802450, PII 1011092002802450
    • D. Merkle, M. Middendorf, and H. Schmeck Ant colony optimization for resource-constrained project scheduling IEEE Transactions on Evolutionary Computation 6 4 2002 333 346 (Pubitemid 35032735)
    • (2002) IEEE Transactions on Evolutionary Computation , vol.6 , Issue.4 , pp. 333-346
    • Merkle, D.1    Middendorf, M.2    Schmeck, H.3
  • 28
    • 0037272238 scopus 로고    scopus 로고
    • Ant colony optimization with global pheromone evaluation for scheduling a single machine
    • D. Merkle, and M. Middendorf Ant colony optimization with global pheromone evaluation for scheduling a single machine Applied Intelligence 18 1 2003 105 111
    • (2003) Applied Intelligence , vol.18 , Issue.1 , pp. 105-111
    • Merkle, D.1    Middendorf, M.2
  • 29
    • 53849105454 scopus 로고    scopus 로고
    • New robust and efficient ant colony algorithms: Using new interpretation of local updating process
    • H.M. Naimi, and N. Taherinejad New robust and efficient ant colony algorithms: Using new interpretation of local updating process Expert Systems with Applications 36 1 2009 481 488
    • (2009) Expert Systems with Applications , vol.36 , Issue.1 , pp. 481-488
    • Naimi, H.M.1    Taherinejad, N.2
  • 31
    • 4344655295 scopus 로고    scopus 로고
    • Improving the Ant System: A Detail Report on the MAX-MIN Ant System
    • FG Intellektik, FB Informatik, TU Darmstadt, Germany.
    • Stützle, T.; Hoos, H.H. (1996). Improving the Ant System: A Detail Report on the MAX-MIN Ant System. Technical Report. AIDA-96-12. FG Intellektik, FB Informatik, TU Darmstadt, Germany.
    • (1996) Technical Report. AIDA-96-12
    • Stützle, T.1    Hoos, H.H.2
  • 34
    • 34547264125 scopus 로고    scopus 로고
    • A graphic clustering algorithm based on MMAS
    • 1688498, 2006 IEEE Congress on Evolutionary Computation, CEC 2006
    • H. Yang, X. Li, C. Bo, and X. Shao A graphic clustering algorithm based on MMAS Proceedings of the 2006 IEEE congress on evolutionary computation 2006 Vancouver, BC Canada 1592 1597 (Pubitemid 47130687)
    • (2006) 2006 IEEE Congress on Evolutionary Computation, CEC 2006 , pp. 1592-1597
    • Yang, H.1    Li, X.2    Bo, C.3    Shao, X.4


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