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

带时效性约束的物流中心选址研究
引用本文:龚延成,蔡团结.带时效性约束的物流中心选址研究[J].公路交通科技,2004,21(12):141-143.
作者姓名:龚延成  蔡团结
作者单位:1. 汽车管理学院车管系,安徽,蚌埠,233011
2. 交通部公路司,北京,100736
摘    要:论述设施选址的时效性约束问题,构造带时效性约束的物流中心选址模型,分析求解重心选址模型传统迭代算法的局限性,提出一种新的基于Matlab优化函数的精确算法,并给出算例,验证模型和新算法的可行性。模拟分析表明,基于Matlab函数的新算法,编程简单,功能强大,能够求解传统迭代算法无法求解的带时效性约束选址问题。

关 键 词:物流中心  选址模型  时效约束  优化算法
文章编号:1002-0268(2004)12-0141-03
修稿时间:2004年4月1日

Study of Logistics Center Location Problems with Time Restrains
GONG Yan-cheng,CAI Tuan-jie.Study of Logistics Center Location Problems with Time Restrains[J].Journal of Highway and Transportation Research and Development,2004,21(12):141-143.
Authors:GONG Yan-cheng  CAI Tuan-jie
Institution:GONG Yan-cheng~1,CAI Tuan-jie~2
Abstract:This article described the time restrictions on logistics center location selection,constructed a logistics location model with the time restrains,analyzed the limitations of traditional alternate algorithms that solves the gravity model,put forward a new exact algorithm to solve the model with the time restrains based on a Matlab optimal function,and used an example to demonstrate the model and the new algorithm.The results indicate that comparing with the traditional algorithm,the new algorithm based on the Matlab function is characteristic of simplicity with powerful capability,and can effectively solve the logistics center location problems with time restrictions.
Keywords:Logistics center  Location model  Time restrains  Optimal algorithms
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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