Vehicle scheduling method and device, computer device and storage medium

Abstract

The application provides a vehicle scheduling method and device, computer equipment and a storage medium. The vehicle scheduling method comprises: obtaining a plurality of order information and unloading scheduling information of each network point in each order information. The loading and unloading scheduling comprises at least one non-loading time period and at least one non-unloading time period in a natural cycle; determining a plurality of first feasible routing information corresponding to the plurality of order information based on the plurality of order information and the loading and unloading scheduling time information of each network point; generating a plurality of second feasible routing information based on the plurality of first feasible routing information, the loading and unloading scheduling information of each network point and each order information, wherein the second feasible routing information is the routing information for completing each order collection task and distribution task; and performing vehicle scheduling based on the plurality of second feasible routing information. The application uses the loading and unloading scheduling information of each network point when generating the routing, thereby improving the accuracy of vehicle scheduling.

Description

Technical Field

[0001] This application mainly relates to the field of vehicle dispatching technology, specifically to a vehicle dispatching method, device, computer equipment, and storage medium. Background Technology

[0002] The Vehicle Scheduling Problem (VSP) and the Vehicle Routing Problem (VRP) are classic problems in the logistics field. Common project solutions include assigning staff based on experience, developing scheduling models or heuristic algorithms according to the scenario, and, academically, developing precise algorithms such as the branch-and-price algorithm and the branch-and-cut-and-price algorithm. All of these solutions are based on feasible vehicle route generation algorithms, and after route generation, suitable routes are selected as the solution to the problem using different methods.

[0003] In terms of scenarios, most previous vehicle dispatching problems assumed that depots could be loaded at any time. In vehicle routing problems, routes are generally defined based on the order of depots visited and the order of service orders. It's generally assumed that the earlier a vehicle departs from a depot before the route, the earlier it arrives at the next depot for loading (unloading), and the earlier it departs from the next depot, thus satisfying the first-in-first-out (FIFO) principle. That is, the earlier a vehicle departs from the first depot, the earlier it arrives at the last depot, and the duration of the entire route is fixed. The duration is the time to reach the last destination depot minus the departure time from the first originating depot. However, if a depot has a time when loading (unloading) is not possible, if a vehicle arrives at the depot during that time, it must wait until the loading / unloading time is available before departing. This prevents a vehicle from departing earlier from the next depot, leading to a mismatch between the dispatching plan and the actual situation, resulting in lower vehicle dispatching accuracy. Summary of the Invention

[0004] This application provides a vehicle dispatching method, apparatus, computer equipment, and storage medium, aiming to solve the problem of accurate disclosure of vehicle dispatching information in the prior art.

[0005] Firstly, this application provides a vehicle dispatching method, the vehicle dispatching method comprising:

[0006] Obtain multiple order information and loading / unloading schedule information for each branch in each order information, wherein the loading / unloading schedule includes at least one non-loading time period and at least one non-unloading time period within a natural cycle;

[0007] Based on multiple order information and loading and unloading schedule information of each branch, multiple first feasible routes are determined for the multiple order information;

[0008] Based on the multiple first feasible routing information, the loading and unloading schedule information of each network point, and each order information, multiple second feasible routing information are generated, wherein the second feasible routing information is the routing information for completing the collection task and the bulk task of each order;

[0009] Vehicle scheduling is performed based on the aforementioned multiple second feasible routing information.

[0010] Optionally, the step of generating multiple second feasible routing information based on the multiple first feasible routing information, the loading and unloading schedule information of each network point, and each order information includes:

[0011] Based on the multiple first feasible routing information, the loading and unloading schedule information of each network point, and the order information, the routing is expanded to obtain multiple third feasible routing information, wherein the third feasible routing information is the routing information for completing the order collection task.

[0012] Based on the multiple third feasible routing information and the loading and unloading schedule information of each network point, the routing is completed, and multiple second feasible routing information is obtained.

[0013] Optionally, the order information includes the order creation time, the latest departure time of the order, and the loading and unloading time, and the first feasible routing information includes the earliest departure time of the current routing point;

[0014] The determination of multiple first feasible routes corresponding to multiple order information based on multiple order information and loading and unloading schedule information of each branch includes:

[0015] The first departure time interval in the first feasible route information is determined based on the order creation time, the loading and unloading time, and the latest departure time of the order.

[0016] The first departure time interval is divided based on a preset time scale to obtain multiple first departure times;

[0017] Based on the loading and unloading schedule information and the loading and unloading time, the earliest departure time of the current route point is obtained from the plurality of first departure times.

[0018] Optionally, the route expansion based on the plurality of first feasible routing information, the loading and unloading schedule information of each network point, and each order information yields a plurality of third feasible routing information, including:

[0019] Based on the multiple first feasible routing information, the loading and unloading schedule information of each network point, and each order information, the multiple first feasible routing information and each order information are expanded in a single route to obtain multiple expanded routing information. The multiple expanded routing information is the routing information generated by expanding the multiple first feasible routes to orders that meet the preset expansion conditions.

[0020] The extended routing information is redefined as the first feasible routing information and iteratively extended the route until the number of newly generated extended routing information is zero.

[0021] The routing information generated in each route extension is determined as the third feasible routing information.

[0022] Optionally, based on the plurality of first feasible routing information, the loading and unloading schedule information of each network point, and each order information, the plurality of first feasible routing information and each order information are expanded in a single run to obtain a plurality of expanded routing information, including:

[0023] Obtain the vehicle travel time from the current route point in the first feasible route information to the originating point in the order information;

[0024] The second departure time interval is determined based on the vehicle running time, the earliest departure time of the current route point in the first feasible route information, the latest departure time of the current route point in the first feasible route information, the latest departure time of the originating point in the order information, and the loading and unloading time.

[0025] The second departure time interval is divided based on a preset time scale to obtain multiple second departure times;

[0026] Multiple extended route information is determined based on the loading and unloading schedule information, the loading and unloading time, and the multiple second departure times.

[0027] Optionally, before iteratively expanding the extended routing information to the first feasible routing information until the number of newly generated extended routing information is zero, the following steps are included:

[0028] Remove one of any two extended routing information that meets the preset removal conditions from the plurality of extended routing information.

[0029] Optionally, the third feasible routing information includes the latest arrival times of multiple destination points in the first set of destination points;

[0030] The routing process, based on the multiple third feasible routing information and the loading and unloading schedule information of each network point, is completed, resulting in multiple second feasible routing information, including:

[0031] Sort the multiple destinations in the first destination set from earliest to latest according to their latest arrival time to obtain the second destination set;

[0032] The first destination point in the second destination point set is identified as the target destination point, and the target destination point is removed from the second destination point set.

[0033] Determine whether the third feasible route information can reach the target destination network point;

[0034] When the third feasible route information can reach the target destination network point, the third feasible route information is iteratively updated until the second destination network point set is empty;

[0035] When the second destination network set is empty, the routing information obtained by updating the third feasible routing information is determined as the second feasible routing information.

[0036] Optionally, determining whether the third feasible routing information can reach the target destination network includes:

[0037] Obtain the earliest departure time of the current route point in the third feasible route information, the vehicle travel time from the current route point in the third feasible route information to the target destination point, and the latest arrival time of the target destination point;

[0038] The arrival time interval is determined based on the earliest departure time of the current route point in the third feasible route information, the vehicle travel time from the current route point in the third feasible route information to the target destination point, and the latest arrival time of the target destination point.

[0039] The arrival time interval is divided according to a predetermined time scale to obtain multiple arrival time points;

[0040] If any of the multiple arrival times satisfy the loading and unloading schedule information, then the third feasible route information is determined to reach the target destination network.

[0041] Secondly, this application provides a vehicle dispatching device, the vehicle dispatching device comprising:

[0042] The acquisition unit is used to acquire multiple order information and loading and unloading schedule information of each branch in each order information. The loading and unloading schedule includes at least one non-loading time period and at least one non-unloading time period within a natural cycle.

[0043] The determining unit is used to determine multiple first feasible routes corresponding to multiple order information based on multiple order information and loading and unloading schedule information of each network point;

[0044] The generation unit is used to generate multiple second feasible routing information based on the multiple first feasible routing information, the loading and unloading schedule information of each network point, and each order information, wherein the second feasible routing information is the routing information for completing the collection task and the bulk task of each order;

[0045] The vehicle scheduling unit is used to schedule vehicles based on the plurality of second feasible routing information.

[0046] Optionally, the generation unit is configured to:

[0047] Based on the multiple first feasible routing information, the loading and unloading schedule information of each network point, and the order information, the routing is expanded to obtain multiple third feasible routing information, wherein the third feasible routing information is the routing information for completing the order collection task.

[0048] Based on the multiple third feasible routing information and the loading and unloading schedule information of each network point, the routing is completed, and multiple second feasible routing information is obtained.

[0049] Optionally, the order information includes the order creation time, the latest departure time of the order, and the loading and unloading time; the first feasible route information includes the earliest departure time of the current route point; the determining unit is used for:

[0050] The first departure time interval in the first feasible route information is determined based on the order creation time, the loading and unloading time, and the latest departure time of the order.

[0051] The first departure time interval is divided based on a preset time scale to obtain multiple first departure times;

[0052] Based on the loading and unloading schedule information and the loading and unloading time, the earliest departure time of the current route point is obtained from the plurality of first departure times.

[0053] Optionally, the generation unit is configured to:

[0054] Based on the multiple first feasible routing information, the loading and unloading schedule information of each network point, and each order information, the multiple first feasible routing information and each order information are expanded in a single route to obtain multiple expanded routing information. The multiple expanded routing information is the routing information generated by expanding the multiple first feasible routes to orders that meet the preset expansion conditions.

[0055] The extended routing information is redefined as the first feasible routing information and iteratively extended the route until the number of newly generated extended routing information is zero.

[0056] The routing information generated in each route extension is determined as the third feasible routing information.

[0057] Optionally, the generation unit is configured to:

[0058] Obtain the vehicle travel time from the current route point in the first feasible route information to the originating point in the order information;

[0059] The second departure time interval is determined based on the vehicle running time, the earliest departure time of the current route point in the first feasible route information, the latest departure time of the current route point in the first feasible route information, the latest departure time of the originating point in the order information, and the loading and unloading time.

[0060] The second departure time interval is divided based on a preset time scale to obtain multiple second departure times;

[0061] Multiple extended route information is determined based on the loading and unloading schedule information, the loading and unloading time, and the multiple second departure times.

[0062] Optionally, the generation unit is configured to:

[0063] Remove one of any two extended routing information that meets the preset removal conditions from the plurality of extended routing information.

[0064] Optionally, the third feasible routing information includes the latest arrival times of multiple destination points in the first destination point set; the generation unit is used for:

[0065] Sort the multiple destinations in the first destination set from earliest to latest according to their latest arrival time to obtain the second destination set;

[0066] The first destination point in the second destination point set is identified as the target destination point, and the target destination point is removed from the second destination point set.

[0067] Determine whether the third feasible route information can reach the target destination network point;

[0068] When the third feasible route information can reach the target destination network point, the third feasible route information is iteratively updated until the second destination network point set is empty;

[0069] When the second destination network set is empty, the routing information obtained by updating the third feasible routing information is determined as the second feasible routing information.

[0070] Optionally, the generation unit is configured to:

[0071] Obtain the earliest departure time of the current route point in the third feasible route information, the vehicle travel time from the current route point in the third feasible route information to the target destination point, and the latest arrival time of the target destination point;

[0072] The arrival time interval is determined based on the earliest departure time of the current route point in the third feasible route information, the vehicle travel time from the current route point in the third feasible route information to the target destination point, and the latest arrival time of the target destination point.

[0073] The arrival time interval is divided according to a predetermined time scale to obtain multiple arrival time points;

[0074] If any of the multiple arrival times satisfy the loading and unloading schedule information, then the third feasible route information is determined to reach the target destination network.

[0075] Thirdly, this application provides a computer device, the computer device comprising:

[0076] One or more processors;

[0077] Memory; and

[0078] One or more applications, wherein the one or more applications are stored in the memory and configured to be executed by the processor to implement the vehicle scheduling method described in any one of the first aspects.

[0079] Fourthly, this application provides a computer-readable storage medium storing a plurality of instructions adapted for loading by a processor to perform the steps of the vehicle scheduling method described in any one of the first aspects.

[0080] This application provides a vehicle dispatching method, apparatus, computer equipment, and storage medium. First, multiple first feasible routes are determined based on multiple order information and loading / unloading schedule information for each branch. Then, multiple second feasible routes are generated based on the multiple first feasible routes, the loading / unloading schedule information for each branch, and the order information, and vehicle dispatching is performed. Because this application uses the loading / unloading schedule information for each branch when generating routes, it avoids the problem of the dispatching scheme deviating from the actual scenario in situations where branches have unavailable loading / unloading times, thus improving the accuracy of vehicle dispatching. Attached Figure Description

[0081] To more clearly illustrate the technical solutions in the embodiments of this application, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0082] Figure 1 This is a schematic diagram of a vehicle dispatching system provided in an embodiment of this application;

[0083] Figure 2 This is a schematic flowchart of an embodiment of the vehicle dispatching method provided in this application;

[0084] Figure 3 This is a schematic flowchart of an embodiment of S203 in this application;

[0085] Figure 4 This is a schematic flowchart of an embodiment of S301 in this application;

[0086] Figure 5 This is a schematic flowchart of an embodiment of S302 in this application;

[0087] Figure 6 This is a schematic diagram of an embodiment of the vehicle dispatching device provided in this application.

[0088] Figure 7 This is a schematic diagram of an embodiment of the computer device provided in this application. Detailed Implementation

[0089] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, and not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0090] In the description of this application, it should be understood that the terms "center," "longitudinal," "lateral," "length," "width," "thickness," "upper," "lower," "front," "rear," "left," "right," "vertical," "horizontal," "top," "bottom," "inner," and "outer," etc., indicating orientation or positional relationships based on the orientation or positional relationships shown in the accompanying drawings, are used only for the convenience of describing this application and simplifying the description, and do not indicate or imply that the device or element referred to must have a specific orientation, or be constructed and operated in a specific orientation, and therefore should not be construed as a limitation of this application. Furthermore, the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of indicated technical features. Thus, features defined with "first" and "second" may explicitly or implicitly include one or more of the stated features. In the description of this application, "a plurality of" means two or more, unless otherwise explicitly specified.

[0091] In this application, the term "exemplary" is used to mean "used as an example, illustration, or description." Any embodiment described as "exemplary" in this application is not necessarily to be construed as being more preferred or advantageous than other embodiments. The following description is provided to enable any person skilled in the art to make and use this application. Details are set forth in the following description for purposes of explanation. It should be understood that those skilled in the art will recognize that this application can be made without using these specific details. In other instances, well-known structures and processes are not described in detail to avoid obscuring the description of this application with unnecessary detail. Therefore, this application is not intended to be limited to the embodiments shown, but is consistent with the broadest scope of the principles and features disclosed in this application.

[0092] This application provides a vehicle dispatching method, apparatus, computer equipment, and storage medium, which will be described in detail below.

[0093] Please see Figure 1 , Figure 1 This is a schematic diagram of a vehicle dispatching system provided in an embodiment of this application. The vehicle dispatching system may include a computer device 100, which integrates a vehicle dispatching unit.

[0094] In this embodiment, the computer device 100 can be a standalone server, a server network, or a server cluster. For example, the computer device 100 described in this embodiment includes, but is not limited to, a computer, a network host, a single network server, a set of multiple network servers, or a cloud server composed of multiple servers. The cloud server is composed of a large number of computers or network servers based on cloud computing.

[0095] In this embodiment, the computer device 100 described above can be a general-purpose computer device or a special-purpose computer device. In specific implementations, the computer device 100 can be a desktop computer, a portable computer, a network server, a handheld computer (Personal Digital Assistant, PDA), a mobile phone, a tablet computer, a wireless terminal device, a communication device, an embedded device, etc. This embodiment does not limit the type of computer device 100.

[0096] Those skilled in the art will understand that Figure 1 The application environment shown is merely one application scenario of the solution in this application and does not constitute a limitation on the application scenario of the solution in this application. Other application environments may include more than one application scenario. Figure 1 The number of computer devices shown is more or less, for example Figure 1 Only one computer device is shown in the diagram. It is understood that the vehicle dispatching system may also include one or more other computer devices capable of processing data, which are not specifically limited here.

[0097] In addition, such as Figure 1 As shown, the vehicle dispatching system may also include a memory 200 for storing data.

[0098] It should be noted that, Figure 1 The schematic diagram of the vehicle dispatching system shown is merely an example. The vehicle dispatching system and scenario described in this application are intended to more clearly illustrate the technical solutions of this application and do not constitute a limitation on the technical solutions provided in this application. As those skilled in the art will know, with the evolution of vehicle dispatching systems and the emergence of new business scenarios, the technical solutions provided in this application are also applicable to similar technical problems.

[0099] First, this application provides a vehicle scheduling method, including: acquiring multiple order information and loading / unloading schedule information of each network point in each order information, wherein the loading / unloading schedule includes at least one non-loading time period and at least one non-unloading time period within a natural cycle; determining multiple first feasible routing information corresponding to the multiple order information based on the multiple order information and the loading / unloading schedule information of each network point; generating multiple second feasible routing information based on the multiple first feasible routing information, the loading / unloading schedule information of each network point, and the order information, wherein the second feasible routing information is routing information for completing the collection task and the bulk cargo task of each order; and performing vehicle scheduling based on the multiple second feasible routing information.

[0100] like Figure 2 The diagram shown is a flowchart of an embodiment of the vehicle dispatching method in this application. The vehicle dispatching method includes the following steps S201 to S204:

[0101] S201. Obtain multiple order information and loading / unloading schedule information for each branch in each order information. The loading / unloading schedule includes at least one non-loading time period and at least one non-unloading time period within the natural cycle.

[0102] In this embodiment, user order information is obtained within a preset time period. The preset time period can be a day or an hour within a day, and the specific time period is not limited here. The natural cycle can be a week or a day. The unloading-unavailable time period indicates that the branch cannot load goods during this time period, and the unloading-unavailable time period indicates that the branch cannot unload goods during this time period.

[0103] In this embodiment, the order information may include: order number, originating point, destination point, starting region, destination region, cargo quantity, order creation time, timeliness requirement, and loading / unloading time. Loading / unloading time includes loading time and unloading time.

[0104] For ease of explanation later, this application defines the parameters in the order information as follows:

[0105] O: Collection of all orders;

[0106] O 1-2 Orders originating from and destined for different regions;

[0107] O 2-2 Orders whose origin and destination points are located in the same region

[0108] a i : The creation time of order i, where i∈O;

[0109] b i The latest departure time of order i, determined by the logic above, where i∈O;

[0110] e i The latest delivery time of order i, determined by the logic above, where i∈O;

[0111] o i The originating point of order i, where i∈O;

[0112] d i : The destination of order i, where i∈O;

[0113] u i The quantity of goods in order i, where i∈O;

[0114] The travel time from the originating point to the destination point of order i, where i∈O;

[0115] ptm / dtm: Loading time / Unloading time.

[0116] A delivery point can be any point within a logistics network, including transit points. Each delivery point is a collection of originating and destination delivery points in the order information. The loading and unloading schedule information for a delivery point can include at least one non-unloading period and at least one non-loading period within a natural cycle. Furthermore, the loading and unloading schedule information can include at least two non-unloading periods and at least two non-loading periods set at intervals within a natural cycle. The more non-loading and non-unloading periods a delivery point has, the less likely it is to meet the first-in, first-out (FIFO) principle. The preset cycle can be one day or one week. For example, the loading and unloading schedule information for a delivery point within a day could be:

[0117] Loading hours: 2:00-7:00; 9:00-12:00; 13:30-18:00; 19:00-23:59. Unloading hours: 0:00-0:50; 1:50-7:50; 8:30-11:50; 12:50-17:50; 18:50-21:00; 21:30-23:59.

[0118] Time periods outside the loading period are considered non-loading periods, for example, 0:00-2:00. Similarly, time periods outside the unloading period are considered non-unloading periods, for example, 0:50-1:50. Of course, non-unloading and non-loading periods can be set according to specific circumstances. Non-unloading and non-loading periods can overlap.

[0119] S202. Based on multiple order information and loading and unloading schedule information of each branch, determine multiple first feasible routes corresponding to multiple order information.

[0120] The first feasible route information includes the earliest departure time of the current route point. The current route point is the last point of the route service. During the route expansion process, the current route point may be the originating point or the destination point.

[0121] In this embodiment of the application, determining multiple first feasible routing information corresponding to multiple order information based on multiple order information and loading and unloading schedule information of each branch can include:

[0122] (1) Determine the first departure time interval in the first feasible route information based on the order creation time, loading and unloading time, and the latest departure time of the order.

[0123] Among them, according to the order creation time a i Based on timeliness requirements, the latest departure time b for this order can be calculated.i Latest delivery time of the order e i The latest delivery time for the order is e. i This refers to the latest time the goods can be transported to the destination point, and the latest delivery time of the order. i = Order creation time a i +Permitted delivery time - Unloading time, if the latest delivery time of the order is e i Until the latest delivery time of the order e i If there is a point in the time interval between the destination point and the sum of the unloading and delivery times where unloading cannot be completed, then the latest delivery time e of the order is continuously reduced. i Until the latest delivery time of the order. i Until the latest delivery time of the order e i The time interval between the time taken for unloading and the time taken for unloading are all possible unloading times. The latest departure time of the order is b. i = Latest delivery time of the order e i - Vehicle travel time from the order's originating point to its destination. If the order's originating point and destination are located in the same area, i.e., O... 2-2 For orders of this type, the vehicle travel time is the first travel time, for example, 20 minutes; if the order's origin and destination are not located in the same area, i.e., O... 1-2 For orders of this type, the vehicle travel time is the second travel time, for example, the second travel time between two outlets in a cross-regional area is 60 minutes.

[0124] Specifically, for order set O 1-2 For any order i in the network, the vehicle will transport the order from the originating point o. i Delivery to destination point d i The first selectable departure time interval is [a i +ptm,b i ].

[0125] (2) Divide the first departure time interval based on the preset time scale to obtain multiple first departure times.

[0126] To find the shortest route duration, it is impractical to traverse all feasible departure times of the vehicle at the network points. Therefore, this application discretizes the continuous first departure time interval, that is, it takes a departure time as the first departure time for each preset time scale Δ.

[0127] Δ = ptm = dtm = 20min

[0128] The size of the preset time scale Δ can be selected according to specific needs. For example, the preset time scale Δ can be 10 min, 5 min, etc. This application does not limit it.

[0129] For example, from a i Starting at +ptm time, every preset time scale Δ from the first departure time interval [a i +ptm,b i We take one time from the set as the first departure time dt, and thus obtain a set consisting of multiple first departure times dt, denoted as departureTmList.

[0130] (3) Based on the loading and unloading schedule information and loading and unloading time, obtain the earliest departure time of the current route network point from multiple first departure times.

[0131] Specifically, multiple first pre-loading time intervals [dt-ptm, dt] corresponding to multiple first departure times are determined based on multiple first departure times and loading / unloading time durations. The first departure times dt corresponding to the first pre-loading time intervals that overlap with non-loading time periods are removed, resulting in multiple remaining first departure times dt. The minimum time mdt among these remaining first departure times dt is determined as the earliest departure time a of the current routing network point. p Before a vehicle departs at its first departure time (dt), it needs to have sufficient loading time (ptm) for loading. If there are unloading times within this first pre-loading time interval, it will delay the loading progress and affect the departure time. Therefore, such departure times are removed.

[0132] Because of the starting point o i Given the existence of unloadable times, any first departure time dt in the set departureTmList, composed of multiple first departure times dt, is removed from the set departureTmList if there is an unloadable time point within the first pre-loading time interval [dt-ptm, dt]. For the smallest departure time mdt in the set departureTmList, a route p is formed as follows. The first feasible route information corresponding to route p includes: current route network point, earliest departure time, latest departure time, set of orders carried, set of origin network points, set of destination network points, and total quantity of items carried. The first feasible route information is obtained based on the order information. The relationship between the first feasible route information corresponding to route p and the order information is as follows:

[0133] Current routing point n p =o i The current routing point of route p is the originating point o of order i. i ;

[0134] Earliest departure time a p =mdt: The earliest departure time of route p is mdt;

[0135] Latest departure time bp =b i The latest departure time for route p is b. i ;

[0136] Order set O p =[i]: Add order i to the order set carried by route p;

[0137] Origin network set BN p =[]: The set of originating network points for route p, temporarily set to empty;

[0138] Destination network set EN p :Place the order at destination point d i Add the destination network set to route p, and the destination network d i Corresponding latest delivery time e i ;

[0139] Total number of items u p =u i Update the total number of components in route p.

[0140] For each new order, a route p can be formed. The first feasible route information corresponding to the formed route p is stored in the collection newList and the collection pathList.

[0141] S203. Generate multiple second feasible routes based on multiple first feasible routes, loading and unloading schedules of each branch, and order information.

[0142] The second feasible routing information is the routing information for completing the consolidation and bulk cargo tasks for each order.

[0143] S204. Vehicle scheduling is performed based on multiple second feasible routing information.

[0144] In one specific embodiment, a set partitioning model is constructed with the goal of minimizing the number of routes. Based on the set partitioning model, multiple first route combinations formed by multiple second feasible route information are filtered to obtain second route combinations. Vehicle scheduling is then performed based on the second route combinations. The multiple first route combinations can be obtained by iterating and combining multiple second feasible route information, and the second route combination is the route combination that satisfies the constraints of the set partitioning model and has the fewest number of routes.

[0145] The purpose of the set partitioning model is to filter multiple second feasible routes to ensure that every order is delivered with the fewest possible routes, thus maximizing the load factor. The optimization objective of the set partitioning model is to minimize the number of routes; given a fixed volume of goods, fewer routes result in a higher load factor. The parameters of the set partitioning model are defined as follows:

[0146] AP: Multiple second feasible routes.

[0147] u p The decision variable is 0 or 1. It is 0 when the route p corresponding to the second feasible route information is not selected, and 1 when the route p corresponding to the second feasible route information is selected, where p∈AP.

[0148] w ip :0 / 1 constant, O for the second feasible route information p If there exists an order i, then the value is 1; otherwise, it is 0, where p∈AP and i∈O.

[0149] The objective function of the set partitioning model is shown in Equation (1), and the constraints of the set partitioning model are shown in Equations (2) and (3):

[0150]

[0151]

[0152] u p ∈{0,1}(3)

[0153] Formula (2) indicates that each order is delivered only once by one route, and Formula (3) indicates that u p It is a 0 / 1 decision variable.

[0154] After solving the model, a complete set of feasible routes is obtained. Vehicles deliver orders according to this complete set of feasible routes, achieving the optimal loading rate.

[0155] Furthermore, after obtaining the second route combination, we denote it as SP. For any complete route p, p∈SP, in the second route combination, we can obtain the following information:

[0156] startWH p / endWH p The first originating network and the last destination network of the complete route p

[0157] startTm p / endTm p The complete route p is defined as the departure time of the first originating network and the arrival time of the last destination network.

[0158] The route extension logic can guarantee that route p is within the time interval [startTm] p -ptm,startTm p There is no unloading time point; route p is within the time interval [endTm] p ,endTm p There is no point in time when unloading is not possible.

[0159] For each route p1 in the second route combination, determine whether there is a route p2 in the second route combination SP that can be connected to route p1. If there is a route p2 in the second route combination SP that can be connected to route p1, connect route p2 and route p1.

[0160] The conditions under which routes p1 and p2 can be connected include:

[0161] At this point, p2 can connect to p1, meaning a vehicle completes unloading at the last destination point of route p1 and then proceeds to the first origin point of route p2. The arrival time must be less than or equal to the latest loading time of the first origin point of route p2. For vehicle scheduling, all complete routes are tasks to be completed, and the goal of vehicle scheduling is to complete all scheduling tasks using the fewest possible number of vehicles.

[0162] For route p1, when there are multiple connectable routes p2, the best route p2 to connect to p1 can be selected based on minimizing the timeCost variable:

[0163]

[0164] Vehicle scheduling based on the second route combination after connection can optimize the load rate and the number of vehicles.

[0165] See Figure 3 In one specific embodiment, multiple second feasible routing information is generated based on multiple first feasible routing information, loading and unloading schedule information of each network point, and each order information. This may include:

[0166] S301. Based on multiple first feasible routing information, loading and unloading schedule information of each network point, and order information, the route is expanded to obtain multiple third feasible routing information.

[0167] The third feasible route information consists of routing information for completing the consolidation tasks of each order. The destination network set in the third feasible route information is an unordered set. The originating network set in the third feasible route information is an ordered set, and the order of the originating network points in the originating network set is the order in which the order information is extended into the route.

[0168] S302. Based on multiple third feasible routing information and loading and unloading schedule information of each network point, the routing is completed, and multiple second feasible routing information is obtained.

[0169] The second feasible routing information consists of routing information for completing the consolidation and distribution tasks for each order. The destination network set in the second feasible routing information is an ordered set.

[0170] See Figure 4 In one specific embodiment, route expansion is performed based on multiple first feasible routing information, loading and unloading schedule information of each network point, and each order information to obtain multiple third feasible routing information, which may include:

[0171] S401. Based on multiple first feasible routing information, loading and unloading schedule information of each network point, and order information, perform single-route expansion on multiple first feasible routing information and order information to obtain multiple expanded routing information.

[0172] Specifically, based on multiple first feasible routes, loading and unloading schedules at various network points, and order information, a single route expansion is performed on the multiple first feasible routes and the order information, including:

[0173] (1) Obtain the vehicle travel time from the current route point in the first feasible route information to the origin point in the order information.

[0174] In this embodiment of the application, the earliest departure time a of the vehicle in the first feasible routing information is... p From the current routing point n p Departure, vehicle travel time Arrive at the originating point on the order information. i Arrival time is Specifically, it is determined whether the current route point in the first feasible route information and the origin point in the order information are located in the same area. If the current route point in the first feasible route information and the origin point in the order information are located in the same area, then the vehicle travel time is... The first running time is, for example, 20 minutes; if the current route point in the first feasible route information and the origin point in the order information are not located in the same area, then the vehicle running time... This is the second running time, for example, the second running time between two branches across regions is 60 minutes.

[0175] (2) The second departure time interval is determined based on the vehicle running time, the earliest departure time of the current route point in the first feasible route information, the latest departure time of the current route point in the first feasible route information, the latest departure time of the originating point in the order information, and the loading and unloading time.

[0176] Among them, based on vehicle running time The earliest departure time 'a' of the current route point in the first feasible route information p b, the latest departure time of the current route point in the first feasible route information. p b. The latest departure time from the originating network in the order information. i The second departure time interval is determined by the loading and unloading time (ptm).

[0177] (3) Divide the second departure time interval based on the preset time scale to obtain multiple second departure times.

[0178] For example, each interval has a preset time scale Δ from the second departure time interval. Choose one time as the second departure time, and denote the set of multiple second departure times as arriveTmList.

[0179] (4) Determine multiple extended route information based on loading and unloading schedule information, loading and unloading time consumption, and multiple second departure times.

[0180] Specifically, multiple second pre-loading time intervals [at, at+ptm] corresponding to multiple second departure times 'at' are determined based on multiple second departure times 'at' and loading / unloading time durations. The second departure times 'dt' corresponding to the second pre-loading time intervals [at, at+ptm] that overlap with non-loading time periods are removed, resulting in the remaining multiple second departure times. These remaining multiple second departure times are then determined as the earliest departure time 'a' of the current routing network point for each extended routing information. p .

[0181] Because of the starting point o i If an unloadable time exists, for any arrival time 'at' in 'arriveTmList', if an unloadable time exists within the second pre-loading time interval [at, at+ptm], then that time is removed from the set. If 'arriveTmList' is not empty, meaning the number of remaining second departure times is not zero, then the order information can be expanded.

[0182] The number of second departure times remaining in arriveTmList determines the number of new routes p1 formed. The extended route information corresponding to any new route p1 formed for any arrival time at in arriveTmList is as follows:

[0183] Current routing point n p1 =o i The current routing point of route p is the originating point o of order i. i ;

[0184] Earliest departure time a p1 =at+ptm: The earliest departure time of route p1 is at+ptm;

[0185] Latest departure time b p1 =min(b i ,b p The latest departure time for route p1 is b. i and bp The minimum value;

[0186] Order set O p1 =[O p [i]: Router p1 delivers orders including O p All orders and order i;

[0187] Starting point collection Record route p1 from originating network point n p The departure time is BN p It contains the originating network points and earliest departure time that route p, corresponding to the first feasible route information, has passed through before;

[0188] Destination network set EN p1 Among them, if the destination point d in the order information i EN does not exist p In the middle, it records the destination network point d that route p1 needs to go to. i , and d i The corresponding latest arrival time e i , i.e. EN p1 =[EN p ,d i :e i If the destination point d i EN already exists p and e i Less than d i For the corresponding time, let EN p1 =EN p , update EN p1 d i The corresponding latest arrival time is e i If the destination point d i EN already exists p and e i If the time is longer, then EN p1 =EN p That's all.

[0189] Total number of items u p1 =u p +u i Update the total number of components in route p1.

[0190] Multiple extended routing information refers to routing information generated by extending multiple first feasible routes to orders that meet preset extension conditions.

[0191] In this embodiment of the application, the preset expansion conditions satisfied by the first feasible routing information and order information may include:

[0192] (1) The route p corresponding to the first feasible route information has not previously carried order i, i.e.

[0193] (2) The route p corresponding to the first feasible route information carries the goods of order i without exceeding the weight limit, i.e., u p +u i ≤Q.

[0194] (3) The set of originating points EN in the first feasible route information p Excluding order originating points. i The destination network set BN in the first feasible routing information p Excluding destination outlets for order i i .

[0195] (4) In the first feasible route information, the earliest departure time a p From n p Departure, Passing Arrival at the order originating point i Arrival time is In time interval A time interval Δ is used as the arrival time, denoted as arrivalTmList, with a preset time scale Δ. This is because the originating point is o. i If an unloadable time exists, for any arrival time *at* in *arriveTmList*, if an unloadable time exists within the time interval [*at*, *at* + *ptm*), then that time is removed from the set. If *arriveTmList* is not empty, it can be expanded to order *i*.

[0196] S402. Re-determine the extended routing information as the first feasible routing information and perform iterative route extension until the number of newly generated extended routing information is zero.

[0197] Specifically, the extended routing information is redefined into multiple first feasible routing information, that is, the extended routing information is put back into the collection newList for iterative route expansion, and S401-402 is executed multiple times to obtain new extended routing information.

[0198] In one specific embodiment, before iteratively extending the route by re-determining the extended route information as the first feasible route information until the number of newly generated extended route information is zero, the following may be included:

[0199] Remove one of any two extended routing entries that meet the preset removal conditions from a pool of extended routing entries.

[0200] In one specific implementation, after expanding route p to obtain all new routes and adding them to a collection newList, some new routes are removed from the collection newList according to the removal logic. These removed routes are those that do not need to be further expanded or saved. This is because for any removed route, there is a better route in the collection newList that dominates that route, so only the better route needs to be expanded.

[0201] Specifically, the preset removal conditions include: two extended routing information have the same current route network point; two extended routing information have the same delivery order; the earliest departure time of one extended routing information p1 is less than or equal to the earliest departure time of the other extended routing information p2; and the latest departure time of one extended routing information p1 is greater than or equal to the latest departure time of the other extended routing information p2.

[0202] When any two extended routing entries meet the preset removal conditions, it means that one of these two extended routing entries can be removed. The extended routing entry with the larger earliest departure time and the smaller latest departure time will be removed; that is, the extended routing entry p2 can be removed.

[0203] S403. Determine the routing information generated in each route extension as the third feasible routing information.

[0204] Specifically, the routing information generated each time the route is extended is placed into a collection pathList.

[0205] In this embodiment of the application, routing is completed based on multiple third feasible routing information and loading and unloading schedule information of each network point, resulting in multiple second feasible routing information.

[0206] In this embodiment of the application, the third feasible routing information includes the latest arrival times of multiple destination network points in the first destination network point set. The first destination network point set is an unordered set of destination network points.

[0207] See Figure 5 In this embodiment of the application, routing is completed based on multiple third feasible routing information and loading / unloading schedule information of each network point, resulting in multiple second feasible routing information, including:

[0208] S501. Sort the multiple destination points in the first destination point set from earliest to latest according to the latest arrival time to obtain the second destination point set.

[0209] S502. Determine the first destination point in the second destination point set as the target destination point, and remove the target destination point from the second destination point set.

[0210] S503. Determine whether the third feasible route information can reach the target destination network point.

[0211] For any route p in the set pathList, determine whether route p can reach the target network point, and then complete the route.

[0212] In a specific embodiment, determining whether the third feasible routing information can reach the target destination network includes:

[0213] (1) Obtain the earliest departure time of the current route point in the third feasible route information, the vehicle travel time from the current route point to the target destination point in the third feasible route information, and the latest arrival time of the target destination point.

[0214] In this embodiment of the application, the earliest departure time 'a' of the vehicle at the current route point in the third feasible route information is... p From the current routing point n p Departure, vehicle travel time Reach the target destination d i Earliest arrival time at the target destination Latest arrival time of the target destination e i Specifically, it determines whether the current route point and the target destination point in the third feasible route information are located in the same area. If the current route point and the target destination point in the third feasible route information are located in the same area, the vehicle travel time is the first travel time, for example, the first travel time is 20 minutes; if the current route point and the target destination point in the third feasible route information are not located in the same area, the vehicle travel time is the second travel time, for example, the second travel time between two points across areas is 60 minutes.

[0215] (2) Determine the arrival time interval based on the earliest departure time of the current route point in the third feasible route information, the vehicle travel time from the current route point in the third feasible route information to the target destination point, and the latest arrival time of the target destination point.

[0216] The arrival time interval is:

[0217] (3) Divide the arrival time interval according to the predetermined time scale to obtain multiple arrival time points.

[0218] During the arrival time interval At each predetermined time scale Δ, a moment is taken as the arrival time point, resulting in multiple arrival time points at. The set of multiple arrival time points at is denoted as the set arriveTmList.

[0219] (4) If multiple arrival times satisfy the loading and unloading schedule information, then the third feasible route information can reach the target destination network.

[0220] Specifically, multiple pre-unloading time intervals [at, at+dtm] corresponding to multiple arrival time points are determined based on multiple arrival time points *at* and loading / unloading time consumption. Arrival time points *at* corresponding to pre-unloading time intervals [at, at+dtm] that overlap with non-unloading time periods are removed, resulting in the remaining multiple arrival time points *at*. If the number of arrival time points *at* among the remaining multiple arrival time points is not zero, then there are multiple arrival time points that satisfy the loading / unloading schedule information, and the third feasible route information can reach the target destination network point. The minimum time *mat* among the remaining arrival time points *at* is used to determine the earliest departure time *a* of the current route network point in the third feasible route information. p .

[0221] Target site d i If an unloading time exists for any arrival time *at* in *arriveTmList*, then that time is removed from the set if an unloading time exists within the time interval [at, at+dtm]. If *arriveTmList* is not empty, then route *p* can reach the destination *d*. i .

[0222] Router p can reach destination network d i Branch d i The corresponding latest arrival time is e i Then update the route p corresponding to the third feasible route information using the minimum arrival time mat in arriveTmList:

[0223] For the smallest departure time mat in the set departTmList, the following route p corresponding to the third feasible route information is formed.

[0224] Current routing point n p =d i After the update, the current routing point of route p is the destination point d. i ;

[0225] Earliest departure time a p =mat+dtm: The earliest departure time of route p after the update is mat plus unloading time dtm;

[0226] b p =∞: After the update, the latest departure time of route p is set to infinity. This parameter is not needed when the route is completed.

[0227] O p The order set carried by route p remains unchanged after the update;

[0228] BN p If d iLet o be the first destination network point that route p passes through. last This indicates the last originating network point traversed by route p. Otherwise BN p Remain unchanged;

[0229] EN p :EN p After sorting, the first target point is retrieved in each loop.

[0230] u p =u p The total cargo volume of route p remains unchanged.

[0231] d for each destination network i By iterating through all the current routing points, we can obtain the destination point d for each destination. i Update information.

[0232] S504. When the third feasible route information can reach the target destination network point, iteratively update the third feasible route information to the second destination network point set to be empty.

[0233] When the third feasible route information can reach the target destination network point, repeat S501-S503 until the second destination network point set is empty.

[0234] S505. When the second destination network set is empty, the routing information obtained by updating the third feasible routing information is determined as the second feasible routing information.

[0235] If the second destination network set is empty, it means that all destination network points in the second destination network set have been extended to the third feasible routing information. At this time, the routing information obtained by updating the third feasible routing information is the routing information to complete the bulk cargo task.

[0236] Furthermore, for two second feasible routes that pass through the same network points and carry the same orders, only the second feasible route with the shorter duration is retained.

[0237] To better implement the vehicle dispatching method in the embodiments of this application, a vehicle dispatching device is also provided in the embodiments of this application, such as... Figure 6 As shown, the vehicle dispatching device 600 includes:

[0238] The acquisition unit 601 is used to acquire multiple order information and loading and unloading schedule information of each branch in each order information. The loading and unloading schedule includes at least one unloading time period and at least one unloading time period within the natural cycle.

[0239] The determining unit 602 is used to determine multiple first feasible route information corresponding to multiple order information based on multiple order information and loading and unloading schedule information of each network point;

[0240] The generation unit 603 is used to generate multiple second feasible routing information based on multiple first feasible routing information, loading and unloading schedule information of each network point and order information, wherein the second feasible routing information is the routing information for completing the collection task and the bulk task of each order.

[0241] The vehicle scheduling unit 604 is used to schedule vehicles based on multiple second feasible routing information.

[0242] Optionally, the generating unit 603 is used for:

[0243] Based on multiple first feasible routing information, loading and unloading schedule information of each network point, and each order information, the routing is expanded to obtain multiple third feasible routing information. Among them, the third feasible routing information is the routing information to complete the consolidation task of each order.

[0244] Based on multiple third feasible routing information and loading and unloading schedule information of each network point, the routing is completed, resulting in multiple second feasible routing information.

[0245] Optionally, the order information includes the order creation time, the latest departure time of the order, and the loading and unloading time; the first feasible route information includes the earliest departure time of the current route point; the determination unit 602 is used for:

[0246] The first departure time interval in the first feasible route information is determined based on the order creation time, loading and unloading time, and the latest departure time of the order.

[0247] The first departure time interval is divided based on a preset time scale to obtain multiple first departure times;

[0248] Based on loading and unloading schedule information and loading and unloading time, the earliest departure time of the current route network point is obtained from multiple first departure times.

[0249] Optionally, the generating unit 603 is used for:

[0250] Based on multiple first feasible route information, loading and unloading schedule information of each network point, and order information, the multiple first feasible route information and order information are expanded in a single route to obtain multiple expanded route information. The multiple expanded route information is the route information generated by expanding multiple first feasible routes to orders that meet preset expansion conditions.

[0251] The extended routing information is re-identified as the first feasible routing information and iteratively extended the route until the number of newly generated extended routing information is zero.

[0252] The routing information generated in each route extension is determined as the third feasible routing information.

[0253] Optionally, the generating unit 603 is used for:

[0254] Obtain the vehicle travel time from the current route point in the first feasible route information to the originating point in the order information;

[0255] The second departure time interval is determined based on the vehicle running time, the earliest departure time of the current route point in the first feasible route information, the latest departure time of the current route point in the first feasible route information, the latest departure time of the originating point in the order information, and the loading and unloading time.

[0256] The second departure time interval is divided based on a preset time scale to obtain multiple second departure times;

[0257] Multiple extended route information is determined based on loading and unloading schedule information, loading and unloading time consumption, and multiple second departure times.

[0258] Optionally, the generating unit 603 is used for:

[0259] Remove one of any two extended routing entries that meet the preset removal conditions from a pool of extended routing entries.

[0260] Optionally, the third feasible routing information includes the latest arrival times of multiple destination points in the first destination point set; the generation unit 603 is used for:

[0261] Sort the multiple destination points in the first destination point set from earliest to latest according to the latest arrival time to obtain the second destination point set;

[0262] The first destination point in the second destination point set is identified as the target destination point, and the target destination point is removed from the second destination point set.

[0263] Determine whether the third feasible route information can reach the target destination network point;

[0264] When the third feasible route information can reach the target destination network point, iteratively update the third feasible route information to the second destination network point set to empty;

[0265] When the second destination network set is empty, the routing information obtained by updating the third feasible routing information is determined as the second feasible routing information.

[0266] Optionally, the generating unit 603 is used for:

[0267] Obtain the earliest departure time of the current route point in the third feasible route information, the vehicle travel time from the current route point in the third feasible route information to the target destination point, and the latest arrival time of the target destination point;

[0268] The arrival time interval is determined based on the earliest departure time of the current route point in the third feasible route information, the vehicle travel time from the current route point in the third feasible route information to the target destination point, and the latest arrival time of the target destination point.

[0269] The arrival time interval is divided according to a predetermined time scale, resulting in multiple arrival time points;

[0270] If multiple arrival times satisfy the loading and unloading schedule information, then the third feasible route information can reach the target destination network.

[0271] This application also provides a computer device that integrates any of the vehicle dispatching devices provided in this application. The computer device includes:

[0272] One or more processors;

[0273] Memory; and

[0274] One or more applications, wherein the applications are stored in memory and configured to be executed by a processor from the steps of the vehicle scheduling method in any of the embodiments described above.

[0275] like Figure 7 As shown, it illustrates a structural schematic diagram of the computer device involved in the embodiments of this application, specifically:

[0276] The computer device may include components such as a processor 701 with one or more processing cores, a memory 702 with one or more computer-readable storage media, a power supply 703, and an input unit 704. Those skilled in the art will understand that the computer device structure shown in the figures does not constitute a limitation on the computer device, and may include more or fewer components than shown, or combine certain components, or have different component arrangements. Wherein:

[0277] Processor 701 is the control center of the computer device. It connects various parts of the computer device via various interfaces and lines, and performs various functions and processes data by running or executing software programs and / or modules stored in memory 702, and by calling data stored in memory 702, thereby providing overall monitoring of the computer device. Optionally, processor 701 may include one or more processing cores; processor 701 may be a Central Processing Unit (CPU), or other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or any conventional processor. Preferably, processor 701 may integrate an application processor and a modem processor, wherein the application processor mainly handles the operating system, user interface, and application programs, and the modem processor mainly handles wireless communication. It is understood that the aforementioned modem processor may not be integrated into processor 701.

[0278] The memory 702 can be used to store software programs and modules. The processor 701 executes various functional applications and data processing by running the software programs and modules stored in the memory 702. The memory 702 may mainly include a program storage area and a data storage area. The program storage area may store the operating system, application programs required for at least one function (such as sound playback function, image playback function, etc.), etc.; the data storage area may store data created according to the use of the computer device, etc. In addition, the memory 702 may include high-speed random access memory, and may also include non-volatile memory, such as at least one disk storage device, flash memory device, or other volatile solid-state storage device. Accordingly, the memory 702 may also include a memory controller to provide the processor 701 with access to the memory 702.

[0279] The computer device also includes a power supply 703 that supplies power to the various components. Preferably, the power supply 703 can be logically connected to the processor 701 through a power management system, thereby enabling functions such as charging, discharging, and power consumption management through the power management system. The power supply 703 may also include one or more DC or AC power supplies, recharging systems, power fault detection circuits, power converters or inverters, power status indicators, and other arbitrary components.

[0280] The computer device may also include an input unit 704, which can be used to receive input digital or character information and generate keyboard, mouse, joystick, optical or trackball signal inputs related to user settings and function control.

[0281] Although not shown, the computer device may also include a display unit, etc., which will not be described in detail here. Specifically, in this embodiment, the processor 701 in the computer device loads the executable files corresponding to the processes of one or more application programs into the memory 702 according to the following instructions, and the processor 701 runs the application programs stored in the memory 702 to realize various functions, as follows:

[0282] The system acquires multiple order information and loading / unloading schedule information for each branch within each order information. The loading / unloading schedule includes at least one non-loading time period and at least one non-unloading time period within a natural cycle. Based on the multiple order information and the loading / unloading schedule information for each branch, the system determines multiple first feasible routes corresponding to the multiple order information. Based on the multiple first feasible routes, the loading / unloading schedule information for each branch, and the order information, the system generates multiple second feasible routes, where the second feasible routes are the routes for completing the consolidation and bulk cargo tasks for each order. Vehicle scheduling is then performed based on the multiple second feasible routes.

[0283] Those skilled in the art will understand that all or part of the steps in the various methods of the above embodiments can be performed by instructions, or by instructions controlling related hardware. These instructions can be stored in a computer-readable storage medium and loaded and executed by a processor.

[0284] Therefore, embodiments of this application provide a computer-readable storage medium, which may include: read-only memory (ROM), random access memory (RAM), a magnetic disk, or an optical disk, etc. A computer program is stored thereon, which is loaded by a processor to execute the steps in any of the vehicle dispatching methods provided in embodiments of this application. For example, the computer program loaded by the processor can execute the following steps:

[0285] The system acquires multiple order information and loading / unloading schedule information for each branch within each order information. The loading / unloading schedule includes at least one non-loading time period and at least one non-unloading time period within a natural cycle. Based on the multiple order information and the loading / unloading schedule information for each branch, the system determines multiple first feasible routes corresponding to the multiple order information. Based on the multiple first feasible routes, the loading / unloading schedule information for each branch, and the order information, the system generates multiple second feasible routes, where the second feasible routes are the routes for completing the consolidation and bulk cargo tasks for each order. Vehicle scheduling is then performed based on the multiple second feasible routes.

[0286] In the above embodiments, the descriptions of each embodiment have different focuses. For parts not described in detail in a certain embodiment, please refer to the detailed descriptions of other embodiments above, which will not be repeated here.

[0287] In practice, each of the above units or structures can be implemented as an independent entity or can be arbitrarily combined to be implemented as the same or several entities. For the specific implementation of each of the above units or structures, please refer to the previous method embodiments, which will not be repeated here.

[0288] For details on the implementation of each of the above operations, please refer to the previous examples, which will not be repeated here.

[0289] The vehicle dispatching method, apparatus, computer equipment, and storage medium provided in the embodiments of this application have been described in detail above. Specific examples have been used to illustrate the principles and implementation methods of this application. The description of the above embodiments is only for the purpose of helping to understand the method and core ideas of this application. 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 this application. Therefore, the content of this specification should not be construed as a limitation of this application.

Claims

1. A vehicle dispatching method, characterized in that, The vehicle dispatching method includes: Obtain multiple order information and loading / unloading schedule information for each branch in each order information, wherein the loading / unloading schedule includes at least one non-loading time period and at least one non-unloading time period within a natural cycle; Based on multiple order information and loading and unloading schedule information of each branch, multiple first feasible routes are determined for the multiple order information; Based on the multiple first feasible routing information, the loading and unloading schedule information of each network point, and each order information, the multiple first feasible routing information and each order information are expanded in a single route to obtain multiple expanded routing information. The multiple expanded routing information is the routing information generated by expanding the multiple first feasible routes to orders that meet the preset expansion conditions. The extended routing information is redefined as the first feasible routing information and iteratively extended the route until the number of newly generated extended routing information is zero. The routing information generated by each route expansion is determined as the third feasible routing information; wherein, the third feasible routing information is the routing information for completing the consolidation task of each order; Based on multiple third feasible routing information and loading and unloading schedule information of each network point, routing is completed to obtain multiple second feasible routing information; among them, the second feasible routing information is the routing information for completing the consolidation task and the bulk cargo task of each order; Vehicle scheduling is performed based on the aforementioned multiple second feasible routing information.

2. The vehicle dispatching method according to claim 1, characterized in that, The order information includes the order creation time, the latest departure time of the order, and the loading and unloading time. The first feasible route information includes the earliest departure time of the current route point. The determination of multiple first feasible routes corresponding to multiple order information based on multiple order information and loading and unloading schedule information of each branch includes: The first departure time interval in the first feasible route information is determined based on the order creation time, the loading and unloading time, and the latest departure time of the order. The first departure time interval is divided based on a preset time scale to obtain multiple first departure times; Based on the loading and unloading schedule information and the loading and unloading time, the earliest departure time of the current route point is obtained from the plurality of first departure times.

3. The vehicle dispatching method according to claim 1, characterized in that, The method involves performing a single route expansion based on the multiple first feasible routing information, the loading and unloading schedule information of each network point, and each order information to obtain multiple expanded routing information, including: Obtain the vehicle travel time from the current route point in the first feasible route information to the originating point in the order information; The second departure time interval is determined based on the vehicle running time, the earliest departure time of the current route point in the first feasible route information, the latest departure time of the current route point in the first feasible route information, the latest departure time of the originating point in the order information, and the loading and unloading time. The second departure time interval is divided based on a preset time scale to obtain multiple second departure times; Multiple extended route information is determined based on the loading and unloading schedule information, the loading and unloading time, and the multiple second departure times.

4. The vehicle dispatching method according to claim 1, characterized in that, The step of re-determining the extended routing information as the first feasible routing information and iteratively extending the route until the number of newly generated extended routing information is zero includes: Remove one of any two extended routing information that meets the preset removal conditions from the plurality of extended routing information.

5. The vehicle dispatching method according to claim 1, characterized in that, The third feasible routing information includes the latest arrival times of multiple destination points in the first set of destination points; The routing process, based on multiple third feasible routing information and loading / unloading schedule information of each network point, is completed, resulting in multiple second feasible routing information, including: Sort the multiple destination points in the first destination point set from earliest to latest according to the latest arrival time to obtain the second destination point set; The first destination point in the second destination point set is identified as the target destination point, and the target destination point is removed from the second destination point set. Determine whether the third feasible route information can reach the target destination network point; When the third feasible route information can reach the target destination network point, the third feasible route information is iteratively updated until the second destination network point set is empty; The routing information obtained by updating the third feasible routing information when the second destination network set is empty is determined as the second feasible routing information.

6. The vehicle dispatching method according to claim 5, characterized in that, The step of determining whether the third feasible routing information can reach the target destination network includes: Obtain the earliest departure time of the current route point in the third feasible route information, the vehicle travel time from the current route point in the third feasible route information to the target destination point, and the latest arrival time of the target destination point; The arrival time interval is determined based on the earliest departure time of the current route point in the third feasible route information, the vehicle travel time from the current route point in the third feasible route information to the target destination point, and the latest arrival time of the target destination point. The arrival time interval is divided according to a predetermined time scale to obtain multiple arrival time points; If any of the multiple arrival times satisfy the loading and unloading schedule information, then the third feasible route information is determined to reach the target destination network.

7. A vehicle dispatching device, characterized in that, The vehicle dispatching device includes: The acquisition unit is used to acquire multiple order information and loading and unloading schedule information of each branch in each order information. The loading and unloading schedule includes at least one non-loading time period and at least one non-unloading time period within a natural cycle. The determining unit is used to determine multiple first feasible routes corresponding to multiple order information based on multiple order information and loading and unloading schedule information of each network point; The generation unit is configured to perform a single-step route expansion based on the multiple first feasible route information, the loading and unloading schedule information of each network point, and each order information to obtain multiple expanded route information. The multiple expanded route information is generated by expanding the multiple first feasible routes to orders that meet preset expansion conditions. The unit then re-determines the expanded route information as the first feasible route information and iteratively expands the route until the number of newly generated expanded route information is zero. Each route expansion generates a route information as third feasible route information, where the third feasible route information is the route information for completing the consolidation task of each order. Finally, based on the multiple third feasible route information and the loading and unloading schedule information of each network point, the unit performs route completion to obtain multiple second feasible route information. The second feasible route information is the route information for completing the consolidation task and the bulk cargo task of each order. The vehicle scheduling unit is used to schedule vehicles based on the plurality of second feasible routing information.

8. A computer device, characterized in that, The computer device includes: One or more processors; Memory; and One or more applications, wherein the one or more applications are stored in the memory and configured to be executed by the processor to implement the vehicle scheduling method of any one of claims 1 to 6.

9. A computer-readable storage medium, characterized in that, It stores a computer program, which is loaded by a processor to execute the steps of the vehicle dispatching method according to any one of claims 1 to 6.

Images