您的位置:首页  > 论文页面

基于Floyd算法的社区服务中心的选址问题

发表时间:2009-01-15  浏览量:2447  下载量:1066
全部作者: 梅索,毛洪振,赵东方
作者单位: 华中师范大学数学与统计学院
摘 要: 讨论如何选择小区建立社区服务中心更好地方便小区居民。为了解决此问题,首先做出适当假设并以此建立一个单目标规划模型。为了求解此规划模型中的数据,将各个小区之间的距离表示为距离矩阵,然后以Matlab为平台利用Floyd算法求出小区之间的最短临接矩阵。在得到最短临接矩阵后,带入规划模型中,利用Lingo 9.0软件包,即可得到社区服务中心选择和对应各个小区居民选择服务中心方案。最后,通过两个实例(单社区多服务中心和多社区多服务中心选址)分别验证了建立的规划模型。
关 键 词: 运筹学与控制论;Floyd算法;单目标规划模型;最短临接矩阵
Title: Location-allocation problem for community service centers bases on Floyd algorithm
Author: MEI Suo, MAO Hongzhen, ZHAO Dongfang
Organization: School of Mathematics and Statistics, Huazhong Normal University
Abstract: This paper discussed how to choose the location of community service centers to facilitate the district residents better. To solve this problem, first of all, it made appropriate assumptions and established a single objective programming model. And in order to get the model data, it used the distance matrix to denote the distance of each district. Then by the software Matlab, via Floyd algorithm, it concluded the minimum adjoining matrix. After that, by substituting the minimum adjoining matrix, it used Lingo 9.0 to solve the programming model and obtained the available options for the corresponding area residents to choose various service centers. Finally, through two examples (multiple service centers for single community and multiple service centers for multiple communities), the paper verified that the programming model is available.
Key words: operations research and cybernetics; Floyd algorithm; single objective programming model; the minimum adjoin matrix
发表期数: 2009年1月第1期
引用格式: 梅索,毛洪振,赵东方. 基于Floyd算法的社区服务中心的选址问题[J]. 中国科技论文在线精品论文,2009,2(1):10-14.
 
2 评论数 0
暂无评论
友情链接