Solving Travelling Salesman Problem using an Enhanced Ant Colony Algorithm

2019 ◽  
Vol 7 (7) ◽  
pp. 214-222
Author(s):  
S. Suriya ◽  
M. Rahul Kumar
Keyword(s):  
Ant Colony Algorithm ◽  
Travelling Salesman Problem ◽  
Ant Colony ◽  
Travelling Salesman

scholarly journals Roteirization of vehicles in the delivery/collection problems - Application of a modifed Ant Colony Algorithm

2020 ◽  
Vol 12 (1) ◽  
pp. 44-53
Author(s):  
Victor Hugo Resende Lima ◽  
Elias De Oliveira Lima ◽  
Hassan Sherafat
Keyword(s):  
Ant Colony Algorithm ◽  
Travelling Salesman Problem ◽  
Ant Colony ◽  
Waste Collection ◽  
Chinese Postman Problem ◽  
Travelling Salesman ◽  
Solid Waste Collection ◽  
Chinese Postman ◽  
Postal Services ◽  
Mixed Graphs

Delivering and collecting problems concern to situations where goods are delivered (or collected) in practical cases. For example, solid waste collection, postal services and snow removing. It can be modelled as the well-known Chinese Postman Problem on mixed graphs (MCPP). The MCPP is a fair model for the delivering and collecting problem because its goal is to cover all links of a mixed graph with minimal cost. The objective of this paper is to develop an algorithm based on Ant Colony Optimization and apply it to MCPP solution. The MCPP is initially converted into an equivalent Travelling Salesman Problem (TSP) and then tackled on this second instance. The results were promising and comparable to some other algorithms. It was found results near of optimal solutions in some cases.

Solution of Travelling Salesman Problem Using Ant Colony Algorithm

2014 ◽  
Vol 548-549 ◽  
pp. 1206-1212
Author(s):  
Sevda Dayıoğlu Gülcü ◽  
Şaban Gülcü ◽  
Humar Kahramanli
Keyword(s):  
Discrete Optimization ◽  
Ant Colony Algorithm ◽  
Optimization Problems ◽  
Travelling Salesman Problem ◽  
Heuristic Method ◽  
Ant Colony ◽  
Ant Colony System ◽  
Travelling Salesman ◽  
Ant Colonies ◽  
Discrete Optimization Problems

Recently some studies have been revealed by inspiring from animals which live as colonies in the nature. Ant Colony System is one of these studies. This system is a meta-heuristic method which has been developed based upon food searching characteristics of the ant colonies. Ant Colony System is applied in a lot of discrete optimization problems such as travelling salesman problem. In this study solving the travelling salesman problem using ant colony system is aimed.

scholarly journals Ants Colony Optimisation of a Measuring Path of Prismatic Parts on a CMM

2016 ◽  
Vol 23 (1) ◽  
pp. 119-132 ◽  
Author(s):  
Slavenko M. Stojadinovic ◽  
Vidosav D. Majstorovic ◽  
Numan M. Durakbasa ◽  
Tatjana V. Sibalija
Keyword(s):  
Travelling Salesman Problem ◽  
Ant Colony ◽  
The Other ◽  
Ant Colony Optimisation ◽  
Travelling Salesman ◽  
Prismatic Parts ◽  
On Line ◽  
Optimisation Model ◽  
Set Of Points ◽  
The Mathematical Model

AbstractThis paper presents optimisation of a measuring probe path in inspecting the prismatic parts on a CMM. The optimisation model is based on: (i) the mathematical model that establishes an initial collision-free path presented by a set of points, and (ii) the solution of Travelling Salesman Problem (TSP) obtained with Ant Colony Optimisation (ACO). In order to solve TSP, an ACO algorithm that aims to find the shortest path of ant colony movement (i.e. the optimised path) is applied. Then, the optimised path is compared with the measuring path obtained with online programming on CMM ZEISS UMM500 and with the measuring path obtained in the CMM inspection module of Pro/ENGINEER®software. The results of comparing the optimised path with the other two generated paths show that the optimised path is at least 20% shorter than the path obtained by on-line programming on CMM ZEISS UMM500, and at least 10% shorter than the path obtained by using the CMM module in Pro/ENGINEER®.

Sign in / Sign up

Export Citation Format

Share Document