有行驶里程限制的满载车辆调度问题
Vehicle Routing Problem with FullLoad and Driving Distance Restriction
-
摘要: 应用网络模型,对有行驶里程限制的多车场满载车辆的调度问题进行了探讨.将行驶里程限制约束转化 为目标约束,建立了该约束条件下的路径选择模型;设计了基于自然数编码求解该问题的遗传算法,并用实例进 行了验证.结果表明,该方法能有效地解决有行驶里程限制的满载车辆调度问题.Abstract: The graphmodelwas applied to solve the vehicle routing problem with full load (VRPFL) and a driving distance restriction. A route choicemodelwith a driving distance restriction was setup through transforming the driving distance restriction into the objective restriction. The genetic algorithm based on decimal codingwas given to solve theVRPFLwith a driving distance restriction and verified through an example. The result of the example shows the validity of thismethod to solve the VRPFL with a driving distance restriction.
点击查看大图
计量
- 文章访问数: 1468
- HTML全文浏览量: 65
- PDF下载量: 465
- 被引次数: 0