首页 | 本学科首页   官方微博 | 高级检索  
     检索      

带投资约束且p不确定的推广p-中位问题
引用本文:蒋建林,李雪,ASSANI Saeed,吴仆,王璨璨.带投资约束且p不确定的推广p-中位问题[J].运筹学杂志,2013(4):69-79.
作者姓名:蒋建林  李雪  ASSANI Saeed  吴仆  王璨璨
作者单位:南京航空航天大学理学院,南京211100
基金项目:国家自然科学基金(No.11101211),江苏省自然科学基金(No.BK2011719),中央高校基本科研业务费专项资金(No.NZ2012306),第46批留学回国人员科研启动基金
摘    要:p-中位问题是设施选址中的一个经典模型,在交通、物流等领域有着广泛应用.在经典p-中位问题的基础上提出一种p不确定的推广p-中位问题,并且加上总投资约束,使得此推广模型更加实用.针对此推广模型,提出三种启发式算法:简单启发式算法、变邻域搜索算法和改进的遗传算法.数值实验结果表明变邻域搜索算法和改进的遗传算法在求解此推广模型时是有效的.

关 键 词:运筹学  设施选址  推广p-中位问题  变邻域搜索算法  改进遗传算法

An extended p-median problem with investment constraint and uncertain p
Authors:JIANG Jianlin LI Xue  ASSANI Saeed  WU Pu WANG Cancan
Institution:1. College of Science, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, China
Abstract: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.
Keywords:operations research  facility location  extended/p-median problem  vari- able neighborhood search algorithm  improved genetic algorithm
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号