A Honey Bee Algorithm To Solve Quadratic Assignment Problem

Autor:	mohamad mirzazadeh, Gholam Shirdel, behrooz masoumi
Jazyk:	angličtina
Rok vydání:	2011
Předmět:	Honey-Bee mating optimization quadratic assignment problem meta- heuristic methods simulated annealing Genetic Algorithm Industrial engineering. Management engineering T55.4-60.8
Zdroj:	Journal of Optimization in Industrial Engineering, Vol Volume 4, Iss 9, Pp 27-36 (2011)
Druh dokumentu:	article
ISSN:	2251-9904 2423-3935
Popis:	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.
Databáze:	Directory of Open Access Journals
Externí odkaz:	https://doaj.org/article/6ed92cf32ffb4240bf5c925037305d3a Zobrazit plný text záznamu View record in DOAJ