用户名: 密码: 验证码:
物流系统库存—路径问题集成优化模型及算法研究
详细信息    本馆镜像全文|  推荐本文 |  |   获取CNKI官网全文
摘要
现代物流的核心就是通过对物流系统中的各种资源进行集成优化,从而降低整个物流系统的总成本。物流系统集成优化主要包括物流节点选址策略、库存控制策略以及运输调度策略这三个方面。虽然这三者之间存在效益背反关系,但如果把其中任意两者或三者统筹考虑,从大系统角度进行集成建模,利用相关智能算法求解,就能找到满足实际系统优化要求的均衡点,满足企业现代物流运作的要求。
     2009年我国社会物流的总费用6.08万亿元,其中运输费用3.36万亿元,管理费用0.72万亿元,保管费用2万亿元,运输费和保管费之和占总物流费用的三分之二以上,因此,降低运输成本和库存成本是减少物流系统总成本的关键。
     本文重点研究物流系统中库存-路径集成优化问题的系统模型、算法设计和仿真,同时拓展研究物流系统集成优化方面其他问题的流程设计以及模型建立等问题,具体研究内容包括:
     首先,从费用的角度阐述运输与库存这两个环节在整个物流系统中的重要性,总结国内外学者对这两方面内容集成优化问题的研究并进行分类。
     第二,介绍物流系统集成优化的基本理论,主要包括供应商管理库存(VMI)、库存控制策略、运输调度策略以及物流节点选址策略;同时还介绍了库存-路径问题、选址-库存问题、选址-路径问题、选址-库存-路径问题的概念,并建立一对多结构的配送结构网络体系的数学模型。
     第三,应用博弈论的思想对库存-路径集成优化问题进行博弈分析,介绍双层规划模型的相关知识以及提出本文IRP模型的假设条件和相关符号的定义,最后利用双层规划模型建立以物流系统总费用最小为目标函数的一对多物流系统下的库存路径集成优化模型。
     第四,提出利用预测法和迭代法的混合模型求解上层模型的Q值;再对配送区域划分时圈,利用混合智能算法求解同一时圈内的车辆路径问题,把结果反馈给上层模型进行调整。最后利用Matlab语言进行编程求解。
     最后,利用本文提出的时圈划分模型把杭州烟草配送中心的配送区域分成5个时圈,以杭州烟草配送中心的一个30分钟时圈范围为例,利用本文提出的模型、算法以及程序对该时圈内的零售户配送问题进行仿真研究。结果验证了算法和模型的实用性,为杭州烟草配送中心关于库存路径集成优化规划的实践提供理论依据和方法指导。
Through integrating and optimizing various resources to reduce the cost of total logistics systems, which is the core of modern logistics systems. Logistics systems integrated optimizations include three aspects logistics node location strategy, inventory control strategy, transport scheduling strategy. The relationships of them is back-efficiency, but if we establish the mathematical model from the perspective of large-scale systems about arbitrariness two of them or all three, use correlative intelligence algorithm to solve, can find the equilibrium point which meets the requirements to the actual system optimization, meet the requirements of modern logistics system planning.
     In China, the total cost of logistics was 6.08 trillion Yuan in the year of 2009. From the composition of logistics costs, transportation costs was 3.36 trillion Yuan, management fee was 0.72 trillion Yuan, inventory costs was 2 trillion Yuan. This showed that the sum of transportation costs and inventory costs was about two-thirds of the total cost of logistics, which means reducing the transportation costs and inventory costs is the key operation to reduce the total cost of logistics.
     This paper focuses on the research of the system model, algorithm design, and simulation about inventory-Routing problem. Expanding the research of process design and establish mathematical model on other issues about integrated optimization of logistics systems, specific research includes:
     First, through the angle of transportation costs, analyzing the importance of transportation and inventory. In the same time, this paper summarizes the contents of inventory-Routing problem.
     Second, this paper introduces the basic theory about integrated optimization of logistics systems. It includes vendor managed inventory (VMI), inventory control strategy, transport scheduling strategy, logistics node location strategy. In the same time, this paper introduced the concept of inventory-routing problem, location-routing problem, location-routing problem, and location-inventory-routing; established the mathematical model about the structure of one to many network systems.
     Third, this paper uses the knowledge of game theory to analyze the inventory-Routing integrated optimization problem, introduce the relevant knowledge to the bi-level programming model, assumption conditions and the related definition of symbols. This paper uses bi-level programming model to establish the model of inventory-Routing integrated optimization problem in the logistics system, the aim is minimize of the total cost of logistics system.
     Then, It proposed the mixed model using prediction method and the iterative method to solute the value of Q. however, we carved up the distribution areas, using mixed intelligence algorithm to solve the vehicle routing problem, putting the result back to the top model for the adjustment. Finally, we use the mat lab programming language to solve them.
     Finally, this paper used the model divide the distribution areas of Hang Zhou tobacco distribution center into five. We take a 30-minute circle for example, using the model, algorithm and program of this paper to simulate inventory-Routing integrated optimization problem of Hang Zhou tobacco distribution center. The results demonstrate the practicality of the algorithm and model; provide the theoretical basis and practical method of guidance to the inventory-Routing integrated optimization problem of Hang Zhou tobacco distribution center.
引文
[1]齐二石.物流系统规划设计方法综述[J].天津大学学报,2003.
    [2]范玉顺.物流系统集成规划模型及优化算法研究[D].沈阳:中国科学研究生院,2006.
    [3]Bell WJ, Dalberto LM, Fisher ML, Greenfield AJ, Jaikumar R, Kedia P, Mack RG, Prutzman PJ. Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer [J]. Interfaces,1983,13:4-23.
    [4]Golden B, Assad A, Dahl R. Analysis of a large scale vehicle routing problem with an inventory component [J]. Operation Research,1984, (7):181-190.
    [5]Blumenfeld D.E, Burn L.D.Reducing logistics costs at General Motors [J]. Interfaces,1987, 17(1):26-47.
    [6]Harris F W. How many parts to make at once [J]. Opertions Research,1990,38:947-950.
    [7]Federgruen, A, Zipkin P. A combined vehicle routing and inventory allocation problem [J]. Operations Research,1984,32(5):1019-1037.
    [8]Daganzo C F, Newell G F. Physical Distribution from a Warehouse:Vehicle Coverage and Inventory Levels [J].Transportation Research,1985,19B:397-407.
    [9]Daganzo C F. A Comparison of In-vehicle and Out-of-vehicle Freight Consolidation Strategies [J]. Transportation Research,1988,22B:173-180.
    [10]Anily A, Federgruen A.One warehouse multipleretailersystems with vehiclerouting costs[J]. Management Science,1990,36:92-114.
    [11]Trudeau P, Dror M. Stochastic inventory routing:rout design with stockouts and route failures [J]. Annals of Operations Research,1992,26(3):171-175.
    [12]Ernst R, Pyke D F. Optimal base stock policies and truck capacity in a two-wchelon system [J]. Naval Research Logistics,1993,40:879-903.
    [13]Chandra P, Fisher L. Coordination of production and distribution planning [J]. European Journal of Operational Research,1994,72:503-517.
    [14]Speranza M G, Ukovich W. Minimizing transportation and inventory costs for several products on a singlelink [J].Operations Research,1994,42:879-894.
    [15]Burns L D. Hall R W. Distribution Strategies that Minimize Transportation and Inventory Costs [J]. Operation Research.1995,33:469-490.
    [16]Daganzo C F. Logistics System Analysis [M]. Springer-Varlag,1996.
    [17]Viswanathan S, Mathur K. Integrating routing and inventory decisions in one-warehouse multiretailer multiproduct distribution systems [J].Management Science,1997,43:294-312.
    [18]Bertazzi L. Speranza M. G, Ukovich W. Minimization of logistics costs with given frequencies [J]. Transportation Research.1997,31:327-340.
    [19]Chen F, Zhen Y.Near-optimal echelon-stock (R, nQ) policies in multistage serial systems [J]. Operations Research,1998,46:592-602.
    [20]Pryor K. The trade off between transportation and inventory costs in point-to-point truckload scenarios [J]. Industrial and Operations Engineering, the University of Michigan,1999.
    [21]Berman O, Larson R C. Deliveries in an inventory routing problem using stochastic dynamic programming[J].Transportation Science,2001,35(2):192-213.
    [22]Kleywegt A J, Nori V S, Savelsbergh M W P. The stochastic inventory routing problem with direct deliveries [J]. Transportation Science,2002,36(1):94-118.
    [23]Adelman D. Price-directed replenishment of subsets:Methodology and its application to inventory routing [J]. Manufacturing Service Operation Management,2003,5(4):348-371.
    [24]Adelman D. A Price-directed approach to stochastic inventory routing [J]. Operations Reserach,2004,52(4):499-514.
    [25]Campbell A, Savelsbergh M. A decomposition approach for the inventory routing problem [J]. Transportation Science,2004,39(4):488-502.
    [26]Giesen R, Mahmassani H S, Jaillet P. Strategies for on-line inventory routing problem under real-time information [R]. Washington:Transportation Research Board Business Office, 2005.
    [27]Giesen R. On-line inventory replenishment and fleet routing decisions under real-time information [D]. Maryland:University of Maryland,2007.
    [28]Jaeheon Jung, Kamlesh Mathur. An Efficient Heuristic Algorithm for a Two-Echelon Joint Inventory and Routing Problem [J].Transportation Science,2007.
    [29]叶志坚,杜文,王清荣等.供应商管理库存系统中库存和运输计划整合[J].交通运输系统工程与信息,2003,3(4):82-88.
    [30]杜文,袁庆达,周再玲.一类随机库存-运输联合优化问题求解过程分析[J].中国公路学 报,2004,17(1):114-118.
    [31]刘立辉,钱燕云.一对多配送网络中ITIO问题的建模与算法研究[J].公路交通科技,2006,23(10):136-141.
    [32]朱晨波,叶耀华,戴锡.直接配送的三层随机库存路径问题[J].系统工程理论与实践,2007,27(12):16-22.
    [33]孙茂,李文年,周永务.基于确定需求的作业层库存路径问题研究[J].计算机集成制造系统,2008,14(2):341-348.
    [34]胡晓宇.基于遗传算法的库存控制与运输决策联合优化问题研究[D].山东大学硕士学位论文,2008.
    [35]雷邦军.模糊环境下库存与运输整合优化问题研究[J].北京工商大学学报,2008,26(6):63-67.
    [36]谢小良.基于VMI的随机需求库存-运输整合优化模型与算法[J].湖南师范大学自然科学学报,2009,32(1):51-55.
    [37]李世殉,朱忠平,王亮,孙绍荣.运输决策与库存控制整合优化研究综述[J].青岛理工大学学报,2006,27(3):126-130.
    [38]曹勇,李岭.运输库存集成优化问题研究[J].中国市场,2009.
    [39]刘立辉,叶春明.库存路径问题的研究综述[J].工业工程,2009,125-127.
    [40]吴承健、彭建良.运输与仓储技术[M].中国物资出版社.2008
    [41]邹谷山、蔡延光等.运输调度问题的现状与发展方向[J].城市交通,2005,3(1):47-50.
    [42]采峰.现代企业物流[M].东北财经大学出版社.2005.
    [43]朱耀祥.设施规划与物流[M].机械工业出版社.2004.
    [44]Wei He, Zi-xia Chen. Demand forecast and analysis for Hang Zhou food cold chain logistics. Proceedings of 2009 conference on systems science, management science & system dynamics, volume 2:225-228.
    [45]袁庆达、游斌.运输-库存联合优化问题简介[J].物流技术.2001,9-11.
    [46]陈伟、许天芳.库存管理与车辆路线优化研究[D].大连海事大学硕士学位论文,2004.
    [47]秦绪伟,范玉顺,尹朝万.随机需求下的选址-库存配送系统集成规划模型及算法[J].控制理论与应用,2006,23(6):853-860.
    [48]王檑,赵晓波.随机需求下选址-库存问题[J].控制理论与应用,2008,17(3):1-6.
    [49]程赐胜,蒲云虎,吴颖.集成化物流选址-路径问题优化模型的算法研究[J].中南林业科技大 学学报,2008,28(5):113-118.
    [50]闻轶.随机物流选址和车辆路径问题综合优化的研究[D].北京交通大学硕士学位论文,2006.
    [51]丁原祖.物流配送中心选址与路径问题的模型研究[J].经济师,2010.
    [52]贺协腾.选址-路径问题及其优化算法综述[J].中国新技术新产品,2009,18:13.
    [53]严曙,刘心报.基于群体决策的库存选址-路径选择模型研究[J].合肥学院学报,2009,19(4):47-50.
    [54]崔广彬,李一军.基于双层规划的物流系统集成定位-运输路线安排-库存问题研究[J].系统工程理论与实践,2007:49-55.
    [55]李华俊.逆向物流系统优化中的定位-路径-库存问题研究[D].西南交通大学硕士学位论文,2008.
    [56]吴金男,刘蓓蕾.供应链战略合作伙伴关系的博弈分析[J].物流技术,2004,46-47.
    [57]金志扬等.现代物流系统中库存-运输联合优化的博弈分析[J].物流技术,2005,284-286.
    [58]王建忠.供应链管理中的双层优化模型与方法研究[D].天津大学硕士学位论文,2006.
    [59]周蕾.物流规划中的双层优化模型与方法研究[D].天津大学硕士学位论文,2007.
    [60]孙惠.物流中心选址的双层优化模型与算法研究[D].山东师范大学硕士学位论文,2009.
    [61]周爱民,谭春桥.双层规划模型及其算法研究综述[J].零陵学院学报,2005,26(2):133-137.
    [62]赵晓飞.库存控制与运输管理的整合优化研究[D].西南交通大学硕士学位论文,2008.
    [63]刘进全.模糊库存运输联合优化极其智能算法[D].南京理工大学硕士学位论文,2007.
    [64]于涛.VMI下库存管理与运输调度整合优化研究[D].同济大学硕士学位论文,2008.
    [65]赵泽舟.库存与运输系统的集成优化研究[D].福建农林大学硕士学位论文,2009.
    [66]王小明.遗传算法——理论、应用与软件实现[M].西安:西安交通大学出版社,2002.
    [67]孙中悦,关忠良,郭春芳.基于改进自适应遗传算法的车辆路径问题研究[J].技术与方法,2009,28(11):83-86.
    [68]赵建平.遗传算法和模拟退火算法在车辆线路问题上的研究与应用[D].长春理工大学硕士学位论文,2008.
    [69]李金屏,何苗,杨波.遗传算法平均截止代数和成功率与种群规模之间的关系[J].系统仿真学报,2001,28(z1):206-210.
    [70]唐世浩,朱启疆.遗传算法中初始种群与交叉、变异率对解得影响及其解决方案[J].科技通报,2001,17(3):1-7.
    [71]华冬冬,李旭.车辆路径问题的改进遗传算法研究[J].山东建筑工程学院学报,2006,21(2):148-150.
    [72]刘海,郝志峰,林智勇.改进遗传交叉算子求解TSP问题[J].华南理工大学学报,2002,30(12):71-73.
    [73]胡大伟等.车辆路径问题的模拟退火算法[J].中国公路学报,2006,19(4):123-126.
    [74]王银年,葛洪伟.求解TSP问题的改进模拟退火遗传算法[J].计算机工程与应用,2010,46(5):44-47.
    [75]陈子侠.配送线路划分与电子排单系统建模与算法研究[D].上海交通大学博士学位论文,2007.
    [76]陈子侠,蒋长兵.杭烟物流送货线路的划分模型与算法研究[J].系统工程理论与实践,2004,3:46-51.
    [77]陈子侠.城市卷烟配送线路的网格划分算法[J].上海交通大学学报,2003,37(7):1013-1017.
    [78]陈子侠,方祖英,陈颢,王光明.杭烟物流与送货线路优化[J].物流技术,2003,8:38-40.
    [79]陈子侠,叶庆泰.基于城市配送的单车线路算法研究[J].计算机工程,2005,11:32-35.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700