Autonomous Units for Solving the Traveling Salesperson Problem Based on Ant Colony Optimization1
نویسندگان
چکیده
Communities of autonomous units are rule-based and graphtransformational systems with a well-defined formal semantics. The autonomous units of a community act and interact in a common environment while striving for their goals. Ant colony systems consist of a set of autonomously behaving ants and are often employed as a metaheuristics for NP-hard logistic problems. In this paper, we demonstrate how communities of autonomous units can be used as a formal graph-transformational framework for modeling ant colony systems. As a first example we model an ant colony system for the Traveling Salesperson Problem as a community of autonomous units.
منابع مشابه
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 statistical analysis of parameter values for the rank-based ant colony optimization algorithm for the traveling salesperson problem
Ant colony optimization (ACO) is a metaheuristic for solving combinatorial optimization problems that is based on the foraging behavior of biological ant colonies. Starting with the 1996 seminal paper by Dorigo, Maniezzo and Colorni, ACO techniques have been used to solve the traveling salesperson problem (TSP). In this paper, we focus on a particular type of the ACO algorithm, namely, the rank...
متن کاملAutonomous Units for Solving the Capacitated Vehicle Routing Problem Based on Ant Colony Optimization
Communities of autonomous units and ant colony systems have fundamental features in common. Both consists of a set of autonomously acting units that transform and move around a common environment that is usually a graph. In contrast to ant colony systems, the actions of autonomous units are specified by graph transformation rules which have a precisely defined operational semantics and can be v...
متن کاملNew Ant Colony Algorithm Method based on Mutation for FPGA Placement Problem
Many real world problems can be modelled as an optimization problem. Evolutionary algorithms are used to solve these problems. Ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. These ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. Ant colony optim...
متن کاملAnt Colony System Optimization
Successful heuristic algorithms for solving combinatorial optimization problems have mimicked processes observed in nature. Two highly successful families of algorithms that do this are simulated annealing and genetic algorithms. Here, a third family of algorithms, ant colony optimization is explored and implemented in C#. The test bed for evaluating the quality of solutions is based on several...
متن کامل