期刊文献+

库存路径问题的固定分区-整数比周期组合策略研究 被引量:3

A combined strategy of fixed-partition and integer-ratio for inventory routing problem
下载PDF
导出
摘要 针对供应商-物流中心-零售商组成的三层级系统的库存路径问题研究一种组合策略。各零售商对单品种货物的需求率固定,相互独立;物流中心从供应商批量进货,然后配送给零售商,不许缺货或延迟;目标是最小化系统库存及运输总成本。整合固定分区、整数比周期设计一种组合策略,构建了三层级系统的IRP数学模型,将三层级库存路径问题分解为两个子问题,借鉴车辆路径问题求解思路设计了启发式算法;试验结果表明,新策略的求解效率更好。 A combined strategy was proposed for the Inventory Routing Problem(IRP) in a three -echelon logis- tics system that consists of a vendor, a logistics center(LC) and multiple geographically dispersed retailers. In the system, each retailer requires a demmld at a deterministic, retailer - specific rate for a single type of prod- uct. Commodities were bought from suppliers in bulk by the LC, and then delivered to retailers whose demand is that there doesn't exist the occurrence of stockout and delay. The objective is to design a combined policy on transportation (routing) and inventory simultaneously for minimizing the system' s cost while meeting the demand of each retailer without shortage or delay. After discussing the characteristics of Integer - Ratio (IR) policy in inventory and Fixed -Pm^ition Policy (FPP) in routing,the model for the IRP system is proposed. The original problem was decomposed into two two - echelon IRPs, and the new heuristic algorithms were designed for the three -echelon IRP based on the thought of solving Vehicle Routing Problem. The computational testing results for a benchmark problem show that the new strategy is more efficient.
作者 傅成红 符卓
出处 《铁道科学与工程学报》 CAS CSCD 北大核心 2013年第6期103-108,共6页 Journal of Railway Science and Engineering
基金 国家自然科学基金资助项目(71271220) 福建省自然科学基金资助项目(2012D073) 福建工程学院校基金资助项目(GY-Z11046)
关键词 库存路径问题 组合策略 固定分区策略 订货周期 启发式算法 inventory routing problem combined strategy fixed - partition policy order interval heuristic algorithm
  • 相关文献

参考文献18

  • 1Hadi Mohammadi Bidhandi,Rosnah Mohd Yusuff. Integrated supply chain planning under uncertainty using an improved stochastic approach[J].{H}Applied Mathematical Modeling,2011,(35):2618-2630.
  • 2Anily S,Federgruen A. Two-echelon distribution systems with vehicle routing costs and central inventories[J].{H}Operations Research,1993,(41):37-47.
  • 3Gallego G,Simchi-Levi D. On the effectiveness of direct shipping strategy for the one warehouse multi-retailer R systems[J].{H}Management Science,1990,(36):240-243.
  • 4Anily S,Bramel J. An asymptotic 98.5% effective lower bound on fixed partition policies for the inventory routing problem[J].{H}Discrete Applied Mathematics,2004,(145):22-39.
  • 5Roundy R. 98%-effective integer-ratio lot-sizing for one-warehouse multi-retailers[J].{H}Management Science,1985,(31):1416-1430.
  • 6Lee F C,Yao M J. A global optimum search algorithm for the joint replenishment problem under power-of-two policy[J].{H}Computers & Operations Research,2003,(30):1319-1333.
  • 7Chu C L,Leon V J. Power-of-two single-warehouse multi-buyer inventory coordination with private information[J].Production Economics,2008,(111):562-574.
  • 8Hsiao Y C. Optimal single cycle policies for the onewarehouse multi-retailer inventory distribution system[J].{H}International Journal of Production Economics,2008,(114):219-229.
  • 9Abdul Jalbar B,Gutirrez J M,Sicilia J. Single cycle policies for the one-warehouse N-retailer inventory/distribution system[J].{H}OMEGA:The International Journal of Management Science,2006,(34):196-208.
  • 10Abdul-Jalbar B,Gutirrez J M,Sicilia J. Integer-ratio policies for distribution/inventory systems[J].{H}International Journal of Production Economics,2005,(93/94):407-415.

二级参考文献18

  • 1钟石泉,杜纲,贺国光.有时间窗的开放式车辆路径问题及其遗传算法[J].计算机工程与应用,2006,42(34):201-204. 被引量:24
  • 2符卓,聂靖.开放式车辆路径问题及其若干研究进展[C]∥中国运筹学会第八流会论文集.深圳:Global-Link出版社,2006:395-400.
  • 3Schrage L. Formulation and structure of more complex/realistic routing and scheduling problems[J]. Networks, 1981,11 :229 - 232.
  • 4Bodin L D, Golden B L, Assad A A, et al. Routing and scheduling of vehicles and crews: The state of the art [ J ]. Computers and Operations Research, 1983,10(2) :63 - 211.
  • 5Sariklis D, Powell S. A heuristic method for the open vehicle routing problem[J]. Journal of the Operational Research Society, 2000,51:564 - 573.
  • 6Brandao J. A tabu search algorithm for the open vehicle routing problem [ J ]. European Journal of Operational Research, 2004,157 : 552 - 564.
  • 7Fu Z, Eglese R, Li L. A new tabu search algorithm for the open vehicle routing problem [J]. Journal of the Operational Research Society, 2005,56(3) :267 - 274.
  • 8Fu Z, Eglese R, Li L. Corrigendum: A new tabu search algorithm for the open vehicle routing problem[J]. Journ,41 of the Operational Research Society,2006,57(8) : 1018 - 1018.
  • 9Tarantilis C, Ioannou G, Kiranoudis C. Solving the open vehicle routing problem via a single parameter metaheuristic algorithm [J]. Journal of the Operational Research Society,2005, 56(5) :588 - 596.
  • 10I~tchford A N, Lysgaard, Eglese R. A branch - and - cut algorithm for the capacitated open vehicle routing problem[J]. Journal of the Operational Research Society, 2006, doi: 10. 1057/palgrave. jors. 2602345.

共引文献17

同被引文献31

  • 1Ramkumar N, Subramanian P, Narendran TT, et al. Mixed integer linear programming model for multi-commodity multi- depot inventory routing problem [J]. OPSEARCH, 2012, 49 (4) : 413-429.
  • 2Archetti C, Bertazzi L, Hertz A, et al. A hybrid heuristic for an inventory routing problem [J]. Informs Journal on Compu- ting, 2012, 24 (1): 101-116.
  • 3Shukla N, Tiwari MK, Ceglarek D. Genetic-algorithms-based algorithm portfolio for inventory routing problem with stochastic demand [J]. International Journal of Production Research, 2013, 51 (1): 118-137.
  • 4SolyalI O, Surall H, Denizel M. The one-warehouse multire- railer problem with an order-up-to level inventory policy [J]. Naval ResearchLogistics, 2010, 57 (7): 653-666.
  • 5Coelho LC, Laporte G. The exact solution of several classes of inventory-routing problems [J]. Computers & Operations Re- search, 2013, 6 (6): 558-565.
  • 6Azuma RM, Coelho GP, Fernando J, et al. Evolutionary multi-objective optimization for the vendor-managed inventory routing problem[J].IEEE Congress on Evolutionary Compu- tation, 2011, 47 (10): 1457-1464.
  • 7Dror M,Ball M.Inventory/routing:reduction from an annual to a short-period problem[J].Naval Research Logistics,1987,34(6):891-905.
  • 8Archetti C,Bertazzi L,Hertz A,et al.A hybrid heuristic for an inventory routing problem[J].Informs Journal on Computing,2012,24(1):101-116.
  • 9Solyali O,Surali H,Denizel M.The one-warehouse multiretailer problem with an order-up-to level inventory policy[J].Naval Research Logistics,2010,57(7):653-666.
  • 10Shukla N,Tiwari M K,Ceglarek D.Genetic-algorithms-based algorithm portfolio for inventory routing problem with stochastic demand[J].International Journal of Production Research,2013,51(1):118-137.

引证文献3

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部