二次分配问题的布谷鸟搜索算法
Cuckoo Search Algorithm for Quadratic Assignment Problem
许秋艳1
作者信息
- 1. 盐城工学院信息工程学院，盐城 224051
- 折叠
摘要
二次分配问题是一种典型的组合优化难题。该问题由于目标函数的非线性而使得问题的求解异常复杂。为求解二次分配问题，设计基于布谷鸟搜索算法的优化方法。布谷鸟搜索算法是一种新型现代启发式算法，具有结构简单和易于编程等特点。针对二次分配问题的特点，给出算法的实现流程。实验结果表明该算法的可行性和有效性。
Abstract
Quadratic Assignment Problem (QAP) is a typical hard problem in combinatorial optimization. It is hard to solve QAP because of its non-linear objective function. To solve QAP, proposes a method based on Cuckoo Search Algorithm (CSA). CSA is a novel metaheuristic which is simple and easy to program. According the features of QAP, shows the algorithm procedure. The results demonstrate that the presented method is feasible and effective.
关键词
二次分配问题/布谷鸟搜索算法/组合优化Key words
Quadratic Assignment Problem/Cuckoo Search Algorithm/Combinatorial Optimization引用本文复制引用
出版年
2015
NETL
NSTL
维普
万方数据