A Honey Bee Algorithm to Solve Quadratic Assignment Problem
Publish Year: 1390
نوع سند: مقاله ژورنالی
زبان: English
View: 320
This Paper With 10 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
این Paper در بخشهای موضوعی زیر دسته بندی شده است:
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_JOIE-4-9_004
تاریخ نمایه سازی: 22 آبان 1397
Abstract:
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
Keywords:
Authors
Mohamad Mirzazadeh
MSc, Department of management, Qazvin Branch, Islamic Azad University, Qazvin, Iran
Gholam Hasan Shirdel
Assistant Professor, Department of mathematics and computer science, faculty of science, Tehran University, Tehran, Iran
Behrouz Masoumi
Assistant Professor, Department of computer, faculty of electronic and computer, Qazvin Branch, Islamic Azad University, Qazvin, Iran