粮食物流车辆路径问题的混合粒子群算法  

RESEARCH ON HYBRID PARTICLE SWARM OPTIMISATION FOR GRAIN LOGISTICS VEHICLE ROUTING PROBLEM

作　　者：葛宏义[1] 甄彤[1] 车毅[2] 蒋玉英[1] 

机构地区：[1]河南工业大学,河南郑州450001 [2]安徽审计职业学院,安徽合肥230601

出　　处：《计算机应用与软件》2011年第7期69-71,151,共4页Computer Applications and Software

基　　金："十一五"国家科技支撑计划重点项目(2008BADA8B03;2006BAD08B01);河南省高校新世纪优秀人才支持计划(2006HANCET-15)

摘　　要：研究粮食物流运输车辆路径问题。针对粮食物流过程批量大、点多、面广等特点,引入模拟退火思想,将粒子群优化算法与模拟退火算法结合,提出一种求解粮食物流车辆路径问题的混合粒子群算法。仿真结果表明,该算法可以快速地求得带时间窗的粮食物流车辆路径问题的优化解,进而降低粮食物流配送成本。The vehicle routing problem of grain logistics transportation is studied.Considering the characteristics of grain logistics process that it has large batch and widespread distribution,a hybrid algorithm of particle swarm optimisation（PSO） for solving grain logistics vehicle routing problem（VRP） is proposed,which integrates the PSO with simulated annealing（SA） algorithm by introducing SA conception.Simulation results indicate that the hybrid algorithm of PSO can find the optimal solution of grain logistics VRP with time window quickly,therefore the cost of grain distribution is reduced.

关 键 词：粮食物流 模拟退火算法 粒子群算法 优化 车辆路径问题 

分 类 号：O29[理学—应用数学]