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

"选址-路线"问题的建模与算法研究
引用本文:张静,刘鲁,陈安. "选址-路线"问题的建模与算法研究[J]. 北京航空航天大学学报(社会科学版), 2002, 15(1): 33-37. DOI: 10.3969/j.issn.1008-2204.2002.01.008
作者姓名:张静  刘鲁  陈安
作者单位:北京航空航天大学,经济管理学院,北京,100083
基金项目:国家自然科学基金;NSFC-RGC7991061987;
摘    要:建立了"选址-路线"问题的数学模型,并且给出了求解问题的启发式算法.该启发式算法是基于改进的Clarke-Wright算法和旅行推销员问题.在账单递送的实际案例中,这种启发式算法,和传统手工方法相比,求解速度更快,同时降低了运作成本,减少了递送时间.

关 键 词:选址-路线  Clarke and Wright算法  案例研究
文章编号:1008-2204(2002)01-0033-05
修稿时间:2001-06-12

Modeling and Algorithm of Location-routing Problems
ZHANG Jing,LIU Lu,CHEN An. Modeling and Algorithm of Location-routing Problems[J]. Journal of Beijing University of Aeronautics and Astronautics(Social Sciences Edition), 2002, 15(1): 33-37. DOI: 10.3969/j.issn.1008-2204.2002.01.008
Authors:ZHANG Jing  LIU Lu  CHEN An
Abstract:A mathematical model to solve location-routing problem is worked out and the heuristic algorithm proposed with the latter based on TSP and Modified Clarke-Wright saving algorithm. In the case of bill delivery, the optimised heuristic algorithm, compared with the traditional method, can acquire satisfactory solutions more quickly with the lowering of the operating cost and saving of the delivery time.
Keywords:location-routing  Clarke and Wright algorithm  case study
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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