期刊文献+

基于动态规划的整车物流装载方案优化研究 被引量:3

Stuy on Optimization of Loading Plan in Vehicle Logistics Based on Dynamic Programming
下载PDF
导出
摘要 论文对整车物流中的乘用车装载问题进行了研究。以物流成本最小为目的,基于动态规划算法,首先对采用一种轿运车装载两种不同乘用车的方案进行优化,然后对采用两种轿运车的方案进行了分析,提出了一种基于矩阵运算的最小费用优化方法。最后通过一个算例验证了模型的可行性。 Passenger cars loading in vehicle logistics is studied in this paper. Based on dynamic programming, this study aims to minimize the costs of logistics. First, transport plan that passenger cars loading apply one kind of car transporter is optimized, then the plan using two kinds of car transporter is analyzed, finally a minimum costs optimization method based on matrix operation is proposed. The feasibility of the model is verified by an example in the end of the paper.
出处 《电脑知识与技术》 2014年第11X期8046-8050,共5页 Computer Knowledge and Technology
关键词 整车物流 乘用车装载 动态规划 优化 vehicle logistics passenger cars loading dynamic programming optimization
  • 相关文献

参考文献2

二级参考文献7

共引文献10

同被引文献16

  • 1陈建新,杨宇航,龚玲,曾鹏.两种准在线装箱算法[J].计算机工程,2006,32(13):4-5. 被引量:3
  • 2ChuckLam.Hadoop实战[M].北京:人民邮电出版社,2011:17-50.
  • 3Deardorff A.Local comparative advantage trade costs and the pattern of trade processed[D].Department of Economics,University of Michigan,Mimeo,2001.
  • 4ROLICH T. Testing of several overlapping optimization methods for bin-packing problem[C]. Information & Communication Tech- nology Electronics &Microelectronics (MIPRO), Opatija, 2013. Croatia: Hrvatska, 2013: 975-980.
  • 5COFFMAN E G, GAREY J M R, JOHNSON D S. Approxima- tion algorithms for bin packing:a survey[M]. Approximation Al- gorithms for NP-Hard Problems, Boston.. PSW publish, 1997.
  • 6ANIKA, GARG D. Parallelizing generalized one-dimensional bin packing problem using MapReduce[C]. 2014 IEEE International Conference on Advance Computing Conference (IACC), Gurgaon, 2014. India: ITM University India, 2014: 628-635.
  • 7LEAH EPSTEIN, LENE M,FAVRHOLDT, et al. Comparing on- line algorithms for bin packing problems[J]. Journal of Schedu- ling,2012.
  • 8LI LUO,YANG YOU. Surgical scheduling based on offline bin- packing [C]. Service Systems and Service Management (IC- SSSM), Shanghai, China, Economics& Management School, Tongji University, 2012: 491-494.
  • 9LEAH EPSTEIN, ROB VAN STEE. Optimal online algorithms for multidimensional packing problem[J]. SIAM Journal on Com- puting, 2005.
  • 10潘峰,陈杰,任智平,王光辉.基于计算智能方法的无人机任务指派约束优化模型研究[J].兵工学报,2009,30(12):1706-1713. 被引量:6

引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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