摘要
建立物流配送中心选址问题的0-1混合整数规划模型,并结合目标排序法和改进的PSRS设计求解0-1规划的并行算法。改进PSRS可将各个目标的验证任务进行均衡划分,并提交给各个处理器并行进行可行性验证,算法理论上具有接近处理器个数p的加速比。
According to the theory of 0--1 programming, this paper presents the model for the problem of logistics distribution centers location. And a new parallel algorithm for the proposed model is given based on objective values sorting and improved PSRS. The tasks of verify solutions have been partitioned and submited to p processors, which verify solutions in parallel. The proposed method have excellent speed up in p.
出处
《计算技术与自动化》
2012年第3期80-82,共3页
Computing Technology and Automation
基金
广西科技特派专项
广西科技攻关项目资助(桂科能129825-12)
研究生创新教育计划项目资助(GXU11T32609)
关键词
配送中心选址
0—1整数规划
并行算法
PSRS
location of logistics distribution centers
O--1 integer programming
parallel algorithm
PSRS