节点文献
有行驶里程限制的满载车辆调度问题
Vehicle Routing Problem with Full Load and Driving Distance Restriction
【摘要】 应用网络模型,对有行驶里程限制的多车场满载车辆的调度问题进行了探讨.将行驶里程限制约束转化为目标约束,建立了该约束条件下的路径选择模型;设计了基于自然数编码求解该问题的遗传算法,并用实例进行了验证.结果表明,该方法能有效地解决有行驶里程限制的满载车辆调度问题.
【Abstract】 The graph model was applied to solve the vehicle routing problem with full load (VRPFL) and a driving distance restriction.A route choice model with a driving distance restriction was set up through transforming the driving distance restriction into the objective restriction.The genetic algorithm based on decimal coding was given to solve the VRPFL with a driving distance restriction and verified through an example.The result of the example shows the validity of this method to solve the VRPFL with a driving distance restriction.
【关键词】 满载车辆调度问题;
遗传算法;
网络模型;
行驶里程;
【Key words】 vehicle routing problem with full load; genetic algorithm; graph model; driving distance;
【Key words】 vehicle routing problem with full load; genetic algorithm; graph model; driving distance;
【基金】 国家自然科学基金资助项目(79700019,70271022)
- 【文献出处】 西南交通大学学报 ,Journal of Southwest Jiaotong University , 编辑部邮箱 ,2005年06期
- 【分类号】U492
- 【被引频次】29
- 【下载频次】377