检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:蒋建林[1] 李雪[1] ASSANI Saeed 吴仆[1] 王璨璨[1]
出 处:《运筹学学报》2013年第4期69-79,共11页Operations Research Transactions
基 金:国家自然科学基金(No.11101211);江苏省自然科学基金(No.BK2011719);中央高校基本科研业务费专项资金(No.NZ2012306);第46批留学回国人员科研启动基金
摘 要:p-中位问题是设施选址中的一个经典模型,在交通、物流等领域有着广泛应用.在经典p-中位问题的基础上提出一种p不确定的推广p-中位问题,并且加上总投资约束,使得此推广模型更加实用.针对此推广模型,提出三种启发式算法:简单启发式算法、变邻域搜索算法和改进的遗传算法.数值实验结果表明变邻域搜索算法和改进的遗传算法在求解此推广模型时是有效的.p-median problem is a classical model in facility location and it has vast applications in related areas such as transportation and logistics. An extended p-median problem is investigated in this paper, in which the number of facilities to be located is uncertain and an investment constraint is considered. This makes the extended problem more applicable in the real lifes. Three heuristics are proposed for solving this extended p-median problem: the first is a simple heuristic algorithm; the second is a variable neigh-borhood search algorithm; and the third is an improved genetic algorithm. Experimental results show that the variable neighborhood search algorithm and the improved genetic algorithm are efficient for solving this problem.
关 键 词:运筹学 设施选址 推广p-中位问题 变邻域搜索算法 改进遗传算法
分 类 号:O221.4[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.148.227.92