Comparison between ant colony and genetic algorithm using traveling salesman problem
The Travelling Salesman Problem (TSP) is a complex problem in combinatorial optimization. The aim of this study is compare the effect of using two distributed algorithm which are ant colony as a Swarm intelligence algorithm and genetic algorithm. In ant colony algorithm each individual ant construct...
        保存先:
      
    
                  | 主要な著者: | Abduljabbar, Zaid Ammen, Khalefa, Mustafa S., A. Jabar, Marzanah | 
|---|---|
| フォーマット: | 論文 | 
| 言語: | English | 
| 出版事項: | 
        Medwell Publishing
    
      2013
     | 
| オンライン・アクセス: | http://psasir.upm.edu.my/id/eprint/30686/1/Comparison%20between%20ant%20colony%20and%20genetic%20algorithm%20using%20traveling%20salesman%20problem.pdf | 
| タグ: | 
       タグ追加    
     
      タグなし, このレコードへの初めてのタグを付けませんか!
    | 
類似資料
- 
                
        
          The traveling salesman problem : a computational study /        
                          
出版事項: (2006) - 
                
        
          An  innovative branch and bound algorithm for the traveling salesman problem /        
                  
著者:: Foroushani, Mahshid Sadat Abtahi - 
                
        
          The Traveling Salesman Problem and Its Variations        
                          
出版事項: (2007) - 
                
        
          A genetic algorithm for symmetric travelling salesman problem eith due dates        
                  
著者:: Lee, Lai Soon, 等
出版事項: (2007) - 
                
        
          Optimization of PID Controllers Using Ant Colony and Genetic Algorithms        
                  
著者:: Ünal, Muhammet., 等
出版事項: (2013) 
