An Improved Ant Colony Algorithm Based on 3-opt and Chaos for Travelling Salesman Problem
نویسندگان
چکیده
This paper presents an improved chaotic ant colony system algorithm (ICACS) for solving combinatorial optimization problems. The existing algorithms still have some imperfections, we use a combination of two different operators to improve the performance of algorithm in this work. First, 3-opt local search is used as a framework for the implementation of the ACS to improve the solution quality; Furthermore, chaos is proposed in the work to modify the method of pheromone update to avoid the algorithm from dropping into local optimum, thereby finding the favorable solutions. From the experimental results, we can conclude that ICACS has much higher quality solutions than the original ACS, and can jump over the region of the local optimum, and escape from the trap of a local optimum successfully and achieve the best solutions. Therefore, it’s better and more effective algorithm for TSP.
منابع مشابه
A Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem
The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...
متن کاملA CONSTRAINED SOLID TSP IN FUZZY ENVIRONMENT: TWO HEURISTIC APPROACHES
A solid travelling salesman problem (STSP) is a travelling salesman problem (TSP) where the salesman visits all the cities only once in his tour using dierent conveyances to travel from one city to another. Costs and environmental eect factors for travelling between the cities using dierent conveyances are dierent. Goal of the problem is to nd a complete tour with minimum cost that damages the ...
متن کاملQuantum Dynamic Mechanism-based Parallel Ant Colony Optimization Algorithm
A novel Parallel Ant Colony Optimization Algorithm based on Quantum dynamic mechanism for traveling salesman problem (PQACO) is proposed. The use of the improved 3-opt operator provides this methodology with superior local search ability; several antibody diversification schemes were incorporated into the PQACO in order to improve the balance between exploitation and exploration. We describe th...
متن کاملA modified elite ACO based avoiding premature convergence for travelling salesmen problem
The Travelling Salesmen Problem (TSP) is one of the most important and famous combinational optimization problems that aim to find the shortest tour. In this problem, the salesman starts to move from an arbitrary place called depot and after visiting all nodes, finally comes back to depot. Solving this problem seems hard because program statement is simple and leads this problem belonging to NP...
متن کاملA Combination of Sweep Algorithm and Elite Ant Colony Optimization for Solving the Multiple Traveling Salesman Problem
The aim of this paper is to introduce a hybrid two-phase algorithm called SW+ ASelite for solving the MTSP which can be explained as the problem of designing collection of routes from one depot to a number of customers subject to side constraints. At the first stage, the MTSP is solved by the sweep algorithm, and at the second stage, the Elite Ant Colony Optimization ( ASelite ) and 3-opt local...
متن کامل