Collaborative vehicle path optimization method based on shared carrier and shared warehouse
A technology of vehicle routing and optimization methods, applied in the field of logistics, which can solve the problems of single target, neglect of transportation plans, and neglect of bilateral cooperation on the supply side and demand side.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0153] As an example with two carriers and four warehouses, Figure 4 (a) A transport scheme solution for this example is given. Figure 4 (b) The transportation scheme solution based on matrix representation is given. Such as Figure 4 As shown in (b), the first row in the carrier coordination matrix shows that the goods delivered by carrier A to warehouse 1 are delivered by carrier A itself, and the goods delivered by carrier A to warehouse 2 and warehouse 4 are delivered by carrier B , warehouse 3 has no cargo demand for carrier A. Likewise, the second row in the carrier coordination matrix represents the shipment by carrier B.
[0154] The first row in the warehouse coordination matrix indicates that warehouse 1 and warehouse 2’s cargo demand for carrier A is delivered to warehouse 2, warehouse 4’s cargo demand for carrier A is delivered to warehouse 3, and warehouse 3 has no cargo for carrier need. Similarly, the second row in the warehouse coordination matrix repres...
Embodiment 2
[0174] Such as Figure 5 As shown, the solution of two carriers and six warehouses is taken as an example. First, split a carrier vector into two vectors of zeros and non-zeros, keeping the relative positions of these elements unchanged. This splitting guarantees that the position of the zeros is fixed (see splitting stages). Then, a reallocation operation is taken on the non-zero vector and a new non-zero vector is produced (see reallocation phase). Finally, the new non-zero and zero vectors are combined into a complete vector according to their relative positions (see combine phase). Perform the reallocation sub-operation on another carrier in a similar manner, and the solution after the reallocation operation is obtained after completion.
[0175] Although the exchange sub-operation and reallocation sub-operation included in the vibration operation can generate new solutions, the solution space is not large enough because the elements that make up each carrier, warehouse...
Embodiment 3
[0212] Select two groups of experimental cases. The first group contains 12 experimental cases, numbered #1001 to #1012. All warehouses in this group of cases are randomly distributed within 100 square meters. The second group also contains 12 experimental cases, numbered from #2001 to #2012, and the warehouses in this group of cases are generated by clustering. The number of clusters in the second group of cases is set to 3 or 5, and within each class, the distance between any two warehouses is less than 15.
[0213] In two sets of cases, the number of warehouses is set to be 10, 15, 20, 25, 30 or 100; the vehicle loading capacity is 100, 200, 1000 or 2000; and the warehouse storage capacity is 200, 300, 2000 or 3000. Each case contains two carriers. Compared with the traditional shared customer collaborative vehicle routing model SCC-VRP model, the CVRP-SCD model of this embodiment adds some new objectives, such as transit time, service quality and service reliability, ther...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More