Yayın:
Optimization of the quadratic assignment problem using an ant colony algorithm

Basit öğe sayfası
dc.contributor.authorDemirel, Nihan Cetin
dc.contributor.authorToksari, M. Duran
dc.date.accessioned2026-06-27T13:05:19Z
dc.date.issued2006
dc.description.abstractAnt algorithm is a multi-agent systems inspired by the behaviors of real ant colonies function to solve optimization problems. In this paper an ant colony optimization algorithm is developed to solve the quadratic assignment problem. The local search process of the algorithm is simulated annealing. In the exploration of the search space, the evaluation of pheromones which are laid on the ground by ants is used. In this work, the algorithm is analyzed by using current problems in the literature and is compared with other metaheuristics. (c) 2006 Elsevier Inc. All rights reserved.en
dc.description.urihttps://doi.org/10.1016/j.amc.2006.05.073
dc.identifier.doi10.1016/j.amc.2006.05.073
dc.identifier.endpage435
dc.identifier.issn0096-3003
dc.identifier.issue1
dc.identifier.startpage427
dc.identifier.urihttps://hdl.handle.net/20.500.14981/49545
dc.identifier.volume183
dc.identifier.wos000243828600043
dc.language.isoeng
dc.publisherELSEVIER SCIENCE INC
dc.relation.ispartofAPPLIED MATHEMATICS AND COMPUTATION
dc.subjectant colony optimization
dc.subjectsimulated annealing
dc.subjectmetaheuristics
dc.subjectquadratic assignment problem
dc.subjectcombinatorial optimization
dc.subjectMathematics
dc.titleOptimization of the quadratic assignment problem using an ant colony algorithm
dc.typeArticle
dspace.entity.typePublication
local.import.sourceWOS

Dosyalar

Koleksiyonlar

Yayınlar