| 摘要: |
| 目的 研究三维装箱约束的车辆路径问题，即在给定车辆中尽可能多地装入货物且保证车辆行驶路线最优。方法 提出基于双向搜寻路径节点规则的智能水滴节约算法来求解车辆路径问题，并采用基于虚拟组合块的启发式算法来求解装箱问题。结果 通过数值算例检验，混合算法使车厢的平均空间利用率达到了76.14%，并确定了最优行驶路线。结论 基于双向搜寻路径节点规则的智能水滴节约算法可找出最优的行驶路线，而基于虚拟组合块的启发式算法也能合理放置货物，得出较优的装载方案。 |
| 关键词: 三维装载 车辆路径 智能水滴算法 节约算法 启发式算法 |
| DOI：10.19554/j.cnki.1001-3563.2019.19.036 |
| 分类号:F570 |
| 基金项目: |
|
| Vehicle Routing Problem of Two-way Search Nodes Based on Loading Constraints |
|
LYU Xue-ju, NI Jing, MA Liang
|
|
University of Shanghai for Science and Technology, Shanghai 200093, China
|
| Abstract: |
| The work aims to study the 3L-CVRP, namely, loading as much cargo as possible in a given vehicle and ensuring optimal driving route. An intelligent water drop saving algorithm based on two-way search path node rule was proposed to solve the vehicle routing problem, and a heuristic algorithm based on virtual combination block was used to solve the packing problem. Through numerical examples, the hybrid algorithm made the average space utilization rate of the carriage reach 76.14%, and determined the optimal driving route. The intelligent water drop saving algorithm based on the two-way search path node rule can find the optimal driving route, and the heuristic algorithm based on the virtual combination block can also reasonably place the goods to obtain a better loading plan. |
| Key words: three-dimensional loading vehicle routing intelligent water drop algorithm saving algorithm heuristic algorithm |
