Vehicle Routing Problem of Two-way Search Nodes Based on Loading Constraints

LYU Xue-ju, NI Jing, MA Liang

Packaging Engineering ›› 2019 ›› Issue (19) : 245-250.

PDF(5296 KB)
PDF(5296 KB)
Packaging Engineering ›› 2019 ›› Issue (19) : 245-250. DOI: 10.19554/j.cnki.1001-3563.2019.19.036

Vehicle Routing Problem of Two-way Search Nodes Based on Loading Constraints

  • LYU Xue-ju, NI Jing, MA Liang
Author information +
History +

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.

Cite this article

Download Citations
LYU Xue-ju, NI Jing, MA Liang. Vehicle Routing Problem of Two-way Search Nodes Based on Loading Constraints[J]. Packaging Engineering. 2019(19): 245-250 https://doi.org/10.19554/j.cnki.1001-3563.2019.19.036
PDF(5296 KB)

Accesses

Citation

Detail

Sections
Recommended

/