期刊文献+

随机存放点和体积下拣货路径问题研究

Picking Vehicle Routing Problem with Stochastic Depots and Cargo Volumes
在线阅读 下载PDF
导出
摘要 针对货物存放点和货物体积的不确定性,提出应用交叉熵法解决拣货车路径问题的方法,由于目标函数的复杂性,设计一种基于Monte-Carlo抽样求解路径期望距离的有效方法。为了提高标准交叉熵(CE)法的性能,设计了随分位值大小发生变化的更新Markov转移矩阵关键路径的自适应调整算法。计算结果验证了采用该方法解决此问题的鲁棒性和有效性。 In view of the uncertainty of the depot locations and cargo volume, the paper proposes an approach to the picking vehicle routing problem (PVRP) that effectively incorporates the cross-entrophy method and a Monte-Carlo-based sampling. To enhance the performanc of the standard cross-entrophy method, an adaptive adjustment scheme is developed for the crucial routes used to update Markov transition matrix in terms of the improvement level of quintiles. The subsequent computational study verifies the robustness and effectiveness of the approach for such problems.
出处 《物流技术》 2010年第5期67-69,73,共4页 Logistics Technology
关键词 拣货车路径 交叉熵法 随机存放点 体积 picking vehicle routing cross-entrophy stochastic depot volume
  • 相关文献

参考文献10

  • 1常发亮,刘增晓,辛征,刘冬冬.自动化立体仓库拣选作业路径优化问题研究[J].系统工程理论与实践,2007,27(2):139-143. 被引量:68
  • 2Roodbergen K J , De Koster R. Routing order-picker in a warehouse with a middle aisle [J]. European Journal of Operational Research, 2001, 133:32- 43.
  • 3田国会,张攀,尹建芹,路飞,宋孔杰.基于混合遗传算法的固定货架拣选优化问题研究[J].机械工程学报,2004,40(2):141-144. 被引量:42
  • 4于洁 苏志忠.蚁群算法在拣货路径中的应用研究.计算机知识和应用,2008,(2):466-467.
  • 5Boer D, Kroese D P, Mannor S, et al. A tutorial on the cross-entropy method [J].Annals of Operations Research, 2005,134(1): 19-67.
  • 6娄山佐,史忠科.基于交叉熵法解决随机用户和需求车辆路径问题[J].控制与决策,2007,22(1):7-10. 被引量:9
  • 7Ratliff H,Donald Rosenthal Amon S. order-picking in a rectangular warehouse. A solvable case of the traveling salesman problem [J].operations Research,1983,30(3):507-521.
  • 8Rubinstein R Y. The cross-entropy method for combinatorial and continuous optimization [J].Methodology and Computing in Applied Probability, 1999,1(2): 127-190.
  • 9Rubinstein R Y. The cross-entropy method for combinatorial and continuous optimization[J].Methodology and Computing in Applied Probability, 1999, 1(2): 127-19.
  • 10Guo Z G, Mak K L. A heuristic algorithm for the stochastic vehicle touting problems with soft time windows [A]. Proc of the 2004 Congress on Evolutionary[C].Computation,Portland, 2004:1449-1456.

二级参考文献20

  • 1田国会,张攀,李晓磊,尹建芹,路飞.一类仓库作业优化问题的混合遗传算法研究[J].系统仿真学报,2004,16(6):1198-1201. 被引量:21
  • 2商允伟 刘长有 田国会.神经网络在自动化立体仓库的一类作业优化中的应用[A].见:1996中国控制与决策学术年会.1996中国控制与决策学术年会论文集[C].济南,沈阳:东北大学出版社,1996.517~521.
  • 3Gendreau M,Laporte G,Seguin R.An exact algorithm for the vehicle routing problem with stochastic demands and customers[J].Trans Portation Science,1995,29(2):143-155.
  • 4Hjorring C,Holt J.New optimality cuts for a single-vehicle stochastic routing problem[J].Annals of Operations Research,1999,86:569-584.
  • 5Secomandi N.A rollout policy for the vehicle routing problem with stochastic demands[J].Operations Research,2001,49(5):796-802.
  • 6Teodorovic D,Pavkovic G.A simulated annealing technique approach to the vehicle routing problem in the case of stochastic demand[J].Transportation Planning and Technology,1992,16:261-270.
  • 7Gendreau M,Laporte G,Seguin R.A tabu search heuristic for the vehicle routing problem with stochastic demands and customers[J].Operations Research,1996,44(3):469-477.
  • 8Guo Z G,Mak K L.A heuristic algorithm for the stochastic vehicle routing problems with soft time windows[C].Proc of the 2004 Congress on Evolutionary Computation (CEC2004).Portland,2004:1449-1456.
  • 9Chepuri K,Homem-de-Mello T.Solving the vehicle routing problem with stochastic demands using the cross-entropy method[J].Annals of Operation Research,2005,134(1):153-181.
  • 10Rubinstein R Y.The cross-entropy method for combinatorial and continuous optimization[J].Methodology and Computing in Applied Probability,1999,1(2):127-190.

共引文献106

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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