| 注册
首页|期刊导航|计算机工程与应用|基于MapReduce的量子蚁群算法

基于MapReduce的量子蚁群算法

贾瑞玉 李亚龙

计算机工程与应用Issue(19):246-249,270,5.
计算机工程与应用Issue(19):246-249,270,5.DOI:10.3778/j.issn.1002-8331.1302-0036

基于MapReduce的量子蚁群算法

Quantum-inspired ant colony algorithm based on MapReduce model

贾瑞玉 1李亚龙1

作者信息

  • 1. 安徽大学 计算机科学与技术学院,合肥 230601
  • 折叠

摘要

Abstract

The Quantum-inspired ant colony algorithm is a new algorithm which is based on the combination of ant colony opti-mization and quantum computing, and has better diversity and global search capacity. This paper aims at the parallelism of Quan-tum-inspired ant colony algorithm, uses cloud computing to parallel Quantum-inspired ant colony algorithm, makes it to meet the key/value programming model of MapReduce, puts forward MapReduce-based Quantum-inspired ant colony algorithm and runs the algorithm on Hadoop platform. Using 0-1 knapsack problem for test, with the expansion of data set, improvement of parallelism, MQACA exhibits good speed-up ratio and parallel efficiency, proves the feasibility of MQACA.

关键词

量子蚁群算法/云计算/MapReduce模型

Key words

Quantum-inspired ant colony algorithm/cloud computing/MapReduce model

分类

信息技术与安全科学

引用本文复制引用

贾瑞玉,李亚龙..基于MapReduce的量子蚁群算法[J].计算机工程与应用,2013,(19):246-249,270,5.

基金项目

安徽省教育厅自然科学研究基金资助重点项目(No.2011A006)。 ()

计算机工程与应用

OACSCDCSTPCD

1002-8331

访问量0
|
下载量0
段落导航相关论文