Sudoku topological graph-based material distribution method and system

Abstract

The invention discloses a Sudoku topological graph-based material distribution method and system, and belongs to the field of vehicle transportation. The method comprises the following steps: selecting a material distribution scheme, and converting a material distribution plane route map under the scheme into a plane topological graph; splitting the planar topological graph into different sudoku topological graphs; calculating the minimum cost of each sudoku topological graph; calculating the total transportation minimum cost of the scheme according to the minimum cost of each sudoku topological graph; the steps are repeated until the total transportation minimum cost of all the material distribution schemes is obtained; and in the total transportation minimum cost of the material distribution schemes, selecting the scheme with the minimum value to carry out material distribution. According to the method, the total transportation minimum cost of all the material distribution schemes is accurately and objectively calculated based on the Sudoku topological graph, and the method is used for selecting the material distribution schemes, so that the utilization rate of transport vehicles is improved, and the transportation cost is reduced.

Description

Technical Field

[0001] The present invention belongs to the field of vehicle transportation, and in particular, relates to a material distribution method and system based on a nine-square grid topological graph. Background Art

[0002] The material distribution method usually refers to: comprehensively considering the priority of materials required in different locations and the fairness of material distribution, based on a two-level supply chain from distribution point to demand point, and a three-level supply chain from distribution point to transfer station and then to demand point, studying the allocation problem in different locations and when material demand is different.

[0003] The comparative document (CN117910666A) provides an optimization method and system for the distribution of electric power materials based on Internet of Things technology, including: collecting the status of the transport vehicle and the location of each distribution node by deploying Internet of Things devices on the transport vehicle and each distribution node; allocating the distribution nodes to be visited by the transport vehicle based on the cargo information on the order, combined with the status of the transport vehicle and the location of each distribution node; based on the distribution nodes to be visited by the transport vehicle, combined with the distribution road condition information, determining the access order of the distribution nodes to be visited by the transport vehicle through an intelligent optimization algorithm, thereby obtaining the optimal distribution route. The present invention realizes real-time data collection and analysis based on Internet of Things technology, and optimizes the distribution route of electric power materials through an optimization algorithm to reduce distribution time and cost, and improve the reliability of the distribution process.

[0004] The above-mentioned reference documents mainly plan the delivery route based on the surrounding environment and vehicle status of the delivery route, and do not involve the consideration of delivery cost. To this end, the present invention proposes a material delivery method and system based on a nine-square topological map. Summary of the invention

[0005] The present invention aims to overcome the shortcomings of the prior art and proposes a material distribution method and system based on a nine-square grid topology map to achieve the following objectives: accurately and objectively calculate the total minimum transportation cost of all material distribution plans based on the nine-square grid topology map, which is used for material distribution plan selection, thereby improving the utilization rate of transportation vehicles and reducing transportation costs.

[0006] In order to achieve the above object, the technical solution adopted by the present invention is: a material distribution method based on a nine-grid topological map, the method comprising the following steps:

[0007] S1. Select a material distribution plan and convert the material distribution plan map under the plan into a plan topology map;

[0008] S2, splitting the plane topological graph into P different nine-square topological graphs;

[0009] S3, calculating the minimum cost of each nine-grid topology graph;

[0010] S4. Calculate the total minimum transportation cost of the solution according to the minimum cost of each nine-grid topology graph;

[0011] S5. Repeat steps S1-S4 until the total minimum transportation cost of all material distribution plans is obtained; among the total minimum transportation costs of the material distribution plans, select the plan with the minimum value for material distribution.

[0012] Preferably, in step S1, the contents of the material distribution planar route map, including distribution centers, customer points and roads, are represented by points and lines on the planar topology map, respectively.

[0013] Preferably, in step S2, each nine-grid topology diagram contains only one distribution center, that is, there is only one node representing the distribution center among the nine nodes of the nine-grid topology diagram.

[0014] Preferably, in step S3, for the t-th nine-grid topology graph, t=1, 2, 3, ..., P, the cost of each nine-grid topology graph is COST t , the cost includes the vehicle fixed cost C 1t and vehicle transportation cost C 2t ,in:

[0015]

[0016] In the formula, C 1t represents the fixed cost of all vehicles; f represents the fixed cost of each transport vehicle; C 2t represents the total transportation cost of all vehicles; h represents the transportation cost per unit vehicle per unit distance; i, j represent the nodes in the nine-square grid topology map that are customer points, i=0 or j=0 represents that the node is a distribution center; n represents the total number of nodes in the nine-square grid topology map that are customer points; x ijk The value of is 1 or 0, where: 1 means that transport vehicle k drives from node i to node j, and 0 means that transport vehicle k does not drive from node i to node j; m represents the total number of transport vehicles; k represents one of all transport vehicles; d ij represents the Manhattan distance between node i and node j;

[0017] Based on the above, establish the minimum cost objective function, namely: minCOST t =C 1t +C 2t , min represents the cost COST of the corresponding nine-grid topology graph t The minimum value of .

[0018] Preferably, in step S3, the objective function of minimum cost is solved using constraint conditions. The constraint conditions include:

[0019] (1) It is required that only one vehicle is allowed to be used for the delivery task to node i, that is:

[0020]

[0021] Among them, y ik The value of is 1 or 0, where: 1 means that the transport vehicle k performs the delivery task for node i, and 0 means that the transport vehicle k does not perform the delivery task for node i;

[0022] (2) Only one vehicle is allowed to travel from node i to node j, that is:

[0023]

[0024] (3) The weight of the cargo loaded by the kth transport vehicle during the delivery mission cannot exceed the maximum loading capacity of the vehicle, that is:

[0025]

[0026] Among them, ω i y ik represents the weight of the cargo loaded by the k-th transport vehicle when it performs the delivery task to node i; Q represents the maximum load capacity of the vehicle;

[0027] (4) During the delivery process, the number of delivery vehicles cannot exceed the total number of vehicles provided, that is:

[0028]

[0029] Preferably, in step S4, the total minimum transportation cost is obtained by adding the minimum cost of each nine-grid topological graph, that is:

[0030]

[0031] Among them, for the tth nine-grid topology graph, t = 1, 2, 3, ..., P, COST t Indicates the cost of each nine-grid topology diagram; min means taking the minimum value.

[0032] Preferably, the vehicle fixed cost C 1t Including labor costs and vehicle maintenance costs. The vehicle transportation cost C 2t Including the fuel costs and maintenance costs incurred by vehicles during delivery tasks.

[0033] At the same time, according to the above-mentioned method, the present invention also proposes a material distribution system based on a nine-square grid topology map, the system includes a graphic conversion module, a cost calculation module, and a selection module, wherein: the graphic conversion module is used to convert the material distribution plan route map into a plan topology map, and then split the plan topology map into P different nine-square grid topology maps; the cost calculation module is used to calculate the total minimum transportation cost of the material distribution plan according to the nine-square grid topology map; the selection module is used to select one from all material distribution plans for material distribution according to the total minimum transportation cost of all material distribution plans.

[0034] The technical effect of the present invention is as follows: the present invention uses the vehicle material transportation scheme in the actual background, takes the lowest distribution cost as the object of investigation, and calculates the vehicle fixed cost and vehicle transportation cost when there is only one distribution center in each nine-square topology map on the basis of converting the plane route map into multiple nine-square topology maps, and finally adds the minimum cost of each nine-square topology map to obtain the total minimum transportation cost, thereby realizing the accurate calculation of the minimum cost problem in a distribution scheme. Different nine-square topology maps can be divided according to different distribution routes, so as to facilitate the selection of the route with the lowest total cost according to the actual application situation. BRIEF DESCRIPTION OF THE DRAWINGS

[0035] Figure 1 This is a flow chart of a material distribution method based on a nine-square grid topology diagram according to an embodiment of the present invention;

[0036] Figure 2 This is a nine-square grid topology diagram of an embodiment of the present invention. DETAILED DESCRIPTION

[0037] The following is a further detailed description of the specific implementation of the present invention through the description of the embodiments with reference to the accompanying drawings, with the purpose of helping those skilled in the art to have a more complete, accurate and in-depth understanding of the inventive concept and technical solution of the present invention and to facilitate its implementation. In order to make the technical solution of the present invention clearer, the present invention is explained through the following embodiments:

[0038] In practical applications, the present invention can comprehensively and accurately calculate the minimum cost distribution plan for a route planning problem by using the nine-square grid topology diagram, thereby improving the utilization rate of transportation vehicles and reducing transportation costs.

[0039] Specifically, a material distribution method based on a nine-square grid topology graph, such as Figure 1 As shown, the method comprises the following steps:

[0040] S1. Multiple distribution centers and multiple customer points can be combined into multiple different material distribution plans. Select a material distribution plan and convert the material distribution plan map under the plan into a plan topology map. Correspondingly, the distribution centers, customer points and roads in the road map are represented by points and lines in the two-dimensional plane map. Usually, distribution centers and customer points are represented by points, and roads are represented by lines.

[0041] S2. Split the plane topology into P different nine-grid topology graphs. The nine-grid topology graph is shown as follows: Figure 2 As shown, in this embodiment, each nine-grid topology diagram contains only one distribution center, that is, among the nine nodes in the nine-grid topology diagram, only one node represents the distribution center, and the remaining nodes represent different meanings in different nine-grid topology diagrams (for example, a node can represent a customer point) or are not used. Figure 2 As shown, in a certain nine-square grid topology diagram of a certain material distribution plan, node 5 is used as the distribution center, node 8 is used as the customer point, and the corresponding distribution path is from node 5 to node 8. And so on, multiple similar nine-square grid topology diagrams constitute a complete material distribution plan.

[0042] S3. Calculate the minimum cost of each nine-grid topology. For the t-th nine-grid topology, t = 1, 2, 3, ..., P, the cost of the t-th nine-grid topology is expressed as COST t , where the cost includes vehicle fixed cost C 1t and vehicle transportation cost C 2t In this embodiment, the vehicle fixed costs include labor costs, vehicle maintenance costs, etc.; the vehicle transportation costs include the fuel costs and maintenance costs incurred by the vehicle in the delivery task link. Among them:

[0043]

[0044] In the formula, C 1t represents the fixed cost of all vehicles; f represents the fixed cost of each transport vehicle. In reality, there is no definite value to represent this cost, so f is used for comprehensive consideration; C 2t represents the total transportation cost of all vehicles; h represents the transportation cost per unit vehicle per unit distance; i, j represent the nodes in the nine-square grid topology map that are customer points, i=0 or j=0 represents that the node is a distribution center; n represents the total number of nodes in the nine-square grid topology map that are customer points; x ijk The value of is 1 or 0, where: 1 means that transport vehicle k drives from node i to node j, and 0 means that transport vehicle k does not drive from node i to node j; m represents the total number of transport vehicles; k represents one of all transport vehicles; d ij represents the Manhattan distance between node i and node j.

[0045] Based on the above assumptions and the description of various costs, the minimum cost objective function is established, namely: minCOST t =C 1t +C 2t , min represents the cost COST of the corresponding nine-grid topology graph t The minimum value of .

[0046] Furthermore, this embodiment also introduces constraints when solving the minimum cost objective function to more realistically simulate the actual material distribution situation and improve the accuracy and reliability of the minimum cost calculation. Specifically, the constraints of this embodiment include:

[0047] (1) It is required that only one vehicle is allowed to be used for the delivery task to node i, that is:

[0048]

[0049] Among them, y ik The value of is 1 or 0, where: 1 means that the transport vehicle k performs the delivery task for node i, and 0 means that the transport vehicle k does not perform the delivery task for node i;

[0050] (2) Only one vehicle is allowed to travel from node i to node j, that is:

[0051]

[0052] (3) The weight of the cargo loaded by the kth transport vehicle during the delivery mission cannot exceed the maximum loading capacity of the vehicle, that is:

[0053]

[0054] Among them, ω i y ik represents the weight of the cargo loaded by the k-th transport vehicle when it performs the delivery task to node i; Q represents the maximum load capacity of the vehicle;

[0055] (4) During the delivery process, the number of delivery vehicles cannot exceed the total number of vehicles provided, that is:

[0056]

[0057] S4. Calculate the total minimum transportation cost of the solution according to the minimum cost of each nine-grid topology map. In this embodiment, the total minimum transportation cost is obtained by adding the minimum cost of each nine-grid topology map, that is:

[0058]

[0059] Among them, for the tth nine-grid topology graph, t = 1, 2, 3, ..., P, COST t Represents the cost of the tth nine-grid topology graph; min represents the minimum value.

[0060] S5. Repeat steps S1-S4 until the total minimum transportation cost of all material distribution plans is obtained; among the total minimum transportation costs of the material distribution plans, select the plan with the minimum value for material distribution.

[0061] In the present invention, firstly, the relevant characteristics of the route map are considered, the route map is converted into a two-dimensional topological map, and then the two-dimensional topological map is split into a nine-grid topological map; secondly, the corresponding fixed cost of a vehicle with a distribution center and the vehicle transportation cost are calculated in each nine-grid topological map; finally, the constraint condition is used to solve the objective function of the minimum cost, and the result of each topological map is added to obtain the total minimum transportation cost of a material distribution plan, and then according to the total minimum transportation cost of all material distribution plans, the material distribution plan with the lowest cost can be selected. The present invention effectively reduces the difficulty of calculating the cost of the vehicle distribution problem, making the obtained minimum cost more accurate and reliable.

[0062] The method of the present invention can also be applied to other computational minimum cost problems such as vehicle path planning with capacity constraints, etc. The corresponding parameters in the construction of the nine-grid topology map can be set according to the specific actual environment.

[0063] In practical applications, the method of the present invention can be used to analyze the complexity of a roadmap, thereby selecting a model algorithm that is more suitable for the roadmap and more conveniently calculating the minimum cost.

[0064] Professionals may further realize that different algorithms may be used for each specific nine-grid topology graph to achieve the minimum cost calculation.

[0065] At the same time, according to the above-mentioned method, the present invention also proposes a material distribution system based on a nine-square grid topology map, the system includes a graphic conversion module, a cost calculation module, and a selection module, wherein: the graphic conversion module is used to convert the material distribution plan route map into a plan topology map, and then split the plan topology map into P different nine-square grid topology maps; the cost calculation module is used to calculate the total minimum transportation cost of the material distribution plan according to the nine-square grid topology map; the selection module is used to select one from all material distribution plans for material distribution according to the total minimum transportation cost of all material distribution plans.

[0066] The present invention is described above by way of example in conjunction with the accompanying drawings. Obviously, the specific implementation of the present invention is not limited to the above-mentioned methods. As long as various non-substantial improvements are made using the method concept and technical solution of the present invention; or the above concept and technical solution of the present invention are directly applied to other occasions without improvement, they are all within the protection scope of the present invention.

Claims

1. A material distribution method based on a nine-grid topological diagram, characterized in that: The method comprises the following steps: S1. Select a material distribution plan and convert the material distribution plan map under the plan into a plan topology map; S2, splitting the plane topological graph into P different nine-square topological graphs; S3, calculating the minimum cost of each nine-grid topology graph; S4. Calculate the total minimum transportation cost of the solution according to the minimum cost of each nine-grid topology graph; S5. Repeat steps S1-S4 until the total minimum transportation cost of all material distribution plans is obtained; among the total minimum transportation costs of the material distribution plans, select the plan with the minimum value for material distribution.

2. A material distribution method based on a nine-square grid topology diagram according to claim 1, characterized in that: In the step S1, the contents of the material distribution planar route map, including distribution centers, customer points and roads, are represented by points and lines on the planar topology map, respectively.

3. The material distribution method based on the nine-square grid topology diagram according to claim 1 is characterized in that: In step S2, each nine-grid topology diagram contains only one distribution center, that is, among the nine nodes of the nine-grid topology diagram, only one node represents the distribution center.

4. The material distribution method based on the nine-square grid topology diagram according to claim 1 is characterized in that: In step S3, for the t-th nine-grid topology graph, t=1, 2, 3, ..., P, the cost of the t-th nine-grid topology graph is COST t , the cost includes the vehicle fixed cost C 1t and vehicle transportation cost C 2t ,in: In the formula, C 1t represents the fixed cost of all vehicles; f represents the fixed cost of each transport vehicle; C 2t represents the total transportation cost of all vehicles; h represents the transportation cost per unit vehicle per unit distance; i, j represent the nodes in the nine-square grid topology map that are customer points, i=0 or j=0 represents that the node is a distribution center; n represents the total number of nodes in the nine-square grid topology map that are customer points; x ijk The value of is 1 or 0, where: 1 means that transport vehicle k drives from node i to node j, and 0 means that transport vehicle k does not drive from node i to node j; m represents the total number of transport vehicles; k represents one of all transport vehicles; d ij represents the Manhattan distance between node i and node j; Based on the above, establish the minimum cost objective function, namely: minCOST t =C 1t +C 2t , min represents the cost COST of the corresponding nine-grid topology graph t The minimum value of .

5. A material distribution method based on a nine-square grid topology diagram according to claim 4, characterized in that: In step S3, the constraint conditions are used to solve the minimum cost objective function.

6. A material distribution method based on a nine-square grid topology diagram according to claim 5, characterized in that: The constraints include: (1) It is required that only one vehicle is allowed to be used for the delivery task to node i, that is: Among them, y ik The value of is 1 or 0, where: 1 means that the transport vehicle k performs the delivery task for node i, and 0 means that the transport vehicle k does not perform the delivery task for node i; (2) Only one vehicle is allowed to travel from node i to node j, that is: (3) The weight of the cargo loaded by the kth transport vehicle during the delivery mission cannot exceed the maximum loading capacity of the vehicle, that is: Among them, ω i y ik represents the weight of the cargo loaded by the k-th transport vehicle when it performs the delivery task to node i; Q represents the maximum load capacity of the vehicle; (4) During the delivery process, the number of delivery vehicles cannot exceed the total number of vehicles provided, that is:

7. A material distribution method based on a nine-square grid topology diagram according to claim 1 or 4, characterized in that: In step S4, the total minimum transportation cost is obtained by adding the minimum cost of each nine-grid topology graph, that is: Among them, for the tth nine-grid topology graph, t = 1, 2, 3, ..., P, COST t Represents the cost of the tth nine-grid topology graph; min represents the minimum value.

8. A material distribution method based on a nine-square grid topology diagram according to claim 4 or 5, characterized in that: The vehicle fixed cost C 1t Including labor costs and vehicle maintenance costs.

9. A material distribution method based on a nine-square grid topology diagram according to claim 4 or 5, characterized in that: The vehicle transportation cost C 2t Including the fuel costs and maintenance costs incurred by vehicles during delivery tasks.

10. A material distribution system based on a nine-square grid topology map according to any one of claims 1 to 9, characterized in that: The system includes a graphic conversion module, a cost calculation module, and a selection module, wherein: the graphic conversion module is used to convert the material distribution plan route map into a plan topology map, and then split the plan topology map into P different nine-square grid topology maps; the cost calculation module is used to calculate the total minimum transportation cost of the material distribution plan according to the nine-square grid topology map; the selection module is used to select one from all material distribution plans for material distribution according to the total minimum transportation cost of all material distribution plans.

Images