期刊文献+

计重收费政策下的货物权重车辆路径 被引量:1

Weighted vehicle routeing problem under toll-by-weight policy
下载PDF
导出
摘要 为提高物流效率、降低物流成本,在货物权重车辆路径问题(Weighted Vehicle RouteingProblem,WVRP)和计重收费问题研究的基础上,按照完全计重收费模式,建立以运输过程中总费用(包括固定费用、油耗费用和路桥费用)最小为目标函数的整数非线性规划优化模型.对实际算例,首先使用lingo软件求解精确解,然后利用粒子群优化(Particle Swarm Optimization,PSO)算法求解近似优化解,最后求解一般车辆路径问题模型并计算出相应的行驶总费用.3种结果的比较分析说明所提出的模型和用PSO算法求解的可行性和有效性.该模型可实现运输资源的优化配置,降低企业的物流成本. To improve logistics efficiency and reduce logistics cost,based on the study of Weighted Vehi-cle Routeing Problem(WVRP) and toll-by-weight problem,according to full toll-by-weight mode,an in-teger nonlinear programming optimization model is established in order to minimize the total cost(include fixed cost,fuel cost and roll cost) during the transport process.For the actual examples,the lingo soft-ware is firstly used to get the exact solutions,and then the Particle Swarm Optimization(PSO) algorithm is used to get the approximate optimal solution,finally the general vehicle routeing problem model is solved and the corresponding total cost of driving is calculated.Comparative analysis of the three kinds of results illustrates the feasibility and effectiveness of the proposed model and PSO algorithm.The method can realize the allocation optimization of transportation resources and reduce the enterprise’s logistics cost.
作者 吴思 丁以中
出处 《上海海事大学学报》 北大核心 2010年第3期22-26,共5页 Journal of Shanghai Maritime University
基金 国家高技术研究发展计划("八六三"计划)(2007AA04Z105)
关键词 车辆路径问题 货物权重 计重收费 粒子群优化算法 vehicle routeing problem cargo weight toll-by-weight particle swarm optimization algo-rithm
  • 相关文献

参考文献15

  • 1DANTZIG G B,RAMSER J H.The truck dispatching problem[J].Manage Sci,1959,6(1):80-91.
  • 2HO W,HO G T S,JI Ping,et al.A hybrid genetic algorithm for the multi-depot vehicle routing problem[J].Eng Applications of Artificial Intelligence,2008,21(4):548-557.
  • 3MONTAN F A T,GALVAO R D.A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service[J].Computers & Operations Res,2006,33(3):595-619.
  • 4TAVAKKOLI-MOGHADDAM R,SAFAEI N,GHOLIPOUR Y.A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length[J].Appl Math & Computation,2006,176(2):445-454.
  • 5BRANCHINI R M,ARMENTANO V A,LKKETANGEN A.Adaptive granular local search heuristic for a dynamic vehicle routing problem[J].Computers & Operations Res,2009,36(11):2955-2968.
  • 6NOVOA C,STORER R.An approximate dynamic programming approach for the vehicle routing problem with stochastic demands[J].Eur J Operational Res,2009,196(2):509-515.
  • 7HEMMELMAYR V C,DOERNER K F,HARTL R F.A variable neighborhood search heuristic for periodic routing problems[J].Eur J Operational Res,2009,195(3):791-802.
  • 8潘震东,唐加福,韩毅.带货物权重的车辆路径问题及遗传算法[J].管理科学学报,2007,10(3):23-29. 被引量:28
  • 9唐加福,孔媛,潘震东,董颖.基于划分的蚁群算法求解货物权重车辆路径问题[J].控制理论与应用,2008,25(4):699-702. 被引量:7
  • 10朱才华,何渝.带时间窗和货物权重的车辆路径问题的研究[J].北京工商大学学报(自然科学版),2009,27(4):61-64. 被引量:2

二级参考文献57

共引文献92

同被引文献6

引证文献1

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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