CN110298491A - A kind of transportation network node selecting method based on slime mould swarm intelligence - Google Patents
A kind of transportation network node selecting method based on slime mould swarm intelligence Download PDFInfo
- Publication number
- CN110298491A CN110298491A CN201910482230.9A CN201910482230A CN110298491A CN 110298491 A CN110298491 A CN 110298491A CN 201910482230 A CN201910482230 A CN 201910482230A CN 110298491 A CN110298491 A CN 110298491A
- Authority
- CN
- China
- Prior art keywords
- node
- slime mould
- slime
- individual
- transportation network
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 83
- 235000013305 food Nutrition 0.000 claims abstract description 113
- 238000005457 optimization Methods 0.000 claims abstract description 48
- 241000224016 Plasmodium Species 0.000 claims abstract description 31
- 238000004891 communication Methods 0.000 claims abstract description 15
- 239000004459 forage Substances 0.000 claims abstract description 15
- 230000035699 permeability Effects 0.000 claims abstract description 15
- 230000008569 process Effects 0.000 claims abstract description 15
- 239000011159 matrix material Substances 0.000 claims description 37
- 239000000126 substance Substances 0.000 claims description 31
- 208000037805 labour Diseases 0.000 claims description 28
- 230000006399 behavior Effects 0.000 claims description 24
- 230000006870 function Effects 0.000 claims description 21
- 238000004422 calculation algorithm Methods 0.000 claims description 15
- 238000013439 planning Methods 0.000 claims description 13
- 230000005540 biological transmission Effects 0.000 claims description 11
- 238000009826 distribution Methods 0.000 claims description 11
- 230000000694 effects Effects 0.000 claims description 7
- 239000000463 material Substances 0.000 claims description 7
- 230000010339 dilation Effects 0.000 claims description 5
- 238000011156 evaluation Methods 0.000 claims description 5
- 238000004364 calculation method Methods 0.000 claims description 4
- 230000008859 change Effects 0.000 claims description 4
- 239000003550 marker Substances 0.000 claims description 3
- 230000001473 noxious effect Effects 0.000 claims description 3
- 239000002245 particle Substances 0.000 claims description 3
- 238000004088 simulation Methods 0.000 claims description 3
- 238000006424 Flood reaction Methods 0.000 claims description 2
- 230000003542 behavioural effect Effects 0.000 claims description 2
- 210000004027 cell Anatomy 0.000 claims 3
- 210000000805 cytoplasm Anatomy 0.000 claims 1
- 239000011664 nicotinic acid Substances 0.000 abstract description 6
- 238000011160 research Methods 0.000 description 11
- 238000006243 chemical reaction Methods 0.000 description 5
- 238000002474 experimental method Methods 0.000 description 5
- 230000007246 mechanism Effects 0.000 description 4
- 238000013473 artificial intelligence Methods 0.000 description 3
- 238000005094 computer simulation Methods 0.000 description 3
- 238000010801 machine learning Methods 0.000 description 3
- 239000000203 mixture Substances 0.000 description 3
- 210000003097 mucus Anatomy 0.000 description 3
- 241000894006 Bacteria Species 0.000 description 2
- XEEYBQQBJWHFJM-UHFFFAOYSA-N Iron Chemical compound [Fe] XEEYBQQBJWHFJM-UHFFFAOYSA-N 0.000 description 2
- 230000003592 biomimetic effect Effects 0.000 description 2
- 238000010276 construction Methods 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 238000013401 experimental design Methods 0.000 description 2
- 230000019637 foraging behavior Effects 0.000 description 2
- 238000013178 mathematical model Methods 0.000 description 2
- 235000015097 nutrients Nutrition 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 150000003839 salts Chemical class 0.000 description 2
- 238000012360 testing method Methods 0.000 description 2
- PXFBZOLANLWPMH-UHFFFAOYSA-N 16-Epiaffinine Natural products C1C(C2=CC=CC=C2N2)=C2C(=O)CC2C(=CC)CN(C)C1C2CO PXFBZOLANLWPMH-UHFFFAOYSA-N 0.000 description 1
- 206010000060 Abdominal distension Diseases 0.000 description 1
- 206010033799 Paralysis Diseases 0.000 description 1
- 230000002776 aggregation Effects 0.000 description 1
- 238000004220 aggregation Methods 0.000 description 1
- 206010002320 anencephaly Diseases 0.000 description 1
- 238000005842 biochemical reaction Methods 0.000 description 1
- 210000004556 brain Anatomy 0.000 description 1
- 238000004140 cleaning Methods 0.000 description 1
- 230000006378 damage Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 235000013399 edible fruits Nutrition 0.000 description 1
- 230000010429 evolutionary process Effects 0.000 description 1
- 238000009472 formulation Methods 0.000 description 1
- 229910052742 iron Inorganic materials 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 230000013011 mating Effects 0.000 description 1
- 230000003278 mimic effect Effects 0.000 description 1
- 235000001968 nicotinic acid Nutrition 0.000 description 1
- 235000016709 nutrition Nutrition 0.000 description 1
- 230000035764 nutrition Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 238000012805 post-processing Methods 0.000 description 1
- 238000013139 quantization Methods 0.000 description 1
- 230000001105 regulatory effect Effects 0.000 description 1
- 238000010187 selection method Methods 0.000 description 1
- 238000012384 transportation and delivery Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Classifications
-
- 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
- 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
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Tourism & Hospitality (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- General Health & Medical Sciences (AREA)
- Health & Medical Sciences (AREA)
- Software Systems (AREA)
- Biophysics (AREA)
- General Engineering & Computer Science (AREA)
- Computing Systems (AREA)
- Molecular Biology (AREA)
- Evolutionary Computation (AREA)
- Data Mining & Analysis (AREA)
- Computational Linguistics (AREA)
- Game Theory and Decision Science (AREA)
- Mathematical Physics (AREA)
- Entrepreneurship & Innovation (AREA)
- Biomedical Technology (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Artificial Intelligence (AREA)
- Life Sciences & Earth Sciences (AREA)
- Educational Administration (AREA)
- Primary Health Care (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
A kind of transportation network node selecting method based on slime mould swarm intelligence, the method optimizes transportation network node using the behavior of slime mould swarm intelligence, importance ranking and optimization layout are carried out to transportation network node, multiple transportation network nodes are modeled to multiple external sources of food, link in transportation network between two nodes is imitated into myxamoeba, transportation network is modeled to cover the slime mould group plasmodium of all external sources of food, communications and transportation is modeled to nutriment in slime mould group carrier, transportation network node optimization problem is modeled to slime mould forage network optimization problem.This bionic method can efficiently complete the solution of the node importance sequence and node select permeability of multinode transportation network, save the problem of social cost improves resource utilization, simplifies researcher and solve process.
Description
Technical field
The invention belongs to computer bionics field, specifically a kind of transportation network node based on slime mould swarm intelligence
Selection method.
Background technique
Network of communication lines planning and design problem can be classical traveling salesman problem (Traveling Salesman with naturalization
Problem, TSP), and it is translated into salesman problem, traveling salesman problem.Earliest TSP problem is studied using mathematical model be
Merrill M.Flood, he in the 1930s, mathematically solve the problems, such as a school bus route planning for the first time.Problem can
To be described as, it is assumed that as soon as there is a travelling salesman to go over n city, it is primary that walking path must traverse each city, and most
Original city of setting out is returned to afterwards, and the optimal scheme of total path may be selected to the greatest extent in travelling salesman.Traveling salesman problem proposes existing a century
Long, it is that a kind of np complete problem (NP-Complete or NPC) or NP are difficult that domestic and international scientist, which tends to receive traveling salesman problem,
Inscribe (NP-Hard or NPH), efficient algorithm be not present, and think to have many examples (such as transportation network) of multiple nodes all without
Method is solved using exact algorithm, can only use approximate optimization algorithm.
Transportation network can successively select different nodes to constitute different topology structures as needed, but different node selection and
Different topological structures its robustness when facing different destructions is but different.For example, a small number of important nodes once fail or
By calculated attack, transportation network is easy to paralyse rapidly, so how to select the important node in network significant.Accordingly,
Domestic and international large quantities of scholars are caused to study importance and the influence power sequence of network node.Relevant research achievement is not
It can only be used to the selection of transportation network node, can also be applied to the information spread speed, again for having important individual in research social networks
Want the selection of device node to avoid the important node control etc. in cascading failure, epidemic transmission.Current all kinds of researchs are calculated
Method still lacks efficient solution method, and usual needle of existing network node Selecting research when solving network node select permeability
To the attribute of node itself, the influence with neighbor node and Lian Bian is not accounted for yet, has ignored the position of node in a network yet
Influence to different degree.
This part thing had taken a turn for the better suddenly before 9 years.2010, scientist Atsushi Tero of Hokkaido, Japan university etc.
People publishes thesis on " Science " periodical and uses slime mould solution path planning problem for the first time, local using culture dish in experiment
Figure, using oatmeal as city, allows slime mould in painted on top Tokyo railroad map.Experimental result shows, what slime mould was made
The railway network that the Tokyo railway network and the mankind make is extremely similar.
It is also earliest most complicated one of the railway system that the Tokyo railway system, which is in human history, is connected for the first time in 1872
Tokyo and Yokohama two big city.Later, the mankind have spent the years up to a hundred go planning, construction, rebuild and optimize, Tokyo iron
Road system is just optimized to the appearance of today, however slime mould has only spent 26 hours, has just obtained same efficient optimum results.
More surprising to be, it is original that slime mould is very low etc., because its brain does not all have, and the Tokyo railway system scheme that it is solved, it is several
The optimization network obtained with the next continuous trial and error of Human Centenary and reconstruction is just the same.Moreover, slime mould can also be tried repeatedly
Mistake obtains Different Optimization scheme.
The research real origin of slime mould optimization algorithm was in 2010.Same year, the Andrew of West of England
Similar research has also been made in professor Adamatzky, depicts 14 national highways using oatmeal and slime mould (slime mold)
Net.It finds that the result that Belgium, the freeway net of Canada and China and slime mould calculate is the most similar, and beautiful after studying
The network of communication lines efficiency in state and Africa is minimum.Over nearly 9 years, many scholars for studying transportation network optimization problem begin to pay attention to
It is solved to slime mould.2014, Xiaoge Zhang et al. delivered an improved slime mould algorithm paper.In an experiment, exist
The food oatmeal of slime mould is placed in labyrinth outlet and inlet, and the path for having length different between entrance and exit can connect at two
Food source.Then, slime mould is put into labyrinth, slime mould can finally find labyrinth outlet, and whole process spends 96 hours.
Slime mould individual is naturally exactly the multiple-limb myxamoeba structure with nucleus node, by slime mould group
The division of labor and cooperation are particularly suitable for solving the selection of transportation network node and network optimization problem.Document above is using true glutinous
Bacterium solves problem, although there is some advantages, also there is many disadvantages.
First, time long (such as Atsushi Tero et al. the research achievement spent using true slime mould Solve problems
In 26 hours, 96 hours in Xiaoge Zhang et al. research achievement).Second, directly needing profession using slime mould Solve problems
Biology technical ability and profession facility, place, equipment, this is that many researchers are lacked.Third, culture slime mould solves
The precision of problem is also not high enough, is essentially all to use culture dish as map and use oatmeal particle as node, culture
Ware space is limited and oatmeal volume is larger, in addition the influence of culture solution, it is clear that limit solving precision.Fourth, cultivation slime mould
Also need to occupy valuable room and time and manpower, mating complex environment adjustment equipment, nutrition and moisture content supply, before experiment
Growing environment control, experimental design, data processing and experiment after cleaning require to spend cost and professional operation.
With the extensive use of computer and the research of computer bionic Algorithm, the behavior of slime mould forage is based on to use
Computer bionic method solve transportation network node select permeability and provide possibility, but up to the present, in the market with it is all kinds of
Still a kind of transportation network node selecting method based on slime mould swarm intelligence is not found in document.
Summary of the invention
The present invention is studied based on mathematics and physical model and proposes a kind of transportation network based on slime mould swarm intelligence
Node selecting method.This method has imitated scientific law of unicellular slime mould group during looking for food, it is established that with biology
With the slime mould forage Model for Movement Law based on mathematical theory, transportation network node select permeability is described as more foods
Slime mould forage problem in the case of source node.This method can be used in transportation network node select permeability, computer network
Optimization problem, social networks and social event emergency processing problem are strict with especially while having to robustness and cost
Network planning issue etc. solution, select calculation method, slime mould group bionic Algorithm compared to current widely applied node
There are the advantages such as speed is fast, at low cost, robustness is good in problem solving process, and pass through computer mimic biology group intelligence
The complexity that problem solving is carried out using true slime mould group can be greatly reduced.
The invention adopts the following technical scheme:
A kind of transportation network node selecting method based on slime mould swarm intelligence, the method use slime mould swarm intelligence row
To be optimized to transportation network node, importance ranking is carried out to transportation network node and optimization is laid out, by multiple networks of communication lines
Network node is modeled to multiple external sources of food, and the link in transportation network between two nodes is imitated into myxamoeba, will be handed over
Open network is modeled to cover the slime mould group plasmodium of all external sources of food, and communications and transportation is modeled to slime mould group carrier
Transportation network node optimization problem is modeled to slime mould forage network optimization problem by interior nutriment；Specific optimization method
The following steps are included:
Step 1 is that slime mould group divides the work the stage, simulates the division of labor behavior of slime mould group activity, and each slime mould individual is random
It is distributed on different external sources of food nodes, each slime mould individual is voluntarily divided the work, and plasmodium is carried out on respective present position
Dilation procedure completion is looked for food, and different slime mould individuals can share mutually the food source node identification found and transmission link letter
Breath, i.e. transportation network are covered using the geographical location of different slime mould individuals to be selected in all external sources of food, that is, solution spaces as far as possible
The transportation network node selected；
Step 2 is the stage of slime mould group cooperation, imitates the cooperation behavior of slime mould group activity, and each slime mould individual exists
Constantly moved on transportation network node and select new external sources of food node, so as under conditions of the constraint of idiotrophic substance with
Most food is fed in shortest path, and the myxamoeba of different slime mould groups can intersect, merges, shrink；To in outside
More slime mould individual is assembled in the more position of food source, can be identified as in slime mould individual compared with the transportation network node of concentration higher
Priority or importance；Assemble less slime mould individual in the less position of external sources of food, in the less friendship of slime mould individual
Open network node can be identified as lower priority or importance；All slime mould individuals are formed to be arranged by transportation network node importance
Sequence and the optimal traffic network structure constituted utilize different slime moulds with highest efficiency transmission external sources of food as far as possible
The concentration degree of body solves the sequence of transportation network node importance and optimal topological layout.
Preferably, slime mould group corresponds to the feasible solution set of node select permeability；Slime mould individual is selected corresponding to node
The single feasible solution of problem；The nucleus of each slime mould corresponds to the transportation network node in single solution, i.e., individual searches most
Excellent Xie Jiedian；The constraint of slime mould individual idiotrophic substance corresponds to the search range individually solved；Slime mould group plasmodium corresponds to
Transportation network；External sources of food corresponds to transportation network node to be selected in solution space；Non-food source corresponds to transportation network
In infeasible node or region；Myxamoeba corresponds to the link in transportation network between each node；Slime mould distribution density pair
It should be assessed in the different degree of transportation network；Nutriment corresponds to communications and transportation in slime mould group carrier；The shifting of slime mould individual
It is dynamic to correspond to the search individually solved；The division of labor of slime mould group corresponds to distributed searching transportation network node；The cooperation pair of slime mould group
It should be in transportation network node evaluation and importance ranking；The objective function that slime mould group shares out the work and help one another is with optimal topological structure
External sources of food is maximumlly obtained, the target corresponding to transportation network is maximumlly met with optimal topological structure
The trip demand of different importance nodes；Crossover operation corresponds to when different feasible solutions are found by slime mould group with certain general
Rate is contacted and is transmitted message；Union operation, which corresponds to when feasible solution is found by slime mould group, can share network node and transport
Link；Shrinkage operation corresponds to the myxamoeba of slime mould group and reduces connection, Optimizing Transport link with certain ratio；
In the step 1 slime mould group division of labor stage, the nucleus of each slime mould individual is randomly distributed in different transportation network sections
On point, each slime mould individual, which voluntarily divides the work to expand everywhere centered on respective nucleus, finds new transportation network node, note
The transportation network node that the myxamoeba of the nucleus coordinate matrix and each slime mould individual of recording each slime mould individual searches out
Number and its corresponding coordinate；And different degree square of the slime mould numbers matrix as the node is established to each node of transportation network
Battle array, the i.e. node importance of transportation network depend on the slime mould individual amount or nucleus amount fed on the node, in traffic
Transportation network node is ranked up when the network planning with reference to the different degree matrix, and according to different degree matrix to topological structure into
Row reasonably optimizing；Slime mould is an expansion structure centered on nucleus, the slime mould quantity on the node actually include with
The information of neighbor nodes and its length information being connected with neighbor node that the node is connected；In pitch point importance matrix
Value it is bigger, show that the node is more important, i.e., the node connection neighbor node it is more, and to neighbor node distance it is shorter；
Conversely, the value is smaller, show that the node is more inessential, i.e. the neighbor node of node connection is fewer, and is connected with neighbor node
Distance it is longer.
It is further preferred that the division of labor stage includes three sub-steps:
Sub-step 1-1: slime mould Population Initialization initializes the digraph Graph=(Node, Edge) of problem to be solved；
Wherein, Node=[Nodei]n=[(xi,yi)]nIt indicates to include the coordinate matrix for sharing n node in transportation network, n indicates to hand over
The node total number of open network digraph Graph, NodeiIndicate i-th of node in transportation network digraph Graph, (xi,yi) table
Show transportation network node NodeiAbscissa and ordinate；Edge={ Edgeij| i, j ∈ n } indicate node between connection structure
At side matrix, EdgeijIndicate node NodeiAnd NodejBetween side；The length matrix or euclidean distance between node pair square on side between node
Matrix representation isDistanceijIt indicates
Node NodeiAnd NodejBetween side EdgeijLength | Edgeij|；The side n (n-1) is up between n node of matrix, then institute
There is the average value of euclidean distance between node pair to be expressed asThis method uses probabilistic search method, produces
Raw m (m >=n) slime mould individual, m indicate slime mould individual sum；The nucleus of each slime mould is randomly placed in transportation network difference
On node, i.e. each slime mould individual k (k=1,2 ..., m) nucleus coordinate is Node matrix random value RAND { (xk,yk)∈
Node | k=1,2 ..., m }, RAND indicates that random function, k indicate slime mould individual serial number；
Sub-step 1-2: the division of labor of slime mould group is looked for food, and transportation network imitates the behavior of slime mould forage, each slime mould individual
Plasmodium constantly carries out dilation procedure from the near to the distant centered on nucleus, by fixed or adjustable under the constraint of idiotrophic substance
Search radius find the transportation network node on periphery as far as possible, kth (k=1,2 ..., m) the search radius of a slime mould individual
It is expressed as Radiusk, average distance generally higher than between node isSuch as
Fruit RadiuskLarger, then the search range of slime mould individual is larger, it is possible to find more transportation network nodes, and different slime moulds
Overlapping possibility between individual is also bigger；If RadiuskSmaller, then the search range of slime mould individual is smaller, the traffic found
Network node may be less, and the overlapping possibility between slime mould individual is also smaller；The division of labor of slime mould group is looked for food, and operate must be each
It carries out from around the node where nucleus, and is carried out under the limitation of idiotrophic substance, and be unable to infinite extension；
A slime mould individual abscissa of kth (k=1,2 ..., m) and ordinate are expressed as (xk,yk), in week after search
While finding CountkA transportation network node, CountkIndicate the neighbor node that a slime mould individual of kth (k=1,2 ..., m) is found
Sum then forms a traversal periphery CountkThe feed network of a transportation network node；A slime mould of kth (k=1,2 ..., m)
Individual feed network representation beThen its total length for feeding network is expressed asWherein, CountkIllustrate a slime mould individual institute of kth (k=1,2 ..., m)
In the centrad of node, it is clear that the centrad of a node is bigger, CountkIt is bigger, illustrate what the node can directly affect
Neighbor node is also more, has more preferably importance；LengthkIllustrate a slime mould individual institute of kth (k=1,2 ..., m)
In the tightness of node and neighbor node, that is, define a node to neighbor node how far, it is clear that node it is tight
Density is bigger, LengthkJust smaller, the neighbor node for illustrating that the node can directly affect is also closer, has and more preferably weighs
The property wanted；Further, comprehensive Countk>=0, Lengthk>=0, slime mould individual is as much as possible with shortest path in the division of labor is looked for food
Find more network nodes, can define kth (k=1,2 ..., m) objective function of a slime mould individual be Subfunk=
Countk/Lengthk(Lengthk≠ 0) or Subfunk=0 (Lengthk=0).
Sub-step 1-3: slime mould group sharing information, slime mould group plasmodium may be looked in process of expansion from inside to outside
Food source has been arrived, calibration has been made to its position, and other slime moulds individual is passed information to by myxamoeba, is slime mould group
The cooperation stage of next step gets ready, so that other slime mould individuals are mobile and feed；Slime mould group plasmodium is in process of expansion
In, it is also possible to food source is not found, or encounters non-food source, such as noxious material, non-affinity substance etc., then slime mould group
Node and region, marker location information simultaneously pass to other slime moulds by myxamoeba where body plasmodium needs to leave the substance
Individual, slime mould group will not enter back into the region.
Wherein, cause some slime mould individuals to be overlapped because sharing certain traffic links, be not repeated when calculating total length
It calculates, transportation network length required by the division of labor stage is the shortest path for traversing all nodes；Due to this algorithm solution procedure with
Primary condition is unrelated, can be each node Node=[Nodei]n=(xi,yi)]nInitialization different degree matrix W eight (0)=
[Weighti(0)]n, wherein Weighti(0) the slime mould individual of random distribution on a node of i-th (i=1,2 ..., n) is indicated just
Beginning quantity, i.e. slime mould individual cells nuclear volume, because having overlapping between the myxamoeba of slime mould individual, by transportation network section
The different degree of point is randomly initialized as slime mould individual cells nuclear volume.
Preferably, step 2 is the stage of slime mould group cooperation, after m slime mould individual resultant force digests n network node
Nutriment, i.e. object of transport is shipped back m node by traffic link；Every slime mould individual is moved everywhere with certain probability
It is dynamic, it is intended to more network nodes be found with the smallest feed distance, after often finding a feed network solution, need to assess the solution
Degree of optimization, and determined whether to stay in the node according to assessment result；The movement of slime mould group has study property, should learn
This slime mould individual is currently located network node information, also to learn the network node information passed over from neighbours slime mould, according to
The case where individual study and neighbor learning, calculates next step up to the probability of network node, and realizes further movement by probability,
It is reciprocal according to this；Finally, entire transportation network forms the topological structure with different slime mould distribution densities, obtain close with slime mould
The network node importance ranking indicated is spent as a result, and reasonably selecting node according to the importance sorting result to construct optimal friendship
Open network.
It is further preferred that the cooperation stage includes three sub-steps；
Sub-step 2-1: slime mould population evaluation, in this sub-steps, using distributed computing method, all slime mould individuals are needed
It to be assessed according to the node location locating for oneself, continue to look for food to determine whether to leave the node；Assuming that current time is
T, kth (k=1,2 ..., m) a slime mould individual coordinate be Nodek(t)=(xk(t),yk(t)), the objective function of slime mould individual
Value is Subfunk(t)；The current desired positions that the individual is found are expressed asCorresponding mesh
Offer of tender numerical value is expressed asThe current desired positions that entire slime mould group is found are expressed asCorresponding target function value is expressed asAccording to assessment result, then slime mould is individual
Optimal location updates are as follows:
Sub-step 2-2: slime mould team learning, in this sub-steps, using probabilistic search method, slime mould individual passes through study
The information that oneself past experience and other slime mould individuals are shared, updates the node location locating for oneself: on the one hand, slime mould
Network structure of the body according to locating for oneself, with individual learning probability Probabilityk1(t) myxamoeba searches self for study
Network node information, and be moved to next network node, attempt to find more preferably or prior network node, that is, have
There is the position of more neighboring network nodes, and from neighboring network node closer proximity, Probabilityk1(t) kth (k is indicated
=1,2 ..., m) study of a slime mould individual quality probability；On the other hand, slime mould individual also passes through myxamoeba and neighbours are glutinous
Intersection, merging, the shrinkage operation of bacterium individual, with neighbor learning probability P robabilityk2(t) learn farther neighbours slime mould
Look for food information and the network node information of body, for being selected when oneself movement, Probabilityk2(t) indicate kth (k=1,
2 ..., m) a slime mould individual study neighbours probability；The learning algorithm of slime mould individual k (k=1,2 ..., m) is as follows:
Sub-step 2-3: pitch point importance sequence, in this sub-steps, on the one hand, have around insignificant network node
Lower network node density and slime mould population density, and the slime mould with the continuous movement of slime mould group, on the part of nodes
Individual will be fewer and fewer, whenever there is a slime mould individual to leave, then has Weighti(t)=Weighti(t)-1；On the other hand, exist
Important network node nearby has more neighboring network node, and with the continuous movement of slime mould group, critical network section
Slime mould individual on point will be more and more, whenever there is a slime mould individual to enter the node, then have Weighti(t)=Weighti
(t)+1, and slime mould individual k (k=1,2 ..., it is m) mobile every time after calculate oneself objective function, be Subfunk
(t)=Countk(t)/Lengthk(t)(Lengthk) or Subfun (t) ≠ 0k(t)=0 (Lengthk(t)=0)；
Settable termination condition is the number of iterations, or fitness value meets scheduled error amount every time, such as not up to terminates
Condition, then return to sub-step 2-1 and sub-step 2-2 is constantly updated；By the continuous movement of slime mould group, the entire network of communication lines
Different nodes just have accumulated the slime mould individual cells core of different number on network；When meeting termination condition, can provide entire
The pitch point importance of network sorts:
RANK{Node1,...,Nodei,Nodei+1,...,|Nodei∈Node,and Weighti≤Weighti+1,
Wherein, RANK indicates pitch point importance ranking functions；When carrying out Transportation Network Planning, user can be according to being acquired
Pitch point importance ranking results successively select suitable network node, thus optimize transportation network layout and topological structure.
It is further preferred that including multiple external sources of food, multiple slime mould plasmodiums, multiple myxamoebas, multiple slime moulds
Nucleus, multiple endotrophic substances；There are three types of modes for operation between slime mould individual: first is that crossover operation, i.e., different slime moulds
Message is contacted and transmitted with certain probability by myxamoeba (transport link) between individual；Second is that union operation, i.e., not
Network node and transport link can be shared with slime mould individual, consolidated network node is fed jointly, and uses same conveyer chain
The defeated nutriment of road transport；Third is that shrinkage operation, i.e., the myxamoeba between different slime moulds are individual is reduced with certain ratio to be contacted, simulation
Endotrophic substance is absorbed the process of consumption by oneself plasmodium or neighbours' slime mould individual in slime mould individual；It therefore, can basis
The relation intensity of slime mould individual provides the information of transportation network node, provides foundation for slime mould movement.
A kind of transportation network node selecting method based on slime mould swarm intelligence, has the advantages that
(1) theory significance
1) it is theoretical computer bionic optimization has been expanded
The present invention is located at the infall of biological subject and Computer Subject, excellent in conjunction with the foraging behavior of slime mould group and path
Change principle solving transportation network node select permeability, based on Optimum Theory, self-organization theory, biobehavioral is theoretical, molecule is raw
It is theoretical to form the computer bionic optimization based on slime mould forage behavior for object, parallel computation theory, quantum-mechanical theory etc.
With knowledge hierarchy, it is possible to form a completely new swarm intelligence field and bionical ambit.
2) biobehavioral theory has been expanded
Rigorous mathematical theory and physics principle are introduced biological behavioristics by the present invention, deeply excavate and do not have large-brained stick
The internal mechanism of flora body foraging behavior, and for solving transportation network node select permeability, it establishes than more complete slime mould group
Body is looked for food the mathematical model of biological behaviour, and quantization, formulation, the slime mould forage rule of axiomatization and new bio are provided
Intelligence computation method.
3) artificial intelligence and machine Learning Theory have been expanded
The present invention is totally different from traditional artificial intelligence and machine learning reason when solving transportation network node select permeability
By process and sharing out the work and help one another by looking for food for anencephaly slime mould group, the trial and error repeatedly of complex network, study and optimal can be completed
Change, to provide new research method tool for artificial intelligence theory and machine Learning Theory.
(2) practice significance and application prospect
1) it saves social cost and improves resource utilization
Traditional transportation network node selection and topological optimization generally require the planning repeatedly of the mankind, newly-built and reconstruction, tear open
It moves and optimizes, these work are time-consuming and laborious, are also easy to waste a large amount of social cost.Traditional Transportation Network Planning and optimization institute
Caused by traffic congestion, construction is changed its course and removal problem also easily interferes the people's livelihood, or even cause Mass disturbance.This
Invention, which is formed by achievement, will be helpful to improve the efficiency of transportation network node selection and topological optimization, reduce unnecessary society
Cost payout.
2) solution of a variety of optimization problems is efficiently completed
The present invention is used not only for the optimization problem of the selection of transportation network node or similar network, also can be imitative as other
Raw algorithm equally optimizes, based on state by solving more complicated TSP problem, multi-objective optimization question, computer network and cloud computing
The very important decision optimization of the people's livelihood, social groups' network optimization, network public-opinion and the management of group emergency event, fire/floods/ground
Escape, wisdom traffic, self-organizing behavioral study of complication system etc. are shaken, application practice has a extensive future.
3) the problem of simplifying researcher solves process
The present invention only needs a computer that can emulate slime mould forage behavior, quickly acquires the selection of complex network node
The optimal solution of problem and other optimization problems, the slime mould group being related to when eliminating using true slime mould group Solve problems are supported
Grow, experimental design, biology operation, experiment post-processing etc. caused by various problems, greatly facilitate all kinds of researchs and ask
Topic solves.
Detailed description of the invention
Fig. 1 is slime mould group biomimetic features figure of the invention；
Fig. 2 is flow chart of the method for the present invention；
Fig. 3 is one embodiment that the present invention finds all external sources of food；
Fig. 4 is the scheme 1 that the present invention forms optimal feed network.
Fig. 5 is the scheme 2 that the present invention forms optimal feed network
Specific embodiment
Combined with specific embodiments below, further details of elaboration is made to the present invention, but embodiments of the present invention are not
It is confined to the range of embodiment expression.These embodiments are merely to illustrate the present invention, range and is not intended to limit the present invention.
Embodiment 1
As shown in Figure 1, for slime mould group used in a kind of transportation network node selecting method based on slime mould swarm intelligence
Biomimetic features figure, the method optimizes transportation network node using the behavior of slime mould swarm intelligence, to transportation network node
Importance ranking and optimization layout are carried out, multiple transportation network nodes are modeled to multiple external sources of food, it will be in transportation network
Link between two nodes is imitated into myxamoeba, and transportation network is modeled to cover the slime mould group of all external sources of food
Communications and transportation is modeled to nutriment in slime mould group carrier, transportation network node optimization problem is modeled to by plasmodium
Slime mould forage network optimization problem；
Preferably, slime mould group corresponds to the feasible solution set of node select permeability；Slime mould individual is selected corresponding to node
The single feasible solution of problem；The nucleus of each slime mould corresponds to the transportation network node in single solution, i.e., individual searches most
Excellent Xie Jiedian；The constraint of slime mould individual idiotrophic substance corresponds to the search range individually solved；Slime mould group plasmodium corresponds to
Transportation network；External sources of food corresponds to transportation network node to be selected in solution space；Non-food source corresponds to transportation network
In infeasible node or region；Myxamoeba corresponds to the link in transportation network between each node；Slime mould distribution density pair
It should be assessed in the different degree of transportation network；Nutriment corresponds to communications and transportation in slime mould group carrier；The shifting of slime mould individual
It is dynamic to correspond to the search individually solved；The division of labor of slime mould group corresponds to distributed searching transportation network node；The cooperation pair of slime mould group
It should be in transportation network node evaluation and importance ranking；The objective function that slime mould group shares out the work and help one another is with optimal topological structure
External sources of food is maximumlly obtained, the target corresponding to transportation network is maximumlly met with optimal topological structure
The trip demand of different importance nodes；Crossover operation corresponds to when different feasible solutions are found by slime mould group with certain general
Rate is contacted and is transmitted message；Union operation, which corresponds to when feasible solution is found by slime mould group, can share network node and transport
Link；Shrinkage operation corresponds to the myxamoeba of slime mould group and reduces connection, Optimizing Transport link with certain ratio.
This method imitates different slime mould individuals in slime mould population model using transportation network and was looking for food in solution procedure
The division of labor and cooperation in journey, mainly complete following function:
1, using the topology optimization problem of the Assembling Behavior simulation transportation network node select permeability of looking for food of slime mould group.With
The selection of transportation network node is similar with topological optimization, and the activity of slime mould group search of food is that multiple slime mould plasmodiums are shared out the work and helped one another
On the basis of group behavior.In the method, transportation network is imitated to the organism group for becoming multiple slime moulds composition, the network of communication lines
The topological structure of network imitates the topological structure of slime mould forage network, is voluntarily divided the work just by slime mould group according to food source distance
Nearly finding nearby food, to find most external sources of food with the smallest cost.Therefore, it was being looked for food by slime mould group
Assembling Behavior in journey is easy to that people is helped to select important node and optimization network topology structure.Further, transportation network
The different stress reactions that slime mould group generates the external sources of food of different compatibilities or non-food source can be imitated, that is, are surrounded outer
Portion's food source is to feed, and leaves non-food source；Further, transportation network can imitate slime mould group in sharing out the work and help one another
Different stress reactions, that is, intersect, merge, shrink.
2, slime mould group is imitated using transportation network node confirm food node.The expansion of transportation network node has been imitated glutinous
The food and non-food object that flora body plasmodium is encountered when finding external sources of food, such as inorganic matter, salt and other plasmodiums.
Different substances is different from compatibility when slime mould population exposed, and slime mould passes through very long evolutionary process, has had been provided with and has passed through
Compatibility identifies the ability of different material.In the method, transportation network node can imitate slime mould group plasmodium and stick
Deformable body judges that the feature of food and non-food, transportation network can also imitate point of slime mould group by compatibility and biochemical reaction
Work cooperation and external sources of food is shared, slime mould group is expanded or shunk nearby by shared information, to surround external food
Source and the region for leaving no food source or non-food source.
3, the movement and housing choice behavior for imitating slime mould group on topological node are shunk using transportation network.Transportation network is received
It shortens optimal topological structure into and has imitated the probability search process that slime mould group plasmodium finds external sources of food, and is shared outer
The behavior of portion's food source and transportation network, so that multiple slime moulds commonly through feed network sharing and digest and assimilate external food
Source, and transported nutriment in ex vivo with optimal channel design.During the entire process of the feed of slime mould group, endotrophic
Substance can the merging out of some aethalium through myxamoeba be flowed into another aethalium, realize transportation network letter
Shared and traffic link more slime moulds of breath are multiplexed.
4, it imitates slime mould group and transmits topology information using endotrophic substance.This method has imitated slime mould forage mistake
Information transmission and shared mechanism in journey, are not only able to recycle most effective food delivery network (nutrient concentrations
It is high), moreover it is possible to it is marked on unsuccessful route with chemical substance (such as mucus).On the one hand, this method has imitated slime mould group
The information transmission mechanism looked for food when expanding, as without discovery external sources of food on the path explored, plasmodium and glutinous
Deformable body will be shunk, and leave chemical substance (such as compatibility bad mucus), and the myxamoeba of other slime moulds touches
The abdominal distension is voluntarily shunk, promote all slime mould groups plasmodium and myxamoeba by the region that do not explored to other (such as
No mucus) it expands, expanded scope continually looks for external sources of food.On the other hand, this method has been imitated the feed of slime mould group and has been shunk
When information transmission mechanism convert endotrophic matter transportation for external sources of food if having found external sources of food
In ex vivo, the concentration for transporting internal nutriment on the route of nutriment is higher than peripheral region, and all slime mould groups can
Shared transport link, and be further retracted on the higher transit route of endotrophic material concentration.New outside is arrived when exploring
When food source, the myxamoeba transit route that slime mould group can have been formed using other slime moulds as far as possible, such important node
Positive feedback will be further obtained with nutrient concentrations in the myxamoeba on important transportation route to reinforce.
As shown in Fig. 2, being a kind of method flow diagram of transportation network node selecting method based on slime mould swarm intelligence, tool
Body optimization method the following steps are included:
Step 1 is that slime mould group divides the work the stage, simulates the division of labor behavior of slime mould group activity, method flow as shown in Figure 2
Figure includes three sub-steps, i.e. sub-step 1-1, sub-step 1-2, sub-step 1-3 altogether；Each slime mould individual is randomly distributed in not
On same external sources of food node, each slime mould individual is voluntarily divided the work, and plasmodium dilation procedure is carried out on respective present position
Completion is looked for food, and different slime mould individuals can share mutually the food source node identification found and transmission link information, i.e. traffic
Network covers traffic to be selected in all external sources of food i.e. solution space using the geographical location of different slime mould individuals as far as possible
Network node；
Step 2 is the stage of slime mould group cooperation, imitates the cooperation behavior of slime mould group activity, method stream as shown in Figure 2
Cheng Tu includes three sub-steps, i.e. sub-step 2-1, sub-step 2-2, sub-step 2-3 altogether；Each slime mould individual is in transportation network
Constantly moved on node and select new external sources of food node, so as under conditions of the constraint of idiotrophic substance with shortest road
Diameter feeds most food, and the myxamoeba of different slime mould groups can intersect, merges, shrink；To external sources of food compared with
More slime mould individual is assembled in more positions, can be identified as higher priority compared with the transportation network node of concentration in slime mould individual
Or importance；Assemble less slime mould individual in the less position of external sources of food, in the less transportation network section of slime mould individual
Point can be identified as lower priority or importance；All slime mould individuals, which are formed, to be sorted and is constituted by transportation network node importance
Optimal traffic network structure, with highest efficiency transmission external sources of food, i.e., as far as possible utilize different slime mould individuals concentration
Degree solves the sequence of transportation network node importance and optimal topological layout.
As shown in figure 3, finding an implementation of all external sources of food the division of labor stage for step 1 slime mould of the present invention group
Example；In the step 1 slime mould group division of labor stage, the nucleus of each slime mould individual is randomly distributed on different transportation network nodes,
Each slime mould individual, which voluntarily divides the work to expand everywhere centered on respective nucleus, finds new transportation network node, and record is each
Transportation network node number that the nucleus coordinate matrix of slime mould individual and the myxamoeba of each slime mould individual search out and
Its corresponding coordinate；And different degree matrix of the slime mould numbers matrix as the node is established to each node of transportation network, that is, it hands over
The node importance of open network depends on the slime mould individual amount or nucleus amount fed on the node, in Transportation Network Planning
When transportation network node is ranked up with reference to the different degree matrix, and according to different degree matrix topological structure is carried out rationally excellent
Change；As shown in figure 3, finding one embodiment of all external sources of food for the present invention；Slime mould is one centered on nucleus
Expansion structure, the slime mould quantity on the node actually include the information of neighbor nodes being connected with the node and its with
The length information that neighbor node is connected；Value in pitch point importance matrix is bigger, shows that the node is more important, i.e., the node connects
The neighbor node connect is more, and shorter to the distance of neighbor node；Conversely, the value is smaller, show that the node is more inessential, i.e., should
Node connection neighbor node it is fewer, and with neighbor node be connected at a distance from it is longer.
It is further preferred that the division of labor stage include three sub-steps, i.e. sub-step 1-1, sub-step 1-2, sub-step 1-3:
Sub-step 1-1: slime mould Population Initialization, including sub-step 1-1a, 1-1b, 1-1c, 1-1d.
Sub-step 1-1a: the digraph Graph=(Node, Edge) of problem to be solved is initialized, wherein including the network of communication lines
Network node shares the coordinate matrix N ode=[Node of n nodei]n=[(xi,yi)]n, as shown in figure 3, including in embodiment
33 nodes；
Sub-step 1-1b: the connection between node constitutes side matrix Edge={ Edgeij| i, j ∈ n }, side between node
Length matrix or euclidean distance between node pair matrix
The side n (n-1) is up between n node；
Sub-step 1-1c: the average value for calculating all euclidean distance between node pair isSuch as figure
Shown in 3,33 nodes share 33 × 32 sides in embodiment；
Sub-step 1-1d: this method uses probabilistic search method, m (m >=n) slime mould individual is generated, by the thin of each slime mould
Karyon is randomly placed on transportation network difference node, i.e. and each slime mould individual k (k=1,2 ..., m) nucleus coordinate is
Node matrix random value RAND { (xk,yk) ∈ Node | k=1,2 ..., m }；As shown in figure 3, using 40 slime moulds in embodiment
Composition group is randomly distributed on 33 nodes；
Sub-step 1-2: the division of labor of slime mould group is looked for food, including sub-step 1-2a, 1-2b, 1-2c, 1-2d.
Sub-step 1-2a: transportation network imitates the behavior of slime mould forage, and each slime mould individual plasmodium is with nucleus
Center constantly carries out dilation procedure from the near to the distant, under the constraint of idiotrophic substance as far as possible by fixed or adjustable search radius
The transportation network node for finding periphery, as shown in figure 3,40 slime moulds scan on 33 nodes respectively in embodiment；Kth
The search radius Radius of (k=1,2 ..., m) a slime mould individualkAverage distance generally higher than between node isIf RadiuskLarger, then the search range of slime mould individual is larger, has
More transportation network nodes may be found, and the overlapping possibility between different slime mould individuals is also bigger；If RadiuskIt is smaller,
Then the search range of slime mould individual is smaller, and the transportation network node found may be less, the overlapping possibility between slime mould individual
It is smaller；The division of labor of slime mould group, which is looked for food, to be operated and must carry out around the node where respective nucleus, and in idiotrophic
It is carried out under the limitation of substance, and is unable to infinite extension；As shown in figure 3,40 slime moulds are respectively with Radius in embodimentkIt is searched
Rope；
Sub-step 1-2b: a slime mould individual coordinate of kth (k=1,2 ..., m) is (xk,yk), it is looked for after search on periphery
To CountkA transportation network node then forms a traversal periphery CountkThe feed network of a transportation network node, i.e. network
Node is
Sub-step 1-2c: calculate feed network total length beSuch as Fig. 3
Shown, the transportation network node that 40 slime moulds are found on periphery in embodiment is different, and the slime mould individual at figure center is easier
Find more transportation network nodes；Wherein, CountkIllustrate a slime mould individual neighbor node of kth (k=1,2 ..., m)
Number defines the centrad of a node, it is clear that the centrad of a node is bigger, CountkIt is bigger, illustrate the section
The neighbor node that point can directly affect is also more, has more preferably importance；LengthkIllustrate kth (k=1,
2 ..., the m) tightness of a slime mould individual and neighbor node, that is, a node is defined to neighbor node how far, it is clear that
The tightness of one node is bigger, LengthkJust smaller, the neighbor node for illustrating that the node can directly affect is also closer,
With more preferably importance；
Sub-step 1-2d: further, comprehensive Countk>=0, Lengthk>=0, slime mould individual is looked in the division of labor as much as possible
More network nodes are found with shortest path in food, the objective function that can calculate slime mould individual is Subfunk=Countk/
Lengthk(Lengthk≠ 0) or Subfunk=0 (Lengthk=0).
Sub-step 1-3: slime mould group sharing information, including sub-step 1-3a, 1-3b, 1-3c.
Sub-step 1-3a: slime mould group plasmodium may have found food source in process of expansion from inside to outside, to its position
It sets and makes calibration, and other slime moulds individual is passed information to by myxamoeba, be the cooperation stage of slime mould group next step
It gets ready, so that other slime mould individuals are mobile and feed；Slime mould group plasmodium is in process of expansion, it is also possible to not find
Food source, or encounter non-food source, such as noxious material, non-affinity substance etc., then slime mould group plasmodium needs leave
Node and region where the substance, marker location information simultaneously pass to other slime moulds individual by myxamoeba, and slime mould group will
The region is not entered back into.As shown in figure 3,40 slime moulds share oneself find transportation network nodal information respectively in the present embodiment,
The information of 33 nodes can be for known to other slime moulds individual；
Sub-step 1-3b: where cause some slime mould individuals to be overlapped because sharing certain traffic links, calculating total length
When be not repeated to calculate, transportation network length required by the division of labor stage is the shortest path for traversing all nodes；
Sub-step 1-3c: can be each node Node=[Node since this algorithm solution procedure is unrelated with primary conditioni]n=
(xi,yi)]nInitialize different degree matrix W eight (0)=[Weighti(0)]n, wherein Weighti(0) for i-th (i=1,
2 ..., n) on a node random distribution slime mould individual initial number, i.e. slime mould individual cells nuclear volume, because slime mould is individual
Myxamoeba between have overlapping, therefore the different degree of transportation network node is randomly initialized as slime mould individual cells nucleus number
Amount；As shown in figure 3,40 slime moulds pass through all 33 nodes of least connection type connection in embodiment；
Preferably, step 2 is the stage of slime mould group cooperation, after m slime mould individual resultant force digests n network node
Nutriment, i.e. object of transport is shipped back m node by traffic link；As shown in figure 4, forming optimal feed for the present invention
0 slime mould of embodiment Isosorbide-5-Nitrae of network is cooperated respectively on 33 nodes；Every slime mould individual is moved everywhere with certain probability
It is dynamic, it is intended to more network nodes be found with the smallest feed distance, after often finding a feed network solution, need to assess the solution
Degree of optimization, and determined whether to stay in the node according to assessment result；The movement of slime mould group has study property, should learn
This slime mould individual is currently located network node information, also to learn the network node information passed over from neighbours slime mould, according to
The case where individual study and neighbor learning, calculates next step up to the probability of network node, and realizes further movement by probability,
It is reciprocal according to this；Finally, entire transportation network forms the topological structure with different slime mould distribution densities, obtain close with slime mould
The network node importance ranking indicated is spent as a result, and reasonably selecting node according to the importance sorting result to construct optimal friendship
Open network；As shown in figure 5, forming optimal 2,40 slime moulds of scheme for feeding network on 33 nodes due to aggregation for the present invention
Degree is different and causes different node connectivities different, and the connection of more important node and neighbor node is more.
It is further preferred that the cooperation stage includes three sub-steps, i.e. sub-step 2-1, sub-step 2-2, sub-step 2-3.
Sub-step 2-1: slime mould population evaluation, including sub-step 2-1a, 2-1b, 2-1c, 2-1d, 2-1e, 2-1f.
Sub-step 2-1a, in this sub-steps, using distributed computing method, all slime mould individual needs are according to oneself institute
The node location at place is assessed, and continues to look for food to determine whether to leave the node；As shown in figure 4, being formed for the present invention optimal
0 slime mould of scheme Isosorbide-5-Nitrae for feeding network carries out distributed computing on 33 different nodes respectively, compared with Fig. 3, different slime moulds
The concentration class of individual is varied, and more slime mould individuals are had accumulated on important core node, more with the connection of neighbor node；
Assuming that current time be t, kth (k=1,2 ..., m) a slime mould individual coordinate be Nodek(t)=(xk(t),yk(t)), slime mould
The target function value of individual is Subfunk(t)；
Sub-step 2-1b, calculating the current desired positions that the individual is found is
Sub-step 2-1c, calculating corresponding target function value is
Sub-step 2-1d, calculating the current desired positions that entire slime mould group is found is
Sub-step 2-1e, calculating corresponding target function value is
Sub-step 2-1f: according to assessment result, then slime mould personal best particle updates are as follows:
Sub-step 2-2: slime mould team learning, including sub-step 2-2a, 2-2b.
Sub-step 2-2a, in this sub-steps, using probabilistic search method, slime mould individual is by learning oneself past warp
It tests and information that other slime mould individuals are shared, update the node location locating for oneself: on the one hand, slime mould individual is according to oneself institute
The network structure at place, with individual learning probability Probabilityk1(t) the study network node that myxamoeba searches self letter
Breath, and is moved to next network node, attempts to find more preferably or prior network node, that is, has more neighbours' nets
The position of network node, and from neighboring network node closer proximity；On the other hand, slime mould individual also passes through myxamoeba and neighbours
Intersection, merging, the shrinkage operation of slime mould individual, with neighbor learning probability P robabilityk2(t) learn farther neighbours slime mould
Look for food information and the network node information of individual, for being selected when oneself movement；
Sub-step 2-2b, according to learning algorithm calculate slime mould individual k (k=1,2 ..., position m):
Sub-step 2-3: pitch point importance sequence, including sub-step 2-3a, 2-3b, 2-3c, 2-3d, 2-3e, 2-3f.
Sub-step 2-3a, in this sub-steps, on the one hand, there is lower network node around insignificant network node
Density and slime mould population density, and with the continuous movement of slime mould group, the slime mould individual on the part of nodes will be fewer and fewer,
Whenever there is a slime mould individual to leave, then there is Weighti(t)=Weighti(t)-1；
On the other hand sub-step 2-3b has a more neighboring network node near important network node, and with
The continuous movement of slime mould group, the slime mould individual on critical network node will be more and more, whenever there is a slime mould individual to enter
The node, then have Weighti(t)=Weighti(t)+1；
Sub-step 2-3c, and slime mould individual k (k=1,2 ..., it is m) mobile every time after calculate oneself target letter
Number is Subfunk(t)=Countk(t)/Lengthk(t)(Lengthk) or Subfun (t) ≠ 0k(t)=0 (Lengthk(t)
=0)；
Sub-step 2-3d, settable termination condition are the number of iterations, or fitness value meets scheduled error amount every time, such as
Not up to termination condition, then return to sub-step 2-1 and sub-step 2-2 is constantly updated；
Sub-step 2-3e, by the continuous movement of slime mould group, different nodes just have accumulated difference in entire transportation network
The slime mould individual cells core of quantity；When meeting termination condition, the pitch point importance sequence of whole network can be provided:
RANK{Node1,...,Nodei,Nodei+1,...,|Nodei∈Node,and Weighti≤Weighti+1}
Sub-step 2-3f exports solving result, as shown in figure 5, the scheme 2 of optimal feed network is formed for the present invention, with
The scheme 1 of optimal feed network in Fig. 4 is compared, and is formd more between important network node and the node of surrounding in Fig. 5
Connection, slime mould group significantly built up on prior node and on core node it is more, with contacting also more for neighbor node
It is more；When carrying out Transportation Network Planning, user can successively select suitable net according to obtained pitch point importance ranking results
Network node, to optimize transportation network layout and topological structure.
Fig. 3 is one embodiment that the present invention finds all external sources of food.As it can be seen that Computer Simulation is only used only in Fig. 3
Mode just preferably simulate the behavior that the mankind select transportation network node, acquired results optimize many years very close to the mankind
The Tokyo railway topological structure just obtained, and the transportation network topological structure formed in relation to scholar using true slime mould.It uses
This method has shortest total connection path, and important node selection is rationally and connection is reliable, the simplicity and robust of topological structure
Property obtained fine optimization, solve that calculate the time short, and this method solution efficiency is higher than true slime mould.
Fig. 4 is the scheme 1 that the present invention forms optimal feed network.As it can be seen that the mode of Computer Simulation is only used only just in Fig. 4
The transportation network with redundancy formed when preferably simulating true slime mould trial and error, when the variation of network node different degree,
Slime mould group can reappraise according to the importance of different nodes and optimize network topology structure, while make important network section
Point has higher redundancy, and the distribution solution calculating time is short, and solution efficiency is higher than true slime mould.
Fig. 5 is the scheme 2 that the present invention forms optimal feed network.As it can be seen that the mode of Computer Simulation is only used only just in Fig. 5
The transportation network with redundancy formed when preferably simulating true slime mould trial and error, when the variation of network node different degree,
Slime mould group can reappraise according to the importance of different nodes and optimize network topology structure, important core node and neighbour
Redundancy with higher when node is connected is occupied, this algorithm solution calculating time is short, and solution efficiency is higher than true slime mould.
As shown in the embodiment of Fig. 3, Fig. 4, Fig. 5, the method when solving transportation network node select permeability well
It simulates the Assembling Behavior of true slime mould group and shares out the work and help one another behavior when encountering different network nodes (external sources of food),
Slime mould group can reasonably select important node, and continuous trial and error, generate different open up by regulating networks link connection mode
Structure is flutterred to imitate the division of labor behavior of slime mould group and movement of looking for food.The method can also imitate true slime mould group in reality
Stress reaction caused by various chemical substances, such as inorganic matter, the non-food substance such as salt can be encountered under environment.It is described
Method can be all-network node and link establishment taboo list and compatibility matrix, can imitate and be likely to occur the affine of substance
Property feature, classifies to different external sources of food and non-food source material property, simulates slime mould group and encountering these
Stress reaction when substance, these reactions can influence last route line decision.This method is suitble to solve simultaneously to cost and Shandong
Stick has the transportation network node select permeability of strict demand, can calculate link cost and redundancy for different topology structure
Degree, and pass through test repeatedly and trial and error, eventually form satisfactory optimal transportation network topological structure.
Claims (8)
1. a kind of transportation network node selecting method based on slime mould swarm intelligence, which is characterized in that the method uses slime mould
Swarm intelligence behavior optimizes transportation network node, carries out importance ranking to transportation network node and optimization is laid out, will
Multiple transportation network nodes are modeled to multiple external sources of food, and the link in transportation network between two nodes is imitated into glutinous change
Transportation network is modeled to cover the slime mould group plasmodium of all external sources of food, communications and transportation is modeled to slime mould by body
Transportation network node optimization problem is modeled to slime mould forage network optimization problem by nutriment in group's carrier；Tool
Body optimization method the following steps are included:
Step 1 is that slime mould group divides the work the stage, simulates the division of labor behavior of slime mould group activity, each slime mould individual random distribution
In on different external sources of food nodes, each slime mould individual is voluntarily divided the work, and plasmodium expansion is carried out on respective present position
Operation is completed to look for food, and different slime mould individuals can share mutually the food source node identification found and transmission link information, i.e.,
Transportation network is covered using the geographical location of different slime mould individuals to be selected in all external sources of food i.e. solution space as far as possible
Transportation network node；
Step 2 is the stage of slime mould group cooperation, imitates the cooperation behavior of slime mould group activity, each slime mould individual is in traffic
Constantly moved on network node and select new external sources of food node, so as under conditions of the constraint of idiotrophic substance with most short
Path feed most food, the myxamoeba of different slime mould groups can intersect, merges, shrink；To in external food
More slime mould individual is assembled in the more position in source, can be identified as in slime mould individual compared with the transportation network node of concentration higher excellent
First grade or importance；Assemble less slime mould individual in the less position of external sources of food, in the less network of communication lines of slime mould individual
Network node can be identified as lower priority or importance；All slime mould individuals formed by the sequence of transportation network node importance and
The optimal traffic network structure constituted utilizes the concentration degree of different slime mould individuals with highest efficiency transmission external sources of food
Solve the sequence of transportation network node importance and optimal topological layout.
2. the optimization method of the transportation network node according to claim 1 based on slime mould swarm intelligence, which is characterized in that
Slime mould group corresponds to the feasible solution set of node select permeability；Slime mould individual corresponds to the single feasible of node select permeability
Solution；The nucleus of each slime mould corresponds to the transportation network node in single solution, i.e., the individual optimal solution node searched；Slime mould
The constraint of body idiotrophic substance corresponds to the search range individually solved；Slime mould group plasmodium corresponds to transportation network；Outside food
Material resource corresponds to transportation network node to be selected in solution space；Non-food source correspond to transportation network in infeasible node or
Region；Myxamoeba corresponds to the link in transportation network between each node；Slime mould distribution density corresponds to the weight of transportation network
Spend assessment；Nutriment corresponds to communications and transportation in slime mould group carrier；The movement of slime mould individual, which corresponds to, individually to be solved
Search；The division of labor of slime mould group corresponds to distributed searching transportation network node；The cooperation of slime mould group corresponds to transportation network node
Assessment and importance ranking；The objective function that slime mould group shares out the work and help one another is outer maximumlly to obtain with optimal topological structure
Portion's food source, the target corresponding to transportation network are maximumlly to meet different importance nodes with optimal topological structure
Trip demand；Crossover operation, which corresponds to when different feasible solutions are found by slime mould group, to be contacted and is transmitted with certain probability
Message；Union operation, which corresponds to when feasible solution is found by slime mould group, can share network node and transport link；Shrinkage operation pair
It should be reduced and be contacted with certain ratio in the myxamoeba of slime mould group, Optimizing Transport link.
3. the optimization method of the transportation network node according to claim 1 based on slime mould swarm intelligence, which is characterized in that
In the step 1 slime mould group division of labor stage, the nucleus of each slime mould individual is randomly distributed in different transportation network nodes
On, each slime mould individual, which voluntarily divides the work to expand everywhere centered on respective nucleus, finds new transportation network node, record
The transportation network node that the nucleus coordinate matrix of each slime mould individual and the myxamoeba of each slime mould individual search out
Several and its corresponding coordinate；And different degree matrix of the slime mould numbers matrix as the node is established to each node of transportation network,
I.e. the node importance of transportation network depends on the slime mould individual amount or nucleus amount fed on the node, in transportation network
Transportation network node is ranked up with reference to the different degree matrix when planning, and topological structure is closed according to different degree matrix
Reason optimization；Slime mould is an expansion structure centered on nucleus, and the slime mould quantity on the node actually includes and the section
The information of neighbor nodes and its length information being connected with neighbor node that point is connected；Value in pitch point importance matrix
It is bigger, show that the node is more important, i.e. the neighbor node of node connection is more, and shorter to the distance of neighbor node；Conversely,
The value is smaller, shows that the node is more inessential, i.e., the node connection neighbor node it is fewer, and with neighbor node be connected at a distance from
It is longer.
4. the optimization method of the transportation network node according to claim 3 based on slime mould swarm intelligence, which is characterized in that
The division of labor stage includes three sub-steps:
Sub-step 1-1: slime mould Population Initialization initializes the digraph Graph=(Node, Edge) of problem to be solved；Wherein,
Node=[Nodei]n=[(xi,yi)]nIndicate to include the coordinate matrix that n node is shared in transportation network, n indicates transportation network
The node total number of digraph Graph, NodeiIndicate i-th of node in transportation network digraph Graph, (xi,yi) indicate traffic
Network node NodeiAbscissa and ordinate；Edge={ Edgeij| i, j ∈ n } indicate that the connection between node constitutes side square
Battle array, EdgeijIndicate node NodeiAnd NodejBetween side；The length matrix or euclidean distance between node pair matrix on side indicate between node
ForDistanceijIndicate node
NodeiAnd NodejBetween side EdgeijLength | Edgeij|；The side n (n-1) is up between n node of matrix, then all sections
The average value of distance is expressed as between pointThis method uses probabilistic search method, generates m
(m >=n) slime mould individual, m indicate slime mould individual sum；The nucleus of each slime mould is randomly placed in transportation network difference node
On, i.e. each slime mould individual k (k=1,2 ..., m) nucleus coordinate is Node matrix random value RAND { (xk,yk)∈Node|k
=1,2 ..., m }, RAND indicates that random function, k indicate slime mould individual serial number；
Sub-step 1-2: the division of labor of slime mould group is looked for food, and transportation network imitates the behavior of slime mould forage, each slime mould individual protoplasm
Group constantly carries out dilation procedure from the near to the distant centered on nucleus, by fixed or adjustable search under the constraint of idiotrophic substance
Rope radius finds the transportation network node on periphery as far as possible, and kth (k=1,2 ..., m) search radius of a slime mould individual indicates
For Radiusk, average distance generally higher than between node isIf
RadiuskLarger, then the search range of slime mould individual is larger, it is possible to find more transportation network nodes, and different slime moulds
Overlapping possibility between body is also bigger；If RadiuskSmaller, then the search range of slime mould individual is smaller, the network of communication lines found
Network node may be less, and the overlapping possibility between slime mould individual is also smaller；The division of labor of slime mould group is looked for food, and operate must be respective
It carries out around node where nucleus, and is carried out under the limitation of idiotrophic substance, and be unable to infinite extension；
A slime mould individual abscissa of kth (k=1,2 ..., m) and ordinate are expressed as (xk,yk), it is looked for after search on periphery
To CountkA transportation network node, CountkThe neighbor node for indicating that a slime mould individual of kth (k=1,2 ..., m) is found is total
Number then forms a traversal periphery CountkThe feed network of a transportation network node；A slime mould of kth (k=1,2 ..., m)
The feed network representation of body isThen its total length for feeding network is expressed asl∈Subnetk；Wherein, CountkIllustrate a slime mould individual institute of kth (k=1,2 ..., m)
In the centrad of node, it is clear that the centrad of a node is bigger, CountkIt is bigger, illustrate what the node can directly affect
Neighbor node is also more, has more preferably importance；LengthkIllustrate a slime mould individual institute of kth (k=1,2 ..., m)
In the tightness of node and neighbor node, that is, define a node to neighbor node how far, it is clear that node it is tight
Density is bigger, LengthkJust smaller, the neighbor node for illustrating that the node can directly affect is also closer, has and more preferably weighs
The property wanted；Further, comprehensive Countk>=0, Lengthk>=0, slime mould individual is as much as possible with shortest path in the division of labor is looked for food
Find more network nodes, can define kth (k=1,2 ..., m) objective function of a slime mould individual be Subfunk=
Countk/Lengthk(Lengthk≠ 0) or Subfunk=0 (Lengthk=0)；
Sub-step 1-3: slime mould group sharing information, slime mould group plasmodium may have found in process of expansion from inside to outside
Food source makes calibration to its position, and passes information to other slime moulds individual by myxamoeba, is one under slime mould group
The cooperation stage of step gets ready, so that other slime mould individuals are mobile and feed；Slime mould group plasmodium in process of expansion,
Food source may not be found, or encounters non-food source, such as noxious material, non-affinity substance etc., then slime mould group is former
Node and region where matter group needs to leave the substance, marker location information simultaneously pass to other slime moulds by myxamoeba
Body, slime mould group will not enter back into the region；
Wherein, cause some slime mould individuals to be overlapped because sharing certain traffic links, be not repeated to calculate when calculating total length,
Transportation network length required by the division of labor stage is the shortest path for traversing all nodes；Due to this algorithm solution procedure and initial strip
Part is unrelated, can be each node Node=[Nodei]n=(xi,yi)]nInitialize different degree matrix W eight (0)=[Weighti
(0)]n, wherein Weighti(0) indicate i-th (i=1,2 ..., n) on a node random distribution slime mould individual initial number,
That is slime mould individual cells nuclear volume, because having overlapping between the myxamoeba of slime mould individual, by the weight of transportation network node
It spends and is randomly initialized as slime mould individual cells nuclear volume.
5. a kind of transportation network node selecting method based on slime mould swarm intelligence according to claim 1, feature exist
In step 2 is the stage of slime mould group cooperation, and m slime mould individual resultant force is by the postdigestive nutriment of n network node, i.e.,
Object of transport is shipped back m node by traffic link；Every slime mould individual is moved around with certain probability, it is intended to the smallest
Feed distance finds more network nodes, after often finding a feed network solution, needs to assess the majorization of solutions degree, and root
Determine whether to stay in the node according to assessment result；The movement of slime mould group has study property, and it is current should to learn this slime mould individual
Place network node information will also learn the network node information passed over from neighbours slime mould, according to individual study and neighbours
The case where study, calculates the probability up to network node in next step, and further mobile by probability realization, according to this back and forth；Finally,
Entire transportation network forms the topological structure with different slime mould distribution densities, obtains the network section indicated with slime mould density
Point importance ranking is as a result, and reasonably select node according to the importance sorting result to construct optimal transportation network.
6. a kind of transportation network node selecting method based on slime mould swarm intelligence according to claim 5, feature exist
In the cooperation stage includes three sub-steps；
Sub-step 2-1: slime mould population evaluation, in this sub-steps, using distributed computing method, all slime mould individual need roots
It is assessed according to the node location locating for oneself, continues to look for food to determine whether to leave the node；Assuming that current time is t, kth
(k=1,2 ..., m) a slime mould individual coordinate is Nodek(t)=(xk(t),yk(t)), the target function value of slime mould individual is
Subfunk(t)；The current desired positions that the individual is found are expressed asCorresponding objective function
Value is expressed asThe current desired positions that entire slime mould group is found are expressed as
Corresponding target function value is expressed asAccording to assessment result, then slime mould personal best particle updates are as follows:
Sub-step 2-2: slime mould team learning, in this sub-steps, using probabilistic search method, slime mould individual is by learning oneself
The information that past experience and other slime mould individuals are shared, updates the node location locating for oneself: on the one hand, slime mould individual root
According to the network structure locating for oneself, with individual learning probability Probabilityk1(t) learn the net that myxamoeba searches self
Network nodal information, and be moved to next network node is attempted to find more preferably or prior network node, that is, is had more
The position of more neighboring network nodes, and from neighboring network node closer proximity, Probabilityk1(t) indicate kth (k=1,
2 ..., m) study of a slime mould individual quality probability；On the other hand, slime mould individual also passes through myxamoeba and neighbours slime mould
Intersection, merging, the shrinkage operation of body, with neighbor learning probability P robabilityk2(t) learn farther neighbours slime mould individual
Information of looking for food and network node information, for being selected when oneself movement, Probabilityk2(t) it indicates kth (k=1,2 ..., m)
The probability of a slime mould individual study neighbours；The learning algorithm of slime mould individual k (k=1,2 ..., m) is as follows:
Sub-step 2-3: pitch point importance sequence, in this sub-steps, on the one hand, have around insignificant network node lower
Network node density and slime mould population density, and the slime mould individual with the continuous movement of slime mould group, on the part of nodes
Will be fewer and fewer, whenever there is a slime mould individual to leave, then there is Weighti(t)=Weighti(t)-1；On the other hand, important
Network node nearby there is more neighboring network node, and with the continuous movement of slime mould group, on critical network node
Slime mould individual will be more and more, whenever have a slime mould individual enter the node, then have Weighti(t)=Weighti(t)+
1, and slime mould individual k (k=1,2 ..., it is m) mobile every time after calculate oneself objective function, be Subfunk(t)=
Countk(t)/Lengthk(t)(Lengthk) or Subfun (t) ≠ 0k(t)=0 (Lengthk(t)=0), wherein CountkTable
Show kth (k=1,2 ..., neighbor node that m) a slime mould individual is found sum, LengthkIllustrate kth (k=1,2 ...,
M) total length of a slime mould individual feed network；
Settable termination condition is the number of iterations, or fitness value meets scheduled error amount every time, such as not up to termination condition,
It then returns to sub-step 2-1 and sub-step 2-2 is constantly updated；By the continuous movement of slime mould group, in entire transportation network
Different nodes just have accumulated the slime mould individual cells core of different number；When meeting termination condition, whole network can be provided
Pitch point importance sequence:
RANK{Node1,...,Nodei,Nodei+1,...,|Nodei∈Node,and Weighti≤Weighti+1,
Wherein, RANK indicates pitch point importance ranking functions；When carrying out Transportation Network Planning, user can be according to obtained section
Point importance sorting result successively selects suitable network node, to optimize transportation network layout and topological structure.
7. a kind of transportation network node selecting method based on slime mould swarm intelligence according to claim 1, including it is multiple outer
Portion's food source, multiple slime mould plasmodiums, multiple myxamoebas, multiple slime mould nucleus, multiple endotrophic substances；Its feature exists
In there are three types of modes for the operation between slime mould individual: first is that crossover operation, i.e., pass through myxamoeba (fortune between different slime moulds are individual
Transmission link) message is contacted and transmitted with certain probability；Second is that union operation, i.e., different slime mould individuals can share network
Node and transport link feed consolidated network node jointly, and transport nutriment using same transport link；Third is that shrinking
Operation, i.e., the myxamoeba between different slime moulds are individual is reduced with certain ratio to be contacted, endotrophic substance in simulation slime mould individual
The process of consumption is absorbed by oneself plasmodium or neighbours' slime mould individual；Therefore, it can be provided according to the relation intensity of slime mould individual
The information of transportation network node provides foundation for slime mould movement.
8. method described in claim 1-7 any one is applied to solve multiple-objection optimization or Computer network optimization or cloud meter
Calculate optimization or the very important decision optimization or social groups' network optimization of national economy or network public-opinion or group emergency event pipe
The self-organizing behavioral study of reason or the escape of fire disaster escaping or floods or earthquake escape or wisdom traffic or complication system.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910482230.9A CN110298491B (en) | 2019-06-04 | 2019-06-04 | Traffic network node selection method based on slime mold group intelligence |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910482230.9A CN110298491B (en) | 2019-06-04 | 2019-06-04 | Traffic network node selection method based on slime mold group intelligence |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110298491A true CN110298491A (en) | 2019-10-01 |
| CN110298491B CN110298491B (en) | 2022-01-25 |
Family
ID=68027552
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910482230.9A Active CN110298491B (en) | 2019-06-04 | 2019-06-04 | Traffic network node selection method based on slime mold group intelligence |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110298491B (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113596169A (en) * | 2021-08-03 | 2021-11-02 | 中国地质大学（武汉） | Method for selecting proxy node to manage fog computing network based on slime algorithm |
| CN113743266A (en) * | 2021-08-24 | 2021-12-03 | 三峡大学 | Face recognition method based on artificial slime |
| CN113744296A (en) * | 2021-08-24 | 2021-12-03 | 三峡大学 | Image edge detection method based on artificial slime bacterium population intelligence |
| CN113743005A (en) * | 2021-08-24 | 2021-12-03 | 三峡大学 | Maze problem bionic solving method based on myxomycete foraging behavior |
| CN113744216A (en) * | 2021-08-24 | 2021-12-03 | 三峡大学 | Image segmentation method based on artificial slime mold group intelligence |
| CN114063623A (en) * | 2022-01-11 | 2022-02-18 | 中国人民解放军陆军装甲兵学院 | Robot path planning method based on multi-strategy improved slime mold algorithm |
| CN115346371A (en) * | 2022-08-12 | 2022-11-15 | 广西新发展交通集团有限公司 | Identification method of important nodes of traffic network |
| CN118529101A (en) * | 2024-07-25 | 2024-08-23 | 福建银数信息技术有限公司 | Rail transit industrial control network safety supervision method and system |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109508831A (en) * | 2018-11-19 | 2019-03-22 | 西南大学 | Urban traffic flow network structure recognition methods based on adaptive Markov cluster |
| CN110288131A (en) * | 2019-06-04 | 2019-09-27 | 三峡大学 | Transportation network fragility problem bionic optimization method based on slime mould foraging behavior |
-
2019
- 2019-06-04 CN CN201910482230.9A patent/CN110298491B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109508831A (en) * | 2018-11-19 | 2019-03-22 | 西南大学 | Urban traffic flow network structure recognition methods based on adaptive Markov cluster |
| CN110288131A (en) * | 2019-06-04 | 2019-09-27 | 三峡大学 | Transportation network fragility problem bionic optimization method based on slime mould foraging behavior |
Non-Patent Citations (6)
| Title |
|---|
| MATTHIAS BECKER: "Applicability of Bio-inspired and Graph-Theoretic Algorithms for the Design of Complex Fault-Tolerant Graphs", 《2013 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS》 * |
| XIAOGE ZHANG: "A Bio-Inspired Approach to Traffic Network Equilibrium Assignment Problem", 《IEEE TRANSACTIONS ON CYBERNETICS 》 * |
| ZHENGYING CAI: "A Node Selecting Approach for Traffic Network Based on Artificial Slime Mold", 《IEEE ACCESS 》 * |
| 张晓革: "基于多头绒泡菌的交通网络设计算法的研究", 《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑》 * |
| 王庆: "基于多头绒泡菌的路网优化算法", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
| 章雅娟: "基于多头绒泡菌仿生算法的复杂网络节点中心度研究", 《中国优秀硕士学位论文全文数据库 基础科学辑》 * |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113596169B (en) * | 2021-08-03 | 2022-04-15 | 中国地质大学（武汉） | Method for selecting proxy node to manage fog computing network based on slime algorithm |
| CN113596169A (en) * | 2021-08-03 | 2021-11-02 | 中国地质大学（武汉） | Method for selecting proxy node to manage fog computing network based on slime algorithm |
| CN113743005B (en) * | 2021-08-24 | 2023-08-25 | 三峡大学 | Maze problem bionic solving method based on myxobacteria foraging behaviors |
| CN113743005A (en) * | 2021-08-24 | 2021-12-03 | 三峡大学 | Maze problem bionic solving method based on myxomycete foraging behavior |
| CN113744216A (en) * | 2021-08-24 | 2021-12-03 | 三峡大学 | Image segmentation method based on artificial slime mold group intelligence |
| CN113744296A (en) * | 2021-08-24 | 2021-12-03 | 三峡大学 | Image edge detection method based on artificial slime bacterium population intelligence |
| CN113743266A (en) * | 2021-08-24 | 2021-12-03 | 三峡大学 | Face recognition method based on artificial slime |
| CN113743266B (en) * | 2021-08-24 | 2023-11-24 | 三峡大学 | Human face recognition method based on artificial myxobacteria |
| CN113744216B (en) * | 2021-08-24 | 2024-02-20 | 三峡大学 | Image segmentation method based on artificial myxobacteria population intelligence |
| CN113744296B (en) * | 2021-08-24 | 2024-03-12 | 三峡大学 | Image edge detection method based on artificial coliform group intelligence |
| CN114063623A (en) * | 2022-01-11 | 2022-02-18 | 中国人民解放军陆军装甲兵学院 | Robot path planning method based on multi-strategy improved slime mold algorithm |
| CN114063623B (en) * | 2022-01-11 | 2022-03-29 | 中国人民解放军陆军装甲兵学院 | Robot path planning method based on multi-strategy improved slime mold algorithm |
| CN115346371A (en) * | 2022-08-12 | 2022-11-15 | 广西新发展交通集团有限公司 | Identification method of important nodes of traffic network |
| CN115346371B (en) * | 2022-08-12 | 2023-12-29 | 广西新发展交通集团有限公司 | Identification method for important nodes of traffic road network |
| CN118529101A (en) * | 2024-07-25 | 2024-08-23 | 福建银数信息技术有限公司 | Rail transit industrial control network safety supervision method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110298491B (en) | 2022-01-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110298491A (en) | A kind of transportation network node selecting method based on slime mould swarm intelligence | |
| Seyyedabbasi et al. | I-GWO and Ex-GWO: improved algorithms of the Grey Wolf Optimizer to solve global optimization problems | |
| Akhand et al. | Discrete spider monkey optimization for travelling salesman problem | |
| Molina et al. | Comprehensive taxonomies of nature-and bio-inspired optimization: Inspiration versus algorithmic behavior, critical analysis recommendations | |
| Taher et al. | Modified grasshopper optimization framework for optimal power flow solution | |
| Rajasekhar et al. | Computing with the collective intelligence of honey bees–a survey | |
| Basse et al. | Land use changes modelling using advanced methods: Cellular automata and artificial neural networks. The spatial and explicit representation of land cover dynamics at the cross-border region scale | |
| McMullen | An ant colony optimization approach to addressing a JIT sequencing problem with multiple objectives | |
| CN110288131B (en) | Bionic optimization method for traffic network vulnerability problem based on myxomycete foraging behavior | |
| CN109165799A (en) | The class's of walking education course arrangement system based on genetic algorithm | |
| Crainic et al. | Parallel meta-heuristics applications | |
| Pinto et al. | Applicability and calibration of an irregular cellular automata model for land use change | |
| Yu et al. | Modeling and implementation of classification rule discovery by ant colony optimisation for spatial land-use suitability assessment | |
| Emami | Seasons optimization algorithm | |
| Muazu et al. | Review of nature inspired metaheuristic algorithm selection for combinatorial t-way testing | |
| Sampaio et al. | Contributions to the future of metaheuristics in the contours of scientific development | |
| Sajith et al. | Bio-inspired and artificial intelligence enabled hydro-economic model for diversified agricultural management | |
| Srivastava et al. | A survey on traffic optimization problem using biologically inspired techniques | |
| Pham Vu Hong et al. | Application of artificial intelligence algorithm to optimize the design of water distribution system | |
| Liu et al. | Research on the optimized management of agricultural machinery allocation path based on teaching and learning optimization algorithm | |
| Cai et al. | A node selecting approach for traffic network based on artificial slime mold | |
| Ghafori et al. | A multiobjective Cuckoo Search Algorithm for community detection in social networks | |
| Wang et al. | A carnivorous plant algorithm with heuristic decoding method for traveling salesman problem | |
| Chu et al. | Adaptive brainstorm optimisation with multiple strategies | |
| Mo et al. | Biogeography based optimization for traveling salesman problem |
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 | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20240815 Address after: 518000 1104, Building A, Zhiyun Industrial Park, No. 13, Huaxing Road, Henglang Community, Longhua District, Shenzhen, Guangdong Province Patentee after: Shenzhen Hengyuan Zhida Information Technology Co.,Ltd. Country or region after: China Address before: 443002 No. 8, University Road, Xiling District, Yichang, Hubei Patentee before: CHINA THREE GORGES University Country or region before: China |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20240927 Address after: No. 2 Huancheng South Road, Zaoyuan Community, Xincheng Office, Hanbin District, Ankang City, Shaanxi Province 725000 Patentee after: Ankang Traffic Engineering Technology Consulting Co.,Ltd. Country or region after: China Address before: 518000 1104, Building A, Zhiyun Industrial Park, No. 13, Huaxing Road, Henglang Community, Longhua District, Shenzhen, Guangdong Province Patentee before: Shenzhen Hengyuan Zhida Information Technology Co.,Ltd. Country or region before: China |