A Honey Bee Algorithm To Solve Quadratic Assignment Problem
محورهای موضوعی : Design of Experiment
mohamad mirzazadeh
1
(management and accounting department. QAZVIN Islamic Azad University)
غلام حسن شیردل
2
(دپارتمان ریاضیات و علوم کامپیوتر- دانشکده علوم- دانشگاه قم- قم -ایران)
behrooz masoumi
3
(department of computer, faculty of electronic and computer, qazvin branch, Islamic Azad university , qazvin, Iran)
کلید واژه: simulated annealing, Genetic Algorithm, Honey-Bee mating optimization, quadratic assignment problem, meta- heuristic methods,
چکیده مقاله :
Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first of all, we have been described exact methods and heuristics, which are able to solve QAP; then we have been applied a meta-heuristic algorithm for it. QAP is a difficult problem and is in NP-hard class, so we have been used honey bee mating optimization (HBMO) algorithm to solve it.This method is new and have been applied and improved NP-hard problems. It’s a hybrid algorithm from Honey-Bee Mating system, simulated annealing and genetic algorithm.
