Logistics scheme planning method, device, equipment and medium

Abstract

The application provides a logistics scheme planning method, device, equipment and medium; the method comprises the following steps: acquiring transportation demand information and site information of each site in a logistics network corresponding to the transportation demand information; inputting the transportation demand information and the site information of each site into a preset logistics planning model to obtain an initial solution; adjusting a transportation demand parameter according to a preset local search strategy, processing the adjusted transportation demand parameter through the preset logistics planning model to iteratively update the initial solution, and obtaining an updated solution; if the updated solution meets a preset planning condition, obtaining a target transportation demand parameter corresponding to the updated solution, and outputting a logistics planning scheme corresponding to the target transportation demand parameter; in the embodiment of the application, the preset logistics planning model considers the vehicle parking space limitation and the cargo handling capacity of each site, minimizes the total cost including the vehicle transportation cost and the site handling cost, and makes the logistics planning scheme corresponding to the logistics network line and the vehicle arrangement more accurate and efficient.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of logistics, in particular to a logistics scheme planning method, device, equipment and medium. BACKGROUND

[0002] With the rapid development of society, the demand for logistics is increasing, and the logistics network line and vehicle arrangement planning in the logistics scheme will affect the logistics efficiency and logistics cost.

[0003] Logistics scheme planning refers to: under the known space-time connection relationship between sites and customer transportation demand in the logistics network, meeting the constraint conditions such as transportation time limit and vehicle load limit, selecting appropriate transportation path for transportation demand and reasonably arranging vehicles between site shifts, so that the total cost including vehicle transportation cost and site cargo handling cost is low. Because the current logistics network is complex and the transportation demand is large, it is difficult to obtain a reasonable logistics network line and vehicle arrangement planning scheme. How to plan the logistics network line and vehicle arrangement while meeting the transportation demand and ensuring that the total cost of vehicle transportation cost and site cargo handling cost is low has become a technical problem to be solved. SUMMARY

[0004] The present application provides a logistics scheme planning method, device, equipment and medium, aiming to solve the technical problems that the existing logistics scheme planning cannot guarantee the lowest cost of the planning scheme, the logistics scheme planning is relatively complex, and it does not have real-time and flexibility.

[0005] In one aspect, the present application provides a logistics scheme planning method, comprising:

[0006] Obtaining transportation demand information and site information corresponding to each site in the logistics network of the transportation demand information;

[0007] Inputting the transportation demand information and the site information of each site into a preset logistics planning model to obtain an initial solution;

[0008] Adjusting the transportation demand parameter according to a preset local search strategy, processing the adjusted transportation demand parameter through the preset logistics planning model to iteratively update the initial solution, and obtaining an updated solution;

[0009] If the updated solution meets a preset planning condition, obtaining a logistics planning scheme corresponding to the updated solution.

[0010] In some embodiments of the present application, before the transportation demand information and the site information of each site are inputted into the preset logistics planning model to obtain the initial solution, the method comprises:

[0011] receive a model construction instruction, obtain site information of each site in a logistics network, and obtain a plurality of transportation demand information in a historical time period;

[0012] generate a site path according to the site information of each site in the logistics network and the plurality of transportation demand information;

[0013] generate a shift path according to the site path, the site information of each site, and the vehicle travel time between each site;

[0014] screen each shift path according to the transportation time limit in each transportation demand information to obtain a feasible path set;

[0015] construct a preset logistics planning model according to the transportation proportion of each path in the feasible path set, the allocation information of vehicle parking spaces in each site shift, and the arrangement information of vehicles between each pair of site shifts.

[0016] In some embodiments of the present application, the construction of the preset logistics planning model according to the transportation proportion of each path in the feasible path set, the allocation information of vehicle parking spaces in each site shift, and the arrangement information of vehicles between each pair of site shifts includes:

[0017] set a constraint condition according to the transportation proportion of each path in the feasible path set, the allocation information of vehicle parking spaces in each site shift, and the arrangement information of vehicles between each pair of site shifts;

[0018] set a target function according to the constraint condition, the vehicle transportation cost, and the site transfer processing cost, encapsulate the constraint condition and the target function, and obtain the preset logistics planning model, wherein the target function is a function with the transportation demand information as the independent variable and the vehicle transportation cost and the site processing cost as the dependent variable.

[0019] In some embodiments of the present application, the input of the transportation demand information and the site information of each site into the preset logistics planning model to obtain an initial solution includes:

[0020] input the transportation demand information and the site information of each site into the preset logistics planning model, and analyze the transportation quantity, the transportation time, the initial transportation address, and the destination transportation address in the transportation demand information through the preset logistics planning model;

[0021] configure transportation demand parameters for each transportation demand parameter in the preset logistics planning model according to the transportation quantity, the transportation time, the initial transportation address, and the destination transportation address;

[0022] input the transportation demand parameters of each transportation demand parameter into the preset logistics planning model to obtain an initial solution.

[0023] In embodiments of the present application, the adjusting the transportation demand parameters according to the preset local search strategy comprises:

[0024] adjusting a transportation demand parameter of each transportation demand parameter in the transportation demand information according to the preset local search strategy to obtain an adjusted transportation demand parameter;

[0025] inputting the adjusted transportation demand parameter into a preset logistics planning model, and calculating a vehicle transportation cost and a site processing cost according to the adjusted transportation demand parameter by using the preset logistics planning model to obtain a local optimal solution;

[0026] updating the initial solution according to the local optimal solution to obtain an updated solution.

[0027] In embodiments of the present application, after the adjusting the transportation demand parameters according to the preset local search strategy, processing the adjusted transportation demand parameters by using the preset logistics planning model to iteratively update the initial solution to obtain an updated solution, the method comprises:

[0028] obtaining an iteration number and / or an iteration time of the iterative update, and obtaining a preset number and a preset time length corresponding to the preset logistics planning model;

[0029] if the iteration number is greater than the preset number, and / or if the iteration time is greater than the preset time length, it is determined that the updated solution meets a preset planning condition;

[0030] if the iteration number is less than or equal to the preset number, and / or if the iteration time is less than or equal to the preset time length, it is determined that the updated solution does not meet the preset planning condition.

[0031] In embodiments of the present application, after the adjusting the transportation demand parameters according to the preset local search strategy, processing the adjusted transportation demand parameters by using the preset logistics planning model to iteratively update the initial solution to obtain an updated solution, the method comprises:

[0032] if the updated solution does not meet the preset planning condition, obtaining each local optimal solution of historical iterations;

[0033] adjusting the preset local search strategy according to a change trend of each local optimal solution to obtain an updated local search strategy;

[0034] adjusting each corresponding transportation demand parameter in the transportation demand information according to the updated local search strategy;

[0035] Input the adjusted transportation demand parameter into the preset logistics planning model to obtain an updated solution.

[0036] In an embodiment of the present application, if the updated solution meets a preset planning condition, a logistics planning scheme corresponding to the updated solution is obtained, including:

[0037] If the updated solution meets the preset planning condition, a local optimal solution of each iteration is obtained.

[0038] The local optimal solutions are combined to form a minimum updated solution, a target transportation demand parameter corresponding to the minimum updated solution is obtained, and logistics route information and vehicle arrangement information corresponding to the target transportation demand parameter are obtained, and the logistics route information and vehicle arrangement information are output as a logistics planning scheme.

[0039] In an embodiment of the present application, the transportation demand information is obtained, and the transportation demand information corresponds to site information of each site in the logistics network, including:

[0040] The transportation demand information is obtained, and starting address and time information and destination address information in the transportation demand information are extracted.

[0041] The logistics network is determined according to the starting address and time information and the destination address information.

[0042] A preset site database is queried to obtain site information of each site in the logistics network, wherein the site information includes site vehicle parking information, site address information, site shift information, and available vehicle information between site shifts.

[0043] On the other hand, the present application provides a logistics scheme planning device, including:

[0044] The obtaining module is configured to obtain transportation demand information, and site information of each site in a logistics network corresponding to the transportation demand information.

[0045] The planning module is configured to input the transportation demand information and the site information of each site into a preset logistics planning model to obtain an initial solution.

[0046] The updating module is configured to adjust the transportation demand parameter according to a preset local search strategy, process the adjusted transportation demand parameter through the preset logistics planning model to iteratively update the initial solution, and obtain an updated solution.

[0047] The output module is configured to obtain a logistics planning scheme corresponding to the updated solution if the updated solution meets a preset planning condition.

[0048] On the other hand, the present application also provides a logistics scheme planning device, including:

[0049] one or more processors;

[0050] a memory; and

[0051] one or more application programs, wherein the one or more application programs are stored in the memory and configured to be executed by the processor to implement the logistics scheme planning method.

[0052] In another aspect, the present application also provides a computer readable storage medium, which stores a computer program, and the computer program is loaded by a processor to execute the steps of the logistics scheme planning method.

[0053] In the technical solution of the present application, the transportation demand information is obtained, and the transportation demand information corresponds to the site information of each site in the logistics network; the transportation demand information and the site information of each site are input into a preset logistics planning model, the transportation demand information and the site information of each site are analyzed by the preset logistics planning model to set transportation demand parameters, and an initial solution is obtained; in this way, the preset logistics planning model considers the vehicle parking space limitation and the cargo handling capacity of each site, so that the total cost of the vehicle transportation cost and the site handling cost corresponds to the initial solution; then, according to the preset local search strategy, the transportation demand parameters are adjusted according to the transportation demand information and the site information of each site, partial parameter updating is realized, and further, the adjusted transportation demand parameters are processed by the preset logistics planning model to iteratively update the initial solution, and an updated solution is obtained; if the updated solution meets the preset planning condition, a logistics planning scheme corresponding to the updated solution is obtained; according to the preset local search strategy, the solution corresponding to the logistics scheme is iteratively updated, so that the calculation amount of the planning is small, and the logistics scheme planning has real-time performance and flexibility. BRIEF DESCRIPTION OF DRAWINGS

[0054] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed in the embodiment description will be briefly introduced. Obviously, the drawings in the following description are only some embodiments of the present application, and other drawings can be obtained by those skilled in the art without creative labor.

[0055] Figure 1 is a scene schematic diagram of the logistics scheme planning method provided by the embodiment of the present application;

[0056] Figure 2 is an embodiment flowchart of the logistics scheme planning method in the embodiment of the present application, which is used to pre-construct a preset logistics planning model;

[0057] Figure 3 is an embodiment flowchart of the logistics scheme planning method provided by the embodiment of the present application;

[0058] Figure 4 is an embodiment flow diagram of the logistics scheme planning update in the logistics scheme planning method provided in the embodiments of the present application;

[0059] Figure 5 is an embodiment flow diagram of the local search strategy and planning scheme synchronous update in the logistics scheme planning method provided in the embodiments of the present application;

[0060] Figure 6 is an embodiment flow diagram of the update solution determination in the logistics scheme planning method provided in the embodiments of the present application;

[0061] Figure 7 is an embodiment structure diagram of the logistics scheme planning device provided in the embodiments of the present application;

[0062] Figure 8 is an embodiment structure diagram of the logistics scheme planning device provided in the embodiments of the present application. DETAILED DESCRIPTION

[0063] The technical solutions in the embodiments of the present application will be described clearly and completely below with reference to the drawings in the embodiments of the present application. Obviously, the described embodiments are only some of the embodiments of the present application, but not all the embodiments. Based on the embodiments in the present application, any other embodiments obtained by those skilled in the art without creative work fall within the scope of the present application.

[0064] In the present application, the word "exemplary" is used to mean "serving as an example, instance, or illustration." Any implementation described as "exemplary" in the present application is not necessarily to be construed as preferred or advantageous over other implementations. The following description is presented to enable any person skilled in the art to make and use the application. In the following description, for purposes of explanation, specific details are set forth. It is apparent to those skilled in the art that the present application can be practiced without using these specific details. In other instances, well-known structures and processes are not elaborated in order not to obscure the description of the present application with unnecessary details. Thus, the present application is not intended to be limited by the embodiments shown, but is to be accorded with the widest scope consistent with the principles and features disclosed herein.

[0065] The embodiments of the present application provide a logistics scheme planning method, device, equipment and medium, which are described in detail as follows.

[0066] The logistics scheme planning method in the embodiment of the application is applied to a logistics scheme planning device, the logistics scheme planning device is arranged in a logistics scheme planning equipment, the logistics scheme planning equipment is provided with one or more processors, a memory, and one or more application programs, wherein the one or more application programs are stored in the memory and are configured to be executed by the processor to realize the logistics scheme planning method; the logistics scheme planning equipment can be a mobile terminal, for example, a mobile phone, a tablet computer, or a camera.

[0067] As shown in Figure 1 Figure 1 The figure shows a scene of the logistics scheme planning method in the embodiment of the application, and the logistics scheme planning scene in the embodiment of the application includes a logistics scheme planning equipment 100 (the logistics scheme planning equipment 100 is integrated with a logistics scheme planning device), and a computer readable storage medium corresponding to the logistics scheme planning is run in the logistics scheme planning equipment 100 to execute the steps of the logistics scheme planning.

[0068] It can be understood that Figure 1 The logistics scheme planning equipment in the scene of the logistics scheme planning, or the device included in the logistics scheme planning equipment does not constitute a limitation on the embodiment of the application, that is, the number and types of equipment included in the scene of the logistics scheme planning, or the number and types of devices included in each equipment do not affect the overall implementation of the technical solution in the embodiment of the application, and can be regarded as equivalent replacement or derivation of the technical solution claimed in the embodiment of the application.

[0069] The logistics scheme planning equipment 100 in the embodiment of the application is mainly used for: acquiring transportation demand information and site information of each site in a logistics network corresponding to the transportation demand information; inputting the transportation demand information and the site information of each site into a preset logistics planning model to obtain an initial solution; the preset logistics planning model analyzes the transportation demand information and the site information of each site to set a transportation demand parameter, the preset logistics planning model calculates a vehicle transportation cost and a site processing cost according to the transportation demand parameter to obtain the initial solution; the transportation demand parameter is adjusted according to a preset local search strategy, the adjusted transportation demand parameter is processed by the preset logistics planning model to iteratively update the initial solution to obtain an updated solution; and if the updated solution meets a preset planning condition, a logistics planning scheme corresponding to the updated solution is acquired.

[0070] ​In this embodiment of the invention, the logistics planning device 100 can be an independent logistics planning device, or it can be a network or cluster of logistics planning devices. For example, the logistics planning device 100 described in this embodiment includes, but is not limited to, computers, network hosts, single network logistics planning devices, sets of multiple network logistics planning devices, or cloud logistics planning devices composed of multiple logistics planning devices. The cloud logistics planning device is composed of a large number of computer or network logistics planning devices based on cloud computing.

[0071] Those skilled in the art will understand that Figure 1 The application environment shown is merely one application scenario of the solution in this application and does not constitute a limitation on the application scenario of the solution in this application. Other application environments may include those that are more specific to this application. Figure 1 The more or fewer logistics planning devices shown, or the network connection relationships of logistics planning devices, for example Figure 1 Only one logistics planning device is shown in the document. It is understood that the logistics planning scenario may also include one or more other logistics planning devices, which are not limited here. The logistics planning device 100 may also include a memory for storing data, such as site information.

[0072] Furthermore, in the logistics planning scenario of this application, the logistics planning device 100 can be equipped with a display device, or the logistics planning device 100 can be connected to an external display device 200 without a display device. The display device 200 is used to output the results of the logistics planning method executed in the logistics planning device. The logistics planning device 100 can access the background database 300 (the background database can be in the local storage of the logistics planning device, or it can be located in the cloud), and the background database 300 stores information related to logistics planning.

[0073] It should be noted that, Figure 1 The schematic diagram of the logistics solution planning method shown is merely an example. The logistics solution planning scenarios described in the embodiments of the present invention are intended to more clearly illustrate the technical solutions of the embodiments of the present invention and do not constitute a limitation on the technical solutions provided in the embodiments of the present invention.

[0074] The logistics scheme planning method in the embodiment is applied to a logistics scheme planning device, and the type of the logistics scheme planning device is not specifically limited. For example, the logistics scheme planning device can be a terminal or a server. In the embodiment, the server is taken as an example for description. A preset logistics planning model is preset in the server. The preset logistics planning model is a calculation model formed by summarizing a large amount of logistics network line and vehicle arrangement information in advance. The preset logistics planning model can select a suitable path according to each transportation demand, and optimize the total cost on the premise of meeting the transportation demand.

[0075] The preset logistics planning model considers the vehicle parking space constraint and the cargo processing capacity constraint of the site. For example, the sum of the vehicle parking spaces allocated to each site shift cannot exceed the number of parking spaces owned by the site, only the site shift with allocated parking spaces can run vehicles, and the cargo processed by each site per day cannot exceed its processing capacity. The server generates and filters feasible paths for each transportation demand according to the above constraint conditions, meets each transportation demand within the time limit, and summarizes the path information of each path to the preset logistics planning model.

[0076] As shown in Figure 2 , the flowchart shown in Figure 2 is an embodiment of the preset logistics planning model constructed in the logistics scheme planning method in the embodiment. The steps of constructing the preset logistics planning model in the logistics scheme planning method in the embodiment include:

[0077] 201, receiving a model construction instruction, obtaining site information of each site in a logistics network, and historical time period multiple transportation demand information.

[0078] The server receives a model construction instruction, wherein the triggering mode of the model construction instruction is not specifically limited, that is, the user can manually trigger the model construction instruction, or the server automatically triggers the model construction instruction. After the server receives the model construction instruction, the server obtains a model training sample. The model training sample in the embodiment includes: obtaining site information of each site in a logistics network, and historical time period multiple transportation demand information.

[0079] The site information includes site identification, site address, vehicle parking space distribution in the site, site shift arrangement and the like. The transportation demand information refers to the information of transportation demand of different starting addresses, different destination addresses and different time limits. The transportation demand information includes multiple transportation demands in a historical time period, for example, multiple transportation demands in the past month.

[0080] 202, generating a site path according to the site information of each site in the logistics network and the multiple transportation demand information.

[0081] The server generates a site path according to site information of each site in the logistics network and a plurality of transportation demand information. For example, the server obtains a starting address and time information and a destination address information in each transportation demand information, determines a site between the starting address and time information and the destination address information, obtains site information of each site, and traces from the starting address along each site until the destination address to obtain a site path formed between the starting position and the destination position.

[0082] 203. Generate a shift path according to the site path, the site information of each site, and the vehicle travel time between each site.

[0083] 204. Screen each shift path according to the transportation time limit in each transportation demand information to obtain a feasible path set.

[0084] The server sorts the vehicle path corresponding to each transportation demand according to the site path, the site information of each site, and the vehicle travel time between each site to generate a shift path. The server extracts the transportation time limit in each transportation demand information, and deletes the shift path that exceeds the transportation time limit according to the transportation time limit to obtain a feasible path set.

[0085] 205. Construct a preset logistics planning model according to the transportation proportion of each path in the feasible path set, the allocation information of vehicle parking spaces in each site shift, and the arrangement information of vehicles between each pair of site shifts.

[0086] The server sets the vehicle shift information of each site reasonably according to the transportation proportion of each path in the feasible path set, the vehicle travel time between sites, the allocation information of vehicle parking spaces in each site shift, and the arrangement information of vehicles between each pair of site shifts. The server takes the site information of each site and a plurality of transportation demand information as independent variables, and takes the vehicle shift information of each site as dependent variables to construct a preset logistics planning model. Step 205 includes:

[0087] (1) Set a constraint condition according to the transportation proportion of each path in the feasible path set, the allocation information of vehicle parking spaces in each site shift, and the arrangement information of vehicles between each pair of site shifts.

[0088] (2) Set a target function according to the constraint condition, the vehicle transportation cost, and the site transfer processing cost, encapsulate the constraint condition and the target function, and obtain a preset logistics planning model. The target function is a function with the transportation demand information as an independent variable and the vehicle transportation cost and the site processing cost as a dependent variable.

[0089] The server in the embodiment determines constraint conditions and an objective function according to site information of each site in a logistics network and a plurality of transportation demand information. The server encapsulates the constraint conditions and the objective function to form a preset logistics planning model. The preset logistics planning model is constructed in the embodiment to realize efficient and flexible logistics scheme planning through the preset logistics planning model.

[0090] As Figure 3 shown, Figure 3 FIG. 1 is a flowchart of an embodiment of a logistics scheme planning method in the embodiment. The logistics scheme planning method includes the following steps.

[0091] 301, obtaining transportation demand information and site information of each site in a logistics network corresponding to the transportation demand information.

[0092] When the server receives a logistics scheme planning instruction, the server obtains transportation demand information. The transportation demand information includes transportation volume, starting address and time information, destination address information, and transportation time. The server determines a logistics network involved in transportation according to the transportation demand information. For example, the transportation demand information is to transport xxx products from Dalian, Liaoning to Changchun, Jilin. The server determines that the transportation network is the Northeast region.

[0093] Specifically, step 301 in the embodiment includes the following steps.

[0094] (1) obtaining transportation demand information and extracting starting address and time information and destination address information in the transportation demand information;

[0095] (2) determining a logistics network according to the starting address and time information and the destination address information;

[0096] (3) querying a preset site database to obtain site information of each site in the logistics network, wherein the site information includes site vehicle parking information, site address information, site shift information, and available vehicle information between site shifts.

[0097] The server obtains transportation demand information and extracts starting address and time information and destination address information in the transportation demand information. The server determines a logistics network according to the starting address and time information and the destination address information. The server queries a preset site database. The preset site database stores site information of different sites. The site information includes site vehicle parking information, site address information, site shift information, and available vehicle information between site shifts. After the server determines the logistics network, the server obtains site information of each site in the logistics network stored in the preset site database.

[0098] 302, inputting the transportation demand information and the site information of each site into a preset logistics planning model to obtain an initial solution.

[0099] The server sets the transportation demand parameters according to the freight volume, the freight time and the free space in the site information in the transportation demand information by the preset logistics planning model, the preset logistics planning model calculates the vehicle transportation cost and the site processing cost according to the transportation demand parameters to obtain an initial solution, the manner in which the server sets the transportation demand parameters is not limited in the embodiment, for example, the server sets the number of transfers in the transportation demand parameters to zero according to the transportation demand information, and the preset logistics planning model calculates the cost when the freight volume in the transportation demand information is directly transported as the initial solution.

[0100] Specifically, the step of calculating the initial solution by the preset logistics planning model in the embodiment includes:

[0101] (1) inputting the transportation demand information and the site information of each site into the preset logistics planning model, and analyzing the transportation volume, the transportation time, the initial transportation address and the destination address in the transportation demand information by the preset logistics planning model;

[0102] (2) configuring the transportation demand parameters of each transportation demand parameter in the preset logistics planning model according to the transportation volume, the transportation time, the initial transportation address and the destination address;

[0103] (3) inputting the transportation demand parameters of each transportation demand parameter into the preset logistics planning model to obtain the initial solution.

[0104] The server first calculates the initial solution by the preset logistics planning model to optimize the initial solution to obtain an updated solution in the embodiment, specifically:

[0105] 303, adjusting the transportation demand parameters according to the preset local search strategy, processing the adjusted transportation demand parameters by the preset logistics planning model to iteratively update the initial solution to obtain an updated solution.

[0106] The local search strategy is preset in the server, which refers to the adjustment strategy of the transportation demand parameters, for example, the local search strategy can be set as random start address of vehicle transfer in the transportation process, or random destination address of vehicle transfer in the transportation process, etc. The server fixes part of the transportation demand parameters according to the preset local search strategy, and then adjusts part of the transportation demand parameters in the preset logistics planning model. The server calculates a local optimal solution according to the adjusted part of the transportation demand parameters. The server fuses the local optimal solution and the initial solution to obtain an updated solution. Further, the server iteratively executes the above steps, the server takes the updated solution obtained last time as a new initial solution, and the server iteratively obtains a new updated solution.

[0107] The server in the embodiment adopts a local updating manner, so that the server can realize partial updating, so that the calculation amount of the server is smaller, and the updated solution is obtained conveniently.

[0108] Since the end of iteration needs to be known in the server, the operation time can be reduced, and the real-time performance of data processing is ensured. After step 303, the following steps are included:

[0109] (1) obtaining the iteration number and / or iteration time of the iterative updating, and obtaining the preset number and preset time length corresponding to the preset logistics planning model;

[0110] (2) if the iteration number is greater than the preset number, and / or if the iteration time is greater than the preset time length, it is determined that the updated solution meets the preset planning condition;

[0111] (3) if the iteration number is less than or equal to the preset number, and / or if the iteration time is less than or equal to the preset time length, it is determined that the updated solution does not meet the preset planning condition.

[0112] That is, the server obtains the iteration number and / or iteration time of the iterative updating, the server obtains the preset number and preset time length corresponding to the preset logistics planning model, the server compares the iteration number of the iterative updating with the preset number corresponding to the preset logistics planning model, the server compares the iteration time of the iterative updating with the preset time length corresponding to the preset logistics planning model, if the iteration number is greater than the preset number, and / or if the iteration time is greater than the preset time length, the server determines that the updated solution meets the preset planning condition, if the iteration number is less than or equal to the preset number, and / or if the iteration time is less than or equal to the preset time length, the server determines that the updated solution does not meet the preset planning condition.

[0113] If the updated solution does not meet the preset planning condition, the server performs iterative updating until the updated solution meets the preset planning condition.

[0114] 304, if the updated solution meets the preset planning condition, obtaining the logistics planning scheme corresponding to the updated solution.

[0115] If the updated solution meets the preset planning condition, the server obtains the target transportation demand parameter corresponding to the updated solution, and the server outputs the logistics line information and vehicle arrangement information corresponding to the target transportation demand parameter as the final planning scheme.

[0116] The preset logistics planning model in the embodiment considers the vehicle parking restriction and the cargo processing capacity of each site, and the total cost of vehicle transportation cost and site processing cost, so that the logistics scheme planning is more reasonable. At the same time, according to the preset local search strategy, the solution corresponding to the logistics scheme planning scheme is updated partially and iteratively, so that the calculation amount of planning is small, and the logistics scheme planning is ensured to be not real-time and flexible.

[0117] For the convenience of understanding, specific application scenarios are given in the embodiment for illustration. For example, the server generates a site path for each transportation demand based on the site network V, then generates a shift path based on the site path, considering the properties of each site shift (∈N) and the vehicle travel time between sites, and finally screens the shift path based on the timeliness of each transportation demand to obtain a feasible path set; the server models based on the feasible path set, the model makes decisions on the proportion of each path used for transportation for each transportation demand, the allocation of vehicle parking in each site shift, and the arrangement of vehicles between each pair of site shifts, with the goal of minimizing the total cost (including the total transportation cost of vehicles and the total processing cost of cargo passing through all sites), and considering the parking restriction and processing capacity restriction of each site.

[0118] The model input in the preset logistics planning model in the embodiment includes:

[0119] (1) Site information: the set of sites V in the logistics network; the set of site shifts N in the logistics network; the site s(i) corresponding to the site shift i, i∈N; the maximum cargo processing capacity h of the site i i ,i∈V; the number of loading parking spaces owned by the site i g i ,i∈V; the single ticket processing cost f of the site i i ,i∈V; the vehicle travel distance d between sites i and j ij ,i,j∈V;

[0120] (2) Vehicle information: the unit distance travel cost c of the vehicle; the maximum loading weight q of the vehicle;

[0121] (3) Transportation demand information: the set of all transportation demands K; the set of all feasible paths P of the transportation demand k k ,k∈K; the transportation ticket volume G of the transportation demand k k ,k∈K and the transportation weight W k ,k∈K.

[0122] In order to complete the above tasks, the server in the embodiment needs to consider the following constraints:

[0123] The sum of the number of loading slots assigned to all directions by each yard shift i cannot exceed the number of slots g owned by the corresponding yard s(i) s(i) i.e. equation (2); only after a slot is assigned to a flow direction can a vehicle run in the flow direction of each yard shift, i.e. equation (3); the amount of cargo passing through each yard cannot exceed the processing capacity of the yard, i.e. equation (4); the sum of the maximum loading capacity of vehicles running in the flow direction of each yard shift cannot be less than the total weight of the transportation demand using the flow direction, i.e. equation (5); each transportation demand must be fully satisfied, and all cargo is transported from the origin shift to the destination yard, i.e. equation (6).

[0124] The goal of the preset logistics planning model is to minimize the total cost (including vehicle transportation cost and yard processing cost), where the transportation cost is related to the number of trips in each flow direction, and the yard processing cost is related to the total amount of cargo passing through each yard. The objective function and constraints are as follows:

[0125]

[0126]

[0127]

[0128]

[0129]

[0130]

[0131]

[0132]

[0133]

[0134] where X ij = 0 or 1, i.e. if a slot is assigned to flow direction j by yard shift i, then X ij = 1, otherwise 0, i∈N, j∈N; Y ij represents the number of vehicles dispatched from yard shift i to yard shift j, i∈N, j∈N; β kp represents the proportion of transportation demand k using path p for transportation p∈P k ; M represents a sufficiently large constant.

[0135] In the embodiment, the preset logistics planning model selects one or more paths for each transportation demand to transport all the cargo from the starting node to the destination node, and each path is connected by a pair of edges formed by the starting and ending site shifts. Based on the transportation weight passing through each edge, considering the site constraints at both ends of the edge, the transportation cost can be minimized by reasonably allocating vehicles. Each path will bring cargo to each site it passes through. By selecting appropriate paths for each transportation demand, the sum of the processing costs of all sites can be minimized. By considering transportation costs and processing costs, the optimal path planning and vehicle arrangement scheme can be found.

[0136] Referring to Figure 4 , Figure 4 is an embodiment of the logistics scheme planning update in the logistics scheme planning method provided in the application.

[0137] In some embodiments of the application, the logistics scheme planning method updates the transportation demand parameters according to the preset local search strategy, and performs the following steps by planning and updating the preset logistics planning model:

[0138] 401, adjusting the transportation demand parameters of each transportation demand parameter in the transportation demand information according to the preset local search strategy to obtain adjusted transportation demand parameters.

[0139] The local search strategy preset in the server is the transportation demand parameter adjustment strategy corresponding to the transportation demand information. For example, the preset local search strategy can be a random change strategy of the transportation demand parameter, or a partial change strategy of the transportation demand parameter. The server adjusts the transportation demand parameters of each transportation demand parameter in the transportation demand information according to the preset local search strategy to obtain adjusted transportation demand parameters.

[0140] 402, inputting the adjusted transportation demand parameters into the preset logistics planning model, and calculating the vehicle transportation cost and site processing cost according to the adjusted transportation demand parameters by the preset logistics planning model to obtain a local optimal solution.

[0141] 403, updating the initial solution according to the local optimal solution to obtain an updated solution.

[0142] The server inputs the adjusted values of the transportation demand parameters into the preset logistics planning model. The preset logistics planning model keeps the values of part of the transportation demand parameters unchanged, adjusts part of the logistics network routes and vehicle arrangement information according to the adjusted values of the transportation demand parameters, and obtains a local optimal solution. The server replaces part of the initial solution with the local optimal solution to obtain an updated solution. In the embodiment, the local transportation demand parameter update method is used to update the initial solution, which can reduce the amount of data processing and quickly update the logistics network routes and vehicle arrangement scheme, making the logistics scheme planning more flexible.

[0143] With reference to Figure 5 , Figure 5 is a flowchart of an embodiment of a local search strategy and a planning scheme synchronous updating method provided in the logistics scheme planning method in the embodiments of the present application. The logistics scheme planning method in the embodiment includes the following steps:

[0144] 501, if the updated solution does not meet the preset planning condition, obtaining each local optimal solution of historical iterations.

[0145] If the updated solution does not meet the preset planning condition, the server obtains each local optimal solution of historical iterations, that is, when the server performs iteration updating, different transportation demand parameters are adjusted, and multiple local optimal solutions are obtained. The server obtains the local optimal solutions generated by historical iterations.

[0146] 502, adjusting the preset local search strategy according to the change trend of each local optimal solution to obtain an updated local search strategy.

[0147] The server adjusts the preset local search strategy according to each local optimal solution, that is, the server determines the change trend of each local optimal solution. If each local optimal solution gradually increases, the local search strategy is not adjusted. If each local optimal solution gradually decreases, the local search strategy is adjusted in the opposite direction, for example, the server analyzes each local optimal solution to determine whether each local optimal solution is decreasing. If the local optimal solution is not decreasing, the server adjusts the local search strategy to obtain an updated local search strategy.

[0148] 503, adjusting each transportation demand parameter corresponding to the transportation demand information according to the updated local search strategy.

[0149] 504, inputting the adjusted transportation demand parameter into the preset logistics planning model to obtain an updated solution.

[0150] The server adjusts the transportation demand parameter corresponding to the transportation demand information according to the updated local search strategy. The server inputs the adjusted value into the preset logistics planning model to obtain an updated solution. In the embodiment, the local search strategy can be adjusted synchronously according to the change law of the local optimal solution, so that the server can obtain the logistics planning scheme of the logistics network line and the vehicle arrangement with the least number of iterations and the fastest speed.

[0151] With reference to Figure 6 , Figure 6 is a flowchart of an embodiment of a local search strategy and a planning scheme synchronous updating method provided in the logistics scheme planning method in the embodiments of the present application. The logistics scheme planning method in the embodiment includes the following steps:

[0152] 601. If the updated solution meets the preset planning conditions, then the local optimal solution of each iteration is obtained;

[0153] 602, combine the local optimal solutions to form the minimum updated solution, and obtain the target transportation demand parameters corresponding to the minimum updated solution;

[0154] 603, Obtain the logistics route information and vehicle layout information corresponding to the target transportation demand parameters, and output the logistics route information and vehicle layout information as a logistics planning scheme.

[0155] If the server determines that the updated solution meets the preset planning conditions, it obtains the local optimal solutions from each iteration. The server combines these local optimal solutions to form the minimum updated solution, and obtains the target transportation demand parameters corresponding to the minimum updated solution. The server then obtains the logistics route information and vehicle layout information corresponding to the target transportation demand parameters, and uses this information as the logistics planning scheme corresponding to the minimum updated solution. In this embodiment, the server can combine the local optimal solutions formed by multiple local searches to obtain the optimal solution. This minimizes the vehicle transportation cost and site cargo handling cost of the logistics plan, while also minimizing the computational load.

[0156] To better implement the logistics planning method in this application embodiment, a logistics planning device is also provided in this application embodiment based on the logistics planning method.

[0157] like Figure 7 As shown, Figure 7 This is a schematic diagram of an embodiment of a logistics planning device; the logistics planning device includes:

[0158] The acquisition module 701 is used to acquire transportation demand information and site information of each site in the logistics network corresponding to the transportation demand information. The preset logistics planning model analyzes the transportation demand information and the site information of each site to set transportation demand parameters. The preset logistics planning model calculates vehicle transportation costs and site processing costs according to the transportation demand parameters to obtain an initial solution.

[0159] The planning module 702 is used to input the transportation demand information and the site information of each site into a preset logistics planning model to obtain an initial solution;

[0160] The update module 703 is used to adjust the transportation demand parameters according to a preset local search strategy, and process the adjusted transportation demand parameters through the preset logistics planning model to iteratively update the initial solution to obtain an updated solution;

[0161] The output module 704 is configured to acquire the logistics planning scheme corresponding to the updated solution if the updated solution meets preset planning conditions.

[0162] In some embodiments of the present application, the logistics scheme planning device comprises:

[0163] The model construction instruction is received, and site information of each site in the logistics network and historical time period multiple transportation demand information are acquired;

[0164] According to the site information of each site in the logistics network and the multiple transportation demand information, a site path is generated;

[0165] According to the site path, the site information of each site and the vehicle driving time between each site, a shift path is generated;

[0166] According to the transportation time limit in each transportation demand information, each shift path is screened to obtain a feasible path set;

[0167] According to the transportation proportion of each path in the feasible path set, the allocation information of the vehicle parking space in each site shift, and the arrangement information of the vehicle between each pair of site shifts, a preset logistics planning model is constructed.

[0168] In some embodiments of the present application, the logistics scheme planning device executes the construction of the preset logistics planning model according to the transportation proportion of each path in the feasible path set, the allocation information of the vehicle parking space in each site shift, and the arrangement information of the vehicle between each pair of site shifts, comprising:

[0169] According to the transportation proportion of each path in the feasible path set, the allocation information of the vehicle parking space in each site shift, and the arrangement information of the vehicle between each pair of site shifts, a constraint condition is set;

[0170] According to the constraint condition and the transportation cost of each path, a target function is set, the constraint condition and the target function are encapsulated, and a preset logistics planning model is obtained, wherein the target function is a function with the transportation demand information as the independent variable and the vehicle transportation cost and the site processing cost as the dependent variable.

[0171] In some embodiments of the present application, the planning module 702 comprises:

[0172] The transportation demand information and the site information of each site are input into the preset logistics planning model, and the transportation quantity, transportation time, transportation initial address and transportation destination address in the transportation demand information are analyzed by the preset logistics planning model;

[0173] According to the transportation quantity, the transportation time, the transportation initial address and the transportation destination address, a transportation demand parameter of each transportation demand parameter in the preset logistics planning model is configured;

[0174] The transportation demand parameter of each transportation demand parameter is input into a preset logistics planning model to obtain an initial solution.

[0175] In some embodiments of the present application, the updating module 703 comprises:

[0176] According to a preset local search strategy, a transportation demand parameter of each transportation demand parameter in the transportation demand information is adjusted to obtain an adjusted transportation demand parameter;

[0177] The adjusted transportation demand parameter is input into a preset logistics planning model, and a vehicle transportation cost and a site processing cost are calculated according to the adjusted transportation demand parameter by the preset logistics planning model to obtain a local optimal solution;

[0178] The initial solution is updated according to the local optimal solution to obtain an updated solution.

[0179] In some embodiments of the present application, the logistics scheme planning device comprises:

[0180] An iteration number and / or an iteration time of the iterative updating are obtained, and a preset number and a preset time length corresponding to the preset logistics planning model are obtained;

[0181] If the iteration number is greater than the preset number, and / or if the iteration time is greater than the preset time length, it is determined that the updated solution meets a preset planning condition;

[0182] If the iteration number is less than or equal to the preset number, and / or if the iteration time is less than or equal to the preset time length, it is determined that the updated solution does not meet the preset planning condition.

[0183] In some embodiments of the present application, the logistics scheme planning device comprises:

[0184] If the updated solution does not meet the preset planning condition, each local optimal solution of historical iterations is obtained;

[0185] According to a change trend of each local optimal solution, the preset local search strategy is adjusted to obtain an updated local search strategy;

[0186] According to the updated local search strategy, each transportation demand parameter corresponding to the transportation demand information is adjusted;

[0187] The adjusted transportation demand parameter is input into a preset logistics planning model to obtain an updated solution.

[0188] In some embodiments of the present application, the output module 704 comprises:

[0189] If the updated solution meets the preset planning condition, the local optimal solution of each iteration is obtained.

[0190] The local optimal solutions are combined to form a minimum updated solution, the target transportation demand parameter corresponding to the minimum updated solution is obtained, and the logistics line information and vehicle arrangement information corresponding to the target transportation demand parameter are obtained, and the logistics line information and vehicle arrangement information are output as a logistics planning scheme.

[0191] In some embodiments of the present application, the obtaining module 701 comprises:

[0192] Obtain transportation demand information, extract the starting address and time information and destination address information in the transportation demand information;

[0193] Determine a logistics network according to the starting address and time information and the destination address information;

[0194] Query a preset site database to obtain site information of each site in the logistics network, wherein the site information comprises site vehicle parking information, site address information, site shift information, and available vehicle information between site shifts.

[0195] In the embodiment, the logistics scheme planning device obtains transportation demand information and site information of each site in a logistics network corresponding to the transportation demand information; inputs the transportation demand information and the site information of each site into a preset logistics planning model to obtain an initial solution; adjusts the transportation demand parameter according to a preset local search strategy, processes the adjusted transportation demand parameter through the preset logistics planning model to iteratively update the initial solution, and obtains an updated solution; if the updated solution meets a preset planning condition, a logistics planning scheme corresponding to the updated solution is obtained; in the embodiment, the preset logistics planning model considers the vehicle parking restriction and cargo handling capacity of each site, and the total cost of vehicle transportation cost and site processing cost, so that the logistics scheme planning is more reasonable. At the same time, the technical solution in the embodiment iteratively updates the solution corresponding to the logistics scheme planning scheme according to the preset local search strategy, so that the calculation amount of the planning is small, and the logistics scheme planning is ensured to be not real-time and flexible.

[0196] The embodiment of the present application also provides a logistics scheme planning device, as shown in Figure 8 The structure schematic diagram of the logistics scheme planning device related to the embodiment of the present application is shown.

[0197] The logistics scheme planning device integrates any logistics scheme planning device provided in the embodiment of the present application, and the logistics scheme planning device comprises:

[0198] one or more processors;

[0199] a memory; and

[0200] one or more application programs, wherein the one or more application programs are stored in the memory and configured to perform the steps of the logistics scheme planning method in any of the embodiments of the logistics scheme planning method.

[0201] In particular, the logistics scheme planning device can include a processor 801 with one or more processing cores, a memory 802 with one or more computer readable storage media, a power supply 803, an input unit 804, and the like. Those skilled in the art can understand that the logistics scheme planning device structure shown in the figure does not constitute a limitation on the logistics scheme planning device, and can include more or fewer components than shown, or combine certain components, or different component arrangements. Among them: Figure 8

[0202] The processor 801 is the control center of the logistics scheme planning device, connects various parts of the logistics scheme planning device through various interfaces and lines, performs various functions of the logistics scheme planning device and processes data by running or executing software programs and / or modules stored in the memory 802, and calling data stored in the memory 802, thereby overall monitoring the logistics scheme planning device. Optionally, the processor 801 can include one or more processing cores; preferably, the processor 801 can integrate an application processor and a modem processor, wherein the application processor mainly processes the operating system, user interface, and application program, etc., and the modem processor mainly processes wireless communication. It can be understood that the above-mentioned modem processor can also not be integrated into the processor 801.

[0203] The memory 802 can be used to store software programs and modules, and the processor 801 performs various function applications and data processing by running the software programs and modules stored in the memory 802. The memory 802 can mainly include a program storage area and a data storage area, wherein the program storage area can store the operating system, at least one application program required by the function (such as sound playing function, image playing function, etc.), etc.; the data storage area can store data created according to the use of the logistics scheme planning device, etc. In addition, the memory 802 can include a high-speed random access memory, and can also include a non-volatile memory, such as at least one magnetic disk storage device, a flash memory device, or other volatile solid-state memory device. Accordingly, the memory 802 can also include a memory controller to provide access for the processor 801 to the memory 802.

[0204] ​The logistics scheme planning device further comprises a power supply 803 for supplying power to each component. Preferably, the power supply 803 can be logically connected to the processor 801 through a power management system, so that the power management system can realize functions such as management of charging, discharging and power consumption management. The power supply 803 can further comprise one or more than one direct current or alternating current power supply, a recharging system, a power failure detection circuit, a power converter or inverter, a power state indicator and any other components.

[0205] The logistics scheme planning device can further comprise an input unit 804 for receiving inputted digital or character information and generating keyboard, mouse, joystick, optical or trackball signal inputs related to user settings and function controls.

[0206] Although not shown, the logistics scheme planning device can further comprise a display unit and the like, which will not be described here. In the present embodiment, the processor 801 in the logistics scheme planning device loads one or more than one executable file corresponding to the process of an application program into the memory 802 according to the following instructions, and runs the application program stored in the memory 802 by the processor 801, so as to realize various functions, such as:

[0207] obtaining transportation demand information and site information of each site in a logistics network corresponding to the transportation demand information;

[0208] inputting the transportation demand information and the site information of each site into a preset logistics planning model to obtain an initial solution;

[0209] adjusting the transportation demand parameter according to a preset local search strategy, processing the adjusted transportation demand parameter through the preset logistics planning model to iteratively update the initial solution, and obtaining an updated solution;

[0210] if the updated solution meets a preset planning condition, obtaining a logistics planning scheme corresponding to the updated solution.

[0211] Those skilled in the art can understand that all or part of the steps in the various methods of the above embodiments can be completed by instructions or controlled by instructions related to hardware, which can be stored in a computer readable storage medium and loaded and executed by a processor.

[0212] To this end, the embodiment of the present application provides a computer readable storage medium, which can include a read only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, etc. A computer program is stored on the computer readable storage medium, and the computer program is loaded by a processor to execute steps in any one of the logistics scheme planning methods provided by the embodiment of the present application. For example, the computer program loaded by the processor can execute the following steps:

[0213] Obtaining transportation demand information and site information of each site in a logistics network corresponding to the transportation demand information;

[0214] Inputting the transportation demand information and the site information of each site into a preset logistics planning model to obtain an initial solution;

[0215] Adjusting the transportation demand parameter according to a preset local search strategy, processing the adjusted transportation demand parameter by the preset logistics planning model to iteratively update the initial solution, and obtaining an updated solution;

[0216] If the updated solution meets a preset planning condition, obtaining a logistics planning scheme corresponding to the updated solution.

[0217] In the above embodiments, the description of each embodiment has its own focus, and the parts not described in detail in a certain embodiment can be referred to the detailed description of other embodiments above, which will not be repeated here.

[0218] In a specific implementation, each unit or structure above can be implemented as an independent entity, or can be combined as the same or several entities, and the specific implementation of each unit or structure can be referred to the method embodiments above, which will not be repeated here.

[0219] The specific implementation of each operation above can be referred to the embodiments above, which will not be repeated here.

[0220] The above describes in detail a logistics scheme planning method provided by the embodiment of the present application, and the principle and implementation manner of the present application are described by applying specific examples. The above embodiment is only used to help understand the method of the present application and its core idea; meanwhile, for those skilled in the art, the specific implementation manner and application range can be changed according to the idea of the present application, and the above description should not be understood as a limitation of the present application.

Claims

1. A logistics plan planning method characterized by comprising: The method comprises the following steps: acquiring transportation demand information and site information of each site in a logistics network corresponding to the transportation demand information; the site information comprises vehicle parking restriction information and cargo handling capacity information; inputting the transportation demand information and the site information of each site into a preset logistics planning model to obtain an initial solution, wherein the preset logistics planning model analyzes the transportation demand information and the site information of each site to set transportation demand parameters, the preset logistics planning model calculates vehicle transportation cost and site handling cost according to the transportation demand parameters to obtain an initial solution; adjusting the transportation demand parameters according to a preset local search strategy, processing the adjusted transportation demand parameters by the preset logistics planning model to iteratively update the initial solution, and obtaining an updated solution; if the updated solution meets a preset planning condition, acquiring target transportation demand parameters corresponding to the updated solution, and outputting a logistics planning scheme corresponding to the target transportation demand parameters, wherein the logistics planning scheme comprises logistics route information and vehicle arrangement information; before the step of inputting the transportation demand information and the site information of each site into the preset logistics planning model to obtain the initial solution, the method comprises the following steps: receiving a model construction instruction, acquiring site information of each site in a logistics network and a plurality of transportation demand information in a historical time period; generating site paths according to the site information of each site in the logistics network and the plurality of transportation demand information; generating shift paths according to the site paths, the site information of each site and vehicle travel time between each pair of sites; screening each shift path according to transportation time limit in each transportation demand information to obtain a feasible path set; constructing a preset logistics planning model according to transportation proportion of each path in the feasible path set, allocation information of vehicle parking in each site shift, and arrangement information of vehicles between each pair of site shifts.

2. The method of claim 1, wherein, The step of constructing a preset logistics planning model according to transportation proportion of each path in the feasible path set, allocation information of vehicle parking in each site shift, and arrangement information of vehicles between each pair of site shifts comprises the following steps: setting constraint conditions according to the transportation proportion of each path in the feasible path set, the allocation information of vehicle parking in each site shift, and the arrangement information of vehicles between each pair of site shifts; setting an objective function according to the transportation cost of each path, encapsulating the constraint conditions and the objective function to obtain a preset logistics planning model, wherein the objective function is a function with the transportation demand information as an independent variable and vehicle transportation cost and site handling cost as a dependent variable.

3. The method of claim 1, wherein, The step of inputting the transportation demand information and the site information of each site into a preset logistics planning model to obtain an initial solution comprises the following steps: inputting the transportation demand information and the site information of each site into a preset logistics planning model, and analyzing transportation volume, transportation time, transportation initial address and transportation destination address in the transportation demand information by the preset logistics planning model; According to the transportation quantity, the transportation time, the transportation initial address and the transportation destination address, a transportation demand parameter of each transportation demand parameter in the preset logistics planning model is configured; The transportation demand parameter of each transportation demand parameter is input into a preset logistics planning model to calculate vehicle transportation cost and site processing cost, and an initial solution is obtained.

4. The method of claim 1, wherein, According to the preset local search strategy, the transportation demand parameter is adjusted, and the adjusted transportation demand parameter is processed by the preset logistics planning model to iteratively update the initial solution, and an updated solution is obtained, which comprises: According to the preset local search strategy, the transportation demand parameter of each transportation demand parameter in the transportation demand information is adjusted to obtain the adjusted transportation demand parameter; The adjusted transportation demand parameter is input into the preset logistics planning model, and the vehicle transportation cost and the site processing cost are calculated according to the adjusted transportation demand parameter by the preset logistics planning model, and a local optimal solution is obtained; According to the local optimal solution, the initial solution is updated to obtain an updated solution.

5. The method of claim 1, wherein, After the transportation demand parameter is adjusted according to the preset local search strategy, the adjusted transportation demand parameter is processed by the preset logistics planning model to iteratively update the initial solution, and an updated solution is obtained, the method comprises: The iteration number and / or iteration time of the iterative update are obtained, and the preset number and preset time length corresponding to the preset logistics planning model are obtained; If the iteration number is greater than the preset number, and / or if the iteration time is greater than the preset time length, it is determined that the updated solution meets the preset planning condition; If the iteration number is less than or equal to the preset number, and / or if the iteration time is less than or equal to the preset time length, it is determined that the updated solution does not meet the preset planning condition, and the iteration solving process is continued.

6. The method of claim 1, wherein, After the transportation demand parameter is adjusted according to the preset local search strategy, the adjusted transportation demand parameter is processed by the preset logistics planning model to iteratively update the initial solution, and an updated solution is obtained, the method comprises: If the updated solution does not meet the preset planning condition, each local optimal solution of the historical iteration is obtained; According to the change trend of each local optimal solution, the preset local search strategy is adjusted to obtain an updated local search strategy; According to the updated local search strategy, each transportation demand parameter corresponding to the transportation demand information is adjusted; The adjusted transportation demand parameter is input into the preset logistics planning model to obtain an updated solution.

7. The method of claim 1, wherein, If the updated solution meets the preset planning condition, the logistics planning scheme corresponding to the updated solution is obtained, which comprises: If the updated solution meets the preset planning condition, the local optimal solution of each iteration is obtained; Each local optimal solution is combined to form a minimum updated solution, and the target transportation demand parameter corresponding to the minimum updated solution is obtained; The logistics line information and vehicle arrangement information corresponding to the target transportation demand parameter are obtained, and the logistics line information and vehicle arrangement information are output as a logistics planning scheme.

8. The method of any one of claims 1-7, wherein, The transportation demand information and the site information of each site in the logistics network corresponding to the transportation demand information are obtained, which comprises: Obtaining transportation demand information, extracting the starting address and time information and the destination address information in the transportation demand information; Determining a logistics network according to the starting address and time information and the destination address information; Querying a preset site database to obtain site information of each site in the logistics network, wherein the site information includes site vehicle parking information, site address information, site shift information, and available vehicle information between site shifts.

9. A logistics plan planning device characterized by comprising: Comprise: An acquisition module configured to acquire transportation demand information and site information of each site in a logistics network corresponding to the transportation demand information; The site information includes vehicle parking restriction information and cargo handling capacity information; A planning module configured to input the transportation demand information and the site information of each site into a preset logistics planning model to obtain an initial solution, wherein the preset logistics planning model analyzes the transportation demand information and the site information of each site to set transportation demand parameters, and calculates vehicle transportation cost and site handling cost according to the transportation demand parameters to obtain an initial solution; An updating module configured to adjust the transportation demand parameters according to a preset local search strategy, process the adjusted transportation demand parameters through the preset logistics planning model to iteratively update the initial solution, and obtain an updated solution; An output module configured to obtain a logistics planning scheme corresponding to the updated solution if the updated solution meets a preset planning condition, wherein the logistics planning scheme includes logistics route information and vehicle arrangement information; Before the transportation demand information and the site information of each site are input into the preset logistics planning model to obtain the initial solution, the planning module is further configured to: Receive a model construction instruction, acquire site information of each site in a logistics network, and a plurality of transportation demand information in a historical time period; Generate site paths according to the site information of each site in the logistics network and the plurality of transportation demand information; Generate shift paths according to the site paths, the site information of each site, and vehicle travel time between each pair of sites; Select each shift path according to the transportation time limit in each transportation demand information to obtain a feasible path set; Construct a preset logistics planning model according to the transportation proportion of each path in the feasible path set, the allocation information of vehicle parking in each site shift, and the arrangement information of vehicles between each pair of site shifts.

10. A logistics plan planning device characterized by comprising: Comprise: One or more processors; Memory; And One or more application programs, wherein the one or more application programs are stored in the memory and configured to be executed by the processor to implement the logistics scheme planning method of any one of claims 1 to 8.

11. A computer readable storage medium, characterized in that, A computer program is stored thereon, and the computer program is loaded by a processor to execute the steps in the logistics scheme planning method of any one of claims 1 to 8.

Images