Method and device for deploying reusable transportation container

Abstract

The invention discloses a method and a device for deploying reusable transportation containers, and relates to the technical field of intelligent logistics. A specific embodiment of the method comprises the following steps: determining whether a transportation site is a providing site or a required site of reusable transportation containers by acquiring the available number of the reusable transportation containers in the transportation site; according to the providing number of the providing sites, the demanded number of the demanded sites and the current remaining loading capacity of the transportation tools of the providing sites; determining the allocation quantity of transportation from the providing site to the demand site; and the transportation tool is controlled to transport the reusable transportation containers with the allocated number to the required site. According to the embodiment of the invention, the type of the transportation site is automatically determined, and the allocation quantity is calculated in combination with the residual loading capacity of the transportation site, so that the accuracy and real-time performance of determining the allocation quantity of the reusable transportation containers are improved, and the allocation efficiency of the reusable transportation containers is improved.

Description

Technical Field

[0001] The present invention relates to the field of smart logistics technology, and in particular to a method and device for deploying reusable transport containers. Background Art

[0002] In the field of logistics, transport executors can use reusable transport containers (such as reusable packaging bags, panel boxes, pallets, etc.) to assemble multiple individual item packages into container units, thereby better realizing the collective transportation and transit of item packages and improving transportation efficiency.

[0003] Since reusable transport containers need to be dynamically transferred and reused between different transport sites, the number of reusable transport containers between different sites (or areas) needs to be dynamically allocated to achieve a dynamic balance of the reusable transport containers; the current method for allocating the number of reusable transport containers is mainly through staff allocation based on experience, or through the logistics platform to estimate the allocation quantity of reusable transport containers; the manual allocation method has the problem of low accuracy and precision, and the method of logistics platform estimation has the problem of accuracy bias due to poor real-time performance. Summary of the invention

[0004] In view of this, an embodiment of the present invention provides a method and device for allocating reusable transport containers, which can determine whether a transport site is a provision site or a demand site for reusable transport containers by obtaining the available number of reusable transport containers in the transport site; determine the allocation number from the provision site to the demand site based on the provided number of the provision site, the required number of the demand site, and the current remaining load capacity of the transport vehicle providing the site; and control the transport vehicle to transport the allocated number of reusable transport containers to the demand site. The embodiment of the present invention improves the accuracy and real-time performance of determining the allocation number of reusable transport containers and improves the efficiency of allocating reusable transport containers by automatically determining the type of transport site and calculating the allocation number based on the remaining load capacity of the transport site.

[0005] To achieve the above-mentioned purpose, according to one aspect of an embodiment of the present invention, a method for allocating reusable transport containers is provided, which is characterized by comprising: obtaining the available number of reusable transport containers in a logistics transportation site; determining, based on the available number, whether the transportation site is a supply site or a demand site for reusable transport containers; for a determined set of paired supply sites and demand sites, obtaining the supply quantity of reusable transport containers at the supply site and the demand quantity of reusable transport containers at the demand site, and determining the current remaining load of a transport vehicle at the supply site; determining the allocation quantity for transportation from the supply site to the demand site based on the supply quantity, the demand quantity and the current remaining load; and controlling the transport vehicle to transport the allocated number of reusable transport containers to the demand site.

[0006] Optionally, determining a set of paired provided venues and demanded venues includes: in the case where the transportation venue is the provided venue, selecting a demanded venue paired with the provided venue from multiple downstream transportation venues to form a set of paired provided venues and demanded venues.

[0007] Optionally, selecting a demand site to be paired with the providing site from multiple downstream transportation sites includes: determining each downstream demand site having a transportation relationship with the providing site based on logistics network information; obtaining the transportation cost between the providing site and each downstream demand site; and selecting the downstream demand site corresponding to the minimum transportation cost as the demand site to be paired with the providing site.

[0008] Optionally, obtaining the available number of reusable transport containers in the logistics transportation site includes: obtaining the historical outflow number and historical inflow number of reusable transport containers in the transportation site; and using the difference between the historical outflow number and the historical inflow number as the current available number of reusable transport containers in the transportation site.

[0009] Optionally, based on the provided quantity, the required quantity and the current remaining load, the allocation quantity from the provided site to the required site is determined, including: inputting the provided quantity and the required quantity into a preset operations research model; performing a solution operation based on the preset operations research model and preset constraints; wherein the preset constraints include constraints on the current remaining load of the transport vehicle; and determining the allocation quantity of reusable transport containers provided by the provided site to the required site based on the solution results.

[0010] Optionally, the preset constraints also include any one or more of the following multiple constraints and / or constraint relationships: total number of transportation sites constraint; route constraint between different transportation sites; demand satisfaction constraint for demand sites; inventory constraint for provided sites.

[0011] Optionally, after controlling the transport vehicle to transport the allocated quantity of reusable transport containers to the demand site, it further includes: updating the first available quantity of the reusable transport containers of the providing site and updating the second available quantity of the demand site according to the allocated quantity; re-determining a set of paired first providing site and first demand site according to the first available quantity and the second available quantity; and determining the updated allocation quantity from the first providing site to the first demand site based on the first available quantity, the second available quantity and the current remaining loading capacity of the transport vehicle of the first providing site.

[0012] To achieve the above object, according to a second aspect of an embodiment of the present invention, a deployment device for reusable transport containers is provided, characterized in that it includes: a site determination module, a quantity acquisition module and a deployment module; wherein,

[0013] A site determination module is used to obtain the available number of reusable transport containers in a logistics transport site; based on the available number, determine whether the transport site is a provision site or a demand site for reusable transport containers;

[0014] A quantity acquisition module is used to obtain, for a determined set of paired provision sites and demand sites, the provision quantity of reusable transport containers provided by the provision site and the demand quantity of reusable transport containers required by the demand site, and determine the current remaining load of the transport vehicle of the provision site;

[0015] The allocation module is used to determine the allocation quantity for transportation from the provided site to the required site based on the provided quantity, the required quantity and the current remaining load; and control the transportation tool to transport the reusable transportation containers of the allocated quantity to the required site.

[0016] Optionally, a deployment device for reusable transport containers is used to determine a set of paired provision sites and demand sites, including: in the case where the transport site is a provision site, selecting a demand site paired with the provision site from multiple downstream transport sites to form a set of paired provision sites and demand sites.

[0017] Optionally, a deployment device for reusable transport containers is used to select a demand site to be paired with a providing site from multiple downstream transport sites, including: determining each downstream demand site that has a transport relationship with the providing site based on logistics network information; obtaining the transport cost between the providing site and each downstream demand site; and using the downstream demand site corresponding to the minimum transport cost as the demand site to be paired with the providing site.

[0018] Optionally, a deployment device for reusable transport containers is used to obtain the available number of reusable transport containers in a logistics transportation site, including: obtaining a historical outflow number and a historical inflow number of reusable transport containers in the transportation site; and taking the difference between the historical outflow number and the historical inflow number as the current available number of reusable transport containers in the transportation site.

[0019] Optionally, a deployment device for reusable transport containers is used to determine the deployment quantity from the provision site to the demand site based on the provision quantity, the demand quantity and the current remaining load, including: inputting the provision quantity and the demand quantity into a preset operations research model; performing a solution operation based on the preset operations research model and preset constraints; wherein the preset constraints include constraints on the current remaining load of the transport tool; and determining the deployment quantity of reusable transport containers provided by the provision site to the demand site based on the solution results.

[0020] Optionally, the allocation device for reusable transport containers includes preset constraints that also include any one or more of the following multiple constraints and / or constraint relationships: total number of transport sites constraint; route constraints between different transport sites; demand satisfaction constraints for demand sites; inventory constraints for provided sites.

[0021] Optionally, the allocation device for reusable transport containers is used to control the transport vehicle to transport the allocated number of reusable transport containers to the demand site, and further includes: updating the first available number of reusable transport containers of the providing site and the second available number of the demand site according to the allocated number; re-determining a set of paired first providing site and first demand site according to the first available number and the second available number; and determining the updated allocation number from the first providing site to the first demand site based on the first available number, the second available number and the current remaining loading capacity of the transport vehicle of the first providing site.

[0022] To achieve the above-mentioned purpose, according to the third aspect of an embodiment of the present invention, there is provided an electronic device for deploying reusable transport containers, characterized in that it includes: one or more processors; a storage device for storing one or more programs, when the one or more programs are executed by the one or more processors, the one or more processors implement any of the methods described in the above-mentioned methods for deploying reusable transport containers.

[0023] To achieve the above-mentioned purpose, according to the fourth aspect of an embodiment of the present invention, a computer-readable medium is provided, on which a computer program is stored, characterized in that when the program is executed by a processor, any method described in the above-mentioned method for deploying reusable transport containers is implemented.

[0024] To achieve the above-mentioned purpose, according to the fifth aspect of an embodiment of the present invention, a computer program product is provided, including a computer program, characterized in that when the computer program is executed by a processor, any one of the methods for deploying reusable transport containers as described above is implemented.

[0025] One embodiment of the above invention has the following advantages or beneficial effects: it is possible to determine whether the transport site is a provision site or a demand site for reusable transport containers by obtaining the available number of reusable transport containers in the transport site; determine the number of deployments from the provision site to the demand site based on the provision number of the provision site, the demand number of the demand site, and the current remaining load of the transport vehicle providing the site; and control the transport vehicle to transport the deployed number of reusable transport containers to the demand site. The embodiment of the present invention improves the accuracy and real-time performance of determining the deployment number of reusable transport containers and improves the efficiency of deployment of reusable transport containers by automatically determining the type of transport site and calculating the deployment number in combination with the remaining load of the transport site.

[0026] The further effects of the above-mentioned non-conventional optional manner will be described below in conjunction with the specific implementation manner. BRIEF DESCRIPTION OF THE DRAWINGS

[0027] The accompanying drawings are used to better understand the present invention and do not constitute an improper limitation of the present invention.

[0028] Figure 1 It is a flow chart of a method for dispensing a reusable transport container provided by one embodiment of the present invention;

[0029] Figure 2 It is a schematic diagram of a construction process of a preset operations model for handling the allocation of reusable transport containers provided by an embodiment of the present invention;

[0030] Figure 3 It is a schematic diagram of a flow chart of the deployment of a reusable transport container provided by an embodiment of the present invention;

[0031] Figure 4 It is a structural schematic diagram of a deployment device for a reusable transport container provided by one embodiment of the present invention;

[0032] Figure 5 is an exemplary system architecture diagram to which embodiments of the present invention may be applied;

[0033] Figure 6 It is a schematic diagram of the structure of a computer system of a terminal device or a server suitable for implementing an embodiment of the present invention. DETAILED DESCRIPTION

[0034] The following is a description of exemplary embodiments of the present invention in conjunction with the accompanying drawings, including various details of the embodiments of the present invention to facilitate understanding, which should be considered as merely exemplary. Therefore, it should be recognized by those of ordinary skill in the art that various changes and modifications may be made to the embodiments described herein without departing from the scope and spirit of the present invention. Similarly, for clarity and conciseness, the description of well-known functions and structures is omitted in the following description.

[0035] It should be noted that the collection, use, storage, sharing and transfer of user personal information involved in the technical solution of the present invention are in compliance with the provisions of relevant laws and regulations, and the user needs to be informed and the user's consent or authorization is obtained. When applicable, the user's personal information is de-identified and / or anonymized and / or encrypted. The existing planning methods for reusable transport containers mainly have the following problems:

[0036] Both the manual experience method and the system estimation method have problems with real-time performance and low turnover rate, making it difficult to meet the actual allocation time limit. Among them, the planning rationality of the manual experience method depends on the experience of the planners and is difficult and time-consuming. In addition, it can only provide planning data from a macro perspective, while in actual operations, more accurate information on the number and allocation of reusable transport containers is required; while the system estimation method relies on the stability of the inventory data interface and the accuracy of manually submitted data. The system cannot update the data of the day in real time, resulting in delayed forecast time and low turnover rate, resulting in retention and loss, and the site cannot achieve allocation imbalance. For example: Taking the reusable transport container as a bag, assume the following scenario: (1) Site A in the upstream link allocates 1,000 bags to Site B in the downstream link and requires the bags to be returned, but Site B in the downstream link will return the bags empty, which will cause the line loading rate to be damaged; (2) Site A in the upstream link allocates 1,000 bags to Site B in the downstream link but does not require them to be returned, which will cause the bags to be stranded at the site, idle and wasted, affecting the site turnover rate; (3) If there is no round-trip route between Site A in the upstream link and Site B in the downstream link, the empty bags need to be ferried to the nearest site for transfer, which will cause a waste of transportation capacity. It can be seen that the existing allocation method lacks the ability to achieve dynamic allocation of bags while ensuring the turnover rate and transportation cost of bags so that the allocation balance between sites can be achieved.

[0037] In view of this, if Figure 1 As shown, an embodiment of the present invention provides a method for distributing a reusable transport container, which may include the following steps:

[0038] Step S101: obtaining the available number of reusable transport containers in a logistics transport site; and determining, based on the available number, whether the transport site is a provision site or a demand site for reusable transport containers.

[0039] Specifically, a transportation site is a transportation transit node in a logistics network, such as a distribution point, a transfer station, etc.; an item package usually passes through multiple transportation sites from the place of shipment to the destination address, that is, a reusable transportation container carrying multiple item packages (such as a reusable packaging bag, a panel box, a pallet, etc.) usually passes through multiple transportation sites from the place of shipment to the destination address. In actual logistics transportation, a large number of reusable transportation containers continue to circulate between different transportation sites.

[0040] Furthermore, the available number of reusable transport containers in the logistics transport site is obtained. For each transport site in the logistics network, the available number of reusable transport containers at a certain time can be obtained; it can be understood that since the available number of reusable transport containers for a certain transport site changes dynamically, the available number refers to the current available number.

[0041] Furthermore, the method for obtaining the available number of reusable transport containers in the logistics transportation site is: obtaining the historical outflow number and the historical inflow number of the reusable transport containers in the transportation site; and taking the difference between the historical outflow number and the historical inflow number as the current available number of reusable transport containers in the transportation site. Specifically, for a certain transportation site, each outflow or inflow of a reusable transport container can be recorded and stored, so the difference between the historical outflow number and the historical inflow number is calculated as the current available number of reusable transport containers in the transportation site. Similarly, in a certain time period, the available number of reusable transport containers in each transportation site can be obtained.

[0042] Further, determine whether the transport yard is a provision yard or a demand yard for reusable transport containers. Specifically, for a certain transport yard, if the difference between the historical outflow quantity and the historical inflow quantity is greater than 0, it means that the transport yard has reusable transport containers that can be provided; that is, the transport yard is a provision yard; if the difference between the historical outflow quantity and the historical inflow quantity is less than 0, it means that the transport yard needs reusable transport containers, that is, the transport yard is a demand yard. If the difference between the historical outflow quantity and the historical inflow quantity is equal to 0, it means that the reusable transport containers of the transport yard are balanced, that is, the transport yard is neither a provision yard nor a demand yard. It can be understood that the embodiments of the present invention only perform allocation processing for provision yards or demand yards.

[0043] Step S102: for a determined set of paired providing sites and demanding sites, obtain the providing quantity of reusable transport containers provided by the providing sites and the demanding quantity of reusable transport containers required by the demanding sites, and determine the current remaining load capacity of the transport vehicle of the providing sites.

[0044] Specifically, it can be understood that the reusable transport container needs to be transported from the supply site to the demand site, so a set of paired supply sites and demand sites need to be determined; in the case where the transport site is the supply site, a demand site paired with the supply site is selected from multiple downstream transport sites to form a set of paired supply sites and demand sites. According to the logistics network, multiple downstream transport sites downstream of a transport site can be determined.

[0045] Furthermore, selecting a demand site to be paired with the provision site from multiple downstream transportation sites includes: determining each downstream demand site that has a transportation relationship with the provision site based on the logistics network information; obtaining the transportation cost between the provision site and each downstream demand site; and using the downstream demand site corresponding to the minimum transportation cost as the demand site paired with the provision site. Specifically, for a certain provision site, there may be multiple demand sites downstream thereof. In an embodiment of the present invention, a set of paired provision sites and demand sites is determined based on the minimum transportation cost (e.g., distance, time consumption, etc.).

[0046] Furthermore, the quantity of reusable transport containers provided by the providing site and the quantity of reusable transport containers demanded by the demanding site are obtained, wherein the quantity of reusable transport containers provided by the providing site is usually greater than the quantity of reusable transport containers demanded by the demanding site. In another embodiment, if the quantity provided is less than the quantity demanded, multiple providing sites can be determined to jointly provide reusable transport containers for the demanding site to meet the quantity requirement of the demanding site.

[0047] Further, the current remaining load of the transport vehicle providing the site is determined; wherein the current remaining load represents the number of reusable transport containers that can be loaded by the transport vehicle (e.g., different types of vehicles) that handles the transport task from the site, and the current remaining load can be determined by obtaining the total load of the transport vehicle and the load of the currently loaded items; in order to solve the problem of using a dedicated vehicle for reusable transport containers, the present invention adopts a "filling warehouse" deployment method, so that the transport vehicle can carry reusable transport containers while performing normal transport tasks. The transport efficiency is improved and the transport cost of the reusable transport container is reduced.

[0048] Step S103: Based on the provided quantity, the required quantity and the current remaining load, determine the allocated quantity for transportation from the provided site to the required site; and control the transportation tool to transport the allocated quantity of reusable transportation containers to the required site.

[0049] Specifically, the number of deployments from the provided site to the required site is determined in combination with the provided quantity, the required quantity and the current remaining load capacity of the provided site; and information on the number of deployments of reusable transport containers is sent to the staff client of the provided site or the operator client of the transport vehicle to control the transport vehicle to transport the deployed number of reusable transport containers to the required site.

[0050] In an embodiment of the present invention, a preset operations research model is used in combination with a constraint condition solving method to determine the allocation quantity from the provided site to the required site.

[0051] The embodiment of the present invention dynamically and in real time obtains the available number of reusable transport containers in different transport sites; distinguishes between the supply site and the demand site according to the available number, determines the transport direction and route of the reusable transport containers, and determines the number of reusable transport containers to be deployed, so that the deployed number of reusable transport containers is transported from the supply site to the demand site. The embodiment of the present invention improves the accuracy and real-time performance of the number of reusable transport containers deployed in the transport site, and reduces the transport cost and improves the transport efficiency by combining the current remaining load of the transport tool.

[0052] It can be understood that the method of the embodiment of the present invention can also be applied to the allocation of reusable transport containers between different geographical areas. For the inflow and outflow of reusable transport containers between different areas, one area can be taken as a whole, and the processing methods of different sites can be used to determine the allocation plan of reusable transport containers for different areas.

[0053] like Figure 2 As shown, an embodiment of the present invention provides a schematic diagram of a construction process of a preset logistics model for processing the allocation of reusable transport containers. The process may include:

[0054] Step S201: According to the description of the deployment scenario of the reusable transport container, the deployment problem of the reusable transport container is abstracted. Specifically, for the deployment problem of the existing reusable transport container (for example: reusable bulk bags), the decision factor abstracted from the problem is to determine the filling and allocation plan of the bulk bags at each site (representing the plan of carrying reusable transport containers and transporting reusable transport containers by non-dedicated vehicles). The following is an example of bulk bags, that is, the problem is the most reasonable number of bulk bags transported from any provided site to the required site, which is essentially a problem of allocation balance between the inflow and outflow of bulk bags at different transport sites. Since the origin and destination sites can contain multiple departure waves, the number of bulk bags and vehicle loading rates issued in each wave are different. Since there will be no cross-over and overlap in the time period of different waves, they will not affect each other. Each wave can be planned independently. For any wave period, the optimization goal is the balance of inflow and outflow in different sites (or areas). In addition, after the packaging bags of a route are sent from the supply site A to the demand site B, ignoring the time required in transit, the problem is abstracted into an intelligent decision-making method for allocating the number of reusable transport containers, transportation tools (such as vehicle models), and transportation routes from the supply site A to the demand site B.

[0055] Step S202: Based on the abstraction of the allocation problem of the reusable transport container, a preset operation model is constructed, constraints of the preset operation model are constructed, and priorities of the constraints are configured.

[0056] Specifically, through problem abstraction, it can be known that it is a single optimization objective filling and allocation optimization problem. The objective function is to minimize the number of bag allocations at the site while considering the distance between transportation sites. For example, the main decision variable X oj Indicates the number of bag collection bags transferred from site i to site j (i.e., the number of reusable transport containers transferred). In order to overcome the following problems: On the one hand, if the empty bags are returned when all upstream sites require the return of the bags, the vehicle loading rate will be damaged; On the other hand, if the bags are not returned by the upstream links, they will be stranded at the site and will be idle and wasted. At the same time, if there is no round-trip route that requires the empty bags to be ferried to the nearest site for transfer, it will cause a waste of transportation capacity. Therefore, the embodiment of the present invention constructs a preset operations model.

[0057] Specifically, the objective function of the preset operations research model is shown in formula (1):

[0058]

[0059] The objective function is used to minimize the number of baggage allocated to the site, so as to minimize the absolute value of the number of baggage flowing into the site minus the number of baggage flowing out of the site. Through the constraints, the transportation is made to use the warehouse filling method as much as possible and reduce the special vehicle allocation method.

[0060] The following is a symbolic description of the preset operations research model and constraints:

[0061] M represents the set of sites; P represents the set of flow pairs between transport sites, representing the fixed routes between site i and site j; S represents the set of sites for business demand routes; K ij represents the transportation distance from site i to site j; Represents the safety stock of site i. For example, the average daily construction quantity*0.25 is taken for the inflow site, and the average daily construction quantity*0.5 is taken for the outflow site; C i Represents the initial inflow and outflow difference of site i, the average of the historical inflow bag quantity Ii-outflow bag quantity Oi of site i, the difference of the demand site (inflow site) is greater than 0, and the difference of the supply site (outflow site) is less than 0; D ij represents the remaining load of site i, which is the product of (1-loading rate on the route from site i to site j) and the maximum loading capacity of the specified vehicle type on the route; P ij Represents whether there is a feasible path from site i to site j. If there is a route from site i to site j, Pij = 1, otherwise Pij = 0, indicating that there is no route. The decision variable X ij Represents the number of bags transferred from site i to site j (i.e. the number of bags transferred).

[0062] Among them, the average daily packaging volume refers to the number of packaging bags used every day; the inflow site refers to the site where the daily inflow is greater than the outflow (demand site), and the outflow site refers to the site where the daily inflow is less than the outflow (providing site). From the perspective of flow direction, the outflow itself is a consumable site, so the safety stock retained should be relatively large to improve the site's ability to resist abnormalities and risks. The inflow is a surplus site, so the safety stock retained is relatively small, and according to the management of reusable transport containers, the detention cost must be calculated for more than N days (LIRU 3 days, 7 days, etc.), so the safety stock coefficient needs to be less than 1 to encourage and promote timely allocation; 0.5 and 0.25 can be obtained based on the historical data analysis of the daily fluctuations in the cargo volume and its turnover rate of each site, and the present invention does not limit the specific quantity and coefficient.

[0063] Furthermore, the preset constraint conditions of the preset operations research model are, for example, one or more of the following:

[0064] Route constraints: For the bag filling and allocation on the route, it must first be satisfied that the route has a flow route and that the sorting has other upstream and downstream sorting.

[0065] X ij ≥0,i,j∈P ij =1,i,j∈S

[0066] Feasible path constraints: avoid situations where there is only entry but no exit or only exit but no entry.

[0067]

[0068] Satisfy demand constraints: The quantity of packaging bags required at each site must be met.

[0069]

[0070] Satisfy inventory constraints: In the case of inventory restrictions, the total amount of bulk bags transferred from site i cannot exceed its safety stock. In the case of no inventory restrictions, the remaining sites meet the allocation balance constraint: the final inflow and outflow difference of each site i is as close to 0 as possible, ensuring that the imbalance between sites after allocation is minimal.

[0071]

[0072] For the above constraints, the constraint priority can be configured. That is, the preset constraints also include any one or more of the following constraints and / or constraint relationships: total number of transport sites constraint; route constraints between different transport sites; demand satisfaction constraints for demand sites; inventory constraints for provided sites.

[0073] Step S203: Based on the historical data of the deployment of reusable transport containers, perform data cleaning and preprocessing operations to obtain preprocessed data, perform a solving operation on a preset operations research model based on the processed data, and use a business executable solution to adjust the result of the solving operation.

[0074] Specifically, since the original historical data (bag inventory information, net value information of inflow and outflow of each site, line loading rate information, etc.) is scattered data and has problems such as missing data, data duplication, and invalid data, the original data is cleaned and preprocessed, for example: data verification, deletion of erroneous data, filling in missing data, etc. are used to clean the data and organize it into a data structure that matches the preset operations model. The model is solved in combination with the processed preprocessed data, which improves the efficiency of model construction.

[0075] Specifically, in the solution method of the preset operations research model, the embodiment of the present invention realizes the solution by using the operations research optimization algorithm. Specifically, the implementation steps of the operations research optimization algorithm can be adjusted as follows:

[0076] 1) Initialization: Calculate the initial inflow and outflow difference C of each site i , remaining load R i .

[0077] 2) Determine the type of transport site (provided site or required site): First, based on the initial inflow and outflow difference C i Determine the venue type. If C i >0, the site type is an inflow site (providing site), which is regarded as the originating site set of the transfer line; if C i <0, the site type is an outflow site (demand site) and is considered as the destination site set of the transfer line; if C i =0, it means that the initial state of the site has reached the balance of inflow and outflow, and the site type is regarded as other sites and does not need to participate in the site allocation set. Furthermore, in addition to determining the type of a transport site, the inflow and outflow difference of all sites in the same province j can also be calculated according to the province or region to which the site belongs. j C i , if ∑ j C i >0 is an inflow province, otherwise it is an outflow province. Finally, the inflow and outflow difference of all sites in the same region q∑ q C i , if ∑ q C i If >0, it is an inflow area, otherwise it is an outflow area.

[0078] 3) Select the minimum filling and transfer pair based on transportation cost (a set of paired supply sites and demand sites): Since transportation cost is proportional to distance, the transportation distance L between inflow site i and outflow site j is calculated. ij , and according to the principle of minimum distance priority, obtain the closest route (i, j) between the inflow site i and the outflow site j, which is regarded as the transfer pair. Secondly, among all the possible transfer pairs (i, j) between the inflow site i and the outflow site j, select one such that L ij *X ij The smallest transfer pair, here is X ij is the estimated demand quantity, based on C i , C j , R i To estimate the transfer amount.

[0079] 4) Determine the filling transfer quantity: For the selected transfer pair (i, j), according to C i and C j , and the site i allocation capacity R of the feasible route flow i Limit, determine the transfer quantity X ij , that is, choose min(C i ,C j ,R i ).

[0080] 5) Update status: After executing the transfer, update C i and C j and the status of other relevant venues.

[0081] 6) Repeat steps 2) to 5) until no suitable transfer pair or C flowing into site i can be found. i =0 (the upper limit of the site has been reached and the site has been converted to a balanced state) or the C of site j has flowed out j Balanced to 0 (converted to balanced field state).

[0082] The preset operations research model can be solved by executing a solution on multiple historical transportation data of the reusable transportation container, and the constraints or the priority of the constraints can be adjusted according to the solution results to obtain an optimized preset operations research model and constraints.

[0083] The description of step S201 to step S203 is to determine the allocation quantity from the providing site to the demanding site based on the provided quantity, the required quantity and the current remaining load, including: inputting the provided quantity and the required quantity into a preset operations research model; performing a solution operation based on the preset operations research model and preset constraints; wherein the preset constraints include constraints on the current remaining load of the transport vehicle; and determining the allocation quantity of reusable transport containers provided by the providing site to the demanding site based on the solution results.

[0084] like Figure 3 As shown, an embodiment of the present invention provides a schematic diagram of a process for allocating a reusable transport container; the process may include the following steps:

[0085] Step S301: obtaining the available number of reusable transport containers in a logistics transport site; and determining, based on the available number, whether the transport site is a provision site or a demand site for reusable transport containers.

[0086] Step S302: for a determined set of paired providing sites and demanding sites, obtain the providing quantity of reusable transport containers provided by the providing sites and the demanding quantity of reusable transport containers required by the demanding sites, and determine the current remaining load capacity of the transport vehicle of the providing sites.

[0087] Step S303: Based on the provided quantity, the required quantity and the current remaining load, determine the allocation quantity from the provided site to the required site; control the transport tool to transport the allocated quantity of reusable transport containers to the required site.

[0088] Specifically, the steps of step S301 to step S303 are consistent with the description of step S101 to step S103, and are not repeated here.

[0089] Step S304: according to the allocated quantity, the provided quantity of the reusable transport containers of the provided site is updated, and the required quantity of the required site is updated.

[0090] Step S305: re-determine a pair of first provided venues and first required venues according to the updated provided quantity and the updated required quantity.

[0091] Step S306: Based on the updated supply quantity, the updated demand quantity and the current remaining load capacity of the transport vehicle of the first supply site, determine the updated allocation quantity from the first supply site to the first demand site; in the next transport wave, control the transport vehicle to transport the updated allocation quantity of reusable transport containers to the first demand site.

[0092] Specifically, since the available number of reusable transport containers of a transportation site changes dynamically, the type of transportation site (providing site or demanding site) may also change; therefore, after the embodiment of the present invention determines the allocation quantity for a group of paired providing sites and demanding sites and completes the transportation, it updates the available number of reusable transport containers of the providing site, updates the available number of the demanding site, re-determines one or more groups of paired providing sites and demanding sites, and continues to loop based on the first available number, the second available number and the current remaining load of the transportation vehicle of the first providing site, determines the updated allocation quantity from the first providing site to the first demanding site, until the allocation quantity of each transportation site under the logistics network is in a balanced state (that is, the outflow and inflow quantities are basically the same, or the difference is less than the set threshold).

[0093] Step S307: Determine whether the number of reusable transport containers in the transport yard has reached a balance. If so, the process ends; otherwise, the process loops through step S301.

[0094] The description of step S304 to step S306 is that after controlling the transport vehicle to transport the allocated quantity of reusable transport containers to the demand site, it further includes: updating the first available quantity of the reusable transport containers of the providing site and updating the second available quantity of the demand site according to the allocated quantity; re-determining a set of paired first providing site and first demand site according to the first available quantity and the second available quantity; and determining the updated allocation quantity from the first providing site to the first demand site based on the first available quantity, the second available quantity and the current remaining load of the transport vehicle of the first providing site.

[0095] like Figure 4 As shown, an embodiment of the present invention provides a deployment device 400 for reusable transport containers, comprising: a site determination module 401, a quantity acquisition module 402 and a deployment module 403; wherein,

[0096] The site determination module 401 is used to obtain the available number of reusable transport containers in the logistics transport site; according to the available number, determine whether the transport site is a provision site or a demand site for reusable transport containers;

[0097] The quantity acquisition module 402 is used to acquire the quantity of reusable transport containers provided by the providing site and the quantity of reusable transport containers required by the requiring site for a determined set of paired providing sites and requiring sites, and determine the current remaining load of the transport vehicle of the providing site;

[0098] The allocation module 403 is used to determine the allocation quantity for transportation from the provided site to the required site based on the provided quantity, the required quantity and the current remaining load; and control the transportation tool to transport the reusable transportation containers of the allocated quantity to the required site.

[0099] An embodiment of the present invention also provides an electronic device for deploying reusable transport containers, including: one or more processors; a storage device for storing one or more programs, when the one or more programs are executed by the one or more processors, the one or more processors implement the method provided in any of the above embodiments.

[0100] An embodiment of the present invention further provides a computer-readable medium on which a computer program is stored. When the program is executed by a processor, the method provided in any of the above embodiments is implemented.

[0101] An embodiment of the present invention further provides a computer program product, including a computer program, which implements any of the above-mentioned methods for allocating reusable transport containers when executed by a processor.

[0102] Figure 5 An exemplary system architecture 500 is shown to which the method for deploying a reusable transport container or the device for deploying a reusable transport container according to an embodiment of the present invention can be applied.

[0103] like Figure 5 As shown, system architecture 500 may include terminal devices 501, 502, 503, a network 504 and a server 505. Network 504 is used to provide a medium for communication links between terminal devices 501, 502, 503 and server 505. Network 504 may include various connection types, such as wired, wireless communication links or optical fiber cables, etc.

[0104] Users can use terminal devices 501, 502, 503 to interact with server 505 through network 504 to receive or send messages, etc. Various client applications can be installed on terminal devices 501, 502, 503, such as e-commerce client applications, web browser applications, search applications, instant messaging tools, and email clients.

[0105] The terminal devices 501 , 502 , and 503 may be various electronic devices having a display screen and supporting various client applications, including but not limited to smart phones, tablet computers, laptop computers, desktop computers, and the like.

[0106] The server 505 may be a server that provides various services, such as a background management server that provides support for client applications used by users using the terminal devices 501, 502, and 503. The background management server may process the received allocation request for the reusable transport container and feed back the allocated quantity of the reusable transport container to the terminal device.

[0107] It should be noted that the method for allocating reusable transport containers provided in the embodiment of the present invention is generally executed by the server 505 , and accordingly, the device for allocating reusable transport containers is generally disposed in the server 505 .

[0108] It should be understood that Figure 5 The number of terminal devices, networks and servers in the embodiment is only for illustration. Any number of terminal devices, networks and servers may be provided according to implementation requirements.

[0109] Reference below Figure 6 , which shows a schematic diagram of the structure of a computer system 600 of a terminal device suitable for implementing an embodiment of the present invention. Figure 6 The terminal device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present invention.

[0110] like Figure 6 As shown, the computer system 600 includes a central processing unit (CPU) 601, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 602 or a program loaded from a storage part 608 into a random access memory (RAM) 603. In the RAM 603, various programs and data required for the operation of the system 600 are also stored. The CPU 601, the ROM 602, and the RAM 603 are connected to each other via a bus 604. An input / output (I / O) interface 605 is also connected to the bus 604.

[0111] The following components are connected to the I / O interface 605: an input section 606 including a keyboard, a mouse, etc.; an output section 607 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 608 including a hard disk, etc.; and a communication section 609 including a network interface card such as a LAN card, a modem, etc. The communication section 609 performs communication processing via a network such as the Internet. A drive 610 is also connected to the I / O interface 605 as needed. A removable medium 611, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 610 as needed, so that a computer program read therefrom is installed into the storage section 608 as needed.

[0112] In particular, according to the embodiments disclosed in the present invention, the process described above with reference to the flowchart can be implemented as a computer software program. For example, the embodiments disclosed in the present invention include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from the network through the communication part 609, and / or installed from the removable medium 611. When the computer program is executed by the central processing unit (CPU) 601, the above-mentioned functions defined in the system of the present invention are executed.

[0113] It should be noted that the computer-readable medium shown in the present invention may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present invention, a computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, device or device. In the present invention, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries a computer-readable program code. This propagated data signal may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Computer-readable signal media may also be any computer-readable medium other than computer-readable storage media, which may send, propagate or transmit a program for use by or in conjunction with an instruction execution system, apparatus or device. The program code contained on the computer-readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, optical cable, RF, etc., or any suitable combination of the above.

[0114] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present invention. In this regard, each box in the flow chart or block diagram can represent a module, a program segment, or a part of a code, and the above-mentioned module, program segment, or a part of a code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram or flow chart, and the combination of the boxes in the block diagram or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0115] The modules and / or units involved in the embodiments of the present invention may be implemented in software or hardware. The modules and / or units described may also be arranged in a processor. For example, they may be described as follows: a processor includes a site determination module, a quantity acquisition module, and an allocation module. The names of these modules do not, in some cases, constitute limitations on the modules themselves. For example, the site determination module may also be described as a "module for determining that a transport site is a provision site or a demand site for reusable transport containers."

[0116] As another aspect, the present invention also provides a computer-readable medium, which may be included in the device described in the above embodiment; or it may exist independently and not be assembled into the device. The above computer-readable medium carries one or more programs, and when the above one or more programs are executed by a device, the device includes: obtaining the available number of reusable transport containers in the transportation site of logistics; according to the available number, determining that the transportation site is a supply site or a demand site for reusable transport containers; for a determined set of paired supply sites and demand sites, obtaining the supply quantity of reusable transport containers in the supply site and the demand quantity of reusable transport containers in the demand site, and determining the current remaining load of the transport vehicle of the supply site; based on the supply quantity, the demand quantity and the current remaining load, determining the allocation quantity from the supply site to the demand site; controlling the transport vehicle to transport the allocated number of reusable transport containers to the demand site.

[0117] The embodiments of the present invention can determine whether the transport site is a provision site or a demand site for reusable transport containers by obtaining the available number of reusable transport containers in the transport site; determine the number of deployments from the provision site to the demand site based on the provision number of the provision site, the demand number of the demand site, and the current remaining load of the transport vehicle providing the site; and control the transport vehicle to transport the deployed number of reusable transport containers to the demand site. The embodiments of the present invention improve the accuracy and real-time performance of determining the deployment number of reusable transport containers and improve the efficiency of deployment of reusable transport containers by automatically determining the type of transport site and calculating the deployment number in combination with the remaining load of the transport site.

[0118] The above specific implementations do not constitute a limitation on the protection scope of the present invention. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may occur depending on design requirements and other factors. Any modification, equivalent substitution and improvement made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.

Claims

1. A method for preparing a reusable transport container, characterized in that: include: Obtain the available number of reusable transport containers in the logistics transport yard; Determining, based on the available quantity, that the transport site is a site for providing or a site for demanding reusable transport containers; For a determined set of paired provision sites and demand sites, obtaining the provision quantity of reusable transport containers provided by the provision site and the demand quantity of reusable transport containers required by the demand site, and determining the current remaining load capacity of the transport vehicle of the provision site; Determine the allocation quantity for transporting from the supply site to the demand site based on the supply quantity, the demand quantity and the current remaining load; The transport vehicle is controlled to transport the allocated number of reusable transport containers to the required site.

2. The method according to claim 1, characterized in that The step of determining a set of paired provided venues and required venues includes: In the case where the transport site is a provision site, a demand site paired with the provision site is selected from multiple downstream transport sites to form a group of paired provision sites and demand sites.

3. The method according to claim 2, characterized in that The step of selecting a demand site that matches the provided site from a plurality of downstream transport sites includes: Determine each downstream demand site having a transportation relationship with the providing site according to the logistics network information; Obtaining the transportation cost between the providing site and each of the downstream demand sites; The downstream demand site corresponding to the minimum transportation cost is used as the demand site paired with the provided site.

4. The method according to claim 1, characterized in that The available number of reusable transport containers in the transport site for obtaining logistics includes: Obtain the historical outflow quantity and historical inflow quantity of the reusable transport containers of the transport yard; The difference between the historical outflow quantity and the historical inflow quantity is used as the current available quantity of reusable transport containers at the transport yard.

5. The method according to claim 1, characterized in that: The step of determining the allocation quantity from the providing site to the requiring site based on the providing quantity, the requiring quantity and the current remaining load capacity includes: Input the provided quantity and the required quantity into a preset operation research model; perform a solution operation based on the preset operation research model and preset constraints; wherein the preset constraints include constraints on the current remaining load of the transport vehicle; The allocation quantity of the reusable transport containers provided by the providing site to the demanding site is determined according to the solution result.

6. The method according to claim 5, characterized in that The preset constraint conditions also include any one or more of the following constraint items and / or constraint relationships: Constraints on the total number of transport sites; Route constraints between different transport sites; The demand for the required site meets the constraints; Inventory constraints for providing venues.

7. The method according to claim 1, characterized in that After controlling the transport vehicle to transport the allocated number of reusable transport containers to the demand site, the method further includes: According to the allocated quantity, updating the first available quantity of the reusable transport containers providing the site and updating the second available quantity of the required site; Re-determining a pair of first provided venue and first required venue according to the first available quantity and the second available quantity; Based on the first available quantity, the second available quantity and the current remaining load capacity of the transportation vehicle providing the first providing site, an updated deployment quantity from the first providing site to the first demanding site is determined.

8. A device for dispensing reusable transport containers, characterized in that: include: Determine the site module, obtain the quantity module and allocate the module; among them, The site determination module is used to obtain the available number of reusable transport containers in the logistics transport site; according to the available number, determine that the transport site is a provision site or a demand site for reusable transport containers; The quantity acquisition module is used to obtain, for a determined set of paired provision sites and demand sites, the provision site's provision quantity for reusable transport containers, the demand site's demand quantity for reusable transport containers, and determine the current remaining load capacity of the transport vehicle of the provision site; The allocation module is used to determine the allocation quantity for transportation from the supply site to the demand site based on the supply quantity, the demand quantity and the current remaining load; and control the transportation vehicle to transport the allocated quantity of reusable transportation containers to the demand site.

9. An electronic device, characterized in that: include: one or more processors; a storage device for storing one or more programs, When the one or more programs are executed by the one or more processors, the one or more processors implement the method according to any one of claims 1 to 7.

10. A computer readable medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the method according to any one of claims 1 to 7 is implemented.

11. A computer program product, comprising a computer program, characterized in that When the program is executed by a processor, the method according to any one of claims 1 to 7 is implemented.

Images