CN114512011B - Emergency traffic method and system for congested road section based on ant colony algorithm - Google Patents

Emergency traffic method and system for congested road section based on ant colony algorithm Download PDF

Info

Publication number
CN114512011B
CN114512011B CN202210110715.7A CN202210110715A CN114512011B CN 114512011 B CN114512011 B CN 114512011B CN 202210110715 A CN202210110715 A CN 202210110715A CN 114512011 B CN114512011 B CN 114512011B
Authority
CN
China
Prior art keywords
emergency
path
vehicle
time
alarm
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202210110715.7A
Other languages
Chinese (zh)
Other versions
CN114512011A (en
Inventor
谭力江
杨霖
张彩霞
蔡岳城
李凯辉
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Guangdong Oking Information Industry Co ltd
Original Assignee
Guangdong Oking Information Industry Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Guangdong Oking Information Industry Co ltd filed Critical Guangdong Oking Information Industry Co ltd
Publication of CN114512011A publication Critical patent/CN114512011A/en
Application granted granted Critical
Publication of CN114512011B publication Critical patent/CN114512011B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/07—Controlling traffic signals
    • G08G1/087—Override of traffic control, e.g. by signal transmitted by an emergency vehicle
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computing arrangements based on biological models
    • G06N3/004—Artificial life, i.e. computing arrangements simulating life
    • G06N3/006—Artificial life, i.e. computing arrangements simulating life based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computing arrangements based on biological models
    • G06N3/12—Computing arrangements based on biological models using genetic models
    • G06N3/126—Evolutionary algorithms, e.g. genetic algorithms or genetic programming
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/10—Services
    • G06Q50/26—Government or public services
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/09—Arrangements for giving variable traffic instructions
    • G08G1/0962—Arrangements for giving variable traffic instructions having an indicator mounted inside the vehicle, e.g. giving voice messages
    • G08G1/0967—Systems involving transmission of highway information, e.g. weather, speed limits
    • G08G1/096733—Systems involving transmission of highway information, e.g. weather, speed limits where a selection of the information might take place
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02T—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
    • Y02T10/00—Road transport of goods or passengers
    • Y02T10/10—Internal combustion engine [ICE] based vehicles
    • Y02T10/40—Engine management systems

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Health & Medical Sciences (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Biophysics (AREA)
  • Human Resources & Organizations (AREA)
  • Tourism & Hospitality (AREA)
  • Strategic Management (AREA)
  • General Health & Medical Sciences (AREA)
  • Economics (AREA)
  • Computing Systems (AREA)
  • Mathematical Physics (AREA)
  • Evolutionary Biology (AREA)
  • Marketing (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Software Systems (AREA)
  • General Business, Economics & Management (AREA)
  • General Engineering & Computer Science (AREA)
  • Development Economics (AREA)
  • Artificial Intelligence (AREA)
  • Biomedical Technology (AREA)
  • Molecular Biology (AREA)
  • Computational Linguistics (AREA)
  • Data Mining & Analysis (AREA)
  • Evolutionary Computation (AREA)
  • Educational Administration (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Game Theory and Decision Science (AREA)
  • Emergency Management (AREA)
  • Atmospheric Sciences (AREA)
  • Primary Health Care (AREA)
  • Physiology (AREA)
  • Genetics & Genomics (AREA)
  • Traffic Control Systems (AREA)

Abstract

The application provides an ant colony algorithm-based emergency traffic method and system for a congested road section, and relates to the technical field of traffic scheduling. According to the alarm location, determining an alarm unit nearest to the alarm location, and determining the shortest alarm path used by the alarm unit by adopting an ant colony algorithm; setting a lane on the warning path as an emergency lane; determining alarm time, and sending avoidance information to a client corresponding to a vehicle owner of a vehicle on an alarm path in the alarm time; adopting an ant colony algorithm to plan an avoidance path which does not contain an emergency lane for a vehicle owner of the vehicle on the warning path; after the emergency vehicle passes through the warning path, the emergency lane is restored to lanes through which all vehicles can pass; according to the method and the device, the emergency vehicle can arrive at the site in the fastest time through reasonable path planning.

Description

Emergency traffic method and system for congested road section based on ant colony algorithm
Technical Field
The application relates to the technical field of traffic scheduling, but is not limited to, in particular to an ant colony algorithm-based emergency traffic method and system for a congested road section.
Background
With the development of urban, the living standard of people is improved, and the quantity of people-average automobiles is continuously increased. Many cities can meet the situation of traffic jam in a main road in rush hours every day, once a fire disaster or rescue tasks occur during rush hours, emergency vehicles also need to pass through the traffic jam road sections, under the situation that the traffic jam is even a matter of life, although a plurality of traffic lights are controlled to give emergency vehicles some rescue time at present, the method is not comprehensive enough, after all, people can pass through the most road sections or ordinary traffic light road sections, and even the road sections at the moment are like expressways, the possibility of changing the road to other roads is avoided, and the vehicles can only pass through long and long. The scheme that traffic police command vacates a road is adopted, and the implementation difficulty in areas with dense traffic is too high. If a lane is left for a long time, the road utilization rate is lower and the traffic speed is longer than that of a fleet under the condition of no emergency. The scheme that the emergency vehicle passes through the jammed road section based on the ant colony algorithm is provided by the author for solving the problem, the scheme is that the emergency vehicle is divided into lanes on the basis of the original road to be specially used as the emergency vehicle, the lane utilization rate of ordinary commute is maximized, and the lane can be rapidly and safely vacated to help the emergency vehicle arrive at the scene at the fastest speed to increase the success rate for completing the rescue task when the emergency vehicle arrives at the scene at the highest commute peak time.
Disclosure of Invention
The following is a summary of the subject matter described in detail herein. This summary is not intended to limit the scope of the claims.
The embodiment of the application provides an ant colony algorithm-based method and an ant colony algorithm-based system for emergency traffic of a congested road section, which can enable emergency vehicles to arrive at a site in the fastest time.
In a first aspect, an embodiment of the present application provides an emergency traffic method for a congested road section based on an ant colony algorithm, including:
step S100, emergency alarm information of a user is obtained, and an emergency vehicle of a corresponding type is dispatched according to the emergency alarm information; wherein the emergency alert information includes an alert type and an alert location;
step S200, determining an alarm unit nearest to an alarm place according to the alarm place, and determining the shortest alarm path used by the alarm unit by adopting an ant colony algorithm; setting a lane on the warning path as an emergency lane;
step S300, determining alarm time, and sending avoidance information to a client corresponding to a vehicle owner of a vehicle on an alarm path in the alarm time;
step S400, adopting an ant colony algorithm to plan an avoidance path which does not contain an emergency lane for a vehicle owner on the warning path;
and S500, after the emergency vehicle passes through the warning path, restoring the emergency lane to the lane where all vehicles can pass.
In some embodiments, in step S200, the determining, according to the alert location, the alert unit nearest to the alert location includes: when the accident place is determined, the vehicle sending support is carried out according to the thermodynamic diagram of the vehicle provided by the electronic map and the police dispatch unit with the shortest time for selecting the passable distance.
In some embodiments, the step S200 includes:
step S210, listing improved information heuristic factors according to the weight relation between the shortest path cost and the actual vehicle-plugging time cost;
step S220, the improved pheromone concentration updating method is obtained according to the weight relation.
In some embodiments, the step S400 includes:
step S410, the weight ratio of time in the tabu list is reduced according to the actual vehicle-plugging time proportion, and the shortest path proportion is increased;
step S420, setting the tabu table of ants as n-1 lanes;
step S430, adopting the updated tabu list to plan an avoidance path which does not contain an emergency lane for the vehicle owner on the warning path.
In a second aspect, an embodiment of the present application further provides an emergency traffic system for a congested road section based on an ant colony algorithm, including: the system comprises a memory, a processor and a computer program stored on the memory and capable of running on the processor, wherein the processor realizes the method for emergency traffic on the congested road section based on the ant colony algorithm according to the first aspect when executing the computer program.
In a third aspect, embodiments of the present application further provide a computer-readable storage medium storing computer-executable instructions for performing the method for emergency traffic on a congested road segment based on the ant colony algorithm according to the first aspect.
Additional features and advantages of the application will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by practice of the application. The objectives and other advantages of the application will be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.
Drawings
The accompanying drawings are included to provide a further understanding of the technical aspects of the present application, and are incorporated in and constitute a part of this specification, illustrate the technical aspects of the present application and together with the examples of the present application, and not constitute a limitation of the technical aspects of the present application.
Fig. 1 is a flowchart of a congestion road section emergency passing method based on an ant colony algorithm according to an embodiment of the present application;
fig. 2 is a block diagram of an emergency traffic system for a congested road segment based on an ant colony algorithm according to an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application will be further described in detail with reference to the accompanying drawings and examples. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the present application.
It should be noted that although functional block division is performed in a device diagram and a logic sequence is shown in a flowchart, in some cases, the steps shown or described may be performed in a different order than the block division in the device, or in the flowchart. The terms first, second and the like in the description, in the claims and in the above-described figures, are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order.
The invention provides an ant colony algorithm framework, which is characterized in that firstly, a vehicle thermodynamic diagram provided by an electronic map and the time spent for predicting a certain congestion road section are combined, and then, an ant tabu table is modified by combining information provided by a wind direction diagram and an interviewee, wherein the ant tabu table is different from the traditional ant colony algorithm in that the shortest path is selected, and the shortest path is the optimal path. Because of the particularity of the emergency situation, the route with the highest priority is selected to be the shortest route, when the ordinary private car on the congested road receives the signal sent by the emergency car through the congested road, the temporary emergency lane is shielded from passing and the arrival time of the emergency car is used as the tabu list of the ant colony of the other system, and the temporary emergency lane is preferably set out 30 seconds before the emergency car comes, so that the emergency car can pass quickly, and the time is strived for rescue. The invention enables emergency vehicles to arrive at the scene in the fastest time.
As shown in fig. 1, fig. 1 is a flowchart of a method for emergency traffic on a congested road segment according to an embodiment of the present application, where the method includes, but is not limited to, the following steps:
step S100, emergency alarm information of a user is obtained, and an emergency vehicle of a corresponding type is dispatched according to the emergency alarm information; wherein the emergency alert information includes an alert type and an alert location;
illustratively, after the emergency rescue center receives the call, the current location of the caller and the wounded person, the accident type, the wounded condition, etc. described by the caller are recorded. The specific dispatching situation dispatches the ambulance according to the traffic accident; if there is a fire, the fire engine is dispatched from the fire department.
Step S200, determining an alarm unit nearest to an alarm place according to the alarm place, and determining the shortest alarm path used by the alarm unit by adopting an ant colony algorithm; setting a lane on the warning path as an emergency lane;
step S300, determining alarm time, and sending avoidance information to a client corresponding to a vehicle owner of a vehicle on an alarm path in the alarm time;
in the step, reminding the car owners who are about to pass through the warning road section that emergency vehicles pass through the road section, and guiding the car owners not to walk on a temporary emergency lane;
step S400, adopting an ant colony algorithm to plan an avoidance path which does not contain an emergency lane for a vehicle owner on the warning path;
specifically, the car to be passed through reminds the car owner section of the ordinary car that emergency vehicles pass through in a certain limited period, detours or original routes are selected to pass through, and if detours are selected, a route which does not pass through the temporary emergency lane is planned to pass through, and the time is relatively short. And if the original road is selected to pass, avoiding the temporary emergency lane to walk. The car owner of the ordinary car receives the information and avoids the emergency lane, so that the car on the temporary emergency lane is emptied in the fastest time;
and S500, after the emergency vehicle passes through the warning path, restoring the emergency lane to the lane where all vehicles can pass.
Specifically, after the emergency vehicle passes through, the emergency lane is canceled, and the jammed road section can be immediately restored to a full lane passing state, so that the maximum lane passing capacity is achieved, and the jam degree is reduced.
In addition, in an embodiment, in step S200, the determining, according to the alert location, the alert unit nearest to the alert location includes, but is not limited to, the following steps:
when the accident place is determined, the vehicle sending support is carried out according to the thermodynamic diagram of the vehicle provided by the electronic map and the police dispatch unit with the shortest time for selecting the passable distance.
It should be noted that, when a fire comes, a real-time wind pattern needs to be considered; if the rescue task is carried out, the ambulance also needs to consider the illness state of the wounded person, and the wounded person can go to the hospital with the appropriate wounded person level nearby to more accurately arrive at the help-seeking place. The electronic map provides the urban real-time vehicle thermodynamic diagram and path, synthesizes the weather wind diagram or other information, limits the conditions by matching with the genetic algorithm, synthesizes the weather wind diagram or other information, and gives the shortest path for reaching the accident site.
Since the modified ant colony algorithm is applied, the modified ant colony algorithm will be described below.
Considering the path and the actual time of the stop, the weight coefficient between the two satisfies the following formula (1):
μ+ν＝1 (1)；
wherein μ is a ratio of a difference between the current path and the shortest path to the shortest path; v is the ratio of actual time to one hour.
During the entire travel of the emergency vehicle, congestion is taken into account with the shortest possible distance. The optimization objective function is described by the following formula (2):
Figure BDA0003494993230000031
in the formula (2), when S is the total usage, T i Is node i transit time, T j Is the time of vehicle stop, T minh Is the shortest time to stop a car between connected nodes, M j Is the cost of time for stoppering M minh Is the minimum cost of time to plug traffic between connected nodes.
There are essential parameters in the ant colony algorithm, such as: if the information heuristic factor is too small, the residual pheromone on each path is excessive, so that invalid paths are continuously searched, and the convergence rate of the algorithm is affected; if the information heuristic is too large, the invalid path can be searched, but the valid path cannot be guaranteed to be abandoned, and the searching of the optimal value is affected. The improved ant colony algorithm is a relational expression for obtaining improved information heuristic factors under the limit condition of integrating time and paths, and the relational expression is as follows:
Figure BDA0003494993230000041
in addition, the pheromone updating method is improved. The concentration of pheromone is closely related to the value of heuristic factors. In the process of updating the pheromone concentration, if the heuristic factor is too small, the concentration of the path pheromone which is not selected yet is reduced to zero rapidly; if the heuristic factor is too large, the algorithm convergence speed is too slow, and the improved pheromone concentration updating method is described as the following formula (4):
Figure BDA0003494993230000042
in the formula (4), the amino acid sequence of the compound,
Figure BDA0003494993230000043
a direct proportional function is shown with respect to the number of iterations g, the value of which increases with increasing number of iterations g.
In addition, in one embodiment, the step S200 includes, but is not limited to, the following steps:
step S210, listing improved information heuristic factors according to the weight relation between the shortest path cost and the actual vehicle-plugging time cost;
according to the accident place, a corresponding emergency vehicle is dispatched from the nearest police dispatch unit nearby, and the conventional ant colony algorithm realizes the selection of the shortest path through a positive feedback mechanism by using a heuristic function of a target with the shortest distance. However, the shortest time is taken as the highest priority, and in general, the shortest distance of the vehicle without the vehicle and the shortest time of the vehicle with the vehicle in the actual vehicle are in conflict, so that in order to balance the two points, the ant colony algorithm of the vehicle is improved to match with the optimization method.
Step S220, the improved pheromone concentration updating method is obtained according to the weight relation.
Setting initial parameters of an initial ant colony algorithm, wherein the initial parameters comprise: the starting node is the alarm unit, the target node, the ant colony scale, the maximum iteration number, the initial pheromone concentration, the heuristic factor, the information factor and the tabu list; the target node, namely the target site, the ant colony scale is set to 100 according to the ideal value range, the maximum iteration number is set to 200, the initial pheromone concentration, the heuristic factor, the information factor and the tabu list.
Step 2.1: for vehicles on an emergency lane where the emergency vehicle is to travel, a tabu list is modified, and the traveling direction of each vehicle is calculated through an ant colony algorithm.
It should be noted that the tabu table is a basic concept in the ant colony algorithm, and refers to a node which is recorded and stored and has been selected by the ant in the iterative process of the ant colony algorithm, and the node is characterized in that the ant is not allowed to select in the subsequent path selection. The invention is based on the shortest-time purpose to reach the same place, because the corkscrew is likely to be either the theoretical shortest path or the shortest-time path. For this purpose, the traffic lights of the present invention should give a green light for a long period of time in the congested road section, while the lane where the emergency vehicle is to pass should give a threshold of time for the vehicle in the lane, leaving the lane for a certain time to give temporary passage of the emergency vehicle. The first is to drive off the road section as soon as possible near the road section leaving the congestion section, and the second is to merge into the other lane for a defined time in the middle of the congestion section leaving the current section.
The temporary emergency lane and the time of the emergency vehicle reaching the road section are taken as limiting conditions through the improved genetic algorithm, so that the temporary emergency lane can be quickly and orderly yielded. The following is an explanation of the improved ant colony algorithm.
Step 2.2: an improved pheromone concentration updating method is obtained according to the formula (1).
μ=0.5, v=0.5, the choice of path and the time to stop the car are balanced as required for emergency situations.
In addition, in one embodiment, the step S400 includes, but is not limited to, the following steps:
step S410, the weight ratio of time in the tabu list is reduced according to the actual vehicle-plugging time proportion, and the shortest path proportion is increased;
the time is the maximum priority, so the weight ratio is adjusted, the actual time of the vehicle stop is reduced, and the shortest path is increased.
Step S420, setting the tabu table of ants as n-1 lanes;
step S430, adopting the updated tabu list to plan an avoidance path which does not contain an emergency lane for the vehicle owner on the warning path.
The vehicles on the blocked temporary emergency lane need to be reserved with a temporary emergency lane as soon as possible, so that emergency vehicles can be supplied. The invention takes every 1 meter of each lane of the whole congestion road section as a node, and changes each node of the preset temporary emergency lane into a node which is not allowed to be selected any more when receiving the information of the temporary emergency lane to be completed, thereby modifying the tabu list. In addition, the vehicles running on the temporary emergency lane can be combined into other lanes or leave the congestion road section or the traffic light is in a long proportion time through the setting of the ant colony algorithm of the system, so that the vehicles can pass faster.
In addition, referring to fig. 2, an embodiment of the present application further provides an emergency traffic system for a congested road segment based on an ant colony algorithm, where the emergency traffic system for a congested road segment based on the ant colony algorithm includes: memory 11, processor 12, and a computer program stored on memory 11 and executable on processor 12.
The processor 12 and the memory 11 may be connected by a bus or other means.
The non-transitory software program and instructions required to implement the ant colony algorithm-based congestion section emergency pass method of the above embodiment are stored in the memory 11, and when executed by the processor 12, the ant colony algorithm-based congestion section emergency pass method of the above embodiment is executed.
Furthermore, an embodiment of the present application provides a computer-readable storage medium storing computer-executable instructions that are executed by a processor or a controller, for example, by one of the processors in the embodiment of the ant colony algorithm-based congestion section emergency traffic system, so that the processor executes the ant colony algorithm-based congestion section emergency traffic method in the embodiment.
Those of ordinary skill in the art will appreciate that all or some of the steps, systems, and methods described above may be implemented as software, firmware, hardware, and any suitable combination thereof. Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on computer readable media, which may include computer storage media (or non-transitory media) and communication media (or transitory media). The term computer storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data, as known to those skilled in the art. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital Versatile Disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by a computer. Furthermore, as is well known to those of ordinary skill in the art, communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media.
While the preferred embodiments of the present application have been described in detail, the present application is not limited to the above embodiments, and various equivalent modifications and substitutions can be made by those skilled in the art without departing from the spirit of the present application, and these equivalent modifications and substitutions are intended to be included in the scope of the present application as defined in the appended claims.

Claims (4)

1. An ant colony algorithm-based emergency traffic method for a congested road section is characterized by comprising the following steps of:
step S100, emergency alarm information of a user is obtained, and an emergency vehicle of a corresponding type is dispatched according to the emergency alarm information; wherein the emergency alert information includes an alert type and an alert location;
step S200, determining an alarm unit nearest to an alarm place according to the alarm place, and determining the shortest alarm path used by the alarm unit by adopting an ant colony algorithm; setting a lane on the warning path as an emergency lane;
step S300, determining alarm time, and sending avoidance information to a client corresponding to a vehicle owner of a vehicle on an alarm path in the alarm time;
step S400, adopting an ant colony algorithm to plan an avoidance path which does not contain an emergency lane for a vehicle owner on the warning path;
step S500, after the emergency vehicle passes through the warning path, restoring all lanes which can be used for passing through by the emergency vehicle;
in step S200, the determining, according to the alert location, the alert unit nearest to the alert location includes:
when the accident place is determined, the vehicle sending support is carried out according to the vehicle thermodynamic diagram provided by the electronic map and the police dispatch unit with the shortest time for selecting the passable distance;
the step S200 includes:
step S210, listing improved information heuristic factors according to the weight relation between the shortest path cost and the actual vehicle-plugging time cost;
step S220, a pheromone concentration updating method is obtained after the improvement according to the weight relation;
considering the path and the actual time of the stop, the weight coefficient between the two satisfies the following formula (1):
μ+γ＝1 (1)；
wherein μ is a ratio of a difference between the current path and the shortest path to the shortest path; gamma is the ratio of actual time to one hour;
in the whole emergency vehicle driving process, the congestion is considered to follow the shortest distance as possible; the optimization objective function is described by the following formula (2):
Figure FDA0004065905390000011
in the formula (2), when S is the total usage, T i Is node i transit time, T j Is the time of vehicle stop, T minh Is the shortest time to stop a car between connected nodes, M j Is the cost of time for stoppering M minh Is the minimum cost of time to plug traffic between the connected nodes;
there are essential parameters in the ant colony algorithm, such as: if the information heuristic factor is too small, the residual pheromone on each path is excessive, so that invalid paths are continuously searched, and the convergence rate of the algorithm is affected; if the information heuristic factor is too large, the invalid path can be searched, but the effective path cannot be guaranteed to be abandoned, and the searching of the optimal value is influenced; the improved ant colony algorithm is a relational expression for obtaining improved information heuristic factors under the limit condition of integrating time and paths, and the relational expression is as follows:
Figure FDA0004065905390000012
besides, the pheromone updating method is improved, the concentration of the pheromone is closely related to the value of the heuristic factor, and if the value of the heuristic factor is too small in the pheromone concentration updating process, the concentration of the path pheromone which is not selected yet is reduced to zero rapidly; if the heuristic factor is too large, the algorithm convergence speed is too slow, and the improved pheromone concentration updating method is described as the following formula (4):
Figure FDA0004065905390000021
in the formula (4), the amino acid sequence of the compound,
Figure FDA0004065905390000022
a direct proportional function is shown with respect to the number of iterations g, the value of which increases with increasing number of iterations g.
2. The method for emergency traffic on congested road segments of claim 1, wherein said step S400 includes:
step S410, the weight ratio of time in the tabu list is reduced according to the actual vehicle-plugging time proportion, and the shortest path proportion is increased;
step S420, setting the tabu table of ants as n-1 lanes;
step S430, adopting the updated tabu list to plan an avoidance path which does not contain an emergency lane for the vehicle owner on the warning path.
3. An ant colony algorithm-based emergency traffic system for a congested road section, comprising: a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the method for emergency traffic on congested road segments based on the ant colony algorithm according to any one of claims 1 to 2 when executing the computer program.
4. A computer-readable storage medium storing computer-executable instructions for performing the ant colony algorithm-based congestion road segment emergency passing method according to any one of claims 1 to 2.
CN202210110715.7A 2021-12-31 2022-01-29 Emergency traffic method and system for congested road section based on ant colony algorithm Active CN114512011B (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202111675534 2021-12-31
CN2021116755340 2021-12-31

Publications (2)

Publication Number Publication Date
CN114512011A CN114512011A (en) 2022-05-17
CN114512011B true CN114512011B (en) 2023-05-19

Family

ID=81551071

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210110715.7A Active CN114512011B (en) 2021-12-31 2022-01-29 Emergency traffic method and system for congested road section based on ant colony algorithm

Country Status (1)

Country Link
CN (1) CN114512011B (en)

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101493329B (en) * 2008-01-23 2011-04-27 华东师范大学 Multiple target point path planning method and device
CN106200650A (en) * 2016-09-22 2016-12-07 江苏理工学院 Mobile robot path planning method and system based on improved ant colony algorithm
CN111968396A (en) * 2020-08-22 2020-11-20 刘秀萍 Emergency rescue vehicle driving optimization method driven by intelligent Internet of vehicles
CN112146673B (en) * 2020-09-27 2022-07-22 浙江综合交通大数据中心有限公司 Expressway multipoint collaborative rescue path planning method based on improved ant colony algorithm
CN112525211B (en) * 2020-11-26 2023-06-09 陕西合友网络科技有限公司 Emergency vehicle navigation system and navigation method based on big data
CN113433940A (en) * 2021-06-28 2021-09-24 北京辰安科技股份有限公司 Ant colony algorithm-based emergency material transportation path planning method and device
CN113762598B (en) * 2021-08-05 2023-08-04 同济大学 Comprehensive transportation hub emergency evacuation vehicle path planning method

Also Published As

Publication number Publication date
CN114512011A (en) 2022-05-17

Similar Documents

Publication Publication Date Title
US12086752B2 (en) Dynamic multi-vehicle mixed-fleet route optimization and sequencing with advanced constraints
US12025449B2 (en) Dynamically determining origin and destination locations for a network system
US10032367B2 (en) Management of mobile objects and service platform for mobile objects
US9857191B2 (en) Context-based routing and access path selection
CN109949604B (en) Large parking lot scheduling navigation method and system
US20200309543A1 (en) Monitoring autonomous vehicle route conformance for improved efficiency
US8504295B2 (en) Preserving assigned carpools after a cancellation
US9805598B2 (en) Management of mobile objects
RU2563104C2 (en) Delivery, processing and updating of new map information
US20220044198A1 (en) Method and apparatus for dynamic load selection and parking calculation for last mile delivery
US10540895B2 (en) Management of mobile objects
CN110954119B (en) Urban road motor vehicle optimal route induction method based on big data
WO2013117410A2 (en) Method and system for routing using uncertainty data
CN113811832B (en) Real-time optimization of autonomous vehicle routes
CN112669642A (en) Dynamic path planning algorithm and system based on passing time and vehicle speed prediction
CN111047880B (en) Traffic control method and device for road network, storage medium and management equipment
CN114512011B (en) Emergency traffic method and system for congested road section based on ant colony algorithm
CN115938150A (en) Algorithm for optimizing utilization
EP4016415A1 (en) Deployment of autonomous vehicles
CN114264313A (en) Potential energy-based lane-level path planning method, system, equipment and storage medium
WO2022003847A1 (en) Travel plan creation device and travel plan creation method
CN114185341A (en) Unmanned vehicle path planning method, device and computer readable storage medium
Malowidzki et al. Traffic Routes for Emergency Services
CN114964285A (en) Navigation method, system, equipment and storage medium based on dynamic waiting area
CN113033847A (en) Scheduling operation system, scheduling operation method, vehicle travel method, and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant