CN111179580A

CN111179580A - Service route evaluation method and device

Info

Publication number: CN111179580A
Application number: CN201811344754.3A
Authority: CN
Inventors: 杨鑫; 孙峰; 韩锋; 程小钰; 李楠
Original assignee: Hisense TransTech Co Ltd
Current assignee: Hisense TransTech Co Ltd
Priority date: 2018-11-13
Filing date: 2018-11-13
Publication date: 2020-05-19
Anticipated expiration: 2038-11-13
Also published as: CN111179580B

Abstract

The invention discloses a service route evaluation method and a service route evaluation device, wherein the method comprises the following steps: the method comprises the steps of obtaining starting and stopping time and service intersections of a plurality of service routes, determining overlapped service routes aiming at any one of the plurality of service routes, determining a first service route of the intersection having conflict with the service route from the overlapped service routes, determining a target service route having conflict with the service route, and finally determining a plurality of service route conflict groups. According to the technical scheme, factors such as departure time, arrival time and speeds of all road sections of the service fleet are comprehensively considered, service lines are scientifically evaluated, potential service conflicts in service tasks are found in advance, and risks in actual execution are reduced.

Description

Service route evaluation method and device

Technical Field

The embodiment of the invention relates to the field of intelligent traffic control, in particular to a service route evaluation method and device.

Background

In the service tasks, service routes of the service tasks, such as departure time, arrival time, speed of each road section and the like of a service motorcade, need to be planned in advance, and generally the service routes are all made by experts with abundant guard traffic support experience, and the departure time, arrival time and speed of each road section of the service motorcade are set, and the main principle is to avoid conflicts of different service motorcades.

Under the condition that the number of service tasks is small, a manual calculation mode can better ensure that fleet conflicts do not occur, but under the conditions of large-scale activity places, large-scale meeting places, scattered places and the like, dozens of service routes are often concurrent, the manual calculation difficulty is greatly increased, and the situation of neglect is difficult to avoid, so that the factors of departure time, arrival time, speed of each road section and the like of the service fleet need to be comprehensively considered, potential service conflicts in the service tasks are found in advance, and the risk in actual execution is reduced.

Disclosure of Invention

The embodiment of the invention provides a service route evaluation method and device, which are used for scientifically evaluating service routes by comprehensively considering factors such as departure time, arrival time, speeds of all road sections and the like of a service fleet, discovering potential service conflicts in service tasks in advance and reducing risks in actual execution.

The service route evaluation method provided by the embodiment of the invention comprises the following steps:

acquiring starting and stopping time and service intersections of a plurality of service routes;

aiming at any one of the plurality of service routes, determining an overlapped service route according to the starting and stopping time of the service route and the starting and stopping time of other service routes in the plurality of service routes; according to the service intersections of the service routes, determining a first service route of the intersection which conflicts with the service routes from the overlapped service routes; determining a target service route which conflicts with the service route according to the route information of the service route and the route information of the first service route; the overlapped service route is a service route with time overlapping with the starting time and the ending time of the service route;

and determining a plurality of service route conflict groups according to each service route and a target service route which conflicts with each service route.

According to the technical scheme, before an actual service task starts, starting and stopping time and service intersections of a plurality of service routes are obtained, one service route is selected at will, the service routes overlapped with the service routes in the starting and stopping time are determined according to any one service route, then a first service route having a conflict intersection is determined from the service routes overlapped with the service routes in the starting and stopping time, and finally a target service route having a conflict is determined. The method comprises the steps of selecting any one service route, namely judging all the acquired service routes once, and finally determining a plurality of service route conflict groups, so that every two service routes which conflict with each other in the plurality of service routes can be judged, and judging whether the starting time and the ending time are overlapped or not and judging whether conflict intersections exist or not in the judging process, thereby reducing the workload of the whole judging process and relatively improving the efficiency of determining the plurality of service route conflict groups. In addition, the technical scheme is that the service route is evaluated before the service task is started, namely, potential service conflicts in the service task are found in advance, and risks in actual execution are reduced.

Optionally, the route information includes the length of each route, the running speed of the service fleet, a speed floating coefficient, time consumed for switching signal lamps and time consumed for reacting personnel;

the step of determining a target service route which conflicts with the service route according to the route information of the service route and the route information of the first service route comprises the following steps:

determining a first time interval when the service fleet on the service route reaches the conflict intersection according to the length of each road segment of the service route, the running speed of the service fleet, a speed floating coefficient, signal lamp switching time consumption and personnel reaction time consumption;

determining a second time period when the service fleet on the first service route reaches the conflict intersection according to the length of each road segment of the first service route, the running speed of the service fleet, a speed floating coefficient, signal lamp switching time consumption and personnel reaction time consumption;

determining a first service route corresponding to a second time period when the first time period has time to overlap as the target service route having a conflict with the service route.

In the technical scheme, as the determined first service routes are multiple, the first service route corresponding to the second time period with time overlapping with the first time period can be determined as the target service route, namely the target service route with conflict with the service route is determined from the multiple first service routes according to the time of the service fleet on each first service route reaching the conflict intersection. When the target service route is determined, the length of each road segment of the service route, the running speed of a service vehicle fleet on each road segment, a speed floating coefficient, signal lamp switching time consumption, personnel reaction time consumption and the like are comprehensively considered, the time period when the service vehicle fleet reaches a conflict intersection is accurately predicted, and the target service route can be accurately determined.

Optionally, the determining, according to the service intersections of the service routes, a first service route from the overlapped service routes, which includes an intersection having a conflict with the service route, includes:

according to the service intersections of the service routes, determining a plurality of public intersections overlapped with the service routes from the service intersections of the overlapped service routes;

judging whether a first public intersection and a second public intersection which are adjacent exist in the plurality of public intersections, and if so, determining the first public intersection as the conflict intersection; the second public intersection is the next intersection on the service route to the first public intersection;

and determining a first service route of the conflict intersection with the service route according to the conflict intersection.

In the above technical solution, if there are adjacent first and second public intersections in a plurality of public intersections determined by the service route and the first service route, it is indicated that the service route and the first service route are the same driving route on the road section between the first and second public intersections, that is, the service fleets of two service routes are in a following state on the road section between the first and second public intersections, and at this time, if the distance between the two service fleets is smaller than a preset value, it is abnormal to follow, and corresponding processing needs to be performed on the abnormal following.

Optionally, after determining a plurality of service route conflict groups according to each service route and a target service route which conflicts with each service route, the method further includes:

aiming at any service route conflict group in the plurality of service route conflict groups, determining a route to be adjusted according to the route levels of two service routes in the service route conflict groups, the number of conflict intersections with other service routes in the plurality of service routes and the distance from a starting point to the conflict intersections of the two service routes;

adjusting the route to be adjusted according to the adjustment parameters of the route to be adjusted; the adjustment parameters of the route to be adjusted comprise the driving speed, the departure time and the arrival time of the service fleet on the route to be adjusted.

According to the technical scheme, after a plurality of service route conflict groups are determined, the corresponding route to be adjusted is determined for each service route conflict group, and adjustment is carried out according to the adjustment parameters of the route to be adjusted. That is, when the service routes are evaluated in advance, after the conflict of the service routes is found, the adjustment is made in time aiming at the routes with conflict mutually, so as to avoid the conflict in the actual execution.

Optionally, the determining a route to be adjusted according to the respective route levels of the two service routes in the service route conflict group, the number of conflict intersections existing between the two service routes and other service routes in the plurality of service routes, and the distance from the starting point to the conflict intersections of the two service routes includes:

if the two service routes are different in route level, determining the service route with the lower route level in the two service routes as the route to be adjusted;

if the route levels of the two service routes are the same, after the two service routes are determined to be unequal to the number of the conflict intersections of other service routes, determining the service routes with less number of the conflict intersections of other service routes in the two service routes as the routes to be adjusted; or after the two service routes are determined to be respectively equal to the number of the conflict intersections of other service routes, determining the service route with long distance from the starting point to the conflict intersection of the two service routes as the route to be adjusted.

In the technical scheme, the route levels of two service routes which conflict with each other are considered when the route to be adjusted is determined, namely the service route with a low priority adjustment level is selected from the service routes with different levels; if the two service routes are the same in level, considering the number of conflict intersections between the two service routes which conflict with each other and other service routes respectively, and selecting the service route with the number of the conflict intersections with other service routes as a route to be adjusted, so that the conflict with other service routes caused by the adjustment of the service route in the group is reduced as much as possible; and considering the distance from the starting point of each of the two service routes to the conflict intersection of the two service routes again, and selecting the service route with larger distance as the route to be adjusted, so that the factors of the running speed, the departure time and the like of the service motorcade on the route to be adjusted can be easily adjusted to solve the conflict.

Optionally, the adjusting the route to be adjusted according to the adjustment parameter of the route to be adjusted includes:

if the adjustment parameter is the running speed of the service motorcade on the route to be adjusted, adjusting the running speed of the service motorcade on the route to be adjusted according to preset conditions, and determining whether the conflict of the service route conflict group is solved, if so, adjusting the arrival time of the service motorcade on the route to be adjusted after determining that the arrival time of the service motorcade on the route to be adjusted is adjustable; otherwise, after the departure time of the service fleet on the route to be adjusted is determined to be adjustable, the departure time of the service fleet on the route to be adjusted is adjusted;

and if the adjustment parameter is the departure time of the service motorcade on the route to be adjusted, judging whether the arrival time of the service motorcade on the route to be adjusted is adjustable, and if so, adjusting the arrival time of the service motorcade on the route to be adjusted.

Optionally, the method further includes:

after the arrival time of the service motorcade on the route to be adjusted is determined to be not adjustable, adjusting the driving speed of the service motorcade on a road section behind the conflict intersection;

and after determining that the departure time of the service fleet on the route to be adjusted is not adjustable, adjusting the route to be adjusted again according to the adjustment parameters of the route to be adjusted.

In the technical scheme, the route to be adjusted is adjusted, a specific adjustment plan is given, and the driving speed of the service fleet is adjusted, the departure time and the arrival time of the service fleet are combined to achieve the aim of finally solving the conflict.

Optionally, after the adjusting the route to be adjusted according to the adjustment parameter of the route to be adjusted, the method further includes:

determining whether the adjusted service route conflicts with a third service route, if so, continuing to adjust the conflicts between the adjusted service route and the third service route until the adjusted service route does not conflict with all service routes; and the third service route is a service route except the service route in the service route conflict group.

In the above technical solution, if the adjusted service route causes a conflict with another service route (a third service route) due to the adjustment, at this time, the adjustment of the conflict between the adjusted service route and the third service route is further required until all the service routes do not conflict with each other. And adjusting the service routes based on a recursive idea, and finally solving the conflicts among all the service routes.

Correspondingly, an embodiment of the present invention further provides a service route evaluation device, including:

the system comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for acquiring the starting and ending time of a plurality of service routes and service intersections;

the processing unit is used for determining overlapped service routes according to the starting and stopping time of the service routes and the starting and stopping time of other service routes in the service routes aiming at any one service route in the service routes; according to the service intersections of the service routes, determining a first service route of the intersection which conflicts with the service routes from the overlapped service routes; determining a target service route which conflicts with the service route according to the route information of the service route and the route information of the first service route; the overlapped service route is a service route with time overlapping with the starting time and the ending time of the service route;

and the determining unit is used for determining a plurality of service route conflict groups according to each service route and the target service route which conflicts with each service route.

the processing unit is specifically configured to:

Optionally, the processing unit is specifically configured to:

Optionally, the determining unit is further configured to:

after a plurality of service route conflict groups are determined according to each service route and a target service route which conflicts with each service route, aiming at any one of the service route conflict groups, determining a route to be adjusted according to the route level of each of two service routes in the service route conflict groups, the number of intersections which conflict with other service routes in the service routes and the distance from a starting point to the conflict intersections of the two service routes;

Optionally, the determining unit is further configured to:

Optionally, the determining unit is specifically configured to:

Optionally, the determining unit is further specifically configured to:

Optionally, the determining unit is further configured to:

after the route to be adjusted is adjusted according to the adjustment parameters of the route to be adjusted, determining whether the adjusted service route conflicts with a third service route, if so, continuing to adjust the conflict between the adjusted service route and the third service route until the adjusted service route does not conflict with all service routes; and the third service route is a service route except the service route in the service route conflict group.

Correspondingly, an embodiment of the present invention further provides a computing device, including:

a memory for storing program instructions;

and the processor is used for calling the program instructions stored in the memory and executing the service route evaluation method according to the obtained program.

Accordingly, an embodiment of the present invention further provides a computer-readable non-volatile storage medium, which includes computer-readable instructions, and when the computer-readable instructions are read and executed by a computer, the computer is caused to execute the above service route evaluation method.

Drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, 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 diagram of a system architecture according to an embodiment of the present invention;

fig. 2 is a schematic flow chart of a service route evaluation method according to an embodiment of the present invention;

FIG. 3a is a schematic view of two service fleet directions of travel provided by an embodiment of the present invention;

FIG. 3b is a schematic view of another two service fleet driving directions provided by an embodiment of the present invention;

FIG. 4 is a schematic illustration of a service fleet following anomaly provided by an embodiment of the present invention;

FIG. 5 is a schematic flow chart illustrating a process of determining a route to be adjusted according to an embodiment of the present invention;

fig. 6 is a schematic flow chart of adjusting a conflict according to an embodiment of the present invention;

FIG. 7 is a flow chart of service route assessment and conflict adjustment according to an embodiment of the present invention;

fig. 8 is a schematic structural diagram of a service route evaluation device according to an embodiment of the present invention.

Detailed Description

In order to make the objects, technical solutions and advantages of the present invention clearer, the present invention will be described in further detail with reference to the accompanying drawings, and it is apparent that the described embodiments are only a part of the embodiments of the present invention, not all of the 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 invention.

Fig. 1 illustrates an exemplary system architecture, which may be a server 100, including a processor 110, a communication interface 120, and a memory 130, to which embodiments of the present invention are applicable. The server 100 may be a server located in a traffic control center, or may be a server in other sub-centers, which is not limited in this embodiment of the present invention.

The communication interface 120 is used for receiving and transmitting service route information to realize communication.

The processor 110 is a control center of the server 100, connects various parts of the entire server 100 using various interfaces and lines, performs various functions of the server 100 and processes data by running or executing software programs and/or modules stored in the memory 130 and calling data stored in the memory 130. Alternatively, processor 110 may include one or more processing units.

The memory 130 may be used to store software programs and modules, and the processor 110 executes various functional applications and data processing by operating the software programs and modules stored in the memory 130. The memory 130 may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function, and the like; the storage data area may store data created according to a business process, and the like. Further, the memory 130 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.

It should be noted that the structure shown in fig. 1 is only an example, and the embodiment of the present invention is not limited thereto.

Based on the above description, fig. 2 exemplarily shows a flow of an evaluation method of a service route according to an embodiment of the present invention, which may be performed by an evaluation apparatus of a service route. As shown in fig. 2, the process specifically includes:

step 201, acquiring a plurality of service route information.

The plurality of pieces of service route information comprise the starting and ending time of each service route and the service intersections. In the scenes of large-scale activity places, large-scale meeting arrival places or scattered places and the like, a plurality of service routes can possibly occur simultaneously, and at the moment, a plurality of pieces of service route information corresponding to the plurality of service routes are obtained, namely the start-stop time corresponding to each service route in the plurality of service routes and all passing service intersections are obtained.

Of course, a plurality of pieces of road section information included in each service route, the driving speed of the service vehicle on each road section, and the like may also be acquired.

Step 202, aiming at any one of the plurality of service routes, determining overlapped service routes according to the starting and stopping time of the service routes and the starting and stopping time of other service routes in the plurality of service routes; according to the service intersections of the service routes, determining a first service route of the intersection which conflicts with the service routes from the overlapped service routes; and determining a target service route which conflicts with the service route according to the route information of the service route and the route information of the first service route.

The overlapped service route refers to a service route having time overlap with the starting and stopping time of the service route.

As a specific implementation manner, any one of a plurality of service routes can be analyzed, and the any one service route is assumed to be a route R_iAccording to the route R_iStarting and stopping time of the plurality of service routes and a route R_iStarting and stopping times of other service routes are determined_iThe start and end times of which are overlapping in time, assuming thatThe service routes are collected as a collection A. Again according to route R_iDetermining a route R from the set A by the passing service intersection_iThere is a first service route of the conflicting intersection, which is assumed to be the set B. Determining a route R according to the first service route in the set B_iThere are conflicting target service routes.

Here, since the analysis is performed for any one of the plurality of service routes, that is, the route R is analyzed_iThen, the method also needs to be continued for the route R_iAnalyzing any one of the other plurality of service routes, namely a route R_i+1And by analogy, finally, each service route in the plurality of service routes is analyzed in a round-robin mode, and a target service route corresponding to each service route is determined. For example, the plurality of service routes acquired is R₁、R₂、R₃、R₄、R₅Determining R by means of rotation training₁、R₂、R₃、R₄、R₅The respective corresponding target service routes are shown in table 1, for example.

TABLE 1

Current service route	Target service route
		R₁	R₂、R₃
R₂	R₁
		R₃	R₁、R₄
R₄	R₃
		R₅	Is free of

In the above embodiment, route R is still used_iFor example, the first service route can be understood as the route R determined from the start and end times and the service intersections_iThere may be conflicting routes, wherein the first service route may be a plurality of service routes, route R_iA plurality of conflict intersections exist with the plurality of first service routes; a target service route can be understood as route information based on a plurality of first service routes and route R_iWith route R_iThe conflicting routes may specifically be as follows:

the route information can comprise the length of each road section, the running speed of the service fleet, a speed floating coefficient, time consumed by signal lamp switching and time consumed by personnel reaction. Determining a first time interval when the service fleet on the service route reaches a conflict intersection according to the length of each road segment of the service route, the running speed of the service fleet, a speed floating coefficient, signal lamp switching time consumption and personnel reaction time consumption; meanwhile, determining a second time period when the service fleet on the first service route reaches the conflict intersection according to the length of each road segment of the first service route, the running speed of the service fleet, a speed floating coefficient, signal lamp switching time consumption and personnel reaction time consumption; and determining a first service route corresponding to a second time period which is overlapped with the first time period in time as a target service route which conflicts with the service route.

To better describe the embodiment of the present invention, take one of the plurality of first service routes as an example, and let the first service route be the route R_jRoute R_iAnd route R_jThere is a conflicting intersection where route R_iAnd route R_jThere may be only one conflicting intersectionFor convenience of description, it is assumed that there is one conflict intersection, and the conflict intersection C is also used as the conflict intersection C_public。

The service route can comprise a plurality of service road sections, each service road section corresponds to the preset running speed of the service motorcade, and the route R_iOn the service vehicle team from the starting point to the collision intersection C_publicMay be determined according to equation (1).

The above formula (1) is:

wherein the content of the first and second substances,

is a route R_iFrom crossing C_k-1To the intersection C_kThe shortest time consumption;

is a route R_iFrom crossing C_k-1To the intersection C_kThe longest time consumption; speed_kThe preset passing speed on the road section k is obtained; a is a speed floating coefficient, the value range is between 0 and 1, and the speed floating coefficient can be configured according to experience;

is a route R_iOn the service vehicle team from the starting point to the conflict intersection C_publicThe earliest time;

is a route R_iOn the service vehicle team from the starting point to the conflict intersection C_publicThe latest time; t is_transThe time consumed for switching the signal lamps can be set according to experience; t is_reactThe reaction time for the person is long and can be set according to experience.

From the formula (1), the route R_iOn the service vehicle team from the starting point to the collision intersection C_publicFor a first period of time of

In the same way, route R_jOn the service vehicle team from the starting point to the collision intersection C_publicFor a second period of time of

At this time, if there is an overlap between the first time period and the second time period, that is, there is an overlap between the first time period and the second time period

And

there is an overlap between, indicating route R_iOn service vehicle team arriving conflict crossing C_publicWhen, route R_jThe service fleet on the road just arrives at the conflicted intersection C_publicAt this point, two fleets of vehicles will collide, i.e. route R_iAnd route R_jAre two conflicting service routes.

As can be seen from the above embodiments, by judging the route R_iThe time period when the service vehicle team on the first service route reaches the conflict intersection can be determined_iThere are conflicting target service routes.

As another specific implementation manner, it can be understood that after obtaining the plurality of pieces of service route information, time dimension filtering, space dimension filtering, and exception output are sequentially performed on the plurality of pieces of service route information, and the specific steps are as follows:

1. time dimension filtering

Only two service routes which conflict with each other in the starting and stopping time of the service routes are possible to have the risk of mutual conflict, so that the time dimension filtration is firstly carried out on the information of the plurality of service routes, and the subsequent calculation amount is reduced.

The start time of each service route is determined and the corresponding end time is determined based on the start time of each service route, as shown in equation (2).

The above formula (2) is:

among them, Cost_maxThe maximum time consumption of the single route is achieved;

Cost_stdtime consumption is expected for a single route (standard time consumption);

β is a floating factor (which can be empirically configured) and can be set to 0.2.

The start-stop Time range of the service line is [ Time_begin，Time_{max_end}]。

Based on formula (2), two service fleets overlapped on the starting time are determined in a rotation training mode, and the time conflicts are collected to form a set P_i＝[R_i，R_j，Time_{public_begin}，Time_{public_end}]Adding into the set P, wherein R_jIs and route R_iThere are conflicting routes at the start and end times,

is a route R_iAnd route R_jOverlapping time over start and stop times.

2. Spatial dimension filtering

Generating service intersections through which each service route in the set P passes based on road network topology and route planning, and adding each service intersection into an intersection set corresponding to the service route, such as a route R_iThe intersection set is as follows:

U_i＝[C_i1，C_i2，C_i3，……，C_in]

determining whether the same intersection (conflict intersection) exists among all service routes in the set P in a rotation training mode, and generating a potential conflict route set I_i＝[R_i，R_j，C_public]Is shown by_iAdding into a set I, wherein R_jIs and route R_iRoutes having conflicts in starting and stopping times, C_publicIs a route R_iAnd route R_jThe conflict intersection of (2).

3. Abnormal output

For each potentially conflicting route set I in set I ═ R_i，R_j，C_public]Calculating a route R_iOn service vehicle team arriving conflict crossing C_publicAnd route R_jOn service vehicle team arriving conflict crossing C_publicIf the two time periods are coincident, the second time period represents the route R_iAnd route R_jTwo mutually conflicting service routes are used, and an abnormal set is output:

N＝[R_i，R_j，C_public，Time_{public_begin}，Time_{public_end}]

it should be noted that the conflicting routes according to the embodiment of the present invention refer to two or more service fleets simultaneously traveling to a certain intersection, so as to generate a conflict through the intersection, such that one or more service fleets have to stop to avoid another service fleet, that is, the traveling directions of the service fleets conflicting with each other are different, and when the service routes are evaluated, the traveling directions of the service fleets on the service routes are also considered, for example, the traveling direction of the first fleet is north → south, and the traveling direction of the second fleet is east → west, and when it is predicted that two service fleets simultaneously travel to the intersection O, it is evaluated that two service fleets occur, as shown in fig. 3 a. Accordingly, if the driving direction of the first fleet is east → west and the driving direction of the second fleet is east → west, it cannot be estimated that the two service routes collide even if it is predicted that the two service fleets simultaneously drive to a certain intersection, as shown in fig. 3 b.

Specifically, according to the service intersections of the service routes, a plurality of public intersections overlapped with the service routes are determined from the overlapped service routes; judging whether a first public intersection and a second public intersection which are adjacent exist in the plurality of public intersections, and if so, determining the first public intersection as a conflict intersection; wherein the second public intersection is the next intersection on the service route at the first public intersection; and determining a first service route of the intersection with which the service route conflicts according to the conflict intersection.

Is explained if route R_iAnd route R_jThere are two public intersections between them, the first one O₁And a second common intersection O₂It can be seen from FIG. 4 that these two intersections are adjacent intersections, i.e. route R is indicated_iAnd route R_jAt the first public crossing O₁And a second common intersection O₂Section of road between O₁O₂Service fleets with identical driving routes, i.e. two service routes, at a first common crossing O₁And a second common intersection O₂Section of road between O₁O₂And when the vehicle is in the following state, if the distance between the two service fleets is smaller than a preset value, the vehicle is judged to be in the following abnormality, and corresponding treatment needs to be carried out on the following abnormality.

Step 203, determining a plurality of service route conflict groups according to each service route and the target service route which conflicts with each service route.

From step 202, route R_iA plurality of target service routes, namely the route R, can be determined_iCorresponding to a plurality of service route conflict groups. Furthermore, the plurality of service routes respectively correspond to the plurality of service route conflict groups.

After a plurality of service route conflict groups are determined according to each service route and a target service route which conflicts with each service route, the service routes need to be adjusted according to each service route conflict group, so that the condition of service route conflict cannot occur in the actual execution process.

Specifically, for any service route conflict group in the plurality of service route conflict groups, a route to be adjusted is determined according to the route levels of two service routes in the service route conflict groups, the number of conflict intersections between the two service routes and other service routes in the plurality of service routes and the distance from each starting point to the conflict intersections of the two service routes. And adjusting the route to be adjusted according to the adjustment parameters of the route to be adjusted.

The adjustment parameters of the route to be adjusted comprise the driving speed, the departure time and the arrival time of the service motorcade on the route to be adjusted.

The following description is provided with reference to the flowchart in fig. 5 for a specific implementation manner of determining a route to be adjusted.

In step 501, route levels of two service routes are determined.

Step 502, whether the route levels are the same or not is judged, if yes, the process goes to step 504, and if not, the process goes to step 503.

And step 503, determining the service route with low route level as the route to be adjusted.

And if the route levels of the two service routes are different, determining the service route with the lower route level in the two service routes as the route to be adjusted.

And step 504, determining the number of conflicted intersections of the two service routes and other service routes respectively.

And 505, judging whether the number of the conflict intersections is the same, if so, turning to 507, and otherwise, turning to 506.

Step 506, determining the service routes with less number of the conflicted intersections as the routes to be adjusted.

And if the route levels of the two service routes are the same, after the two service routes are determined to be unequal to the number of the conflicted intersections of other service routes, determining the service routes with less conflicted intersections of other service routes in the two service routes as the routes to be adjusted.

And step 507, determining the distance from the starting point of the two service routes to the conflict intersection of the two service routes.

Step 508, determine whether the distances are the same, if yes, go to step 510, otherwise, go to step 509.

In step 509, the long-distance service route is determined as the route to be adjusted.

And after the two service routes are determined to be respectively equal to the number of the conflict intersections of other service routes, determining the service route with long distance from the starting point to the conflict intersection of the two service routes as the route to be adjusted.

At step 510, a service route is randomly determined as a route to be adjusted.

Of course, if the route to be adjusted cannot be determined according to the respective route levels of the two service routes in the service route conflict group, the number of conflict intersections existing between the two service routes and other service routes in the plurality of service routes and the distance from the starting point to the conflict intersections of the two service routes, a service route is randomly selected from the service route conflict group to serve as the route to be adjusted.

And after the route to be adjusted is determined, adjusting the route to be adjusted according to the adjustment parameters of the route to be adjusted. Since the departure time and the arrival time of the service vehicle cannot be easily changed in the service task, in the adjustment parameters of the route to be adjusted, the problem of conflict resolution by adjusting the driving speed of the service vehicle fleet on the route to be adjusted is preferably considered, and the problem of change in the arrival time of the service vehicle caused by adjusting the driving speed is also fully considered when the conflict resolution by adjusting the driving speed is considered.

According to the difference of the adjustment parameters, the following two cases can be distinguished:

(1) the adjusting parameter is the running speed of the service fleet on the route to be adjusted.

Adjusting the running speed of the service motorcade on the route to be adjusted according to preset conditions, determining whether the conflict of the service route conflict group is solved, if so, adjusting the arrival time of the service motorcade on the route to be adjusted after determining that the arrival time of the service motorcade on the route to be adjusted is adjustable; otherwise, after the departure time of the service motorcade on the route to be adjusted is determined to be adjustable, the departure time of the service motorcade on the route to be adjusted is adjusted.

Of course, the method also comprises the step of adjusting the running speed of the service vehicle fleet on the road section behind the conflict intersection after the fact that the arrival time of the service vehicle fleet on the route to be adjusted is not adjustable.

(2) The adjustment parameter is the departure time of the service fleet on the route to be adjusted.

Judging whether the arrival time of the service motorcade on the route to be adjusted is adjustable, if so, adjusting the arrival time of the service motorcade on the route to be adjusted; otherwise, adjusting the driving speed of the service motorcade on the road section behind the conflict intersection.

And naturally, after the departure time of the service fleet on the route to be adjusted is determined to be not adjustable, adjusting the route to be adjusted again according to the adjustment parameters of the route to be adjusted.

An embodiment of adjusting the route to be adjusted can be seen in fig. 6.

Step 601, determining a route to be adjusted and an adjustment parameter of the route to be adjusted.

Step 602, the adjustment parameter of the route to be adjusted is the driving speed of the motorcade.

Step 603, adjusting the driving speed of the fleet.

Step 604, determine if the conflict is resolved, if yes, go to step 605, otherwise, go to step 608.

Step 605, judging whether the arrival time of the fleet is adjustable, if so, turning to step 606, otherwise, turning to step 607.

Step 606, fleet arrival times are adjusted.

And step 607, adjusting the driving speed of the fleet on the road section behind the conflict intersection.

Step 608, the adjustment parameter of the route to be adjusted is the departure time of the fleet.

And step 609, judging whether the fleet arrival time is adjustable. If so, go to step 610, otherwise, go to step 611.

Step 610, adjusting fleet arrival times.

Step 611, adjusting the driving speed of the fleet on the road section behind the conflict intersection.

It should be noted that when the adjustment is performed for a service route conflict group, new conflicts may occur between the adjusted service route and other service routes, here, the service routes except the service routes in the service route conflict group are defined as a third service route, after the adjustment is performed on the route to be adjusted according to the adjustment parameters of the route to be adjusted, it is further required to determine whether the adjusted service route conflicts with the third service route, and if so, the conflict between the adjusted service route and the third service route is continued to be adjusted until the conflict does not exist between the adjusted service route and all the service routes.

See Table 1 for example, route R₁And route R₂Forming a service route conflict group according to the route R₁And route R₂The route level, the number of conflicted intersections between the two service routes and other service routes in the plurality of service routes and the distance from the starting point to the conflicted intersections of the two service routes are respectively determined, and finally the route to be adjusted is determined to be a route R₂Before adjustment, route R₂And route R₃For two service routes which do not conflict with each other, but route R₂After making the service adjustments, route R₂And route R₃And changing into two service routes which conflict with each other, and introducing new service conflict after service adjustment. At this time, the adjusted route R needs to be continued₂And route R₃Forming a new service route conflict group, determining a route to be adjusted and carrying out service adjustment according to the route to be adjusted until no conflict exists between the adjusted service route and all service routes.

In order to better explain the embodiment of the present invention, a specific flow of service route evaluation and adjustment after service conflict will be described below in a specific implementation scenario.

One, two vehicle conflict example

TABLE 2

The service routes of the two service fleets are shown in table 2, with service route numbers 6625, 6618 respectively.

1. Time dimension filtering

The travel time of the service fleet of the service route 6625 is (9:23:20, 9:30:07) and the travel time of the service fleet of the service route 6618 is (9:20:40, 9:30:31), both of which have a common areaM (9:23:20, 9:30:07), thus P will be_i＝[6625，6618，9:20:40，9:30:31]Join set P.

2. Spatial dimension filtering

The service route 6625 and the service route 6618 have conflict intersections of "east sea west road-Taiping angle six road" in east sea west road and Taiping angle six road, will I_i6625, 6618, east China sea West Lu-Taiping jiao Liu Lu]Add set I.

3. Abnormal output

Here, for convenience of description, a in formula (1) is taken to be 0. Then from equation (1) it can be determined that equation (3) is as follows:

here, the sum of the signal light switching time and the human reaction time is set to 60 seconds, i.e., T_trans+T_react60, then there are

Further, route R_iOn service vehicle team arriving conflict crossing C_publicIs regarded as the earliest time of route R_iThe arrival time of the service fleet at the vehicle; will route R_jOn service vehicle team arriving conflict crossing C_publicIs regarded as the earliest time of route R_jThe arrival time of the service fleet at the vehicle; then, if route R is_iArrival time and route R of service fleet_jThe difference of the arrival times of the service fleet above is less than 60 seconds, the route R can be determined_iAnd route R_jAre two conflicting routes.

The time for the service fleet of the service route 6625 to reach the potential conflict intersection "west east China road-six Taiping places" is 9:26:02, the time for the service fleet of the service route 6618 to reach the potential conflict intersection "west east China road-six Taiping places" is 9:26:27, the difference between the two is 25 seconds and less than 60 seconds, and then the service route 6625 and the service route 6618 can be determined to conflict on "west east China road-six Taiping places".

4. Adjustment of

(1) Determining a route to be adjusted

The level of the service route 6625 is one level (lower represents higher level), and the level of the service route 6618 is two levels, so that the lower level service route 6618 is determined as the route to be adjusted.

(2) Determining an adjustment parameter

Since the duty route 6618 is ranked as second-level, here the maximum adjustable space for departure time and arrival time of the second-level task is set to 30 minutes empirically.

The service route 6618 may arrive 25 seconds later than the service route 6625 as originally planned, so that the difference in arrival time between the service route 6625 and the service route 6618 may be as much as 65 seconds (more than 60 seconds) by delaying the departure of the service fleet of the service route 6618 for 40 seconds (the number of seconds can be only ten) to avoid a conflict between the two routes.

(3) Determining an adjustment scheme

By delaying the departure time of the service route 6618 by 40 seconds, the arrival time difference between the service route 6625 and the service route 6618 can be 65 seconds, so that the conflict between the two routes can be avoided. Since the departure time of the service route 6618 is adjusted and the arrival time of the service route 6618 is adjusted, the arrival time of the service route 6618 also needs to be adjusted accordingly (delayed by 40 seconds accordingly), and the service route 6618 and other lines have no potential conflict points, so the output adjustment scheme is as follows: "departure time of the service route 6618 is delayed by 40 seconds and arrival time is delayed by 40 seconds".

Example of two and three vehicle conflicts

TABLE 3

TABLE 4

The service routes of the two service fleets are shown in table 3, the service route numbers are 2156 and 2766 respectively, and service conflicts occur between the service route 2156 and the service route 2766 at the intersection of the Yangan three-way road and the hong Kong road.

The service routes of the two service fleets are shown in table 4, the service routes are numbered 2666 and 2766 respectively, and service conflicts occur between the service routes 2666 and 2766 at the road junction of Nanjing road and hong Kong.

The evaluation method for the three service routes is not repeated, and the conflict solution is mainly described. The two service route conflict groups are respectively (2156, 2766), (2666, 2766), and taking the conflict of the service route conflict group (2156, 2766) as an example, the following steps are calculated:

(1) determining a route to be adjusted

Three influencing factors need to be considered when determining the route to be adjusted:

a) the route levels of two service routes in the service route conflict group;

b) the number of intersections where the two service routes conflict with other service routes in the plurality of service routes;

c) the distance from the starting point to the conflicting intersection of the two service routes.

Comparing the route levels of the service routes 2156 and the service routes 2766, the route levels of both the service routes are one level, so that the number of intersections where two service routes conflict with other service routes in the plurality of service routes needs to be continuously considered, the number of intersections where the service routes 2156 conflict with other service routes in the plurality of service routes is 0, and the number of intersections where the service routes 2766 conflict with other service routes in the plurality of service routes is 1, so that the route to be adjusted is determined to be the service route 2156.

(2) Determining an adjustment parameter

Since the route level of the service route 2156 is one level, the time maximum adjustment range of the primary task is 40 seconds, and the original arrival time of the service route 2156 is earlier than that of the service route 2766, in order to avoid conflict, it is necessary to further advance the arrival time of the service route 2156, that is, to try to advance the arrival time of the service route 2156 by 40 seconds. After 40 seconds in advance, the time for the service route 2156 to reach the potential conflict intersection "delay three routes — hong kong west road intersection" is 9:24:10, the time for the service route 2766 to reach the potential conflict intersection is 9:25:15, the arrival interval of the two is 65 seconds, and the interval time is more than 60 seconds, so that the adjustment service route 2156 and the service route 2766 do not conflict any more, and the departure time of the service route 2156 can be determined as the adjustment parameter.

(3) Determining an adjustment scheme

In determining the adjustment parameters for the service route 2156, we have determined to advance the departure time of the service route 2156 by 40 seconds, so the output adjustment is "departure time of the service route 2156 40 seconds in advance and arrival time 40 seconds in advance".

(4) Determining whether to introduce new conflicts after adjustment

No new conflicts are introduced because the service route 2156 does not intersect other routes.

Resolving conflicts for the service route conflict group (2156, 2766) may be referred to as resolving the route conflict group (2156, 2766), again not described in detail.

Three, recursive resolution of conflict instances

TABLE 5

TABLE 6

The service routes of the two service fleets are shown in table 5, the service routes are numbered as 2156 and 2766, and service conflicts occur between the service routes 2156 and the service routes 2766 at the intersection of the Yangan three-way road and the hong Kong road.

The service routes of the two service fleets are shown in table 6, the service routes are numbered 2666 and 2766 respectively, and service conflicts occur in the "road junction in south kyo-hong kong" port by the service routes 2666 and 2766.

The evaluation method for the three service routes is not repeated, and the conflict solution is mainly described. The two service route conflict groups are (2156, 2766), (2666, 2766), respectively.

(1) Determining a route to be adjusted

In the service route conflict group (2156, 2766), the service route level of the service route 2156 is one level and the service route level of the service route 2766 is two levels, so the service route 2766 is determined as a route to be adjusted.

(2) Determining an adjustment parameter

Since the time when the service vehicles of the service route 2766 arrive at the potential conflict intersection 'Yanan Sanuo-hong Kong Xiong intersection' is later, the arrival time of the service route 2766 needs to be further delayed, if the delay is 40 seconds, the arrival time of the service route 2766 at the 'Yanan Sanuo-hong Kong Xiong intersection' is 9:25:55, the arrival time of the service route 2156 at the 'Yanan Sanuo-hong Kong Xiong intersection' is 9:24:50, the arrival interval between the two routes is 65 seconds, and the interval is more than 60 seconds, namely, the tasks of the adjusted service route 2766 and the service route 2156 do not conflict any more.

The adjustment parameters are determined as departure time and arrival time in terms of service conflicts between service routes 2766 and 2156 on a single basis.

(3) Determining an adjustment scheme

Determining the departure time and arrival time of the service route 2766 is delayed by 40 seconds.

(4) Determining whether to introduce new conflicts after adjustment

Since the service route 2766 also has potential conflicting intersections with the service route 2666, it is also necessary to determine that the adjusted service route 2766 will not introduce new conflicts, i.e., determine whether the adjusted service route 2766 and the service route 2666 conflict, and the service route 2766 will defer departure for 40 seconds, and the service route 2766 will reach the "Nanjing road-hong Kong road intersection" at a time of 9:25:10 and the service route 2666 will have a time difference of 40 seconds, so that the service route 2766 and the service route 2666 will conflict at the "Nanjing road-hong Kong road intersection", and therefore, it is necessary to recursively invoke a conflict resolution method to resolve the conflict between the service route 2766 and the service route 2666, and the conflict resolution step is consistent with the conflict resolution method of the service route 2156 and the service route 2766, and is described generally as follows:

(5) secondarily determining a route to be adjusted

In the service route conflict group (2666, 2766), the service route level of the service route 2666 is one level and the service route level of the service route 2766 is two levels, so the service route 2766 is determined as a route to be adjusted.

(6) Determining the adjustment parameter twice

Since the departure time of the service route 2766 can still be delayed, the departure time of the service route 2766 is determined as an adjustment parameter.

(7) Double determination of adjustment scheme

Since the service vehicles of the adjusted service route 2766 arrive 40 seconds later than the service vehicles of the service route 2666, the service vehicles of the service route 2766 are delayed to depart for 30 seconds, so that the arrival interval of the two service fleets is 70 seconds and the interval time is more than 60 seconds.

(8) Determining whether to introduce new conflicts after secondary adjustment

Since the secondary adjustment logistics route 2766 also has a potential conflict intersection with the logistics route 2156, whether the secondary adjustment logistics route 2766 and the logistics route 2156 conflict or not is judged, and after judgment, the time for the secondary adjustment logistics route 2766 to reach the 'Yanan three-way-hong Kong west road intersection' is 9:26:25, the time for the logistics route 2156 to reach the 'Yanan three-way-hong Kong west road intersection' is 9:24:50, the arrival interval between the two routes is 95 seconds, and the interval is more than 60 seconds, so that new conflicts cannot be introduced.

As an alternative, in the embodiment of the present invention, a plurality of service routes are obtained, and the plurality of service routes are evaluated until conflicting service routes are adjusted, as shown in fig. 7. The method comprises the following specific steps:

step 701, acquiring a plurality of service routes.

And acquiring the service information of each service route in the plurality of service routes, wherein the service information comprises the starting and stopping time of each service route and a service intersection.

Step 702, time dimension filtering.

And determining two service routes which have time overlapping on the starting time and the stopping time in all the service routes.

Step 703, spatial dimension filtering.

The results of the time dimension filtering in step 702 are further filtered in a space dimension, that is, two service routes of a conflicted intersection are determined.

Step 704, service route evaluation.

And evaluating the service routes after the time dimension filtration and the space dimension filtration, judging the time when the two service routes respectively reach the conflict intersection, and if the time when the two service routes reach the conflict intersection is overlapped or the time difference is smaller than a preset value, determining that the two service routes are the two service routes which conflict with each other.

Step 705, exception details are output.

Namely, relevant information of two service routes which are determined in service route evaluation and conflict with each other is output.

Step 706, generate adjustment suggestions.

And adjusting according to the information of the two service routes.

In the embodiment, before the actual service task starts, the start and stop times and the service intersections of a plurality of service routes are acquired, one service route is selected randomly, the service routes overlapped with the service routes in the start and stop times are determined according to any one service route, the first service route having the conflict intersection is determined from the service routes overlapped with the service routes in the start and stop times, and finally the target service route having the conflict is determined. The method comprises the steps of selecting any one service route, namely judging all the acquired service routes once, and finally determining a plurality of service route conflict groups, so that every two service routes which conflict with each other in the plurality of service routes can be judged, and judging whether the starting time and the ending time are overlapped or not and judging whether conflict intersections exist or not in the judging process, thereby reducing the workload of the whole judging process and relatively improving the efficiency of determining the plurality of service route conflict groups.

After a plurality of service route conflict groups are determined, corresponding routes to be adjusted are determined in each service route conflict group, adjustment is carried out according to adjustment parameters of the routes to be adjusted, and when service routes are evaluated in advance, after conflicts of the service routes are found, adjustment is carried out on the routes with the conflicts among the service routes in time, so that conflicts in actual execution are avoided.

Based on the same inventive concept, fig. 8 exemplarily shows a structure of an apparatus for service route evaluation provided by an embodiment of the present invention, which can perform a flow of a method for service route evaluation.

An obtaining unit 801, configured to obtain start and end times and service intersections of a plurality of service routes;

the processing unit 802 is configured to determine, for any one of the plurality of service routes, an overlapped service route according to the start-stop time of the service route and the start-stop time of other service routes in the plurality of service routes; according to the service intersections of the service routes, determining a first service route of the intersection which conflicts with the service routes from the overlapped service routes; determining a target service route which conflicts with the service route according to the route information of the service route and the route information of the first service route; the overlapped service route is a service route with time overlapping with the starting time and the ending time of the service route;

a determining unit 803, configured to determine a plurality of service route conflict groups according to each service route and a target service route having a conflict with each service route.

the processing unit 802 is specifically configured to:

Optionally, the processing unit 802 is specifically configured to:

Optionally, the determining unit 803 is further configured to:

Optionally, the determining unit 803 is specifically configured to:

if the adjustment parameter is the departure time of the service motorcade on the route to be adjusted, judging whether the arrival time of the service motorcade on the route to be adjusted is adjustable, and if so, adjusting the arrival time of the service motorcade on the route to be adjusted;

optionally, the determining unit 803 is further configured to:

Optionally, the determining unit 803 is further configured to:

Based on the same inventive concept, an embodiment of the present invention further provides a computing device, including:

a memory for storing program instructions;

Based on the same inventive concept, the embodiment of the present invention also provides a computer-readable non-volatile storage medium, which includes computer-readable instructions, and when the computer-readable instructions are read and executed by a computer, the computer is enabled to execute the service route evaluation method.

The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

While preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all such alterations and modifications as fall within the scope of the invention.

It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.

Claims

1. A method for evaluating a service route, comprising:

2. The method according to claim 1, wherein the route information includes a length of each route, a traveling speed of a service fleet, a speed floating coefficient, a signal light switching elapsed time, a personnel reaction elapsed time;

3. A method according to claim 2 wherein said determining a first service route from said overlapping service routes based on service intersections of said service routes for intersections that conflict with said service routes comprises:

4. A method according to claim 1 wherein, after said determining a plurality of service route conflict groups based on each of said service routes and a target service route having a conflict with each of said service routes, further comprising:

5. A method according to claim 4 wherein said determining a route to be adjusted based on the respective route levels of two service routes in said service route conflict set, the number of conflicting intersections with other service routes in said plurality of service routes, and the distance from the starting point to the conflicting intersection of said two service routes comprises:

6. The method according to claim 4, wherein the adjusting the route to be adjusted according to the adjustment parameter of the route to be adjusted comprises:

7. The method of claim 6, further comprising:

8. The method according to any one of claims 4 to 7, wherein after the adjusting the route to be adjusted according to the adjustment parameter of the route to be adjusted, further comprising:

9. An apparatus for evaluating a service route, comprising:

10. A computing device, comprising:

a memory for storing program instructions;

a processor for calling program instructions stored in said memory to execute the method of any one of claims 1 to 8 in accordance with the obtained program.