A computational optimization research on ant colony optimization for the traveling salesman problem

نویسندگان

چکیده

Abstract The traveling salesman problem (TSP) is one of typical combinatorial optimization problems. Ant colony (ACO) an effective method to solve the problem, but there are some non-negligible shortcomings hidden in original algorithm. primary objective this research optimize ACO produce quality work throughout solving TSP. To end, hybrid SOS-MMAS algorithm proposed. Concretely, apply advanced Max-Min System (MMAS) as basic raise task scheduling efficiency, meanwhile introduce symbiotic organisms search (SOS) into MMAS key parameters. Experiments were carried out on TSP instances different scales, and SOS-ACO algorithms compared with SOS-MMAS, which proved excellent performance Rationality design high has been illuminated by experimentation. In addition, model also could serve suggest further or other related areas.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Ant Colony Optimization for the Traveling Salesman Problem

There are two reasons for parallelizing a metaheuristic if one is interested in performance: (i) given a fixed time to search, the aim is to increase the quality of the solutions found in that time; (ii) given a fixed solution quality, the aim is to reduce the time needed to find a solution not worse than that quality. In this article, we study the impact of communication when we parallelize a ...

متن کامل

Ant Colony Optimization for Solving Traveling Salesman Problem

An ant colony capable of solving the traveling salesman problem (TSP). TSP is NP-hard problem. Even though the problem itself is simple, when the number of city is large, the search space will become extremely large and it becomes very difficult to find the optimal solution in a short time. One of the main ideas of ant algorithms is the indirect communication of a colony of agents, called (arti...

متن کامل

Modified Ant Colony Optimization for Solving Traveling Salesman Problem

This paper presents a new algorithm for solving the Traveling Salesman Problem (NPhard problem) using pheromone of ant colony depends on the pheromone and path between cites. TSP is a problem in theoretical computer science which is very hard to solve a number of real-world problems can be formalized as TSP problems, and ants of the colony are able to generate successively shorter feasible tour...

متن کامل

an effective ant colony algorithm for the traveling salesman problem

the traveling salesman problem (tsp) is a well-known combinatorial optimization problem and holds a central place in logistics management. the tsp has received much attention because of its practical applications in industrial problems. many exact, heuristic and metaheuristic approaches have been proposed to solve tsp in recent years. in this paper, a modified ant colony optimization (maco) is ...

متن کامل

On the Invariance of Ant Colony Optimization for the Traveling Salesman Problem

Ant colony optimization (ACO) is nowadays one of the most promising metaheuristics, and an increasing amount of research has been devoted to its empirical and theoretical analysis. Some authors believe that the performance of ant colony optimization depends somehow on the scale of the problem instance under analysis. The issue has been recently raised explicitly [1] and the hyper-cube framework...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of physics

سال: 2022

ISSN: ['0022-3700', '1747-3721', '0368-3508', '1747-3713']

DOI: https://doi.org/10.1088/1742-6596/2258/1/012006