主管:中国科学院
主办:中国优选法统筹法与经济数学研究会
   中国科学院科技战略咨询研究院

中国管理科学 ›› 2017, Vol. 25 ›› Issue (11): 151-157.doi: 10.16381/j.cnki.issn1003-207x.2017.11.016

• 论文 • 上一篇    下一篇

应急物流系统LRP的双层规划模型及算法

楼振凯   

  1. 北京理工大学管理与经济学院, 北京 100081
  • 收稿日期:2016-07-29 修回日期:2017-02-27 出版日期:2017-11-20 发布日期:2018-01-31
  • 通讯作者: 楼振凯(1989-),男(汉族),浙江浦江人,北京理工大学管理与经济学院博士生,研究方向:决策理论优化算法,E-mail:07224014@bjtu.edu.cn E-mail:07224014@bjtu.edu.cn

Bi-level Programming Model and Algorithmof Location-routing Problem in Emergency Logistics

LOU Zhen-kai   

  1. School of Management and Economics, Beijing Institute of Technology, Beijing 100081,China
  • Received:2016-07-29 Revised:2017-02-27 Online:2017-11-20 Published:2018-01-31

摘要: 针对洪涝、地震等自然灾害发生后的应急物流配送系统优化问题,考虑到政府和企业共同参与、分散决策的特点,建立了一个设施定位-运输路线问题(LRP)的双层规划模型,以应急物流系统消耗总时间最少为上层目标,以配送成本和时间惩罚成本之和最小为下层目标。根据该模型上下层独立决策而又相互影响的特点,设计了一种带启发式规则的两阶段混合模拟退火算法,一阶段禁忌搜索确定可行应急配送中心集合,贪婪就近原则构建初始解,交换编码搜索邻域可行解,记录并更新过程最优解,累加装卸和行驶时间并随最优解输出作为上层决策的依据。最后给出算例和对比算法,验证了模型的有效性和算法的可行性。

关键词: 应急物流, 设施定位-运输路线, 双层规划, 禁忌搜索, 模拟退火算法

Abstract: To optimize emergency logistics distribution system for natural disasters like floods and earthquakes, a bi-level programming model of location allocation-vehicle routing problem is set up by considering the characteristics that government and enterprises participate together but make decision separately. The upper level is to minimize the total time of emergency logistics system, and the lower level is to minimize the sum of distribution costs and time penalty cost. According to the characteristic of independent decision-making and interaction effect in upper and lower level in the model, the problem is broken up into two stages. In the first stage, viable gathers of distribution center are produced. In the second stage, vehicles and transport routes are arranged under viable gathers. A heuristic rule of two stage hybrid simulated annealing algorithm, one-phase tabu search,is designed to determine feasible emergency distribution center collections. The initial solution is construeted by principle of greedy proximity. Code is exchanged to search neighborhood feasible solution. The optimal solution is recorded and updated unloading and driving time is accumulated and output as the basis of the upper decision. Finally a numerical example and the comparing hybrid genetic algorithm are given to verify the validity of the model and the feasibility of the algorithm. A solution for emergency logistics system planning problem of multi-level decision is provided.

Key words: emergency logistics system, location allocation-vehicle routing, bi-level programming, tabu search, simulated annealing algorithm

中图分类号: