Scheduling method and device for transport vehicles

Abstract

The invention discloses a transport vehicle scheduling method and device, and relates to the technical field of intelligent logistics. The method comprises the following steps: acquiring one or more transport routes and first historical transport data corresponding to each transport route; inputting the transportation routes and the first historical transportation data into a pre-trained shipping space prediction model, and outputting to obtain a first available shipping space number corresponding to each transportation route; obtaining a shipping space pre-occupation demand, and determining a target available shipping space number corresponding to the shipping space pre-occupation demand from the first available shipping space number; and according to whether the shipping space pre-occupation number in the shipping space pre-occupation demand satisfies the target available shipping space number, generating a vehicle scheduling result corresponding to each transportation route. According to the embodiment, the number of available shipping spaces can be predicted based on the first historical transportation data corresponding to each transportation route, and secondary allocation is performed on part of idle shipping spaces in the transportation vehicle according to the shipping space pre-occupation demand, so that the space utilization rate of the vehicle is increased as much as possible.

Description

Technical Field

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

[0002] In the existing transportation process of goods, a fixed transportation route has been obtained based on the optimization of vehicle transportation costs and storage costs. However, with the increasing requirements for the timeliness of goods transportation, some goods need to be transported and distributed within a specific time limit (for example, half-day delivery or next-day delivery). Therefore, for a single transportation route, the utilization efficiency of the transportation vehicle cannot be guaranteed for every transportation, and there may be a situation where the vehicle must be dispatched if the goods are not fully loaded. In view of this, the present invention provides a transportation vehicle scheduling method, which can reasonably utilize the vacant vehicle positions in view of the above situation, thereby improving the utilization efficiency of the vehicle and reducing the transportation cost. Summary of the invention

[0003] In view of this, an embodiment of the present invention provides a method and device for scheduling transport vehicles. Based on the first historical transport data corresponding to each transport route, the number of available slots can be predicted, and the target available slots can be matched according to the slot reservation demand, so as to re-allocate some of the idle slots in the transport vehicle and maximize the space utilization of the vehicle.

[0004] To achieve the above objective, according to one aspect of an embodiment of the present invention, a method for dispatching transport vehicles is provided.

[0005] A method for dispatching transport vehicles according to an embodiment of the present invention includes: obtaining one or more transport routes and first historical transport data corresponding to each of the transport routes; inputting the transport routes and the first historical transport data into a pre-trained slot prediction model, and outputting a first number of available slots corresponding to each of the transport routes; obtaining a slot reservation demand, and determining a target number of available slots corresponding to the slot reservation demand from the first number of available slots; and generating vehicle dispatch results corresponding to each of the transport routes based on whether the number of slots in the slot reservation demand meets the target number of available slots.

[0006] Optionally, each of the transport routes corresponds to one or more transport flights; the transport routes and the first historical transport data are input into a pre-trained slot prediction model, and the first number of available slots corresponding to each of the transport routes is output, including: the transport flights and the second historical transport data corresponding to each of the transport flights are input into a pre-trained slot prediction model, and the second number of available slots corresponding to each of the transport flights is output; the target number of available slots corresponding to the slot reservation demand is determined from the first number of available slots, including: the target number of available slots corresponding to the slot reservation demand is determined from multiple second numbers of available slots.

[0007] Optionally, the space reservation demand includes a pickup and dispatch address; determining a target number of available space corresponding to the space reservation demand from the first number of available space includes: determining a departure station and an arrival station for transportation of goods according to the pickup and dispatch address; determining a target transportation route from a plurality of transportation routes according to the departure station and the arrival station; and determining a target number of available space corresponding to the target transportation route.

[0008] Optionally, the vehicle dispatch results corresponding to each of the transport routes are generated based on whether the number of reserved slots in the reserved slot demand meets the target number of available slots, including: in response to the number of reserved slots being less than or equal to the target number of available slots, generating the vehicle dispatch result corresponding to the target transport route based on the number of reserved slots, the pick-up and dispatch address, and the current transport data of the target transport route; in response to the number of reserved slots being greater than the target number of available slots, generating the vehicle dispatch result corresponding to the target transport route based on the current transport data of the target transport route.

[0009] Optionally, the vehicle dispatch result corresponding to the target transport route is generated according to the number of reserved slots, the pick-up and dispatch address, and the current transport data of the target transport route; the vehicle route is generated based on the pick-up and dispatch address and the target transport route; the vehicle type is determined according to the number of reserved slots and the current transport data; and the vehicle dispatch result is generated by combining the vehicle route and the vehicle type.

[0010] Optionally, obtaining the slot reservation demand includes: using a user interaction page to obtain the slot reservation demand input by the user; after generating vehicle scheduling results corresponding to each of the transportation routes according to whether the slot reservation demand meets the target number of available slots, it also includes: generating a slot reservation result corresponding to the slot reservation demand according to whether the target number of available slots meets the reserved number of slots, and displaying the slot reservation result using the user interaction page.

[0011] Optionally, the space prediction model is obtained by training at least one of a time series prediction model, a regression analysis model and a neural network model.

[0012] Optionally, in response to the fact that each of the transport routes corresponds to one or more transport shifts; the comprehensive vehicle routes and the vehicle types are used to generate the vehicle scheduling result, including: obtaining the departure time and arrival time corresponding to each of the transport shifts; calculating the vehicle transportation time corresponding to the vehicle route according to the first distance between the collection address in the pick-up address and the starting site, the second distance between the delivery address in the pick-up address and the arrival site, the departure time, and the arrival time; generating the vehicle scheduling result according to the vehicle route, the vehicle transportation time and the vehicle type.

[0013] To achieve the above objective, according to another aspect of an embodiment of the present invention, a dispatching device for transport vehicles is provided.

[0014] A dispatching device for transport vehicles according to an embodiment of the present invention includes:

[0015] An acquisition module, used for acquiring one or more transport routes and first historical transport data respectively corresponding to each of the transport routes;

[0016] A space prediction module, used for inputting the transport routes and the first historical transport data into a pre-trained space prediction model, and outputting the first available space quantity corresponding to each of the transport routes;

[0017] A determination module, configured to obtain a space reservation demand and determine a target available space quantity corresponding to the space reservation demand from the first available space quantity;

[0018] The generation module is used to generate vehicle scheduling results corresponding to each of the transportation routes according to whether the number of reserved slots in the reserved slot demand meets the target number of available slots.

[0019] To achieve the above objective, according to another aspect of an embodiment of the present invention, a dispatching electronic device for transport vehicles is provided.

[0020] An electronic device for dispatching transport vehicles according to an embodiment of the present invention comprises: one or more processors; a storage device for storing one or more programs, and when the one or more programs are executed by the one or more processors, the one or more processors implement a method for dispatching transport vehicles according to an embodiment of the present invention.

[0021] To achieve the above objective, according to another aspect of an embodiment of the present invention, a computer-readable storage medium is provided.

[0022] A computer-readable storage medium according to an embodiment of the present invention stores a computer program, and when the program is executed by a processor, a method for dispatching transport vehicles according to an embodiment of the present invention is implemented.

[0023] An embodiment of the above invention has the following advantages or beneficial effects: based on the first historical transport data corresponding to each transport route, the number of available slots can be predicted, and the target available slots can be matched according to the slot reservation demand, so that some of the idle slots in the transport vehicle can be redistributed to maximize the space utilization of the vehicle.

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

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

[0026] Figure 1 This is a schematic diagram of the main flow of a method for dispatching transport vehicles according to an embodiment of the present invention;

[0027] Figure 2 is a schematic diagram of a transportation network according to an embodiment of the present invention;

[0028] Figure 3 is a schematic diagram of an application scenario according to an embodiment of the present invention;

[0029] Figure 4 is a schematic diagram of a main process of determining target available space according to an embodiment of the present invention;

[0030] Figure 5 is a schematic diagram of the main flow of another method for dispatching transport vehicles according to an embodiment of the present invention;

[0031] Figure 6 is a schematic diagram of a main process of generating a vehicle dispatch result according to an embodiment of the present invention;

[0032] Figure 7is a schematic diagram of a user interaction page according to an embodiment of the present invention;

[0033] Figure 8 is a schematic diagram of main modules of a dispatching device for transport vehicles according to an embodiment of the present invention;

[0034] Fig. 9 is an exemplary system architecture diagram to which embodiments of the present invention may be applied;

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

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

[0037] It should be pointed out that the embodiments of the present invention and the technical features therein may be combined with each other without conflict.

[0038] It should be noted that the collection, collection, updating, analysis, processing, use, transmission, storage and other aspects of user personal information involved in the technical solution of this disclosure are in compliance with the provisions of relevant laws and regulations, are used for legitimate purposes, and do not violate public order and good morals. Necessary measures are taken for user personal information to prevent illegal access to user personal information data and maintain the security of user personal information, network security and national security.

[0039] Figure 1 Schematic diagram of main steps of a method for dispatching transport vehicles according to an embodiment of the present invention.

[0040] like Figure 1 As shown, the method for dispatching transport vehicles in an embodiment of the present invention mainly includes the following steps:

[0041] Step S101: acquiring one or more transport routes and first historical transport data corresponding to each transport route;

[0042] Step S102: inputting the transport routes and the first historical transport data into a pre-trained space prediction model, and outputting the first available space quantities corresponding to each transport route;

[0043] Step S103: obtaining a space reservation demand, and determining a target available space quantity corresponding to the space reservation demand from the first available space quantity;

[0044] Step S104: generating vehicle dispatch results corresponding to each transport route according to whether the reserved slot quantity in the reserved slot demand meets the target available slot quantity.

[0045] The transportation route refers to the transportation route between every two transfer centers. For each transfer center, based on the city level, transportation capacity, and geographical location, a transportation network has been built between multiple transfer centers, such as a radial transportation network and a direct transportation network. Specifically, Figure 2 As shown, the radial transport network is a level-by-level transfer according to the level between different transfer centers, while the direct transport network does not require a transfer process and is sent from the origin to the destination in a one-stop manner. The transport route in the embodiment of the present invention can be a transport route between every two transfer centers in the radial transport network (for example, from a primary center to a primary center, from a primary center to a secondary center, or from a secondary center to a tertiary center), or a transport route between every two transfer centers in the direct network transportation (for example, from a primary center to a tertiary center).

[0046] For each transport route, it is usually necessary to transport goods multiple times a day or a month. The data of each transport can be used as a first historical transport data. Therefore, each transport route can correspond to one or more first historical transport data. It should be noted that the method for dispatching transport vehicles in the embodiment of the present invention is mainly to help large logistics companies with trunk transport capabilities to reduce transportation costs. Therefore, the main execution body is the server at the large logistics company end. The specific application scenarios are as follows: Figure 3As shown. Specifically, the large logistics company predicts the space according to the first historical transportation data corresponding to each transportation route, obtains the first available space number corresponding to each transportation route, and then publicizes the first available space number (for example, displays it in the interactive page). Small dedicated line companies that lack transportation capacity do not have long-distance or volume transportation capacity, but have the need to transport goods. They need to use the transportation routes of large logistics companies to transport their own goods. Therefore, small dedicated line companies can query in the interactive page according to their own transportation route requirements to determine whether there is a target available space number corresponding to their own transportation route requirements in the first available space number corresponding to each transportation route. If so, further input their own cargo volume requirements, and the large logistics company will determine whether the target available space number can meet the cargo volume requirements and generate a vehicle scheduling result. It can be seen that through the above process, on the basis of completing their own cargo transportation, large logistics companies can also help small dedicated line companies to realize cargo transportation, which not only reduces the logistics costs of large logistics companies, but also improves the utilization efficiency of vehicles.

[0047] It is understandable that in order to ensure the accuracy of the predicted first available space quantity as much as possible, the selection of the first historical transportation data is crucial, and the first available space quantity predicted based on the first historical transportation data of different time periods as input is also different. In an optional embodiment, the historical transportation data corresponding to the current sales cycle is obtained from the historical sales cycle as the first historical transportation data. Exemplarily, the current sales cycle is a peak sales season, such as October to November, then the historical transportation data from October to November in the historical sales cycle is obtained as the first historical transportation data, so as to predict the first available space quantity from October to November.

[0048] In a further optional embodiment, the space prediction model used in the present invention is obtained by training at least one of a time series prediction model, a regression analysis model, and a neural network model. Specifically, the training process of the space prediction model may include:

[0049] (1) Feature processing

[0050] Extract target features from the training data, such as time features (such as month, week, etc.), item features (such as item weight, item type, etc.), market features (such as sales cycle, price fluctuations, promotional activities, etc.), and external factor features (such as weather, traffic conditions, etc.).

[0051] (2) Model training

[0052] The target features are input into the original model, and the model parameters are determined by iteratively adjusting the model parameters, with the minimization of the prediction error as the model judgment criterion. Among them, the commonly used optimization algorithms include the gradient descent algorithm and the Adam algorithm.

[0053] (3) Model optimization

[0054] The validation data is used to adjust the parameters of the model, and the optimized cabin space prediction model is obtained by adjusting the learning rate, regularization parameters and cross-validation.

[0055] (4) Model evaluation

[0056] The test data is fed into the optimized cabin space prediction model, and the indicators such as mean square error (MSE), mean absolute error (MAE) and R are used to calculate the 2 Values ​​are used to measure the accuracy of predictions.

[0057] For each transport route, in an optional embodiment, each transport route may correspond to one or more transport flights. In the embodiment of the present invention, not only the first number of available slots on the transport route can be predicted, but also the second number of available slots corresponding to each transport flight on each transport route can be predicted. Specifically, the above step S102 may further include: inputting the transport flight and the second historical transport data corresponding to each transport flight into the pre-trained slot prediction model, and outputting the second number of available slots corresponding to each transport flight. Furthermore, the process of determining the target number of available slots corresponding to the slot reservation demand from the first number of available slots in step S103 further includes: determining the target number of available slots corresponding to the slot reservation demand from multiple second numbers of available slots.

[0058] In actual application, small dedicated line companies often do not know the transportation routes of large logistics companies. Their ultimate goal is only to successfully complete the transportation of goods. Therefore, in an optional embodiment, the space reservation demand needs to include the collection and delivery address. That is, the small dedicated line company can send the collection address and delivery address to the large logistics company according to its own goods transportation needs, and then the large logistics company will dispatch the vehicle, and the small dedicated line company only needs to ship and receive goods. Based on this, in an optional embodiment, the process of determining the target number of available space in step S103 can be as follows: Figure 4 As shown, specifically including:

[0059] Step S401: Determine the departure station and arrival station of the item transportation according to the pickup and delivery address;

[0060] Step S402: determining a target transport route from multiple transport routes according to the originating site and the arrival site;

[0061] Step S403: Determine the target available space quantity corresponding to the target transportation route.

[0062] It is understandable that the pickup and delivery addresses provided by small dedicated line companies to large logistics companies are usually more specific shipping addresses and receiving addresses. Therefore, large logistics companies are required to determine the target transportation route that the pickup and delivery address meets from multiple transportation routes based on the pickup and delivery address. In an optional embodiment, step S401 can determine the departure site and the arrival site based on the distance between the pickup and delivery address and multiple transportation sites. Exemplarily, the transportation site A that is closest to the pickup address a can be used as the departure site, and the transportation site B that is closest to the delivery address b can be used as the arrival site. It is understandable that since the transportation route in the embodiment of the present invention is actually the transportation route corresponding to each two transfer centers, that is, a single transportation route of the AB type, there is no ACB type multiple transportation route, so there may be a transportation route in which AB does not exist in the transportation route itself. For this situation, it is necessary to further update the departure site and / or arrival site. For example, the transportation sites of a large logistics company include A, B, C, D, E, and F, but the transportation routes only include ACB, AD, and AEF. Therefore, the transportation routes actually include AC, CB, AD, AE, and EF. There is no transportation route directly from A to B. Therefore, even if transportation site B is closest to the delivery address b, only transportation site D, which is closer to the delivery address b, can be determined from transportation sites C, D, and E as the arrival site. That is, the actual transportation route of the items transported by the small dedicated line company is collection address a-transportation site A-transportation site D-delivery address b.

[0063] After determining the target number of available slots corresponding to the slot reservation demand according to the pick-up and dispatch address in the slot reservation demand, it is necessary to further determine whether the target number of available slots can meet the actual goods transportation demand of the small dedicated line company, that is, step S104 actually includes two situations, one is in response to the number of reserved slots being less than or equal to the target number of available slots, according to the number of reserved slots, the pick-up and dispatch address and the current transportation data of the target transportation route, the vehicle scheduling result corresponding to the target transportation route is generated; the other is in response to the number of reserved slots being greater than the target number of available slots, according to the current transportation data of the target transportation route, the vehicle scheduling result corresponding to the target transportation route is generated. It can be understood that only when the number of reserved slots is less than or equal to the target number of available slots, the large logistics company can transport goods for the small dedicated line company, so it is necessary to jointly generate the vehicle scheduling result based on the pick-up and dispatch address of the small dedicated line company, the number of reserved slots and the current transportation data of the large logistics company on the target transportation route. When the number of reserved slots is greater than the target number of available slots, it means that the available slots of the large logistics company cannot meet the goods transportation needs of the small dedicated line company, that is, no cooperation has been reached with the small dedicated line company. Therefore, the large logistics company only needs to generate vehicle scheduling based on its current transportation data on the target transportation route.

[0064] Furthermore, the vehicle dispatching in the embodiment of the present invention may include determining the vehicle route, determining the vehicle type, determining the vehicle personnel, and determining the vehicle departure time and arrival time. Therefore, in a further optional embodiment, the method for dispatching transport vehicles provided by the present invention may be as follows: Figure 5 Shown include:

[0065] Step S501: obtaining one or more transport routes, and each transport route corresponds to one or more transport shifts;

[0066] Step S502: Acquire the second historical transportation data corresponding to each transportation shift;

[0067] Step S503: inputting the second historical transport data into the pre-trained space prediction model, and outputting the second available space quantity corresponding to each transport flight;

[0068] Step S504: obtaining a space reservation demand, and determining a target available space quantity corresponding to the space reservation demand from the second available space quantity according to the pickup and dispatch address in the space reservation demand;

[0069] In response to the reserved space quantity in the reserved space demand being less than or equal to the target available space quantity, executing steps S505 to S507;

[0070] Step S505: Generate a vehicle route based on the pickup address and the target transportation route;

[0071] Step S506: Determine the vehicle type according to the number of reserved spaces and the current transportation data corresponding to the target transportation route;

[0072] Step S507: Integrate vehicle routes and vehicle types to generate vehicle dispatch results.

[0073] Among them, vehicle types are different vehicles divided according to capacity, such as large trucks, medium trucks, small trucks, etc. The current transportation data corresponding to the target transportation route can be understood as the number of items that large logistics companies need to transport on the target transportation route. According to the number of reserved cabin spaces and the sum of current transportation data, the total number of all items to be transported by the current vehicle route can be determined. Furthermore, the vehicle type can be determined based on the total number.

[0074] In addition, the vehicle route is different from the transport route, which can be understood as the actual transport route including the transport route from the pick-up address to the target transport route. Similarly, taking the above example of transporting from the pick-up address a to the delivery address b, the target transport route is transport station A-transport station D, and the vehicle route is pick-up address a-transport station A-transport station D-delivery address b.

[0075] It is understandable that the vehicle dispatch result may further include the departure and arrival time of the vehicle at each transport station and collection address. For example, at 12:00, after collecting the items of the small dedicated line company, the vehicle departs from collection address a, and is expected to arrive at transport station A at 13:00, and load the items required for transportation by the large logistics company at transport station A (at this time, the loading of all items is completed). The vehicle departs from transport station A at 13:30, and is expected to arrive at transport station D at 18:00. At this time, the items of the large logistics company are first unloaded at transport station D, and it is expected that after the unloading is completed at 19:00, the items of the small dedicated line company left on the vehicle will continue to be transported to delivery address b. It can be seen that the vehicle dispatch result finally generated includes the vehicle route and each time node of the vehicle in the vehicle route, so as to ensure that the vehicle can complete the vehicle dispatch within the scheduled time.

[0076] The prediction for each time node can be calculated based on the departure time, arrival time, and distance between the pickup address and the departure and arrival stations of the transport shift. Specifically, in response to the fact that each transport route corresponds to one or more transport shifts, the process of generating the vehicle scheduling result in step S507 can be as follows: Figure 6 As shown, specifically including:

[0077] Step S601: Obtain the departure time and arrival time corresponding to each transport shift;

[0078] Step S602: Calculate the vehicle transportation time corresponding to the vehicle route according to the first distance between the pickup address in the pickup address and the originating station, the second distance between the delivery address in the pickup address and the arrival station, the departure time, and the arrival time;

[0079] Step S603: Generate a vehicle dispatch result according to the vehicle route, vehicle transportation time and vehicle type.

[0080] In a further optional embodiment, the vehicle dispatch result may also include the selection of a specific vehicle and the allocation of vehicle personnel. In the actual vehicle dispatch process, in order to ensure the transportation efficiency of the vehicle, there is usually no binding relationship between the vehicle and the order or item. Instead, the vehicle is kept in working condition as much as possible, and the vehicle personnel are reasonably allocated in different transportation routes and transportation tasks. Moreover, the transportation station may include multiple vehicles of the same vehicle type. Therefore, in the generated vehicle dispatch result, the license plate number can be directly used as the unique identifier of the vehicle, and the target vehicle can be determined from multiple vehicles that meet the vehicle type, and the target vehicle personnel driving the target vehicle can be determined from the personnel at the transportation station.

[0081] As mentioned above, large logistics companies and small dedicated line companies need to implement the data acquisition process through interactive pages, that is, the process of obtaining the space reservation demand. In an optional embodiment, it includes: using the user interaction page to obtain the space reservation demand input by the user. In addition, after the large logistics company generates the vehicle scheduling result based on the space reservation demand, the user interaction page can also be used to display the vehicle scheduling result to the small dedicated line company, so that the small dedicated line company can timely understand the vehicle route and other information of vehicle scheduling (such as license plate number and vehicle personnel, etc.). In a further optional embodiment, after generating the vehicle scheduling result, it can also include: generating a space reservation result corresponding to the space reservation demand according to whether the target available space number meets the space reservation number, and using the user interaction page to display the space reservation result. Exemplarily, when the target available space meets the space reservation number, a space reservation result indicating that the space reservation is successful is generated, and the vehicle scheduling result is synchronously fed back. When the target available space does not meet the space reservation quantity, it means that the large logistics company has not achieved joint transportation with the small dedicated line company, and the vehicle scheduling process has nothing to do with the small dedicated line company. Therefore, only the space reservation result indicating the failure of the space reservation can be generated and displayed on the user interaction page, without feedback on the vehicle scheduling result.

[0082] For example, the user interaction page can be as follows Figure 7As shown, the small dedicated line company needs to fill in the pickup and dispatch address in the user interaction page first. The server determines the corresponding target transportation route, the corresponding transportation class under the target transportation route, and the target available space quantity corresponding to each transportation class based on the pickup and dispatch address for display. The small dedicated line company can then choose from multiple transportation classes and fill in the number of reserved space in the user interaction page. The server compares the number of reserved space with the target available space, and generates the corresponding space reservation result based on whether the number of reserved space meets the target available space.

[0083] In an optional embodiment, during the actual dispatch process based on the vehicle dispatch results, the vehicle personnel need to verify the item information at the collection address (for example, check whether the items contain contraband, etc.), and check whether the weight, volume, etc. of the items match the number of reserved spaces to avoid overloading. In addition, after the delivery is completed, it is also necessary to hand over the items to the small dedicated line company at the delivery address, count the number and status of the items, ensure that the items are properly delivered, and record the item receipt information and generate the corresponding receipt bill for subsequent bill inquiries.

[0084] According to the scheduling method for transport vehicles in an embodiment of the present invention, the number of available slots can be predicted based on the first historical transport data corresponding to each transport route, and the target available slots can be matched according to the slot reservation demand, so as to re-allocate some of the idle slots in the transport vehicle and maximize the space utilization of the vehicle.

[0085] Figure 8 Schematic diagram of main modules of a dispatching device for transport vehicles according to an embodiment of the present invention.

[0086] like Figure 8 As shown, the transport vehicle dispatching device 800 of the embodiment of the present invention includes:

[0087] An acquisition module 801 is used to acquire one or more transport routes and first historical transport data corresponding to each of the transport routes;

[0088] A space prediction module 802 is used to input the transport routes and the first historical transport data into a pre-trained space prediction model, and output the first available space quantity corresponding to each of the transport routes;

[0089] The determination module 803 is used to obtain the space reservation demand and determine the target available space quantity corresponding to the space reservation demand from the first available space quantity;

[0090] The generating module 804 is used to generate vehicle dispatching results corresponding to each of the transport routes according to whether the number of reserved slots in the reserved slot demand meets the target number of available slots.

[0091] In an optional embodiment, each of the transport routes corresponds to one or more transport flights; the space prediction module 802 is further used to input the transport flights and the second historical transport data corresponding to each of the transport flights into a pre-trained space prediction model, and output the second number of available spaces corresponding to each of the transport flights; the determination module 803 is further used to determine the target number of available spaces corresponding to the space reservation demand from multiple second available space numbers.

[0092] In an optional embodiment, the space reservation demand includes a pickup and dispatch address; the space prediction module 802 is also used to determine the departure station and the arrival station for the transportation of the goods according to the pickup and dispatch address; determine the target transportation route from the multiple transportation routes according to the departure station and the arrival station; and determine the target number of available space corresponding to the target transportation route.

[0093] In an optional embodiment, the generation module 804 is also used to, in response to the number of reserved slots being less than or equal to the target number of available slots, generate a vehicle scheduling result corresponding to the target transportation route based on the number of reserved slots, the pickup address and the current transportation data of the target transportation route; in response to the number of reserved slots being greater than the target number of available slots, generate a vehicle scheduling result corresponding to the target transportation route based on the current transportation data of the target transportation route.

[0094] In an optional embodiment, the generation module 804 is also used to generate a vehicle route based on the pickup address and the target transportation route; determine the vehicle type according to the number of reserved spaces and the current transportation data; and generate the vehicle scheduling result by combining the vehicle route and the vehicle type.

[0095] In an optional embodiment, the determination module 803 is also used to obtain the slot reservation demand input by the user using the user interaction page; the generation module 804 is also used to generate the vehicle scheduling results corresponding to each of the transportation routes according to whether the slot reservation demand meets the target number of available slots, generate the slot reservation results corresponding to the slot reservation demand according to whether the target number of available slots meets the number of slots to be reserved, and display the slot reservation results using the user interaction page.

[0096] In an optional embodiment, the space prediction model is obtained by training at least one of a time series prediction model, a regression analysis model and a neural network model.

[0097] In an optional embodiment, in response to each of the transport routes corresponding to one or more transport shifts; the generation module 804 is also used to obtain the departure time and arrival time corresponding to each of the transport shifts; according to the first distance between the collection address in the collection address and the departure site, the second distance between the delivery address in the collection address and the arrival site, the departure time, and the arrival time, the vehicle transportation time corresponding to the vehicle route is calculated; according to the vehicle route, the vehicle transportation time and the vehicle type, the vehicle scheduling result is generated.

[0098] According to the scheduling device for transport vehicles in an embodiment of the present invention, the number of available slots can be predicted based on the first historical transport data corresponding to each transport route, and the target available slots can be matched according to the slot reservation demand, so as to re-allocate some of the idle slots in the transport vehicle and maximize the space utilization of the vehicle.

[0099] Fig. 9 An exemplary system architecture 900 is shown to which the method for dispatching transport vehicles or the device for dispatching transport vehicles according to the embodiments of the present invention can be applied.

[0100] like Fig. 9 As shown, system architecture 900 may include terminal devices 901, 902, 903, network 904 and server 905. Network 904 is used to provide a medium for communication links between terminal devices 901, 902, 903 and server 905. Network 904 may include various connection types, such as wired, wireless communication links or optical fiber cables, etc.

[0101] The user can use the terminal devices 901, 902, 903 to interact with the server 905 through the network 904 to receive or send data, etc. Various communication client applications can be installed on the terminal devices 901, 902, 903, such as shopping applications, web browser applications, search applications, instant messaging tools, email clients, social platform software, etc.

[0102] The terminal devices 901 , 902 , and 903 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop computers, and desktop computers, etc.

[0103] The server 905 may be a server that provides various services, such as a background management server that provides support for the space reservation requirements sent by the user using the terminal devices 901, 902, and 903. The background management server may analyze and process the received space reservation requirements and other data, and feed back the processing results (such as vehicle dispatch results) to the terminal device.

[0104] It should be noted that the method for dispatching transport vehicles provided in the embodiment of the present invention is generally executed by the server 905 , and accordingly, the dispatching device for transport vehicles is generally arranged in the server 905 .

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

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

[0107] like Fig.10 As shown, the computer system 1000 includes a central processing unit (CPU) 1001, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 1002 or a program loaded from a storage part 1008 into a random access memory (RAM) 1003. In the RAM 1003, various programs and data required for the operation of the system 1000 are also stored. The CPU 1001, the ROM 1002, and the RAM 1003 are connected to each other through a bus 1004. An input / output (I / O) first interface 1005 is also connected to the bus 1004.

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

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

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

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

[0112] The modules involved in the embodiments of the present invention may be implemented by software or hardware. The modules described may also be set in a processor, for example, it may be described as: a processor includes an acquisition module, a space prediction module, a determination module and a generation module. The names of these modules do not constitute a limitation on the modules themselves in some cases. For example, the acquisition module may also be described as "a module for acquiring one or more transport routes and the first historical transport data corresponding to each of the transport routes".

[0113] As another aspect, the present invention also provides a computer-readable medium, which may be included in the device described in the above embodiment; or it may exist independently without being assembled into the device. The above computer-readable medium carries one or more programs, and when the above one or more programs are executed by a device, the device includes: obtaining one or more transportation routes, and first historical transportation data corresponding to each of the transportation routes; inputting the transportation routes and the first historical transportation data into a pre-trained cabin space prediction model, and outputting the first number of available cabin spaces corresponding to each of the transportation routes; obtaining cabin space reservation requirements, and determining the target number of available cabin spaces corresponding to the cabin space reservation requirements from the first number of available cabin spaces; generating vehicle scheduling results corresponding to each of the transportation routes according to whether the cabin space reservation number in the cabin space reservation requirements meets the target number of available cabin spaces.

[0114] According to the technical solution of the embodiment of the present invention, the number of available slots can be predicted based on the first historical transport data corresponding to each transport route, and the target available slots can be matched according to the slot reservation demand, so that some of the idle slots in the transport vehicle can be redistributed to maximize the space utilization of the vehicle.

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

Claims

1. A method for dispatching transport vehicles, characterized in that: include: Acquire one or more transport routes and first historical transport data corresponding to each of the transport routes; Inputting the transport routes and the first historical transport data into a pre-trained space prediction model, and outputting the first available space quantities corresponding to each of the transport routes; Acquire a space reservation demand, and determine a target available space quantity corresponding to the space reservation demand from the first available space quantity; According to whether the reserved slot quantity in the reserved slot demand meets the target available slot quantity, a vehicle dispatch result corresponding to each of the transportation routes is generated.

2. The method according to claim 1, characterized in that Each of the transport routes corresponds to one or more transport flights; the transport routes and the first historical transport data are input into a pre-trained space prediction model, and the first available space quantities corresponding to each of the transport routes are output, including: Input the transport flights and the second historical transport data respectively corresponding to each of the transport flights into a pre-trained space prediction model, and output the second available space quantity respectively corresponding to each of the transport flights; The step of determining a target number of available space corresponding to the space reservation demand from the first number of available space includes: A target available capacity quantity corresponding to the capacity reservation demand is determined from the plurality of second available capacity quantities.

3. The method according to claim 1, characterized in that The space reservation demand includes a pickup and dispatch address; and determining a target number of available space corresponding to the space reservation demand from the first number of available space includes: Determine the departure and arrival points for the transportation of the goods according to the pickup and delivery address; Determining a target transport route from the plurality of transport routes according to the departure site and the arrival site; A target number of available shipping spaces corresponding to the target transportation route is determined.

4. The method according to claim 3, characterized in that The generating of vehicle dispatch results corresponding to each of the transport routes according to whether the number of reserved slots in the reserved slot demand meets the target number of available slots includes: In response to the number of reserved slots being less than or equal to the target number of available slots, generating a vehicle dispatch result corresponding to the target transportation route according to the number of reserved slots, the pickup and dispatch address, and current transportation data of the target transportation route; In response to the reserved number of slots being greater than the target available number of slots, a vehicle dispatch result corresponding to the target transportation route is generated according to current transportation data of the target transportation route.

5. The method according to claim 4, characterized in that generating a vehicle dispatch result corresponding to the target transportation route according to the reserved space quantity, the pickup and dispatch address, and the current transportation data of the target transportation route; Generate a vehicle route based on the pickup address and the target transportation route; Determining the vehicle type according to the reserved space quantity and the current transportation data; The vehicle dispatch result is generated by combining the vehicle route and the vehicle type.

6. The method according to claim 1, characterized in that The obtaining of space reservation requirements includes: Utilize the user interaction page to obtain the space reservation demand input by the user; After generating the vehicle dispatch results corresponding to the transport routes respectively according to whether the space reservation demand meets the target available space quantity, the method further includes: A slot reservation result corresponding to the slot reservation demand is generated according to whether the target available slot quantity satisfies the slot reservation quantity, and the slot reservation result is displayed using the user interaction page.

7. The method according to claim 1, characterized in that The space prediction model is obtained by training at least one of a time series prediction model, a regression analysis model and a neural network model.

8. The method according to claim 5, characterized in that In response to each of the transport routes corresponding to one or more transport shifts; the vehicle dispatch result is generated by integrating the vehicle routes and the vehicle types, including: Obtain the departure time and arrival time corresponding to each of the transport shifts; Calculate the vehicle transportation time corresponding to the vehicle route according to the first distance between the pickup address in the pickup address and the origin site, the second distance between the delivery address in the pickup address and the arrival site, the departure time, and the arrival time; The vehicle dispatch result is generated according to the vehicle route, the vehicle transportation time and the vehicle type.

9. A dispatching device for transport vehicles, characterized in that: include: An acquisition module, used for acquiring one or more transport routes and first historical transport data respectively corresponding to each of the transport routes; A space prediction module, used for inputting the transport routes and the first historical transport data into a pre-trained space prediction model, and outputting the first available space quantity corresponding to each of the transport routes; A determination module, configured to obtain a space reservation demand and determine a target available space quantity corresponding to the space reservation demand from the first available space quantity; The generation module is used to generate vehicle scheduling results corresponding to each of the transportation routes according to whether the number of reserved slots in the reserved slot demand meets the target number of available slots.

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

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

12. A computer program product, comprising a computer program, wherein when the computer program is executed by a processor, the computer program implements the method according to any one of claims 1 to 8.

Images