- | ||||
|
![]()
|
Solving a combinatorial problem using a local optimization in ant based system
C-M. Pintea (cmpintea Abstract: Local optimizations introduced to obtain improved tours for Traveling Salesman Problem have a great impact on the final solution. That is way we introduce a new ant system algorithm with a new local updating pheromone rule, and the tours are improved using k-opt techniques. The tests use different parameters, in order to obtain solutions close to the optimal values. Keywords: Ant Systems, Heuristics, k-opt algorithms, Traveling Salesman Problem Category 1: Combinatorial Optimization Category 2: Combinatorial Optimization (Approximation Algorithms ) Citation: Manuscript, Department of Computer-Science, Babes-Bolyai University, Cluj-Napoca, Romania, December 2005 Download: Entry Submitted: 12/28/2005 Modify/Update this entry | ||
Visitors | Authors | More about us | Links | |
Subscribe, Unsubscribe Digest Archive Search, Browse the Repository
|
Submit Update Policies |
Coordinator's Board Classification Scheme Credits Give us feedback |
Optimization Journals, Sites, Societies | |
![]() |