CN112308267B

CN112308267B - Route group determination method, device, network equipment and storage medium

Info

Publication number: CN112308267B
Application number: CN201910689091.7A
Authority: CN
Inventors: 张骞丹; 黄一潇; 李珂; 朱光远; 雷紫霖
Original assignee: SF Technology Co Ltd
Current assignee: SF Technology Co Ltd
Priority date: 2019-07-29
Filing date: 2019-07-29
Publication date: 2022-10-21
Anticipated expiration: 2039-07-29
Also published as: CN112308267A

Abstract

The embodiment of the application discloses a method, a device, network equipment and a storage medium for determining a routing group, which can obtain a task corresponding to an express to be dispatched to obtain a task group; allocating an initial route for each task to obtain a first task route group; adjusting each initial route in the first task route group respectively to obtain a second task route group; screening out task pairs with similar routes from the task group, and determining whether the task pairs have coincident sub-routes; if the task routing group exists, the corresponding routing of the screened task pair is adjusted in the second task routing group according to the coincident sub-routing and the objective function, and a third task routing group is obtained; and determining a target task routing group according to the first task routing group, the second task routing group and the third task routing group. According to the scheme, the initial route is directly distributed to each task from the routing network, and is optimized according to the objective function, so that the transportation cost of the express mail can be reduced.

Description

Route group determining method, device, network equipment and storage medium

Technical Field

The present application relates to the field of logistics technologies, and in particular, to a method, an apparatus, a network device, and a storage medium for determining a route group.

Background

At present, the transportation of express items in the same city in many cities is from a connection point to a network point, then the express items are sent to a corresponding transfer station for transfer, and the process is a flow from a connection network to a large network, and then the express items return to the connection network.

All the express items in the same city need to be transferred to a specified transfer station, and some express items which can be directly transferred or transferred at other network points also need to be transferred to the transfer station, so that the transportation cost is high.

Disclosure of Invention

The embodiment of the application provides a method and a device for determining a route group, network equipment and a storage medium, which can reduce the transportation cost of express mails.

In a first aspect, an embodiment of the present application provides a method for determining a route group, including:

acquiring a task corresponding to an express to be dispatched to obtain a task group;

distributing an initial route for each task in the task group in a preset routing network to obtain a first task routing group;

adjusting each initial route in the first task route group respectively according to a preset objective function to obtain a second task route group;

screening out task pairs with similar routes from the task group, and determining whether the screened task pairs have coincident sub-routes from the routing network;

if yes, adjusting the route corresponding to the screened task pair in the second task routing group according to the coincident sub-route and the objective function to obtain a third task routing group;

and determining a target task routing group of the task group according to the first task routing group, the second task routing group and the third task routing group.

In a second aspect, an embodiment of the present application further provides a routing group determining apparatus, including:

the acquisition unit is used for acquiring a task corresponding to the express to be dispatched to obtain a task group;

the distribution unit is used for distributing an initial route for each task in the task group in a preset routing network to obtain a first task routing group;

the first adjusting unit is used for respectively adjusting each initial route in the first task route group according to a preset target function to obtain a second task route group;

the first determining unit is used for screening out task pairs with similar routes from the task group and determining whether the screened task pairs have coincident sub-routes from the routing network;

a second adjusting unit, configured to, when a duplicate routing exists in a task pair, adjust, in the second task routing group, a routing corresponding to the screened task pair according to the duplicate routing and the objective function, to obtain a third task routing group;

a second determining unit, configured to determine a target task route group of the task group according to the first task route group, the second task route group, and the third task route group.

In some embodiments, the allocation unit is specifically configured to:

determining a feasible route for each task in the task group in the routing network;

randomly distributing an initial route for each task in the feasible routes to obtain the first task route group;

in some embodiments, the allocation unit is further specifically configured to:

acquiring the straight-hair time of each task in the express task group;

and allocating an initial route for each task from the feasible routes according to the size of the hair-straightening time length.

In some embodiments, the apparatus further comprises a third determining unit:

the third determining unit is configured to determine whether the first task routing group needs to be improved according to the objective function;

at this time, the first adjusting unit is specifically configured to:

and if the first task routing group needs to be improved, respectively adjusting each initial routing in the first task routing group according to the objective function to obtain the second task routing group.

In some embodiments, the second determining unit is specifically configured to:

and if the second task routing group and the third task routing group are not improved relative to the first task routing group, determining the third task routing group as the target task routing group.

In some embodiments, the second determining unit is further specifically configured to:

if the second task routing group and/or the third task routing group are improved relative to the first task routing group, determining a sub-route with the minimum number of tasks in the third task routing group;

reallocating routes for the tasks corresponding to the sub-routes with the least number of related tasks to obtain a fourth task route group;

and determining the target task routing group according to the fourth task routing group and the target function.

according to the objective function, each route in the fourth task route group is adjusted respectively to obtain a fifth task route group;

if yes, adjusting the corresponding route of the screened task pair in the fifth task route group according to the coincident sub-route and the objective function to obtain a sixth task route group;

and determining the target task routing group according to the fourth task routing group, the fifth task routing group and the sixth task routing group.

In some embodiments, the first adjusting unit is specifically configured to:

adjusting each initial route in the first task route group respectively to obtain a first task route group after adjustment;

and determining the second task routing group according to the adjusted objective function of the first task routing group and the objective function of the first task routing group.

In some embodiments, the second adjusting unit is specifically configured to:

adjusting the route corresponding to the task pair according to the coincident sub-route to obtain an adjusted second task route group;

and determining the third task routing group according to the adjusted objective function of the second task routing group and the objective function of the second task routing group.

In a third aspect, an embodiment of the present application further provides a network device, including a memory and a processor, where the memory stores a computer program, and the processor executes, when calling the computer program in the memory, any one of the steps in the route group determination method provided in the embodiment of the present application.

In a fourth aspect, an embodiment of the present application further provides a storage medium, where the storage medium stores a plurality of instructions, and the instructions are suitable for being loaded by a processor to perform steps in any one of the route group determination methods provided in the embodiments of the present application.

In the embodiment of the application, a route determining device obtains a task corresponding to an express to be dispatched to obtain a task group; allocating an initial route for each task in the task group in a preset routing network to obtain a first task routing group; then, according to a preset objective function, adjusting each initial route in the first task route group respectively to obtain a second task route group; screening out task pairs with similar routes from the task group, and determining whether the screened task pairs have coincident sub-routes from the routing network; if yes, then adjusting the corresponding route of the screened task pair in the second task route group according to the coincident sub-route and the objective function to obtain a third task route group; and finally, determining a target task routing group according to the first task routing group, the second task routing group and the third task routing group. According to the scheme, a special transition is not required to be set for the express, the initial route is directly distributed to each task from the routing network, the initial route is optimized according to the objective function, and the transportation cost of the express can be reduced.

Drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.

Fig. 1 is a schematic flowchart of a route group determining method according to an embodiment of the present application;

fig. 2 is another schematic flow chart of a route group determining method according to an embodiment of the present application;

fig. 3 is a schematic structural diagram of a route group determining apparatus according to an embodiment of the present application;

fig. 4 is another schematic structural diagram of a route group determining apparatus provided in an embodiment of the present application;

fig. 5 is a schematic structural diagram of a network device according to an embodiment of the present application.

Detailed Description

The technical solutions in the embodiments of the present application will be described clearly and completely with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only some embodiments of the present application, and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.

In the description that follows, specific embodiments of the present application will be described with reference to steps and symbols executed by one or more computers, unless otherwise indicated. Accordingly, these steps and operations will be referred to, several times, as being performed by a computer, the computer performing operations involving a processing unit of the computer in electronic signals representing data in a structured form. This action transforms the data or maintains it at locations in the computer's memory system, which may be reconfigured or otherwise altered in a manner well known to those skilled in the art. The data maintains a data structure that is a physical location of the memory that has particular characteristics defined by the data format. However, while the principles of the application have been described in language specific to above, it is not intended to be limited to the specific form set forth herein, and it will be recognized by those of ordinary skill in the art that various of the steps and operations described below may be implemented in hardware.

The principles of the present application may be employed in numerous other general-purpose or special-purpose computing, communication environments or configurations. Examples of well known computing systems, environments, and configurations that may be suitable for use with the application include, but are not limited to, hand-held telephones, personal computers, servers, multiprocessor systems, microcomputer-based systems, mainframe-based computers, and distributed computing environments that include any of the above systems or devices.

The terms "first", "second", and "third", etc. in this application are used to distinguish between different objects and not to describe a particular order. Furthermore, the terms "include" and "have," as well as any variations thereof, are intended to cover non-exclusive inclusions.

The method for determining the routing group in the embodiment of the application can be used in a same-city express delivery scene, because the amount of express items flowing to one task (shift) in each flow of the same-city express items is not very large, in order to reduce the cost of a high-speed network, express items in different flow directions need to be converged as much as possible (for example, the express items from a to B and the express items from B to C are directly sent, the express items from a to C can be multiplexed with the routes of the previous two tasks on the premise of meeting a time window, so that the convergence of the express items is realized), a routing group determination device (a relay routing model) is needed, a set route is selected for each task in an original task group, the relay is possible to be directly sent, the flow directions are converged, a new task group is formed, and tasks in the new task group are converged, so that the number of the tasks in the new task group is less than that of the tasks in the old task group.

Wherein, the definition of straight hair in this application is: one task from a to B, is transported using only one vehicle.

The first order transit is defined as: a task from A to B goes to C for transfer, and the other vehicle arrives at B point, and the route is as follows: a → B → C.

The definition of the second order transit is: a task from A to B goes to the C point for transfer and then to the D point for transfer, and the route is as follows: a → C → D → B.

Referring to fig. 1, fig. 1 is a schematic flowchart illustrating a method for determining a route group according to an embodiment of the present disclosure. The execution main body of the route group determining method may be the route group determining device provided in the embodiment of the present application, or a terminal or a server integrated with the route group determining device, where the route group determining device may be implemented in a hardware or software manner, and the terminal may be a desktop computer, a smart phone, a tablet computer, a palm computer, or a notebook computer, etc. The route group determination method may include:

101. and acquiring a task corresponding to the express to be dispatched to obtain a task group.

The tasks in this embodiment include a time window, a task start point, a task end point, and a dispatch volume, where the time window includes a task start time and a task end time, and a route of each task in the task group defaults to a direct route from a start point network point of the task to an end point network point of the task, and a route of the task in the task group needs to be improved subsequently.

The task group obtained in the embodiment of the application comprises a plurality of tasks, each task in the task group is independent at first, is transported independently, has no association relation with other tasks, and can be called as an original task group or an old task group.

In some embodiments, the tasks in the task group are only tasks that are partially stripped from the routing of the large network, such as tasks received from 8 am to 14 pm of the day and requiring arrival on the day.

102. And allocating an initial route for each task in the task group in a preset routing network to obtain a first task routing group.

In some embodiments, all feasible routes are first found for each task in the routing network for the tasks in the old task group.

Specifically, according to different set parameters, all routes meeting time window limitation and parameter input limitation are found for the tasks in each old task group in a routing network; the route is composed of one or more arcs, each task can correspond to a plurality of routes, and the route can be straight (only one arc is contained in the route) and can be transit (a plurality of driving arcs and stopping arcs are contained in the route).

A first task routing group (i.e., an initial task routing group) of the task groups is then constructed according to the following two methods:

a. and (3) random construction: i.e. each task is randomly assigned an initial route among the feasible routes.

b. A greedy algorithm (Best-fit) acquires the straight-sending time length of each task in the express mail task group; and then allocating an initial route for each task from the feasible routes according to the size of the straight-forward time length.

The first task route group in the present application includes a route corresponding to each task, and the route may include a direct route and a relay route.

For example, the tasks in the old task group are sorted from small to large according to the hair straightening time length, the first one third of the tasks select a hair straightening route which can enable the target function score to be the best, and the second two thirds of the tasks select any route which enables the target function score to be the best. This allows the following task to try to reuse the arcs that have been generated by the previous task.

In some embodiments, before assigning an initial route to each task in the task group in a preset routing network, it is further required to construct a routing network, wherein the routing network is composed of points (nodes) and ARCs (ARCs), wherein the points are mesh points (distribution points) with sorting capability.

Herein, an arc in the present application may also be referred to as a sub-route.

In this embodiment, the point includes two attributes: the name of the spot and the time at which the spot was located, e.g., "755a,720", identifies 755A the status of the spot (e.g., the in-out status of the spot) at 720 minutes (i.e., 12 noon).

In this embodiment, the arc includes three attributes: the starting point, the ending point (i.e. two points connecting the arc) corresponding to the arc and the edge attribute (whether it is a staying edge or a driving edge) of the arc, if it is a staying edge, the mesh points of the starting point and the ending point of the arc are the same point, but the time of the two mesh points is different, for example, the mesh points on the two sides of the staying edge are respectively "755a,740" and "755a,760", so that the staying time length of the staying edge can be calculated as: 740-720=20 minutes; if it is a driving edge, the difference between the time of the originating node and the time of the terminating node for the arc should be rounded up by a multiple of the degree of time discretization (e.g., 10 minutes). (if the travel time from A to B is 47 minutes, the length of the arc is 50 minutes under the condition that the discretization degree is 10 minutes, and if the time of A is 720 minutes, the time of B is 770 minutes).

It should be noted that, in some embodiments, in order to meet different requirements of different cities for services, some adjustable parameters (setting parameters) may be designed to better adapt to different city scenarios, where the parameters may include:

a. degree of time discretization: slicing a period of complete time according to the discretization degree, wherein the higher the discretization degree is, the higher the complexity of calculation of a route group determining device (a transit route model) is, and the larger the optimization space is.

b. Duration (minutes) that a task may delay departure: each task has the most waiting time at the beginning, and the longer the time, the more routes the task can select and the higher the complexity.

c. Number of selectable transit points per task: the number of the transfer points which can be selected by each task is n points which are nearest to the starting point in a first-order transfer scene; in the second-order relay scenario, the first relay point of each task may be selected from the n points closest to the start point, and the second relay point may be selected from the n points closest to the end point. The larger n, the more routes each task can select, and the higher the model computation complexity.

d. The proportion of the transfer piece amount to the total piece amount is as follows: in consideration of the timeliness and the landing property, the transfer component amount should be controlled within a certain range. The lower the ratio here, the higher the cost.

e. Two points where the travel distance is less than a certain value are calculated to be close: used for judging and identifying adjacent task pairs in the old task group, and then modifying the route of the task pairs simultaneously in the stage of compounding the improved solution.

It should be noted that the objective function in the present application is to determine whether to accept a new solution by determining whether to accept the new solution or not when improving the solution (i.e. improving the task routing group). Also, the objective function is not a value, but a set of hierarchical, numerical values that measure aspects of the solution, where higher-ranked scores are prioritized.

The objective function considered in this application mainly includes the following four aspects, where a and b are hard constraints (i.e. conditions that must be satisfied by the task routing group), and c and d are soft constraints:

a. the sum of transfer quantity overrun in each point is as follows: all network points in the preset routing network have an upper limit of the sorting quantity, such as 4000 tickets for the sorting quantity on the day of the network point A, 3000 tickets for the sorting quantity on the day of the network point B, and the like. To ensure that the model results are viable, this score is a hard constraint and the sum of the transfer volume overruns must be 0 (i.e., each involved dot must not be allowed to overrun).

b. The proportion of the transfer piece quantity to the total piece quantity is as follows: the proportion of the elements (whether first-order transfer or second-order transfer) with transfer operation to the total elements. To ensure that the solution is feasible, this is a hard constraint and cannot exceed a preset proportion. If the preset proportion is 50%, the proportion of the transfer piece quantity in the total piece quantity cannot exceed 50%.

c. In the new task group, the number of vehicles needed on each arc x the sum of the mileage of the arc: the solution needs to be minimized in the process of improving the solution, which is soft constraint.

d. In the new task group, all arcs exceed the sum of the net point in-out vehicle limits: in order to ensure the landing property, the scheme needs to ensure that each network point cannot enter and exit a plurality of vehicles at the same time to a certain extent, and the expression form of the constraint is the limitation of the number of vehicle entering and exiting times in unit time (for example, 2 vehicles enter and exit 1 vehicle within ten minutes); if a certain network point enters 3 vehicles (more than 1 vehicle at the moment) and exits 3 vehicles (more than 2 vehicles at the moment) in ten minutes, the constraint is broken, and the total exceeding constraint count is: 1+2=3. This count term is summed over all ten minute periods of all dots. This is a soft constraint and should be kept as small as possible in improving the solution.

In some embodiments, after assigning an initial route to each task in the task group in the preset routing network, obtaining a first task routing group, the method further includes: a determination is made as to whether the first task route group requires improvement based on the objective function, e.g., when the first task route group does not meet the hard constraints of the objective function, the first task route group is improved.

103. And respectively adjusting each initial route in the first task route group according to a preset objective function to obtain a second task route group.

After the first task routing group is obtained, the task group is improved, firstly, greedy improvement of a single task is performed on the task routing group, namely, each initial route in the first task routing group is adjusted respectively, and then a second task routing group is obtained, which specifically includes:

and under the condition of keeping the routes of other tasks unchanged, changing the route of a single task in the first task route group, if the objective function can be improved to a certain extent, updating the route of the task, and if the objective function is not improved, keeping the original route. And performing single task improvement on all tasks in the first task routing group, and regarding the improvement as a cycle to obtain a second task routing group.

When the route of a single task (current task) in the first task route group is changed, the objective functions respectively corresponding to all the selectable routes corresponding to the current task are respectively calculated, and then the selectable route with the best objective function is determined as the updated route of the current task.

And the second task routing group is a task routing group which is improved by a single task based on the first task routing group.

104. And screening out task pairs with similar routes from the task group, and determining whether the screened task pairs have coincident sub-routes from the routing network.

In this embodiment, the two tasks with similar routes have two meanings, namely, the starting point mesh point is the same, and the end point mesh point is closer; and the other is that the mesh points at the starting points are close in distance, and the mesh points at the end points are the same. It is necessary to define a threshold coefficient close to each other in advance, that is, two dots whose travel time is less than this coefficient (for example, 5 km) are regarded as close to each other.

Specifically, if two tasks 1 and 2 are defined as a task pair with close distance, all solution spaces (namely, routings) of the two tasks are traversed in a nested manner, and if a route a belongs to the task 1 and a route b belongs to the task 2, and the route a and the route b have coincident driving edges, it is indicated that a coincident sub-route exists in the task pair.

105. If the selected task pair exists, the corresponding route of the selected task pair is adjusted in the second task route group according to the coincident sub-route and the objective function, and a third task route group is obtained.

Namely, the improved solution is compounded for two tasks which are closer: and when a coincident sub-route (driving edge) exists, adjusting the route corresponding to the screened task pair in the second task route group according to the coincident sub-route and the objective function to obtain a third task route group.

If the screened task pair is determined to have no coincident sub-route in the routing network, the step is skipped, and the first task routing group is determined to be a third task routing group.

Specifically, if a route a belongs to a task 1 and a route b belongs to a task 2, and the route a and the route b have overlapped driving edges, the route a is assigned to the task 1, the route b is assigned to the task 2, the task 1 and the task 2 have a common driving edge, whether the objective function is improved or not is calculated, if yes, the route a and the route b are adopted, and if not, the two tasks are connected back to the original route.

And finding out all task pairs with similar distances, performing a round of composite improvement on the task pairs, regarding as a cycle, and obtaining a third task routing group after all the task pairs are cycled.

Since the embodiment performs the integration processing on all the task pairs with similar routes in the third task route group (i.e. integrates the task pairs with the common sub-routes under the condition that the objective function is improved), in general, the tasks in the third task route group are fewer than the tasks in the task group (because the tasks are merged), so that the loading rate of the vehicle can be improved, and the cost for constructing the route network can be effectively reduced.

106. And determining a target task routing group of the task group according to the first task routing group, the second task routing group and the third task routing group.

In this embodiment, if the second task routing group and the third task routing group are not improved with respect to the first task routing group, the search may be ended, and the third task routing group may be determined as the target task routing group (since the first task router, the second task routing group, and the third task routing group are not different, the first task routing group or the second task routing group may also be determined as the target task routing group). The reasonable route is planned for each task in the target task routing group, and as the tasks in the target task routing group are fused (such as a supply arc), the number of the tasks in the target task routing group is less than that of the tasks in an old task group, so that the loading rate of vehicles can be improved and the number of transport vehicles can be reduced during subsequent express delivery, and the transport cost of the express can be reduced.

If the second task routing group and/or the third task routing group are/is improved relative to the first task routing group, it is necessary to perform destruction and repair processing (Destroy-and-repair) on the third task routing group, and at this time, it is necessary to determine a sub-route related to the minimum number of tasks in the third task routing group (where, if there are sub-routes related to the same number of tasks, it is determined that the sub-route related to the minimum number of express items is the minimum number of tasks); then, the route is redistributed for the task corresponding to the sub-route with the minimum number of related tasks (or express mails) to obtain a fourth task route group; and determining a target task routing group according to the fourth task routing group and the target function.

The decision-and-repair in the application may cause the score of the objective function to be poor, but as an operation of jumping out a local optimum, the solution quality can be retreated to a certain extent for better improvement of the solution.

It should be noted that the present application executes Destroy-and-repair on the task route group under the condition of meeting the hard constraint of the objective function.

Determining a target task routing group according to the fourth task routing group and the target function, including: according to the objective function, each route in the fourth task route group is adjusted respectively to obtain a fifth task route group; screening out task pairs with similar routes from the task group, and determining whether the screened task pairs have coincident sub-routes from a routing network; if yes, adjusting the corresponding route of the screened task pair in the fifth task route group according to the coincident sub-route and the objective function to obtain a sixth task route group; and determining a target task routing group according to the fourth task routing group, the fifth task routing group and the sixth task routing group.

The step of determining the target task route group according to the fourth task route group, the fifth task route group, and the sixth task route group is similar to the step of determining the target task route group according to the first task route group, the second task route group, and the third task route group, and details are not repeated here.

The judgment of the algorithm ending is as follows: whether optimization of an algorithm (task routing group) needs to be finished or not is determined through judging whether an objective function is improved or not, after one round of single task greedy improvement, the solution does not have any change after two tasks close to each other are compositely improved, searching can be finished, and a new task group is output and comprises the routing of each task.

If the solution is improved after one round of single task greedy improvement and two tasks with close distances are subjected to composite improvement, the step Destroy-and-repair is executed again, the task routing group after the Destroy-and-repair is subjected to one round of single task greedy improvement, whether a better local optimal result can be obtained or not is judged through the two tasks with close distances, the search is not finished until the solution does not have any change after the two tasks with close distances are subjected to composite improvement, and the target task routing group is output.

In some embodiments, a corresponding relationship between the target task routing group and the old task group is also output, for example, each sub-route in the target task routing group is associated with which task in the old task group, and this data may be output to a user for comparison between the two task groups, so as to more intuitively reflect the advantages of the target task routing group.

In the embodiment of the application, a route determining device obtains a task corresponding to an express to be dispatched to obtain a task group; allocating an initial route to each task in the task group in a preset routing network to obtain a first task routing group; then, according to a preset objective function, adjusting each initial route in the first task route group respectively to obtain a second task route group; screening out task pairs with similar routes from the task group, and determining whether the screened task pairs have coincident sub-routes from the routing network; if yes, then adjusting the corresponding route of the screened task pair in the second task route group according to the coincident sub-route and the objective function to obtain a third task route group; and finally, determining a target task routing group according to the first task routing group, the second task routing group and the third task routing group. According to the scheme, a special transition is not required to be set for the express, the initial route is directly distributed for each task from the routing network, the initial route is optimized according to the objective function, the number of tasks in the task group is reduced, the express can be transported by using fewer vehicles in the follow-up process, and then the transportation cost of the express can be reduced.

In addition, each network point in the embodiment can set the transfer quantity of the network points capable of being sorted on the same day according to different sites, so that the possibility of bin explosion of certain network points after falling to the ground in sorting is effectively avoided.

In addition, the proportion of the upper limit of the transfer quantity can be integrally set, the parameter can be understood as a balance item between cost and execution, the more the transfer quantity is, the lower the total cost of the network is, and the parameters can be respectively designed according to different scenes of different cities.

The route group determination method described in the above embodiment will be described in further detail below.

Referring to fig. 2, fig. 2 is another schematic flow chart of a route group determining method according to an embodiment of the present disclosure. The route group determining method may be applied to a network device, which may be a server, as shown in fig. 2, and the flow of the route group determining method may be as follows:

201. a routing network is constructed that includes points and arcs.

In this embodiment, the routing network is composed of points and arcs, where a point is a mesh point with sorting capability, two sides of an arc are respectively connected to an originating mesh point and a terminating mesh point corresponding to the arc, the arc is divided into a retained side and a driving side, if the arc is a retained side, the mesh points of the originating mesh point and the terminating mesh point in the arc are the same mesh point, but the time of the two mesh points is different, for example, the mesh points on two sides of the retained side are "755a,740" and "755a,760", and thus the retention time of the retained side can be calculated as follows: 740-720=20 minutes; if it is a driving edge, the difference between the time of the originating node and the time of the terminating node for the arc should be rounded up by a multiple of the degree of time discretization (e.g., 10 minutes).

202. An initial solution is constructed for the tasks in the old task group.

The task group comprises a plurality of tasks, and each task comprises a time window, a task starting point, a task ending point and an express quantity.

Before constructing an initial solution for the tasks in the old task group, feasible routes need to be found in the routing network for the tasks in the old task group.

Specifically, according to different set parameters, all routes meeting time window limitation and parameter input limitation are found for the tasks in each old task group in a routing network; the route is formed by one or more arcs, each task can correspond to a plurality of routes, and possible forwarding can be directly realized.

The present application may construct an initial solution according to two schemes:

a. and (3) random construction: that is, an initial route is randomly allocated to each task in the feasible routes, and an initial solution of the old task group is obtained.

best-fit: acquiring the straight-sending time length of each task in the old task group; and then distributing an initial route for each task from the feasible routes according to the size of the straight-forward time length to obtain an initial solution of the old task group.

For example, the tasks in the old task group are sorted from small to large according to the hair straightening time length, the first third of the tasks select a hair straightening route which can enable the best score of the objective function, and the second third of the tasks select any route (which can comprise hair straightening and transfer) which enables the best score of the objective function. This allows the following task to try to reuse the arcs that have been generated by the previous task.

203. It is determined whether the initial solution is to be improved, if so, step 204 is performed, and if not, step 208 is performed.

In some embodiments, the initial solution is refined when it does not conform to the hard constraints of the objective function, otherwise, the algorithm is ended, outputting the initial solution as a new task group.

204. A single task greedy improves the solution.

After the initial solution is determined to be improved, firstly, greedy improvement of a single task is performed on the initial solution, that is, each initial route in the initial solution is adjusted respectively, and then a second task route group is obtained, which specifically includes:

and under the condition of keeping the routes of other tasks unchanged, changing the route of a single task in the initial solution, if the target function can be improved to a certain extent, updating the route of the task, and if the target function is not improved, keeping the original route. And performing one-time single task improvement on all tasks in the initial solution, and regarding the single task improvement as one-time circulation to obtain a solution subjected to single task greedy improvement.

When the route of a single task (current task) in the initial solution is changed, the objective functions corresponding to all selectable routes corresponding to the current task are calculated respectively, then the best selectable route of the objective function is determined as the updated route of the current task, whether the current task is adopted for updating is determined according to whether the objective function of the solution after updating the route is optimized, if the current task is optimized, the current task is adopted, and if the current task is not optimized, the original route is kept.

205. Two closely spaced tasks compound the improved solution.

After a single task greedy improvement solution is performed on a task group, two task composite improvement solutions which are closer to each other are performed, specifically:

firstly, determining tasks with close distances in a task group according to a starting point network point and an end point network point of the tasks in the task group, then determining whether two tasks have routes with coincident arcs in selectable routes respectively corresponding to the tasks with close distances, if so, respectively endowing the routes with the coincident arcs of the two tasks with close distances to the two tasks with close distances, and determining a composite improved solution of the two tasks with close distances according to an objective function.

Specifically, if two tasks 1 and 2 are defined as a pair of tasks with close distances, all solution spaces (namely routing) of the two tasks are traversed in a nested mode, and if a route a belongs to the task 1 and a route b belongs to the task 2, and the route a and the route b have overlapped driving edges, the task pair has overlapped arcs. And at the moment, assigning the route a to the task 1, assigning the route b to the task 2, wherein the task 1 and the task 2 have a common driving edge, calculating whether the objective function is promoted, if so, adopting the route a and the route b, and if not, returning the two tasks to the original route.

206. And judging whether the algorithm is terminated, if so, executing step 208, and if not, executing step 207.

In this embodiment, if the solutions in step 204 and step 205 are not improved (i.e. the objective function is not improved), the algorithm is ended and the task group is output, and if the solutions are improved, step 207 is executed.

207. The arc with the least number of involved tasks is determined and the routing is re-selected for the task involved by the arc and the steps 204 to 206 are executed back.

The method comprises the steps of performing Destroy-and-repair operation on the task group formed above, specifically, determining an arc involving the least number of tasks in the task group formed above, then destroying the arc, and rerouting all the tasks involved in the arc. I.e. breaking an arc and reforming a new task group, this step may lead to better locally optimal results.

In some embodiments, when there is more than one arc with the least number of tasks, an arc related to the least number of express mails is determined from the arcs with the least number of tasks, and a route is reselected for the task related to the arc.

And then putting the task group which passes through the Destroy-and-repair into the step 204 again, executing the step 205 again, ending the algorithm until the step 206 judges to terminate the algorithm, and otherwise, circularly executing the step 207, the step 204, the step 205 and the step 206.

208. And finishing the algorithm and outputting the task group.

In this embodiment, after a round of single task greedy improvement, the solution does not change after two tasks with close distances are compositely improved, that is, the search may be ended, and a new task group may be output, where the new task group includes a route of each task, and is actually a better route group corresponding to each task in the old task group.

In some embodiments, the correspondence between the new task group and the old task group is also output, for example, each arc in the new task group is associated with which task in the old task group, and this data may be output to a user for comparison between the two task groups, so as to more intuitively reflect the advantages of the new task group (which may be understood as comparison between routing groups corresponding to tasks, where the routing of tasks in the old task group is by default through).

According to the scheme in the embodiment, the tasks in the old task group can be converged in the new task group, the vehicle loading rate can be improved, and the cost for building a high-speed network is effectively reduced.

In order to better implement the method for determining a routing group provided in the embodiment of the present application, an embodiment of the present application further provides a device based on the method for determining a routing group. The meaning of the noun is the same as that in the above route group determination method, and details of the specific implementation may refer to the description in the method embodiment, which is not described herein again.

Referring to fig. 3, fig. 3 is a schematic structural diagram of a routing group determining apparatus according to an embodiment of the present disclosure, where the routing group determining apparatus 300 may include an obtaining unit 301, a distributing unit 302, a first adjusting unit 303, a first determining unit 304, a second adjusting unit 305, a second determining unit 306, and the like, where:

an obtaining unit 301, configured to obtain a task corresponding to an express to be dispatched, to obtain a task group;

an allocating unit 302, configured to allocate an initial route to each task in the task group in a preset routing network, to obtain a first task route group;

a first adjusting unit 303, configured to adjust each initial route in the first task route group according to a preset objective function, to obtain a second task route group;

a first determining unit 304, configured to screen out task pairs with similar routes from the task group, and determine whether there is a coincident sub-route in the screened task pairs from the routing network;

a second adjusting unit 305, configured to, when a coincident sub-route exists in a task pair, adjust, in the second task route group, a route corresponding to the screened task pair according to the coincident sub-route and the objective function, so as to obtain a third task route group;

a second determining unit 306, configured to determine a target task route group of the task group according to the first task route group, the second task route group, and the third task route group.

In some embodiments, the assignment unit 302 is specifically configured to:

in some embodiments, the assignment unit 302 is further specifically configured to:

acquiring the hair straightening time of each task in the express mail task group;

and allocating an initial route for each task from the feasible routes according to the size of the hair straightening time.

Referring to fig. 4, in some embodiments, the apparatus further includes a third determining unit 307:

at this time, the first adjusting unit 303 is specifically configured to:

and if the first task routing group needs to be improved, respectively adjusting each initial routing in the first task routing group according to the objective function to obtain a second task routing group.

In some embodiments, the second determining unit 305 is specifically configured to:

In some embodiments, the second determining unit 305 is further specifically configured to:

redistributing the route for the task corresponding to the sub-route with the minimum number of related tasks to obtain a fourth task route group;

In some embodiments, the first adjusting unit 303 is specifically configured to:

In some embodiments, the second adjusting unit 305 is specifically configured to:

In the embodiment of the application, the obtaining unit 301 obtains a task corresponding to an express to be dispatched to obtain a task group; the allocating unit 302 allocates an initial route to each task in the task group in a preset routing network to obtain a first task routing group; the first adjusting unit 303 then adjusts each initial route in the first task route group according to a preset objective function, to obtain a second task route group; the first determining unit 304 selects task pairs with similar routes from the task group, and determines whether the selected task pairs have a coincident sub-route from the routing network; if yes, the second adjusting unit 305 adjusts the route corresponding to the screened task pair in the second task route group according to the coincident sub-route and the objective function, so as to obtain a third task route group; finally, the second determining unit 306 determines a target task routing group according to the first task routing group, the second task routing group, and the third task routing group. According to the scheme, a special transit station is not required to be set for the express mail, the initial route is directly distributed for each task from the routing network, the initial route is optimized according to the objective function, the number of tasks in a task group is reduced, fewer vehicles can be used for transporting the express mail in the follow-up process, and then the transportation cost of the express mail can be reduced.

The above operations can be implemented in the foregoing embodiments, and are not described in detail herein.

An embodiment of the present application further provides a network device, which integrates any one of the route group determining apparatuses provided in the embodiments of the present application, where the network device includes:

one or more processors;

a memory; and

one or more applications, wherein the one or more applications are stored in the memory, and the processor may perform any of the steps of the route group determination methods in the above embodiments.

The embodiment of the present application further provides a network device, which integrates any block chain data request processing apparatus provided in the embodiment of the present application. As shown in fig. 5, it shows a schematic structural diagram of a network device according to an embodiment of the present application, specifically:

the network device may include components such as a processor 501 of one or more processing cores, memory 502 of one or more computer-readable storage media, a power supply 503, and an input unit 504. Those skilled in the art will appreciate that the network device architecture shown in fig. 5 does not constitute a limitation of network devices and may include more or fewer components than shown, or some components may be combined, or a different arrangement of components. Wherein:

the processor 501 is a control center of the network device, connects various parts of the entire network device by using various interfaces and lines, and performs various functions of the network device and processes data by running or executing software programs and/or modules stored in the memory 502 and calling data stored in the memory 502, thereby performing overall monitoring of the network device. Optionally, processor 501 may include one or more processing cores; preferably, the processor 501 may integrate an application processor, which mainly handles operating systems, user interfaces, application programs, etc., and a modem processor, which mainly handles wireless communications. It will be appreciated that the modem processor described above may not be integrated into the processor 501.

The memory 502 may be used to store software programs and modules, and the processor 501 executes various functional applications and data processing by operating the software programs and modules stored in the memory 502. The memory 502 may mainly include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application program required for at least one function (such as a sound playing function, an image playing function, etc.), and the like; the storage data area may store data created according to use of the network device, and the like. Further, the memory 502 may include high speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other volatile solid state storage device. Accordingly, the memory 502 may also include a memory controller to provide the processor 501 access to the memory 502.

The network device further comprises a power supply 503 for supplying power to each component, and preferably, the power supply 503 may be logically connected to the processor 501 through a power management system, so as to implement functions of managing charging, discharging, and power consumption through the power management system. The power supply 503 may also include any component of one or more dc or ac power sources, recharging systems, power failure detection circuitry, power converters or inverters, power status indicators, and the like.

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

Although not shown, the network device may further include a display unit and the like, which are not described in detail herein. Specifically, in this embodiment, the processor 501 in the network device loads the executable file corresponding to the process of one or more application programs into the memory 502 according to the following instructions, and the processor 501 runs the application programs stored in the memory 502, thereby implementing various functions as follows:

if the selected task pair exists in the second task routing group, the corresponding routing of the selected task pair is adjusted according to the coincident sub-routing and the objective function, and a third task routing group is obtained;

In the above embodiments, the descriptions of the respective embodiments have respective emphasis, and a part which is not described in detail in a certain embodiment may refer to the above detailed description of the route group determining method, and is not described herein again.

It will be understood by those skilled in the art that all or part of the steps of the methods of the above embodiments may be performed by instructions or by associated hardware controlled by the instructions, which may be stored in a computer readable storage medium and loaded and executed by a processor.

To this end, the present application provides a storage medium, in which a plurality of instructions are stored, where the instructions can be loaded by a processor to execute the steps in any one of the route group determination methods provided in the present application. For example, the instructions may perform the steps of:

Wherein the storage medium may include: read Only Memory (ROM), random Access Memory (RAM), magnetic or optical disks, and the like.

Since the instructions stored in the storage medium may execute the steps of any of the route group determination methods provided in the embodiments of the present application, beneficial effects that can be achieved by any of the route group determination methods provided in the embodiments of the present application may be achieved, for details, see the foregoing embodiments, and are not described herein again.

The foregoing describes a method, an apparatus, a network device, and a storage medium for determining a routing group provided in an embodiment of the present application in detail, and a specific example is applied in the present application to explain principles and embodiments of the present application, and the description of the foregoing embodiment is only used to help understand a method and a core idea of the present application; meanwhile, for those skilled in the art, according to the idea of the present application, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present application.

Claims

1. A method for determining a route group, comprising:

determining a target task routing group of the task group according to the first task routing group, the second task routing group and the third task routing group;

the determining a target task routing group of the task group according to the first task routing group, the second task routing group, and the third task routing group further includes:

2. The method according to claim 1, wherein the allocating an initial route for each task in the task group in a preset routing network to obtain a first task routing group comprises:

and randomly distributing an initial route for each task in the feasible routes to obtain the first task route group.

3. The method according to claim 1, wherein the allocating an initial route for each task in the task group in a preset routing network to obtain a first task routing group comprises:

4. The method of claim 1, wherein after assigning an initial route to each task in the task group in a pre-configured routing network to obtain a first task routing group, the method further comprises:

determining whether the first task routing group needs to be improved according to the objective function;

the adjusting each initial route in the first task route group according to a preset objective function to obtain a second task route group includes:

5. The method of claim 1, wherein determining a target task routing group for the task group based on the first task routing group, the second task routing group, and the third task routing group comprises:

6. The method of claim 1, wherein determining the target task routing group based on the fourth task routing group and the objective function comprises:

7. The method according to any one of claims 1 to 6, wherein the adjusting each initial route in the first task route group according to a preset objective function to obtain a second task route group comprises:

8. The method according to any one of claims 1 to 6, wherein the adjusting, in the second task route group, the route corresponding to the screened task pair according to the coincident sub-route and the objective function to obtain a third task route group includes:

9. A route group determination device, comprising:

a second determining unit, configured to determine a target task route group of the task group according to the first task route group, the second task route group, and the third task route group;

the second determining unit is further configured to:

10. A network device comprising a processor and a memory, the memory having stored therein a computer program, the processor executing the route group determination method according to any one of claims 1 to 8 when calling the computer program in the memory.

11. A storage medium storing a plurality of instructions adapted to be loaded by a processor to perform the route group determination method of any one of claims 1 to 8.