Shortest Path Problem Solving Based on Ant Colony Optimization Metaheuristic
نویسندگان
چکیده
منابع مشابه
Solving a unique Shortest Path problem using Ant Colony Optimisation
Ant Colony Optimisation (ACO) has in the past proved suitable to solve many optimisation problems. This research explores the ability of the ACO algorithm to balance two quality metrics (length and cost) in its decision making process. Results are given for a preliminary investigation based on a series of shortest path problems. It is concluded that, for these problems at least, the solution qu...
متن کاملSolving the Airline Recovery Problem By Using Ant Colony Optimization
In this paper an Ant Colony (ACO) algorithm is developed to solve aircraft recovery while considering disrupted passengers as part of objective function cost. By defining the recovery scope, the solution always guarantees a return to the original aircraft schedule as soon as possible which means least changes to the initial schedule and ensures that all downline affects of the disruption are ...
متن کاملAnalysis of Ant Colony Optimization for Dynamic Shortest Path Problems
iii Preface This thesis was prepared at the department of Informatics and Mathematical Modelling at the Technical University of Denmark in fulfillment of the requirements for acquiring an M.Sc. in Computer Science and Engineering. It was supervised by associate professor Carsten Witt, and assigned a workload of 30 ECTS credits. The thesis examines how nature-inspired algorithms based on the Ant...
متن کاملExploring a shortest path problem using an ant colony algorithm
In this paper, we present an ant algorithm applied to a shortest path problem. The algorithm will consider different input parameters in order to see how the results behave. These results will be compared to see if there is a pattern on changing the input parameters.
متن کاملAnt Colony Optimization Revisited from a Randomized Shortest Path Perspective
In this letter, it is shown that the randomized shortest-path framework (RSP, [15]) provides a theoretical interpretation of a class of ant colony optimization (ACO) algorithms, enjoying some nice properties. According to RSP, ants are sent from some initial node until they either eventually reach the goal node, or abandon and come back unsuccessfully along the same path. During their return tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ipc
سال: 2012
ISSN: 1425-140X
DOI: 10.2478/v10248-012-0011-5