Algoritma Ant Colony Optimization pada Quadratic Assignment Problem
نویسندگان
چکیده
منابع مشابه
Ant Colony Optimization for Quadratic Assignment Problem
THE quadratic assignement problem (QAP) can be described as an optimizing the assignment a set of facilities to a set of locations with given costs between the locations and given flows between the facilities in order to minimize the sum of the product between flows and distances. A concrete example, would be a hospital planning optimization the location of various medical facilities in order t...
متن کاملA Hybrid Ant Colony Algorithm for Quadratic Assignment Problem
Quadratic assignment problem (QAP) is one of fundamental combinatorial optimization problems in many fields. Many real world applications such as backboard wiring, typewriter keyboard design and scheduling can be formulated as QAPs. Ant colony algorithm is a multi-agent system inspired by behaviors of real ant colonies to solve optimization problems. Ant colony optimization (ACO) is one of new ...
متن کاملIncremental Local Search in Ant Colony Optimization: Why It Fails for the Quadratic Assignment Problem
Ant colony optimization algorithms are currently among the best performing algorithms for the quadratic assignment problem. These algorithms contain two main search procedures: solution construction by artificial ants and local search to improve the solutions constructed by the ants. Incremental local search is an approach that consists in reoptimizing partial solutions by a local search algori...
متن کاملAnt Colonies for the Quadratic Assignment Problem
This paper presents HAS-QAP, a hybrid ant colony system coupled with a local search, applied to the quadratic assignment problem. HAS-QAP uses pheromone trail information to perform modifications on QAP solutions, unlike more traditional ant systems that use pheromone trail information to construct complete solutions. HAS-QAP is analysed and compared with some of the best heuristics available f...
متن کامل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 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jambura Journal of Mathematics
سال: 2019
ISSN: 2656-1344,2654-5616
DOI: 10.34312/jjom.v1i2.2353