作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

›› 2005, Vol. 31 ›› Issue (19): 172-174.

• 论文 • 上一篇    下一篇

一种新的求解约束P-中位问题的启发式算法

李有梅,陈晔   

  1. 绍兴文理学院计算机科学系,山西大学计算机科学系 绍兴 312000
  • 发布日期:2005-10-15

A New Heuristic Algorithm for Capacitated P-median Problem

LI Youmei1,CHEN Ye2   

  1. (1.Computer Science Department,Shaoxing College of Arts and Sciences,Shaoxing 312000;2.Computer Science Department,Shanxi University,Taiyuan 030006)
  • Published:2005-10-15

摘要: 针对约束P-中位问题的特点,提出了一种新的启发式算法。该算法借鉴了蚁群算法的信息素学习机制,同时针对问题的结构设计了合理的对象分配方式。模拟计算表明,该算法具有更好的全局优化性能和计算效率。

关键词: 约束P-中位问题, 信息素机制, 启发式算法

Abstract: This article proposes a new heuristic algorithm for capacitated P-median problem.This algorithm adopts pheromone mechanism tolearn the probability in which an object belongs to a median.Also a suitable classification method is designed based on the problem's characteristicsThe experiment result shows that the algorithm is feasible and efficient.

中图分类号: