WO2023227132A1

WO2023227132A1 - Container planning method, apparatus, server, and computer readable storage medium

Info

Publication number: WO2023227132A1
Application number: PCT/CN2023/096775
Authority: WO
Inventors: 彭佳敏; 李珂; 刘志锦; 杨安琪; 王本玉; 张水华; 陈晖�
Original assignee: 顺丰科技有限公司
Priority date: 2022-05-27
Filing date: 2023-05-29
Publication date: 2023-11-30
Also published as: CN117196164A

Abstract

A container planning method in the present solution comprises: according to a container demand information set, an available-container information set and an in-transit container information set, determining a plan set for container usage in a target journey; determining a target container plan in the plan set as a container plan of the target journey, wherein a selected container combination in the target container plan has optimal preset container parameters in the plan set.

Description

Container planning method, device, server and computer-readable storage medium

This disclosure requires the priority of the Chinese patent application submitted to the China Patent Office on May 27, 2022, with the application number 202210594840.X and the invention title "Container planning method, device, server and computer-readable storage medium", all of which The contents are incorporated by reference into this disclosure.

Technical field

The present disclosure relates to the technical field of logistics and transportation, and specifically relates to a container planning method, device, server and computer-readable storage medium.

Background technique

Ocean transportation, also known as "international ocean cargo transportation", referred to as ocean transportation, is the most important mode of transportation in international logistics. It refers to a way of using ships to transport goods between ports in different countries and regions through sea lanes. It is the most widely used in international cargo transportation. However, in many shipping demand processes, there is a need for containers for multi-stage transportation.

The existing container demand for multi-stage transportation is usually manually based on the container demand and then combined with the actual available containers for current shipping. However, the actual matching effect is poor, problems are prone to occur, and the cost is high.

technical problem

The present disclosure provides a container planning method, device, server and computer-readable storage medium, aiming to solve the technical problems of how to realize automatic container planning, improve container planning efficiency and reduce planning costs.

Technical solutions

To achieve this goal, the present disclosure adopts the following technical solutions:

In a first aspect, the present disclosure provides a container planning method, which method includes:

Obtain a freight demand information set for a target trip, the target trip includes multiple freight nodes, and the freight demand information set includes container demand information for each freight node in the multiple freight nodes;

Obtain a set of available container information for the target itinerary, where the set of available container information includes available container information for each of the multiple freight nodes;

Obtain the in-transit container information set of the target trip, where the in-transit container information set includes the in-transit container information of each of the multiple freight nodes;

According to the container demand information set, the available container information set and the in-transit container information set, a set of planning solutions for container use in the target itinerary is determined. The planning solution for each container use includes the selected container combination, and each Select the holding object corresponding to each container in the container combination;

Determine the target container planning scheme in the planning scheme set. As the container planning scheme for the target itinerary, the preset container parameters of the container combination selected in the target container planning scheme are optimal in the planning scheme set, and the selected container combination corresponds to The preset holding object parameters of the holding object are optimal in the set of planning solutions.

In a second aspect, the present disclosure provides a container planning device, which includes:

The first acquisition unit is used to obtain the freight demand information set of the target trip, the target trip includes multiple freight nodes, and the freight demand information set includes container demand information of each freight node in the multiple freight nodes;

a second acquisition unit, configured to acquire a set of available container information for the target itinerary, where the set of available container information includes available container information for each of the multiple freight nodes;

The third acquisition unit is used to acquire the in-transit container information set of the target trip, where the in-transit container information set includes the in-transit container information of each of the multiple freight nodes;

The first determination unit is configured to determine a set of planning solutions for container use in the target itinerary based on the container demand information set, the available container information set, and the in-transit container information set. Including the selected container combinations and the holding objects corresponding to each container in each selected container combination;

The second determination unit is used to determine the target container planning scheme in the planning scheme set. As the container planning scheme for the target itinerary, the preset container parameters of the container combination selected in the target container planning scheme are in the planning scheme set. Optimally, the preset holding object parameters of the holding object corresponding to the container combination are selected to be optimal in the set of planning solutions.

In a third aspect, the present disclosure also provides a server, the server including:

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 container planning method.

In a fourth aspect, the present disclosure also provides a computer-readable storage medium on which a computer program is stored, and the computer program is loaded by a processor to execute the steps in the container planning method.

beneficial effects

The container planning method provided by the present disclosure includes: obtaining a freight demand information set of a target trip, where the target trip includes multiple freight nodes, and the freight demand information set includes container demand information of each freight node in the multiple freight nodes; obtaining The available container information set of the target trip, the available container information set includes the available container information of each freight node in the multiple freight nodes; the in-transit container information set of the target trip is obtained, the in-transit container information set includes multiple In-transit container information of each freight node in the freight node; according to the container demand information set, the available container information set and the in-transit container information set, determine the planning solution set for container use in the target itinerary, and each container uses The planning plan includes the selected container combinations, and the holding objects corresponding to each container in each selected container combination; determine the target container planning plan in the set of planning plans, as the container planning plan for the target itinerary, the target container The preset container parameters of the container combination selected in the planning plan are optimal in the planning plan set, and the preset holding object parameters of the holding objects corresponding to the container combination are selected to be optimal in the planning plan set. Compared with traditional methods, when manually selecting and making decisions on shipping containers at multiple transportation nodes, the workload is large, it is impossible to consider all aspects, and the cost is high. This disclosure creatively proposes to place each freight node at the same location. The availability of containers in transit is taken into account as the category of available container information, thereby increasing the selection range of available container information, and by limiting the default container parameters and default holding object parameters, container planning for multiple transportation nodes is effectively improved. Efficiency and container usage costs.

Description of the drawings

Figure 1 is a schematic scenario diagram of a container planning system provided by one of the embodiments of the present disclosure;

Figure 2 is a schematic flow diagram of an embodiment of the container planning method provided in the embodiment of the present disclosure;

Figure 3 is a schematic flowchart of an embodiment of a set of planning solutions for determining the use of containers in a target itinerary provided in an embodiment of the present disclosure;

Figure 4 is a schematic structural diagram of an embodiment of the container planning device provided in the embodiment of the present disclosure;

Figure 5 is a schematic structural diagram of an embodiment of a server provided in an embodiment of the present disclosure.

Embodiments of the invention

The technical solutions in the embodiments of the present disclosure will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present disclosure. Obviously, the described embodiments are only some of the embodiments of the present disclosure, rather than all of the embodiments. Based on the embodiments in this disclosure, all other embodiments obtained by those skilled in the art without making creative efforts fall within the scope of protection of this disclosure.

In the description of the present disclosure, it should be understood that the terms "center", "longitudinal", "transverse", "length", "width", "thickness", "upper", "lower", "front", " The directions or positional relationships indicated by "back", "left", "right", "vertical", "horizontal", "top", "bottom", "inside", "outside", etc. are based on the directions shown in the accompanying drawings or positional relationships are only for the convenience of describing the present disclosure and simplifying the description, but do not indicate or imply that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore cannot be understood as a limitation of the present disclosure. In addition, the terms “first” and “second” are used for descriptive purposes only and cannot be understood as indicating or implying relative importance or implicitly indicating the quantity of indicated technical features. Thus, features defined as “first” and “second” may explicitly or implicitly include one or more of the described features. In the description of the present disclosure, "plurality" means two or more than two, unless otherwise expressly and specifically limited.

In this disclosure, the word "exemplary" is used to mean "serving as an example, illustration, or illustration." Any embodiment described as "exemplary" in this disclosure is not necessarily to be construed as preferred or advantageous over other embodiments. The following description is presented to enable any person skilled in the art to make and use the present disclosure. In the following description, details are set forth for the purpose of explanation. It will be understood that one of ordinary skill in the art will recognize that the present disclosure may be practiced without these specific details. In other instances, well-known structures and processes have not been described in detail to avoid obscuring the disclosure with unnecessary detail. Thus, the present disclosure is not intended to be limited to the embodiments shown but is to be accorded the widest scope consistent with the disclosed principles and features.

Embodiments of the present disclosure provide a container planning method, device, server and computer-readable storage medium, which will be described in detail below.

As shown in Figure 1, Figure 1 is a schematic scenario diagram of a container planning system provided by an embodiment of the present disclosure. The container planning system may include multiple terminals 100 and a server 200. The terminals 100 and the server 200 are network connected, and the server 200 is integrated with a container. The planning device is the server in Figure 1, and the terminal 100 can access the server 200.

In the embodiment of the present disclosure, the server 200 is mainly used to obtain the freight demand information set of the target itinerary. The target itinerary includes multiple freight nodes. The freight demand information set includes the container demand information of each freight node in the multiple freight nodes; obtain the freight demand information set of the target itinerary. The available container information set includes the available container information of each freight node in multiple freight nodes; the in-transit container information set of the target trip is obtained, and the in-transit container information set includes the in-transit container information of each freight node in the multiple freight nodes; Based on the container demand information set, available container information set and in-transit container information set, determine the planning solution set for container use in the target itinerary. The planning solution for each container use includes the selected container combination, and the corresponding container combination in each selected container combination. Holds the object; determines the target container planning scheme in the planning scheme collection, as the container planning scheme for the target itinerary, and selects the container group in the target container planning scheme The combined default container parameters are optimal in the set of planning plans, and the default holding object parameters of the holding object corresponding to the selected container combination are optimal in the set of planning plans.

In the embodiment of the present disclosure, the server 200 may be an independent server, or a server network or server cluster composed of servers, such as the server 200 described in the embodiment of the present disclosure, which includes but is not limited to a computer, a network terminal, a single A network server, a set of multiple network servers, or a cloud server composed of multiple servers. Among them, the cloud server consists of a large number of computers or network servers based on cloud computing (Cloud Computing). In the embodiments of the present disclosure, communication between the server and the terminal can be achieved through any communication method, including but not limited to, based on the 3rd Generation Partnership Project (3GPP), Long Term Evolution (LTE) , Worldwide Interoperability for Microwave Access (WiMAX) mobile communications, or computers based on the TCP/IP Protocol Suite (TCP/IP) or User Datagram Protocol (UDP) Network communications, etc.

It can be understood that the terminal 100 used in the embodiments of the present disclosure may be a device including both receiving and transmitting hardware, and a device having receiving and transmitting hardware capable of performing two-way communication on a two-way communication link. Such terminals may include cellular or other communications devices with a single line display or a multiple line display or a cellular or other communications device without a multiple line display. The specific terminal 100 may be a desktop terminal or a mobile terminal. The terminal 100 may also be one of a mobile phone, a tablet computer, a notebook computer, etc.

Those skilled in the art can understand that the application environment shown in Figure 1 is only one application scenario of the disclosed solution and does not constitute a limitation on the application scenarios of the disclosed solution. Other application environments may also include those in Figure 1 More or less terminals or server network connection relationships are shown. For example, only 1 server and 2 terminals are shown in Figure 1. It can be understood that the container planning system may also include one or more other servers, or/and one or more terminals connected to the server network, which are not limited here.

In addition, as shown in FIG. 1 , the container planning system may also include a memory 300 for storing data, such as freight demand data and container planning data for the target itinerary, such as container planning data when the container planning system is running.

It should be noted that the scenario diagram of the container planning system shown in Figure 1 is only an example. The container planning system and scenarios described in the embodiments of the present disclosure are for the purpose of more clearly illustrating the technical solutions of the embodiments of the present disclosure, and do not constitute a Limitations of the technical solutions provided by the embodiments of the present disclosure. Persons of ordinary skill in the art will know that with the evolution of container planning systems and the emergence of new business scenarios, the technical solutions provided by the embodiments of the present disclosure are equally applicable to similar technical problems.

Next, the container planning method provided by the embodiment of the present disclosure is introduced.

In the embodiment of the container planning method of the present application, the container planning device is used as the execution subject. For simplicity and convenience of description, the execution subject will be omitted in subsequent method embodiments. The container planning device is applied to the server. The method includes: obtaining the target The freight demand information set of the trip, the target trip includes multiple freight nodes, the freight demand information set includes the container demand information of each freight node in the multiple freight nodes; the available container information set of the target trip is obtained, the available container information set includes multiple The available container information of each freight node in the freight node; obtain the in-transit container information set of the target itinerary. The in-transit container information set includes the in-transit container information of each freight node in multiple freight nodes; according to the container demand information set, available container information set and in-transit The collection of container information determines the collection of planning solutions for the use of containers in the target itinerary. The planning solution for each container use includes the selected container combinations and the holding objects corresponding to each container in each selected container combination; the target container is determined in the planning solution set. Planning plan, as the container planning plan for the target itinerary, the default container parameters of the container combination selected in the target container planning plan are optimal in the planning plan set, and the default holding object parameters of the holding objects corresponding to the container combination are selected in the planning plan. The best in the set.

Please refer to Figures 2 to 5. Figure 2 is a schematic flowchart of a container planning method provided in an embodiment of the present disclosure. The container planning method includes steps 201 to 205:

201. Obtain the freight demand information set of the target trip. The target trip includes multiple freight nodes, and the freight demand information set includes container demand information of each freight node in the multiple freight nodes.

In the embodiment of the present disclosure, the multiple freight nodes included in the target itinerary are at least three freight nodes. The container demand information of each freight node may be the same or different, and the details may be determined according to the actual situation. For example, a user in the paper industry will purchase raw materials from location A and transport them to a factory in location B for processing, and then transport the processed semi-finished/finished products from location B to location C.

It should be noted that the target itinerary in the embodiment of the present disclosure is an ocean transportation itinerary, not a land transportation itinerary. Ocean transportation is also called "international ocean cargo transportation" and is referred to as "sea transportation" in this disclosure. Maritime transportation is an international logistics the most important mode of transportation. It refers to a way of using ships to transport goods between ports in different countries and regions through sea lanes. Specifically, there are two main types of maritime transportation operations: liner transportation and charter transportation. Liner transportation is also called scheduled ship transportation, and chartered ship transportation is also called tramp ship transportation. This disclosure mainly focuses on scheduled ship transportation. However, in special circumstances, chartered ship transportation is not excluded. Among them, liner shipping refers to ships carrying out regular and repeated voyages on specific routes and between established ports in accordance with a predetermined sailing schedule to engage in cargo transport business and collect freight in accordance with a pre-announced rate schedule. A mode of transportation. Its service targets are many non-specific and dispersed cargo owners, and the liner company has the nature of a common carrier. Chartering refers to a method in which a charterer leases a ship from a shipowner for cargo transportation, and is usually suitable for bulk cargo transportation. Regarding routes and ports, The type of cargo transported and the sailing time are all confirmed by the ship owner in accordance with the charterer's requirements. The rights and obligations between the charterer and the lessor are determined by the charter party signed by both parties.

Container demand information can generally include container model, available transportation time (such as one week), etc. Among them, the container model depends on the type, volume, weight and other factors of the goods to be transported. Specifically, the collection of freight demand information for the target itinerary can be obtained by the user. The user can provide relevant information about the goods to be transported, such as the type and quantity of the goods, and the transportation time. The transportation time is generally an interval, that is, within Within what time period will this batch of goods be delivered to the destination?

202. Obtain the available container information set of the target itinerary. The available container information set includes the available container information of each freight node in the multiple freight nodes.

In this disclosed embodiment, the available container information is the container information that can currently be used in multiple ports corresponding to each freight node, where the container information may include the model of the container, the quantity and price corresponding to each model, etc. It should be noted that different containers also have different holding objects, and the holding objects are shipping companies.

In some embodiments of the present disclosure, obtaining the set of available container information for the target itinerary may specifically include: obtaining a business constraint table preset for the target itinerary; obtaining initial available container information for each freight node in multiple freight nodes; based on the business The constraint table and the initial available container information of each freight node in multiple freight nodes determine the available container information set for the target trip. Each available container information in the available container information set includes the available container set and the number limit range of the available container set. Among them, the business constraint table is formed by integrating all business constraints into a constraint table. Each business constraint corresponds to a business constraint scenario (such as the port's requirements for the number and size of containers, requirements for routes, etc.), including the scenario. All available container collections involved, and the upper and lower limits of the overall usage quantity of the collection. Specifically, the business constraint table is preset for different itineraries. The initial available container information of each freight node is the container information that can be used in the multiple ports corresponding to each freight node. It can be understood that since the user's goods have special requirements for the container model, not all of them are available. Container information is within the range that can be selected.

In some embodiments of the present disclosure, determining the set of available container information for the target trip based on the business constraint table and the initial available container information of each freight node among the multiple freight nodes may include: passing each business constraint in the business constraint table Conditions, filter the initial available container information of each freight node in the corresponding multiple freight nodes to obtain the available container information of each freight node, thereby determining the set of available container information for the entire target trip.

The business preset table disclosed in the embodiments of the present disclosure is used to convert business constraints into limits on the number of candidate available containers, thereby effectively improving the efficiency of the set of planning solutions for container use in the target itinerary.

203. Obtain the in-transit container information set of the target itinerary. The in-transit container information set includes the in-transit container information of each of the multiple freight nodes.

In this disclosed embodiment, the container information in transit is the container information that has been used at the corresponding port of each freight node, and there is container information that specifies the date of return to the port. For example, there are currently 100 containers in transit at a certain port. Among these 100 containers in transit, 20 containers will return to the port in the next day, 30 containers will return to the port in the next three days, and 50 containers will return to the port in the next three days. After returning to the port in the next five days, these 100 containers in transit can be booked in advance.

Specifically, to obtain the information set of containers in transit for the target itinerary, the shipping company at each freight node can provide the container information in transit at the corresponding port, and then organize the containers in transit at each line to obtain the information set of containers in transit for the target itinerary.

204. Based on the container demand information set, the available container information set and the in-transit container information set, determine the planning solution set for container use in the target itinerary. The planning solution for each container use includes the selected container combination and each container in each selected container combination. The corresponding holding object.

In this disclosed embodiment, as can be seen from the above, the holding object is the shipping company. Specifically, how to determine the set of planning solutions for container use in the target itinerary based on the container demand information set, the available container information set, and the in-transit container information set can be referred to the following embodiments, and will not be described in detail here.

205. Determine the target container planning scheme in the planning scheme set. As the container planning scheme for the target itinerary, the preset container parameters of the container combination selected in the target container planning scheme are optimal in the planning scheme set, and the holding object corresponding to the container combination is selected. The default holding object parameters are optimal in the set of planning solutions.

In the embodiment of the present disclosure, the preset container parameters may specifically be the preset cost, and the optimal preset cost corresponds to the lowest preset cost, that is, the cost of selecting the container combination in the target container planning scheme is the lowest in the set of planning solutions; and the preset cost optimally corresponds to the lowest preset cost. Assume that the parameter of the holding object can specifically be the performance score of the default shipping company. The optimal performance score of the default shipping company corresponds to the default shipping company with the highest performance score, that is, the default ship of the holding object corresponding to the container combination is selected. The company's performance score is the best among the set of planning options. It should be noted that the performance rating of the preset shipping company can be obtained from the performance rating table of each shipping company formed by the cumulative experience rating of users after use. Specifically, how to determine the target container planning plan in the planning plan set? , please refer to the following embodiments and will not be described in detail here.

The present disclosure provides a container planning method. Compared with the traditional method, when manually selecting and making decisions on shipping containers at multiple transportation nodes, the workload is large, it is impossible to consider all aspects, and in the context of high costs, this method It is openly and creatively proposed to consider whether the containers in transit at each freight node are available as the category of available container information, thereby improving the selection range of available container information, and through the preset The restrictions on container parameters and preset holding object parameters effectively improve the efficiency of container planning and container usage costs for multiple transportation nodes.

In some embodiments of the present disclosure, as shown in Figure 3, based on the container demand information set, the available container information set, and the in-transit container information set, a set of planning solutions for container use in the target trip is determined, which specifically includes steps 301 to 303:

301. According to the container demand information set, the available container information set and the in-transit container information set, determine the planning scheme for the first container usage of the first freight node among the multiple freight nodes.

The first freight node is the first freight node among multiple freight nodes, that is, the initial freight node.

In some embodiments of the present disclosure, determining the first container usage planning solution for the first freight node among multiple freight nodes based on the container demand information set, the available container information set, and the in-transit container information set includes: converting the container demand information The first container demand information set corresponding to the first freight node among the plurality of freight nodes in the set and the first available container information set corresponding to the first freight node in the available container information set are initialized and sorted according to the preset requirements; based on the first A container demand information set, which determines the first reused container information set corresponding to the reused container that can be used for the first freight node from the in-transit container information set; based on the initialized sorted first container demand information set and the first available container information The collection and the first reused container information collection determine the planning scheme for the use of the first container of the first freight node among the multiple freight nodes.

The default requirement in this embodiment means that orders (container demands) with smaller departure time windows and earlier departure deadlines are sorted first, and available containers with lower prices and longer container-free periods are sorted first. The initialization sorting is to optimize the quality of the initial solution (the set of planning solutions used by the container in the target itinerary). By comparison, the quality of the initial solution constructed after sorting is far better than the result of random initialization of the model, which greatly improves the subsequent optimization search of the model. time.

In some embodiments of the present disclosure, based on the first container demand information set, determining the first reused container information set corresponding to the reused container that can be used for the first freight node from the in-transit container information set may specifically include: according to the first The first freight demand information corresponding to the first freight node in a container demand information set (which may include container use time, container use model, quantity, etc.) is performed on the first in-transit container information corresponding to the first freight node in the in-transit container information set. Compare and filter to obtain the first reused container information set corresponding to the reused container that can be used at the first freight node.

In some embodiments of the present disclosure, based on the initialized sorted first container demand information set, the first available container information set, and the first recycled container information set, the first container of the first freight node among the plurality of freight nodes is determined. The planning scheme used includes: based on each of the first available container information sets The departure time parameter of the available container information and the corresponding relationship between the shipping place and the receiving place are matched with the target container demand information in the first container demand information set and the first available container information set to obtain multiple first matches. Result: Match each of the multiple first matching results with the first reused container information according to the preset requirements to obtain the second matching results of multiple selected container combinations; obtain the second matching results of multiple selected container combinations. A set of scoring functions corresponding to the matching results. Each scoring function includes a constraint score and a target score. The constraint score is the sum of the differences between the available container usage quantity and its upper/lower limit constraints. The target score is the predetermined value corresponding to the second matching result. Set the container parameters and the preset holding object parameters; sort the constraint scores and target scores of each scoring function in the scoring function set to obtain the sorting results; based on the sorting results, determine the first container of the first freight node among multiple freight nodes planning scheme used.

The preset requirements in this embodiment are time requirements, cabinet type requirements, and shipping company requirements. Specifically, the time requirements can be understood as the intersection between the time window of container demand and the time window of reused containers, the container type of the reused container meets the container type in the demand for containers, and the needs of the shipping company and the current ship to be selected. The companies are the same. It can be understood that assuming that the currently available shipping companies are A, B and C, if the shipping company corresponding to the reused container is A, that is, among the currently available shipping companies, it means that it meets the preset requirements. If The corresponding shipping company for the reused container is D, which means it is not among the currently available shipping companies, which means it does not meet the preset requirements.

In some embodiments of the present disclosure, according to the above embodiments, the preset container parameter corresponds to the preset cost, and the preset holding object parameter corresponds to the preset shipping company's performance score; each scoring function in the scoring function set is The constraint score and target score are sorted to obtain the sorting result, which may include: sorting according to the constraint score (high priority) and the target score to obtain the sorting result.

In some embodiments of the present disclosure, based on the sorting results, determining the planning scheme for the first container usage of the first freight node among the multiple freight nodes, which may specifically include sorting according to the constraint score (high priority) and the target score, Choose the best matching result.

302. Based on the container usage information in the first container usage planning plan, determine the second container usage planning plan corresponding to the second freight node after the first freight node.

In the embodiment of the present disclosure, the container usage planning scheme of the first freight node will affect the container usage plan of subsequent freight nodes corresponding to the container.

Specifically, based on the container usage information in the first container usage planning plan, determining the second container usage planning plan corresponding to the second freight node after the first freight node includes: based on the first container usage planning plan Container usage information updates the in-transit container information of the second freight node after the first freight node to obtain the updated target in-transit container information. The container usage information is the container information selected by the first container usage planning plan; the container demand The second container demand information set and the available container information set corresponding to the second freight node among the plurality of freight nodes in the information set are related to the second freight node. The second available container information set corresponding to the freight node is initialized and sorted according to the preset requirements; based on the second container demand information set, the second reused container corresponding to the reused container that can be used for the second freight node is determined from the target in-transit container information Information set; based on the initialized and sorted second container demand information set, the second available container information set, and the second recycled container information, determine a planning solution for the second container usage of the second freight node among the multiple freight nodes.

303. Based on the planning scheme for the use of the first container and the planning scheme for the use of the second container, determine a set of planning schemes for the use of the container in the target itinerary.

The solution disclosed in the embodiment of the present disclosure effectively improves the container planning efficiency and container usage cost of multiple transportation nodes, and solves the configuration problem of the planning solution for container usage between multiple transportation nodes.

In some embodiments of the present disclosure, the target itinerary in the above embodiments is three freight nodes, while the embodiment of the present disclosure is aimed at the fourth freight node or even more freight nodes. Specifically, based on the After determining the container usage information in the container usage planning scheme and determining the second container usage planning scheme corresponding to the second freight node after the first freight node, the method also includes: based on the container usage in the second container usage planning scheme information to determine the planning scheme for the use of the third container corresponding to the third freight node after the second freight node; based on the planning scheme for the use of the first container, the planning scheme for the use of the second container and the planning scheme for the use of the third container, Determine the set of planning solutions for container use in the target itinerary.

It should be noted that based on the container usage information in the second container usage planning solution, the planning solution for determining the third container usage corresponding to the third freight node after the second freight node is the same as the above embodiment based on the first container usage plan. The container usage information in the plan determines the planning plan for the second container usage corresponding to the second freight node after the first freight node. The principles are the same and will not be described again here.

In some embodiments of the present disclosure, determining the target container planning scheme in the planning scheme set may specifically include: inputting the planning scheme set into a preset local search model, and using the solution output by the local search model as the target container planning scheme. .

During the local search process, the model optimizes the solution through single-chain search. The specific steps are as follows:

1. After the model initialization is completed, the initial solution S is obtained, and both the current solution Swork and the optimal solution Sbest are set to S.

2. The model is based on the current solution Swork and tries multiple neighborhood movement methods. Neighborhood movement refers to: changing the cabinet demand carried by each available cabinet in various ways, and finding the optimal combination in the process. .

3. Based on the multiple neighborhood structures {S1, S2,...Sn} of the current solution, update the candidate list of reused containers (newly selected available containers are added to the list, and released available containers are removed from the list), based on greedy The algorithm re-determines reused containers for the changed container demand in each structure, and updates the order information carried by the available containers and the reused container list (this is a shadow variable design, an optimization innovation point).

4. For the updated {S1, S2,...Sn}, evaluate the constraint score and target score of each structure, select the SX with the highest score as the result of this neighborhood selection, set Swork=SX, SX is added to the taboo list mainly to avoid these objects as much as possible in the following iterative search, thereby ensuring the exploration of different effective search methods.

5. Compare SX with the optimal solution Sbest. If SX is better, set Sbest=SX.

Determine whether the termination condition is reached. If so, exit the optimization and output Sbest. If not, repeat steps 2 to 5.

Model abort: During the local search process, if the model does not find a better solution within a certain period of time, it will exit the optimization and output the current optimal solution; or, when the running time of the model reaches the upper limit, it will exit the optimization and output the current optimal solution. untie.

In this disclosed embodiment, after completing the construction of the initial solution, that is, after completing the determination of the planning solution set for container use in the target itinerary based on the container demand information set, the available container information set, and the in-transit container information set, the model will enter a local search. When performing local search, it is based on the optimized matching relationship between container demand and available containers. That is, the search is only based on the solution space of the decision variable of available container selection, but the other variable, the selection decision of reused containers, is not included in the model search optimization. Within the scope, the main reason is to allow the model to provide the best optimization effect within a limited time. This model solves the problem by designing the decision of reused containers as a shadow variable of the decision of available containers. When the model simultaneously optimizes the search for the matching of container demand and available containers and the matching of container demand and reused containers, it will search for both at the same time. The solution space range of each variable and the large search range will lead to long model optimization time and difficulty in ensuring the optimization effect. This is a difficulty.

In order to better implement the container planning method in the embodiment of the disclosure, based on the container planning method, the embodiment of the disclosure also provides a container planning device. As shown in Figure 4, the container planning device 400 includes:

The first acquisition unit 401 is used to obtain the freight demand information set of the target trip. The target trip includes multiple freight nodes, and the freight demand information set includes container demand information of each freight node in the multiple freight nodes;

The second acquisition unit 402 is used to acquire the available container information set of the target itinerary. The available container information set includes the available container information of each freight node in the plurality of freight nodes;

The third acquisition unit 403 is used to obtain the in-transit container information set of the target trip. The in-transit container information set includes the in-transit container information of each of the multiple freight nodes;

The first determination unit 404 is used to determine a set of planning solutions for container use in the target itinerary based on the container demand information set, available container information set, and in-transit container information set. The planning solution for each container use includes the selected container combination, and each container combination. Select the holding object corresponding to each container in the container combination;

The second determination unit 405 is used to determine the target container planning scheme in the planning scheme set. As the container planning scheme for the target itinerary, the preset container parameters of the container combination selected in the target container planning scheme are optimal in the planning scheme set, and the container is selected. The preset holding object parameters of the corresponding holding objects are optimal in the set of planning solutions.

In some embodiments of the present disclosure, the second acquisition unit 402 is specifically used to:

Obtain the business constraint table preset for the target itinerary;

Obtain the initial available container information of each freight node in multiple freight nodes;

Based on the business constraint table and the initial available container information of each freight node in multiple freight nodes, the available container information set for the target trip is determined. Each available container information in the available container information set includes the available container set and the quantity limit interval of the available container set. .

In some embodiments of the present disclosure, the first determining unit 404 specifically includes:

The third determination unit is used to determine the planning scheme for the use of the first container of the first freight node among the plurality of freight nodes based on the container demand information set, the available container information set and the in-transit container information set;

The fourth determination unit is configured to determine the second container usage planning scheme corresponding to the second freight node after the first freight node based on the container usage information in the first container usage planning scheme;

The fifth determination unit is used to determine a set of planning solutions for the use of the container in the target itinerary based on the planning solution for the use of the first container and the planning solution for the use of the second container.

In some embodiments of the present disclosure, the third determining unit specifically includes:

The first initialization sorting unit is used to combine the first container demand information set corresponding to the first freight node among the plurality of freight nodes in the container demand information set and the first available container corresponding to the first freight node in the available container information set. The information collection is initialized and sorted according to preset requirements;

The sixth determination unit is configured to determine, based on the first container demand information set, the first reused container information set corresponding to the reused container that can be used for the first freight node from the in-transit container information set;

The seventh determination unit is used to determine the first container used by the first freight node among the plurality of freight nodes based on the initialized sorted first container demand information set, the first available container information set, and the first recycled container information set. Proposal.

In some embodiments of the present disclosure, the seventh determining unit is specifically used for:

According to the departure time parameter of each available container information in the first available container information set and the corresponding relationship between the shipping place and the receiving place, the target container demand information in the first container demand information set and the first available container information set are Perform matching and obtain multiple first matching results;

Match each of the plurality of first matching results with the first reused container information according to preset requirements to obtain second matching results of multiple selected container combinations;

Obtain a set of scoring functions corresponding to the second matching results of multiple selected container combinations. Each scoring function includes a constraint score and a target score. The constraint score is the sum of the differences between the available container usage quantity and its upper/lower limit constraints. The target score The score is the default container parameters and default holding object parameters corresponding to the second matching result;

Sort the constraint scores and target scores of each scoring function in the scoring function set to obtain the sorting results;

Based on the sorting results, a planning solution for using the first container of the first freight node among the plurality of freight nodes is determined.

In some embodiments of the present disclosure, the fourth determining unit is specifically used for:

Based on the container usage information in the first container usage planning scheme, the in-transit container information of the second freight node after the first freight node is updated to obtain the updated target in-transit container information. The container usage information is determined by the first container usage planning scheme. Selected container information;

Initialize the second container demand information set corresponding to the second freight node among the plurality of freight nodes in the container demand information set and the second available container information set corresponding to the second freight node in the available container information set according to the preset requirements. sort;

Based on the second container demand information set, determine the second reused container information set corresponding to the reused container that can be used at the second freight node from the target in-transit container information;

Based on the initialized and sorted second container demand information set, the second available container information set, and the second reused container information, a planning solution for the second container usage of the second freight node among the plurality of freight nodes is determined.

In some embodiments of the present disclosure, after determining the second container usage planning scheme corresponding to the second freight node after the first freight node based on the container usage information in the first container usage planning scheme, the device further uses At:

Based on the container usage information in the second container usage planning plan, determine the third container usage planning plan corresponding to the third freight node after the second freight node;

Based on the planning scheme for the use of the first container, the planning scheme for the use of the second container and the planning scheme for the use of the third container, a set of planning schemes for the use of the container in the target itinerary is determined.

In some embodiments of the present disclosure, the second determining unit 405 is specifically used to:

Input the set of planning solutions into the preset local search model, and use the solution output by the local search model as the target container planning solution.

The container planning device 400 provided by the present disclosure includes: a first acquisition unit 401, used to obtain a freight demand information set of a target itinerary. The target trip includes multiple freight nodes, and the freight demand information set includes a freight demand information set of each of the multiple freight nodes. Container demand information; the second acquisition unit 402 is used to obtain the available container information set of the target trip, and the available container information set includes the available container information of each freight node in multiple freight nodes; the third acquisition unit 403 is used to obtain the target trip A collection of in-transit container information, the in-transit container information set includes in-transit container information of each freight node among multiple freight nodes; the first determination unit 404 is used to determine the target based on the container demand information set, the available container information set and the in-transit container information set A collection of planning solutions for the use of containers during the itinerary. The planning solution for each container use includes the selected combination of containers and the holding objects corresponding to each container in each selected combination of containers; the second determination unit 405 is used to determine in the set of planning solutions The target container planning scheme is the container planning scheme for the target itinerary. The default container parameters of the container combination selected in the target container planning scheme are optimal in the planning scheme set. The default holding object parameters of the holding objects corresponding to the selected container combination are in The best among the set of planning solutions. Compared with traditional devices, when manually selecting and making decisions on shipping containers at multiple transportation nodes, the workload is large, it is impossible to consider all aspects, and the cost is high. This disclosure creatively proposes to place each freight node at the same location. The availability of containers in transit is taken into account as the category of available container information, thereby increasing the selection range of available container information, and by limiting the default container parameters and default holding object parameters, container planning for multiple transportation nodes is effectively improved. Efficiency and container usage costs.

In addition to the above-mentioned methods and devices for container planning, embodiments of the disclosure also provide a server that integrates any container planning device provided by embodiments of the disclosure. The server includes:

One or more processors, wherein the processor is configured to execute the following application programs in which memory exists;

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 in any of the methods in any of the above container planning method embodiments. In the technical solution of this disclosure, the server obtains the freight demand information set of the target trip, which includes multiple freight nodes, and the freight demand information set includes the container demand information of each freight node in the multiple freight nodes; obtains the freight demand information set of the target trip. The available container information set of the target trip, the available container information set includes the available container information of each freight node in the multiple freight nodes; the in-transit container information set of the target trip is obtained, and the in-transit container information set includes multiple freight nodes. In-transit container information of each freight node in the node; according to the container demand information set, the available container information set and the in-transit container information set, determine the planning solution set for container use in the target itinerary, and each container uses The planning plan includes selected container combinations and the holding objects corresponding to each container in each selected container combination; a target container planning plan is determined in the planning plan set as the container planning plan for the target trip, and the target container planning The preset container parameters of the container combination selected in the plan are optimal in the set of planning plans, and the preset holding object parameters of the holding objects corresponding to the container combination selected are optimal in the set of planning plans; compared with traditional devices, in When manually selecting and making decisions on shipping containers at multiple transportation nodes, the workload is large, it is impossible to consider all aspects, and the cost is high. The disclosed server creatively proposes to consider whether the containers in transit at each freight node are available. As a category of available container information, the selection range of available container information is improved, and by limiting the preset container parameters and preset holding object parameters, the container planning efficiency and container usage cost of multiple transportation nodes are effectively improved.

An embodiment of the present disclosure also provides a server that integrates any container planning device provided by the embodiment of the present disclosure. Refer to Figure 5, which is a schematic structural diagram of a server provided by an embodiment of the present disclosure.

As shown in Figure 5, it shows a schematic structural diagram of a container planning device designed according to an embodiment of the present disclosure. Specifically:

The container planning device may include components such as a processor 501 of one or more processing cores, a storage unit 502 of one or more computer-readable storage media, a power supply 503, and an input unit 504. Those skilled in the art can understand that the structure of the container planning device shown in Figure 5 does not constitute a limitation on the container planning device, and may include more or less components than shown in the figure, or some components may be combined, or different components may be used. layout. in:

The processor 501 is the control center of the container planning device, using various interfaces and lines to connect various parts of the entire container planning device, by running or executing software programs and/or modules stored in the storage unit 502, and calling the storage unit 502. The data of unit 502 executes various functions of the container planning device and processes data, thereby overall monitoring the container planning device. Optional, processor 501 It can include one or more processing cores; preferably, the processor 501 can integrate an application processor and a modem processor, where the application processor mainly processes the operating system, user interface, application programs, etc., and the modem processor mainly processes Handles wireless communications. It can be understood that the above modem processor may not be integrated into the processor 501.

The storage unit 502 can be used to store software programs and modules. The processor 501 executes various functional applications and data processing by running the software programs and modules stored in the storage unit 502 . The storage unit 502 may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function (such as a sound playback function, an image playback function, etc.), etc.; the storage data area may store Data created based on the use of container planning devices, etc. In addition, the storage unit 502 may include high-speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other volatile solid-state storage device. Correspondingly, the storage unit 502 may also include a memory controller to provide the processor 501 with access to the storage unit 502 .

The container planning device also includes a power supply 503 that supplies power to each component. Preferably, the power supply 503 can be logically connected to the processor 501 through a power management system, so that functions such as charging, discharging, and power consumption management can be implemented through the power management system. The power supply 503 may also include one or more DC or AC power supplies, recharging systems, power failure detection circuits, power converters or inverters, power status indicators, and other arbitrary components.

The container planning device may also include an input unit 504 that may be used to receive input numeric or character information and generate keyboard, mouse, joystick, optical or trackball signal input related to user settings and function control.

Although not shown, the container planning device may also include a display unit, etc., which will not be described again here. Specifically, in the embodiment of the present disclosure, the processor 501 in the container planning device will load the executable files corresponding to the processes of one or more application programs into the storage unit 502 according to the following instructions, and the processor 501 will Run the application program stored in the storage unit 502 to implement various functions, as follows:

Obtain the freight demand information set of the target trip. The target trip includes multiple freight nodes. The freight demand information set includes the container demand information of each freight node in the multiple freight nodes. Obtain the available container information set of the target trip. The available container information set includes The available container information of each freight node in multiple freight nodes; obtain the in-transit container information set of the target itinerary. The in-transit container information set includes the in-transit container information of each freight node in multiple freight nodes; according to the container demand information set, the available container information set and the information collection of containers in transit to determine the set of planning solutions for container use in the target itinerary. The planning solution for each container use includes the selected container combinations and the holding objects corresponding to each container in each selected container combination; determined in the planning solution set Target container planning scheme, the container used as the target itinerary Planning scheme, the preset container parameters of the container combination selected in the target container planning scheme are optimal in the planning scheme set, and the preset holding object parameters of the holding object corresponding to the container combination selected are optimal in the planning scheme set.

The present disclosure provides a container planning method. Compared with the traditional method, when manually selecting and making decisions on shipping containers at multiple transportation nodes, the workload is large, it is impossible to consider all aspects, and in the context of high costs, this method It is openly and creatively proposed to consider whether the containers in transit at each freight node are available as the category of available container information, thereby increasing the selection range of available container information, and by limiting the preset container parameters and preset holding object parameters, it is effective Improved container planning efficiency and container usage costs for multiple transportation nodes.

To this end, embodiments of the present disclosure provide a computer-readable storage medium. The computer-readable storage medium may include: read-only memory (ROM, Read Only Memory), random access memory (RAM, Random Access Memory), disk Or CD, etc. A plurality of instructions are stored in the computer-readable storage medium, and the instructions can be loaded by the processor to execute the steps in any container planning method provided by the embodiments of the present disclosure. For example, this command can perform the following steps:

Obtain the freight demand information set of the target trip. The target trip includes multiple freight nodes. The freight demand information set includes the container demand information of each freight node in the multiple freight nodes. Obtain the available container information set of the target trip. The available container information set includes The available container information of each freight node in multiple freight nodes; obtain the in-transit container information set of the target itinerary. The in-transit container information set includes the in-transit container information of each freight node in multiple freight nodes; according to the container demand information set, the available container information set and the information collection of containers in transit to determine the set of planning solutions for container use in the target itinerary. The planning solution for each container use includes the selected container combinations and the holding objects corresponding to each container in each selected container combination; determined in the planning solution set The target container planning scheme is the container planning scheme for the target itinerary. The default container parameters of the container combination selected in the target container planning scheme are optimal in the planning scheme set. The default holding object parameters of the holding objects corresponding to the selected container combination are in The best among the set of planning solutions.

In the above embodiments, each embodiment is described with its own emphasis. For parts that are not described in detail in a certain embodiment, please refer to the relevant descriptions of other embodiments.

The container planning method, device, server and computer-readable storage medium provided by the embodiments of the present disclosure have been introduced in detail above. This article uses specific examples to illustrate the principles and implementation methods of the present disclosure. The above embodiments The description is only used to help understand the methods and core ideas of the present disclosure; at the same time, for those skilled in the art, there will be changes in the specific implementation methods and application scope based on the ideas of the present disclosure. In summary, The content of this specification should not be construed as limiting the disclosure.

Claims

A container planning method, wherein the method includes:

Obtain a freight demand information set for a target trip, the target trip includes multiple freight nodes, and the freight demand information set includes container demand information for each freight node in the multiple freight nodes;

Obtain a set of available container information for the target itinerary, where the set of available container information includes available container information for each of the multiple freight nodes;

Obtain the in-transit container information set of the target trip, where the in-transit container information set includes the in-transit container information of each of the multiple freight nodes;

According to the container demand information set, the available container information set and the in-transit container information set, a set of planning solutions for container use in the target itinerary is determined. The planning solution for each container use includes the selected container combination, and each Select the holding object corresponding to each container in the container combination;

Determine the target container planning scheme in the planning scheme set. As the container planning scheme for the target itinerary, the preset container parameters of the container combination selected in the target container planning scheme are optimal in the planning scheme set, and the selected container combination corresponds to The preset holding object parameters of the holding object are optimal in the set of planning solutions.
The container planning method according to claim 1, wherein said obtaining the available container information set of the target itinerary includes:

Obtain the business constraint table preset for the target itinerary;

Obtain initial available container information of each freight node among the plurality of freight nodes;

Based on the business constraint table and the initial available container information of each freight node among the plurality of freight nodes, an available container information set for the target trip is determined, where each available container information in the available container information set includes an available container set, and the The quantity limit range of the available container collection.
The container planning method according to claim 1, wherein the set of planning solutions for container use in the target itinerary is determined based on the container demand information set, the available container information set and the in-transit container information set, include:

According to the container demand information set, the available container information set and the in-transit container information set, determine the planning solution for the first container usage of the first freight node among the plurality of freight nodes;

Based on the container usage information in the first container usage planning plan, determine the second container usage planning plan corresponding to the second freight node after the first freight node;

Based on the planning scheme for the use of the first container and the planning scheme for the use of the second container, a set of planning schemes for the use of the container in the target trip is determined.
The container planning method according to claim 3, wherein the first freight node among the plurality of freight nodes is determined based on the container demand information set, the available container information set and the in-transit container information set. The planning scheme for the use of the first container includes:

The first container demand information set corresponding to the first freight node among the plurality of freight nodes in the container demand information set and the first available container corresponding to the first freight node in the available container information set are The information collection is initialized and sorted according to preset requirements;

Based on the first container demand information set, determine a first reused container information set corresponding to the reused container that can be used for the first freight node from the in-transit container information set;

Based on the initialized sorted first container demand information set, the first available container information set, and the first reused container information set, a planning solution for the first container usage of the first freight node among the plurality of freight nodes is determined.
The container planning method according to claim 4, wherein the plurality of freight shipments are determined based on the initialized sorted first container demand information set, the first available container information set and the first reused container information set. The planning scheme for the use of the first container of the first freight node in the node includes:

According to the departure time parameter of each available container information in the first available container information set and the corresponding relationship between the shipping place and the receiving place, the target container demand information in the first container demand information set and the The first available container information set is matched, and multiple first matching results are obtained;

Match each of the plurality of first matching results with the first reused container information according to preset requirements to obtain second matching results of a plurality of selected container combinations;

Obtain a set of scoring functions corresponding to the second matching results of the plurality of selected container combinations. Each scoring function includes a constraint score and a target score. The constraint score is the difference between the number of available containers and its upper/lower limit constraints. The target score is the sum of the preset container parameters and the preset holding object parameters corresponding to the second matching result;

Sort the constraint scores and target scores of each scoring function in the scoring function set to obtain a sorting result;

Based on the sorting result, a planning solution for the use of the first container of the first freight node among the plurality of freight nodes is determined.
The container planning method according to claim 3, wherein the second container corresponding to the second freight node after the first freight node is determined based on the container usage information in the first container usage planning scheme. Planning options used include:

Based on the container usage information in the first container usage planning scheme, update the in-transit container information of the second freight node after the first freight node to obtain the updated target in-transit container information, where the container usage information is the Container information selected by the first container usage planning plan;

The second container demand information set corresponding to the second freight node among the plurality of freight nodes in the container demand information set and the second available container corresponding to the second freight node in the available container information set are The information collection is initialized and sorted according to preset requirements;

Based on the second container demand information set, determine a second reused container information set corresponding to the reused container that can be used for the second freight node from the target in-transit container information;

Based on the initialized and sorted second container demand information set, the second available container information set and the second reused container information, a planning solution for the second container usage of the second freight node among the plurality of freight nodes is determined.
The container planning method according to claim 3, wherein the second container usage corresponding to the second freight node after the first freight node is determined based on the container usage information in the first container usage planning scheme. After the planning solution, the method also includes:

Based on the container usage information in the second container usage planning plan, determine the third container usage planning plan corresponding to the third freight node after the second freight node;

Based on the planning scheme for the use of the first container, the planning scheme for the use of the second container and the planning scheme for the use of the third container, a set of planning schemes for the use of the container in the target trip is determined.
The container planning method according to claim 1, wherein determining the target container planning scheme in the planning scheme set includes:

The set of planning solutions is input into a preset local search model, and the solution output by the local search model is used as the target container planning solution.
A container planning device, wherein the device includes:

The first acquisition unit is used to obtain the freight demand information set of the target trip, the target trip includes multiple freight nodes, and the freight demand information set includes container demand information of each freight node in the multiple freight nodes;

a second acquisition unit, configured to acquire a set of available container information for the target itinerary, where the set of available container information includes available container information for each of the multiple freight nodes;

The third acquisition unit is used to acquire the in-transit container information set of the target trip, where the in-transit container information set includes the in-transit container information of each of the multiple freight nodes;

The first determination unit is configured to determine a set of planning solutions for container use in the target itinerary based on the container demand information set, the available container information set, and the in-transit container information set. Including the selected container combinations and the holding objects corresponding to each container in each selected container combination;

The second determination unit is used to determine the target container planning scheme in the planning scheme set. As the container planning scheme for the target itinerary, the preset container parameters of the container combination selected in the target container planning scheme are in the planning scheme set. Optimally, the preset holding object parameters of the holding object corresponding to the container combination are selected to be optimal in the set of planning solutions.
A server, wherein the server includes:

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 performed by the processor as follows:

Obtain a freight demand information set for a target trip, the target trip includes multiple freight nodes, and the freight demand information set includes container demand information for each freight node in the multiple freight nodes;

Obtain a set of available container information for the target itinerary, where the set of available container information includes available container information for each of the multiple freight nodes;

Obtain the in-transit container information set of the target trip, where the in-transit container information set includes the in-transit container information of each of the multiple freight nodes;

According to the container demand information set, the available container information set and the in-transit container information set, a set of planning solutions for container use in the target itinerary is determined. The planning solution for each container use includes the selected container combination, and each Select the holding object corresponding to each container in the container combination;

Determine the target container planning scheme in the planning scheme set. As the container planning scheme for the target itinerary, the preset container parameters of the container combination selected in the target container planning scheme are optimal in the planning scheme set, and the selected container combination corresponds to The preset holding object parameters of the holding object are optimal in the set of planning solutions.
The server according to claim 10, wherein said obtaining the available container information set of the target itinerary includes:

Obtain the business constraint table preset for the target itinerary;

Obtain initial available container information of each freight node among the plurality of freight nodes;

Based on the business constraint table and the initial available container information of each freight node among the plurality of freight nodes, an available container information set for the target trip is determined, where each available container information in the available container information set includes an available container set, and the The quantity limit range of the available container collection.
The server according to claim 10, wherein determining a set of planning solutions for container use in the target trip based on the container demand information set, the available container information set, and the in-transit container information set includes:

According to the container demand information set, the available container information set and the in-transit container information set, determine the planning solution for the first container usage of the first freight node among the plurality of freight nodes;

Based on the container usage information in the first container usage planning plan, determine the second container usage planning plan corresponding to the second freight node after the first freight node;

Based on the planning scheme for the use of the first container and the planning scheme for the use of the second container, a set of planning schemes for the use of the container in the target trip is determined.
A computer-readable storage medium, wherein a computer program is stored thereon, and the computer program is loaded by a processor to perform the following steps:

Obtain a freight demand information set for a target trip, the target trip includes multiple freight nodes, and the freight demand information set includes container demand information for each freight node in the multiple freight nodes;

Obtain a set of available container information for the target itinerary, where the set of available container information includes available container information for each of the multiple freight nodes;

Obtain the in-transit container information set of the target trip, where the in-transit container information set includes the in-transit container information of each of the multiple freight nodes;

According to the container demand information set, the available container information set and the in-transit container information set, a set of planning solutions for container use in the target itinerary is determined. The planning solution for each container use includes the selected container combination, and each Select the holding object corresponding to each container in the container combination;

A target container planning scheme is determined in the set of planning schemes as the container planning scheme for the target itinerary. In the target container planning scheme, the preset container parameters of the container combination are selected in the planning scheme. Optimal in the set, select the preset holding object parameters of the holding object corresponding to the container combination to be optimal in the set of planning solutions.
The computer-readable storage medium according to claim 13, wherein said obtaining the set of available container information for the target trip includes:

Obtain the business constraint table preset for the target itinerary;

Obtain initial available container information of each freight node among the plurality of freight nodes;

Based on the business constraint table and the initial available container information of each freight node among the plurality of freight nodes, an available container information set for the target trip is determined, where each available container information in the available container information set includes an available container set, and the The quantity limit range of the available container collection.
The computer-readable storage medium according to claim 13, wherein the planning solution for container usage in the target trip is determined based on the container demand information set, the available container information set and the in-transit container information set. Collection, including:

According to the container demand information set, the available container information set and the in-transit container information set, determine the planning solution for the first container usage of the first freight node among the plurality of freight nodes;

Based on the container usage information in the first container usage planning plan, determine the second container usage planning plan corresponding to the second freight node after the first freight node;

Based on the planning scheme for the use of the first container and the planning scheme for the use of the second container, a set of planning schemes for the use of the container in the target trip is determined.
The computer-readable storage medium according to claim 15, wherein the first freight among the plurality of freight nodes is determined based on the container demand information set, the available container information set and the in-transit container information set. The planning scheme for the use of the first container of the node includes:

The first container demand information set corresponding to the first freight node among the plurality of freight nodes in the container demand information set and the first available container corresponding to the first freight node in the available container information set are The information collection is initialized and sorted according to preset requirements;

Based on the first container demand information set, determine a first reused container information set corresponding to the reused container that can be used for the first freight node from the in-transit container information set;

Based on the initialized sorted first container demand information set, the first available container information set, and the first reused container information set, a planning solution for the first container usage of the first freight node among the plurality of freight nodes is determined.
The computer-readable storage medium according to claim 16, wherein the determination of the plurality of containers based on the initialized sorted first container demand information set, the first available container information set and the first recycled container information set is The planning scheme for the use of the first container of the first freight node among the freight nodes includes:

According to the departure time parameter of each available container information in the first available container information set and the corresponding relationship between the shipping place and the receiving place, the target container demand information in the first container demand information set and the The first available container information set is matched, and multiple first matching results are obtained;

Match each of the plurality of first matching results with the first reused container information according to preset requirements to obtain second matching results of a plurality of selected container combinations;

Obtain a set of scoring functions corresponding to the second matching results of the multiple selected container combinations. Each scoring function includes a constraint score and a target score. The constraint score is the difference between the number of available containers and its upper/lower limit constraints. The target score is the sum of the preset container parameters and the preset holding object parameters corresponding to the second matching result;

Sort the constraint scores and target scores of each scoring function in the scoring function set to obtain a sorting result;

Based on the sorting result, a planning solution for the use of the first container of the first freight node among the plurality of freight nodes is determined.
The computer-readable storage medium according to claim 15, wherein the first freight node corresponding to the second freight node after the first freight node is determined based on the container usage information in the first container usage planning scheme. The planning scheme for the use of second container includes:

Based on the container usage information in the first container usage planning scheme, update the in-transit container information of the second freight node after the first freight node to obtain the updated target in-transit container information, where the container usage information is the Container information selected by the first container usage planning plan;

The second container demand information set corresponding to the second freight node among the plurality of freight nodes in the container demand information set and the second available container corresponding to the second freight node in the available container information set are The information collection is initialized and sorted according to preset requirements;

Based on the second container demand information set, determine a second reused container information set corresponding to the reused container that can be used for the second freight node from the target in-transit container information;

Based on the initialized and sorted second container demand information set, the second available container information set and the second reused container information, a planning solution for the second container usage of the second freight node among the plurality of freight nodes is determined.
The computer-readable storage medium according to claim 15, wherein based on the container usage information in the first container usage planning scheme, a second freight node corresponding to a second freight node after the first freight node is determined. After planning the container usage, the method also includes:

Based on the container usage information in the second container usage planning plan, determine the third container usage planning plan corresponding to the third freight node after the second freight node;

Based on the planning scheme for the use of the first container, the planning scheme for the use of the second container and the planning scheme for the use of the third container, a set of planning schemes for the use of the container in the target trip is determined.
The computer-readable storage medium according to claim 13, wherein determining the target container planning scheme in the planning scheme set includes:

The set of planning solutions is input into a preset local search model, and the solution output by the local search model is used as the target container planning solution.