求解多维0-1背包问题的蚁群算法研究  

Research on Ant Colony Algorithm for Solving Multi-dimension Package Problem

作　　者：张芹[1] 宫洪芸[1] 

机构地区：[1]中国地质大学计算机学院,湖北武汉430074

出　　处：《软件导刊》2008年第12期49-51,共3页Software Guide

摘　　要：系统地阐述了蚁群算法,并对它进行改进、优化。将蚁群算法应用于求解多维0-1背包问题,提出一种新的求解多维0-1背包问题的算法——基于交换策略的蚁群算法。Multi-dimension package problem is a classic NP hard problem. It is raised in many projects, for example, deciding and planning projects, distributing resource and loading cargo and so on . Ant colony algorithm is analyzed and optimized in this article. A new solving 0-1 knapsack problem algorithm, Ant Colony Algorithm based on exchange strategy, is put forward. It greatly reduces the searching time of Ant Colony Algorithm. It also effectively ameliorates the disadvantage of easily falling in local best of ant colony algorithm.

关 键 词：多维0-1背包问题 蚁群算法 交换策略 优化 

分 类 号：TP312[自动化与计算机技术—计算机软件与理论]