CN106709599A - Whole region guide maximization-based road guide sign laying method - Google Patents

Whole region guide maximization-based road guide sign laying method Download PDF

Info

Publication number
CN106709599A
CN106709599A CN201611162902.0A CN201611162902A CN106709599A CN 106709599 A CN106709599 A CN 106709599A CN 201611162902 A CN201611162902 A CN 201611162902A CN 106709599 A CN106709599 A CN 106709599A
Authority
CN
China
Prior art keywords
road
fingerpost
region
guide
nectar source
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
Application number
CN201611162902.0A
Other languages
Chinese (zh)
Other versions
CN106709599B (en
Inventor
黄敏
郑健
刘芳
张腾
毛峰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Sun Yat Sen University
Original Assignee
Sun Yat Sen University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Sun Yat Sen University filed Critical Sun Yat Sen University
Priority to CN201611162902.0A priority Critical patent/CN106709599B/en
Publication of CN106709599A publication Critical patent/CN106709599A/en
Application granted granted Critical
Publication of CN106709599B publication Critical patent/CN106709599B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/04Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/10Services
    • G06Q50/26Government or public services

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • Tourism & Hospitality (AREA)
  • Human Resources & Organizations (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Marketing (AREA)
  • Development Economics (AREA)
  • General Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • Quality & Reliability (AREA)
  • Game Theory and Decision Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Operations Research (AREA)
  • Educational Administration (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Traffic Control Systems (AREA)

Abstract

The invention relates to a whole region guide maximization-based road guide sign laying method. The method comprises the following steps of S1, aiming at a single road in a region, constructing a guide sign laying scheme for guiding the road; S2, superposing guide sign laying schemes for guiding all roads in the region to obtain a superposed region road guide sign laying scheme; and S3, building an artificial bee colony algorithm optimization model, and optimizing the superposed laying scheme by taking whole region road guide maximization as a goal to obtain an optimal region road guide sign laying scheme.

Description

Guided up to maximized road fingerpost distribution method based on region entirety
Technical field
The present invention relates to traffic planninng design field, guide reachable based on region entirety more particularly, to one kind Maximized road fingerpost distribution method.
Background technology
Fingerpost as a kind of static traffic inducing installation, with providing road relevant information (side for traffic participant To, place, distance etc.) and balanced road traffic flow effect, played an important role in whole system for traffic guiding.Especially With going from strength to strength for size of urban population, the deficiency of Urban Traffic Planning is highlighted all the more, and complicated road network is carried out to improve past Toward can produce pull one hair and move the whole body, the problem that operability is not strong.Now, in the optimization and improvement of traffic sign and marked aspect Just seem important all the more and feasible.However, the laying present situation of the road fingerpost in urban region is very pessimistic at present, refer to Road sign will inducible system lacks globality and logic, and the laying of fingerpost and information guide disorderly and unsystematic, and there is guide Poor information guide accessibility problem you.Traffic participant can not be successfully induced to successfully arrive at destination, it is impossible in city Effective inducing function is given full play in system for traffic guiding.At present, as fingerpost is played the part of in system for traffic guiding Role is important all the more and fingerpost guides the problem laid to highlight all the more, and fingerpost lays research also increasingly by research political affairs Mansion department and the concern and attention of researchers.Fingerpost director information whether can continuous induction traveler successfully arrive at Destination (is guided reachable), makes for lifting road overall service levels, the efficiency of operation of lifting traffic system, reduction road The aspect such as the trip delay of user and equilibrium traffic stream is significant.
At present, the research about fingerpost is concentrated mainly on four aspects such as design, laying, analysis and optimization, wherein The design of fingerpost is mainly manifested in board face size, font, format of mark etc..The laying of fingerpost is concentrated mainly on list The aspect such as the laying of point of interest fingerpost and the laying of the fingerpost based on intersection.Assay is mainly including external environment condition point (such as director information classification ratio, guide is reachable for analysis (such as fingerpost shielding rate and fingerpost jamming rate), director information analysis Property) etc. aspect.And for the optimization of fingerpost, it is main including to fingerpost board face size, material, director information quantity etc. Aspect optimizes, and to the inaccessible fingerpost of guide guide the optimization of accessibility.Fingerpost guide accessibility be Fingerpost director information whether can continuous induction pedestrian successfully arrive at destination, be that fingerpost inducible system is most basic One function.Although the research that existing correlation fingerpost is intelligently laid at present, from for the angle for guiding accessibility, omits It is inadequate.
The content of the invention
The present invention is the problem of solution above prior art, there is provided one kind is guided up to maximized based on region entirety Road fingerpost distribution method, there is the area road fingerpost layout scheme that the method is obtained good entirety to guide can Up to property.
To realize above goal of the invention, the technical scheme of use is:
Guided up to maximized road fingerpost distribution method based on region entirety, comprised the following steps:
S1. for the single road in region, the fingerpost layout scheme for guiding this road is built;
S2. the fingerpost layout scheme of every road will be guided to be overlapped in region, obtains area road fingerpost Will is superimposed layout scheme;
S3. artificial bee colony algorithm Optimized model is built, is integrally guided with area road and is turned to target up to maximum, to superposition Layout scheme is optimized, and obtains optimal area road fingerpost layout scheme.
Preferably, in the step S1, obtained using breadth first search method and guide the fingerpost of the road to lay region, Rule is laid then in conjunction with Regional Road Network topological structure and region fingerpost, is laid in the corresponding intersection for laying region and guided The fingerpost of the road and director information is laid on fingerpost, so as to obtain the fingerpost cloth for guiding single road If scheme.
Preferably, if RiRepresent i-th road in region, single road RiUse set of nodeRepresent, extensively Degree searching algorithm is with set of nodeAll nodes for extension starting point, with certain lengthFor radius is outwards searched for, obtain and guide Single road RiFingerpost lay region, the fingerpost of acquisition is laid region by road-net node set representations, is designated as
Preferably, the fingerpost lays all director informations set RS for guiding the road laid in region (Ri)={ γ12,...γjRepresent, wherein, γjRepresent and guide target road RiFingerpost director information, γjHave It is such as one of properties:
(1)fvj):Represent director information γjThe intersection node of guide;
(2)flaj):Represent director information γjResiding road network segmental arc, the road network segmental arc is expressed as follows:
(3)fnaj):Represent according to γjGuide, with intersection fvj) next road network segmental arc for being joined directly together;
(4)fobjj):Represent γjThe road R of guideiTitle;
C(γj):Represent director information γjClassification, be respectively state mark S1, connectivity mark S2With directionality mark Know S3, it is defined as follows:
Preferably, the region fingerpost is laid rule and is specially:
(1) for single road RiIf it is one-level road or secondary road, the guide road R for layingiGuide letter Breath γjClassification is that state identifies S1And/or connectivity mark S2And/or directionality mark S3
(2) for single road RiIf it is three-level road or level Four road, the guide road R for layingiGuide letter Breath γjClassification is that state identifies S1And/or connectivity mark S2
Preferably, the quantity of the director information laid on each fingerpost is no more than 7, wherein directionality mark Know S3No more than 2.
Preferably, the artificial bee colony algorithm Optimized model carries out the detailed process for simplifying optimization such as to superposition layout scheme Under:
S1. starting stage:The multiple nectar sources of initialization a, nectar source represents a feasible area road fingerpost superposition Layout scheme;
S2. the fitness function in each nectar source is calculated:
Wherein f represents the fitness function in nectar source;P(Ri) represent road R in nectar sourceiGuide up to rate, Q (Ri) represent Road R in nectar sourceiGuide coefficient, fitness function value is bigger, and nectar source is more excellent, i.e. area road fingerpost superposition laying side Case is more excellent;
S4. the honeybee stage is led:Each leads the nectar source that honeybee associates to it to carry out neighborhood search in this stage, obtains a neighbour Domain nectar source, then contrasts the fitness function value in neighborhood nectar source and green molasses source, if the fitness function value in neighborhood nectar source is higher than original The fitness function value in nectar source, then neighborhood nectar source is updated to the nectar source of its association;
S5. the honeybee stage is followed:Each follows honeybee to select the nectar source to carry out using the selection mode of roulette in this stage Association, each follows the nectar source that honeybee associates to it to carry out neighborhood search, obtains a neighborhood nectar source, then contrast neighborhood nectar source with The fitness function value in green molasses source, if the fitness function value in neighborhood nectar source is higher than the fitness function value in green molasses source, by neighbour Domain nectar source is updated to the nectar source of its association;
S6. step S4, S5 is repeated, during repeating, if certain nectar source does not update for continuous k times abandons this Honeybee is investigated in nectar source, leading honeybee or following honeybee to be changed into for being associated with the nectar source, and a new honey is re-searched in search space Source replaces abandoned nectar source, then performs step S4 or S5;
S7. optimal area road fingerpost layout scheme is obtained by step S4, S5, S6.
Preferably, it is described to guide up to rate P (Ri) be expressed as follows:
Wherein S1(Ri) represent all guide road R in regioniFingerpost director information in can constitute up to guide The director information quantity in path;S(Ri) represent and road R is guided in regioniAll fingerpost director information quantity.
Preferably, it is described to guide up to rate P (Ri) be expressed as follows:
Wherein S1(Ri) represent all guide road R in regioniFingerpost director information in can constitute up to guide The director information quantity in path;S(Ri) represent and road R is guided in regioniAll fingerpost director information quantity.
Preferably, in the step S6, the probability that each nectar source is led honeybee to select is as follows:
Wherein PiRepresent the selected probability of nectar source i;fiRepresent the fitness function value of nectar source i.
Compared with prior art, the beneficial effects of the invention are as follows:
(1) present invention guides accessibility angle from fingerpost, constructs and is guided up to maximum based on region entirety There is the road fingerpost distribution method of change, the area road fingerpost layout scheme that the method is obtained good entirety to refer to Draw accessibility.
(2) present invention constructs area road fingerpost and integrally guides accessibility mathematical function, can be related for the field Research provides effectively reference;
(3) present invention is solved using artificial bee colony algorithm, constructs algorithm optimization model, and algorithm is practical, energy Enough meet demand.
Brief description of the drawings
Fig. 1 is that the present invention is a kind of to be guided up to the specific of maximized road fingerpost distribution method based on region entirety The flow chart of embodiment.
Fig. 2 is the schematic diagram in acquisition guide single road fingerpost laying region in embodiment.
Fig. 3 is the layout diagram of fingerpost in laying region in embodiment.
Fig. 4 is laying fingerpost schematic diagram in embodiment.
Fig. 5 is overlaying scheme board face information overload schematic diagram in embodiment.
Fig. 6 be embodiment in generate initial nectar source schematic diagram.
Fig. 7 is expression schematic diagram in nectar source in embodiment.
Fig. 8 is renewal principle schematic in nectar source in embodiment.
Fig. 9 is the case schematic diagram of present invention specific implementation.
Specific embodiment
Accompanying drawing being for illustration only property explanation, it is impossible to be interpreted as the limitation to this patent;
Below in conjunction with drawings and Examples, the present invention is further elaborated.
Embodiment 1
Fig. 1 is based on region entirety guide up to maximized road fingerpost distribution method for one kind that the present invention is provided Specific embodiment flow chart.One kind that the present invention is provided is based on region entirety and guides up to maximized road fingerpost The specific steps of distribution method include:
Step one:For the single road in region, the fingerpost for guiding the road is obtained by breadth first search method Lay and guide region.Specific method is:In road network, every road is made up of many road circuit nodes and segmental arc, and Regional Road Network can Represented with the digraph G=(V, A) of graph theory.Wherein V={ viBe G set of node, A={ aij=(vi,vj)|vi,vj∈ V } it is G Segmental arc collection.All road usable set R={ R in regioniRepresent, wherein RiRepresent i-th road in region.For Single road Ri, constitute the node available section point set of this roadRepresent.The concrete operations of breadth first search method For:To gatherAll nodes for extension starting point, with certain lengthIt is radius, obtains and guide target road RiShow the way Mark lays region, and the road-net node set representations in Free Region are designated asWherein, radiusSelection With road RiRank correlation, i.e., Represent road RiCategory of roads, different grades of road, corresponding finger Road sign will is laid and guides area size different.
Specific example is as shown in Figure 2.Where there is a road R1, the set of node for constituting the road isBorrow Help breadth first search method respectively with v1、v2It is extension starting point, with lengthIt is that radius obtains one layer of extension to external expansion, first Node v3、v4、v5、v6、v7、v8.Then with all one layer of expanding nodes as starting point, to external expansion, all two layers of extension sections are obtained Point, repeats the method, until extension radius reaches threshold values set in advance, stops extension, so as to obtain guide road R1Finger Road sign will lays region, is expressed asParticularly, all nodes records in extended area Distance to target road is shortest path, that is, lay the guided path of fingerpost, specific example as shown in figure 3, extension Node v in region4, have two from target road point spread to v4Extensions path, be respectively v1-v3-v4And v2-v4, lead to Cross path length contrast and find the second paths v2-v4It is shorter, therefore the node v in extended area4The arrival target road of record Path be v2-v4, i.e., in intersection v4Lay the guided path of the fingerpost for guiding target road in place.
Step 2:Laid in region in the fingerpost of the guide single road for obtaining, according to road network topology structure every Lay the fingerpost director information for guiding this road in individual intersection.For guide target road Rγ, fingerpost laying That is laid in region guides all director information usable set RS (R of the roadi)={ γ12,...γjRepresent.Wherein, γjRepresent to lay and target road R is guided in regioniFingerpost director information.For each director information γjJust like subordinate Property:
(1)fvj):Represent director information γjThe intersection node of guide
(2)flaj):Represent director information γjResiding road network segmental arc
(3)fnaj):Represent according to γjGuide, with intersection fvj) next road network segmental arc for being joined directly together
(4)fobjj):Represent γjThe road R of guideiTitle
(5)C(γj):Represent director information γjClassification, be respectively state mark (S1), connectivity mark (S2) and Directionality identifies (S3), it is defined as follows:
Particularly, if the fingerpost for guiding the road is laid in each intersection laid in region, can aggravate Fingerpost information load in region, accordingly, it would be desirable to fingerpost according to region lays rule, fingerpost is laid into Row constraint is limited.Fingerpost director information specifically lays rule:
(1) for target road RiIf it is advanced road (one-level road, secondary road), road R is guidedi's Information γjClassification can identify (S for state1), connectivity mark (S2) and directionality mark (S3).If i.e. G (Ri)∈{1, 2 }, then C (γj)∈{S1,S2,S3};
(2) for target road RiIf it is inferior grade road (three-level road, level Four road), road R is guidedi's Information γjClassification is only used as identifying (S for state1) and connectivity mark (S2) guided.If i.e. G (Ri) ∈ { 3,4 }, Then C (γj)∈{S1,S2};
Specific example is as shown in Figure 4.In the guide target road R for obtainingγFingerpost lay region in, for guide Information γ1, its attribute is:fv1)=v3, fla1)=a3,9, fna1)=a3,1, fobj1)=" Rγ", C (γ1)= S3.The director information γ of laying1Design sketch after visualization is as shown in Figure 4.
Step 3:Obtain area road fingerpost superposition layout scheme.Guided in the region that above-mentioned steps are obtained every The fingerpost layout scheme of bar road is overlapped, and obtains area road fingerpost superposition layout scheme.Advised according to GB It is fixed, the director information total amount on each fingerpost board no more than 7, director information quantity in all directions no more than 2.Therefore, can there is director information overload phenomenon in the superposition layout scheme of acquisition.Specific example is as shown in figure 5, deposit herein A fingerpost board in overlaying scheme, it is evident that the information content on the sign board has overloaded, and violates GB.Cause This, needs that it is carried out to simplify optimization in subsequent step.
Step 4:Build area road and integrally guide accessibility mathematical function.Concrete mode is:Consider every road Guide is up to rate and guides coefficient, definition region road integrally guides shown up to rate such as formula (2):
Wherein W (R) represents that area road is integrally guided up to rate;RiRepresent i-th road, P (R in regioni) represent road RiGuide up to rate (as shown in Equation 3), Q (Ri) represent road RiGuide coefficient (as shown in Equation 4).
Road fingerpost director information is guided and is defined as up to rate:For certain target road, the mesh is guided in region Mark in all director informations of road, all guide mesh in the director information quantity and region for guiding reachable path can be constituted The director information quantity ratio of road is marked, such as shown in formula (3):
Wherein P (Ri) represent road RiGuide up to rate;S1(Ri) represent all guide target road R in regioniFinger The director information quantity up to guided path can be constituted in road sign will director information;S(Ri) represent and target track is guided in region Road RiAll fingerpost director information quantity.
For the weight that the guide of clear and definite difference road occupies up to rate in area road is integrally guided up to rate, this hair The bright main grade for considering target road determines the guide coefficient of road, and definition is as shown in formula (4):
Wherein Q (Ri) represent road RiGuide coefficient;G(Ri) represent road RiCategory of roads.
Step 5:Integrally guided with area road and turn to target up to maximum, by artificial bee colony algorithm to area road Fingerpost superposition layout scheme carries out simplifying optimization.Mainly include initial population, fitness function design leads the honeybee stage, Follow honeybee stage and investigation five links of honeybee stage.
Initial population.In artificial bee colony algorithm, a nectar source represents a feasible solution.In the present invention, a nectar source generation The feasible area road fingerpost layout scheme of one, table.The acquisition modes in nectar source are the area road obtained from step 3 In fingerpost superposition layout scheme, due to there are director information overload situations, therefore overload is simplified according to constraints Director information, so as to obtain the area of feasible solutions road fingerpost layout scheme for meeting constraints, as one nectar source.Pass through Multiple nectar sources are obtained so as to constitute an initial population.Overload superposition layout scheme is simplified in the present invention and obtains feasible layout scheme Three constraintss it is as follows:
(1) each fingerpost board face director information sum is no more than 7;
(2) director information quantity is no more than 2 in all directions;
(3) the connectivity mark in state mark and all directions on board face is retained;
As shown in fig. 6, there are two fingerposts of director information overload in the superposition layout scheme of overload in specific example figure Will board, respectively panel1 and panel2, constrain according to above three, obtain reasonable sign board, corresponding reasonable sign board point It is not panel1 ' and panel2 '.The method for expressing in final nectar source (area road fingerpost layout scheme) is the layout scheme In all of fingerpost board information composition set, as shown in Figure 7.By generating a number of nectar source, so as to obtain honey Source population.
Fitness function is designed.Reference zone road is integrally guided up to rate, fitness function such as formula in algorithm for design (5) shown in.Fitness function value is bigger, and nectar source is more excellent, that is, the area road fingerpost layout scheme for obtaining is more superior.
Wherein f represents the fitness function in nectar source;P(Ri) represent road R in nectar sourceiGuide up to rate, Q (Ri) represent Road R in nectar sourceiGuide coefficient.
Lead the honeybee stage.Each leads the honeybee to need the nectar source associated to it to carry out neighborhood search the stage in algorithm, obtains One neighborhood nectar source, by contrasting the fitness function value in neighborhood nectar source and green molasses source, preferentially chooses nectar source.In the present invention, The neighborhood search mode for leading the nectar source (an area of feasible solutions road fingerpost layout scheme) that honeybee associates to it is:It is right Each fingerpost board information in the layout scheme of association carries out neighborhood search, obtains its corresponding neighborhood fingerpost board letter Breath.One area road fingerpost layout scheme is made up of the fingerpost board information for much meeting constraint, by association All fingerpost board information in layout scheme carry out neighborhood search, so as to obtain the neighborhood laying side of association layout scheme Case, by contrasting two fitness function values of layout scheme, preferentially retains.Wherein, honeybee is led to believe each fingerpost board Cease neighborhood search mode be:Retain the state mark and connectivity mark in each sign board information, then obtain and guide With overload sign board information corresponding to the fingerpost board in the superposition layout scheme of information overload, by randomly selecting each side Different directionality mark replaces corresponding directionality mark on the sign board of association upwards, so as to complete a finger to nectar source The neighborhood of road sign board information updates.Fingerpost board information neighborhood update mechanism specific example is as shown in figure 8, be directed to certain nectar source In a sign board panel2 carry out neighborhood search.Panel2 comes from the superposition layout scheme of information overload Panel1, for each directionality mark in panel2, its neighborhood is:The neighborhood of director information item1 be item2 and The neighborhood of item3, director information item7 is item8, and the neighborhood of director information item4 is item5 and item6.By in direction Property identification information neighborhood randomly select information and replace original directionality identification information, a mark in completing to nectar source The information updating of will board panel2, the neighborhood sign board information of acquisition is panel3.
Follow the honeybee stage.The stage, each followed honeybee to select a nectar source to be associated using the selection mode of roulette, Then using neighborhood search is carried out with nectar source of the honeybee identical mode to associating is led, by contrasting fitness function value, preferentially Retain.Wherein, shown in the probability such as formula (6) that each nectar source is led honeybee to select, fitness function value is more excellent, selected general Rate is bigger.
Wherein PiRepresent the selected probability of nectar source i;fiRepresent the fitness function value of nectar source i;
The investigation honeybee stage.If the continuous non-update times in certain nectar source exceed threshold values set in advance, algorithm is absorbed in office Portion is optimal, and the locally optimal solution will be abandoned.Corresponding honeybee is changed into investigation honeybee, and is searched again in search space The new nectar source of one, rope replaces abandoned nectar source.
By three links in continuous repetitive manual ant colony algorithm Optimized model (lead the honeybee stage, follow the honeybee stage and The investigation honeybee stage) the superposition layout scheme to there is director information overload phenomenon optimized, and area road is obtained until final It is overall to guide up to maximized fingerpost layout scheme.
It is pilot region that the present invention chooses Guangzhou College City, using the area road towards road navigation proposed by the present invention Fingerpost distribution method obtains area road fingerpost layout scheme in pilot region, and specific example is as shown in figure 9, simultaneously Laying present situation with Guangzhou College City fingerpost is analyzed, and is found by contrasting, and method proposed by the present invention is obtained Area road fingerpost integrally to guide up to rate be 0.85, guided up to rate 0.605, contrast better than the overall of present situation is laid Result shows that distribution method proposed by the present invention has feasibility.
The present invention is, from road navigation accessibility angle, the fingerpost laying side for guiding single road to be obtained first Case;Then the fingerpost layout scheme of every road will be guided to be overlapped acquisition area road fingerpost in region be superimposed Layout scheme.Be present board face director information overload phenomenon in superposition layout scheme, therefore integrally guided with area road up to maximum Target is turned to, it is carried out by artificial bee colony algorithm Optimized model simplify optimization, so that obtain that area road integrally guides can Up to maximized fingerpost layout scheme.According to comparative analysis, the pilot region that the method proposed using this patent is obtained refers to Road sign will layout scheme road integrally guides the fingerpost that accessibility is substantially better than pilot region to lay present situation, it was demonstrated that the present invention Being guided up to maximized road fingerpost distribution method based on region entirety for proposing is a kind of scientific method, should to engineering With with directive significance.
Obviously, the above embodiment of the present invention is only intended to clearly illustrate example of the present invention, and is not right The restriction of embodiments of the present invention.For those of ordinary skill in the field, may be used also on the basis of the above description To make other changes in different forms.There is no need and unable to be exhaustive to all of implementation method.It is all this Any modification, equivalent and improvement made within the spirit and principle of invention etc., should be included in the claims in the present invention Protection domain within.

Claims (10)

1. guided up to maximized road fingerpost distribution method based on region entirety, it is characterised in that:Including following step Suddenly:
S1. for the single road in region, the fingerpost layout scheme for guiding this road is built;
S2. the fingerpost layout scheme of every road will be guided to be overlapped in region, is obtained area road fingerpost and folded Plus layout scheme;
S3. artificial bee colony algorithm Optimized model is built, is integrally guided with area road and is turned to target up to maximum, superposition is laid Scheme is optimized, and obtains optimal area road fingerpost layout scheme.
2. it is according to claim 1 to be guided up to maximized road fingerpost distribution method based on region entirety, its It is characterised by:In the step S1, obtained using breadth first search method and guide the fingerpost of the road to lay region, Ran Houjie Close Regional Road Network topological structure and region fingerpost lays rule, laid in the corresponding intersection for laying region and guide the road Fingerpost and director information is laid on fingerpost so that obtain guide single road fingerpost laying side Case.
3. it is according to claim 2 to be guided up to maximized road fingerpost distribution method based on region entirety, its It is characterised by:If RiRepresent i-th road in region, single road RiUse set of nodeRepresent, breadth first search Algorithm is with set of nodeAll nodes for extension starting point, with certain lengthFor radius is outwards searched for, obtain and guide wall scroll Road RiFingerpost lay region, the fingerpost of acquisition is laid region by road-net node set representations, is designated as
4. it is according to claim 2 to be guided up to maximized road fingerpost distribution method based on region entirety, its It is characterised by:The fingerpost lays all director informations set RS (R for guiding the road laid in regioni)= {γ12,...γjRepresent, wherein, γjRepresent and guide target road RiFingerpost director information, γjWith such as subordinate One of property:
(1)fvj):Represent director information γjThe intersection node of guide;
(2)flaj):Represent director information γjResiding road network segmental arc, the road network segmental arc is expressed as follows:
(3)fnaj):Represent according to γjGuide, with intersection fvj) next road network segmental arc for being joined directly together;
(4)fobjj):Represent γjThe road R of guideiTitle;
C(γj):Represent director information γjClassification, be respectively state mark S1, connectivity mark S2S is identified with directionality3, It is defined as follows:
5. it is according to claim 4 to be guided up to maximized road fingerpost distribution method based on region entirety, its It is characterised by:The region fingerpost is laid rule and is specially:
(1) for single road RiIf it is one-level road or secondary road, the guide road R for layingiDirector information γj Classification is that state identifies S1And/or connectivity mark S2And/or directionality mark S3
(2) for single road RiIf it is three-level road or level Four road, the guide road R for layingiDirector information γj Classification is that state identifies S1And/or connectivity mark S2
6. it is according to claim 4 to be guided up to maximized road fingerpost distribution method based on region entirety, its It is characterised by:The quantity of the director information laid on each fingerpost is no more than 7, wherein directionality mark S3No More than 2.
7. it is according to claim 1 to be guided up to maximized road fingerpost distribution method based on region entirety, its It is characterised by:The artificial bee colony algorithm Optimized model is as follows to the detailed process that superposition layout scheme simplify optimization:
S1. starting stage:The multiple nectar sources of initialization a, nectar source represents that a feasible area road fingerpost superposition is laid Scheme;
S2. the fitness function in each nectar source is calculated:
Wherein f represents the fitness function in nectar source;P(Ri) represent road R in nectar sourceiGuide up to rate, Q (Ri) represent nectar source Middle road RiGuide coefficient, fitness function value is bigger, and nectar source is more excellent, i.e., area road fingerpost superposition layout scheme is got over It is excellent;
S4. the honeybee stage is led:Each leads the nectar source that honeybee associates to it to carry out neighborhood search in this stage, obtains a neighborhood honey Source, then contrasts the fitness function value in neighborhood nectar source and green molasses source, if the fitness function value in neighborhood nectar source is higher than green molasses source Fitness function value, then by neighborhood nectar source be updated to its association nectar source;
S5. the honeybee stage is followed:Each follows honeybee to select a nectar source to be associated using the selection mode of roulette in this stage, Each follows the nectar source that honeybee associates to it to carry out neighborhood search, obtains a neighborhood nectar source, then contrasts neighborhood nectar source and green molasses The fitness function value in source, if the fitness function value in neighborhood nectar source is higher than the fitness function value in green molasses source, by neighborhood honey Source is updated to the nectar source of its association;
S6. step S4, S5 is repeated, during repeating, if certain nectar source does not update for continuous k times abandon the honey Honeybee is investigated in source, leading honeybee or following honeybee to be changed into for being associated with the nectar source, and a new nectar source is re-searched in search space Replace abandoned nectar source, then perform step S4 or S5;
S7. optimal area road fingerpost layout scheme is obtained by step S4, S5, S6.
8. it is according to claim 7 to be guided up to maximized road fingerpost distribution method based on region entirety, its It is characterised by:It is described to guide up to rate P (Ri) be expressed as follows:
P ( R i ) = S 1 ( R i ) S ( R i )
Wherein S1(Ri) represent all guide road R in regioniFingerpost director information in can constitute up to guided path Director information quantity;S(Ri) represent and road R is guided in regioniAll fingerpost director information quantity.
9. it is according to claim 7 to be guided up to maximized road fingerpost distribution method based on region entirety, its It is characterised by:The road RiGuide coefficient Q (Ri) be expressed as follows:
Q ( R i ) = 1 / G ( R i ) Σ i 1 / G ( R i )
Wherein G (Ri) represent road RiCategory of roads.
10. it is according to claim 7 to be guided up to maximized road fingerpost distribution method based on region entirety, its It is characterised by:In the step S6, the probability that each nectar source is led honeybee to select is as follows:
P i = f i Σ i f i
Wherein PiRepresent the selected probability of nectar source i;fiRepresent the fitness function value of nectar source i.
CN201611162902.0A 2016-12-15 2016-12-15 Road direction sign layout method capable of achieving maximization based on regional overall direction Active CN106709599B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201611162902.0A CN106709599B (en) 2016-12-15 2016-12-15 Road direction sign layout method capable of achieving maximization based on regional overall direction

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201611162902.0A CN106709599B (en) 2016-12-15 2016-12-15 Road direction sign layout method capable of achieving maximization based on regional overall direction

Publications (2)

Publication Number Publication Date
CN106709599A true CN106709599A (en) 2017-05-24
CN106709599B CN106709599B (en) 2020-10-16

Family

ID=58937963

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201611162902.0A Active CN106709599B (en) 2016-12-15 2016-12-15 Road direction sign layout method capable of achieving maximization based on regional overall direction

Country Status (1)

Country Link
CN (1) CN106709599B (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107562986A (en) * 2017-07-18 2018-01-09 北京工业大学 A kind of fingerpost layout information layout optimization design method and device
CN110517484A (en) * 2019-08-06 2019-11-29 南通大学 Diamond interchange area planar crossing sign occlusion prediction model building method
CN112632663A (en) * 2020-12-18 2021-04-09 广州方纬智慧大脑研究开发有限公司 Road traffic direction mark generation method, device, equipment and medium

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150185033A1 (en) * 2012-08-31 2015-07-02 Bae Systems Plc Route planning
CN104808665A (en) * 2015-04-16 2015-07-29 上海大学 Multi robot path planning method based on multi-target artificial bee colony algorithm
CN105678421A (en) * 2016-01-07 2016-06-15 中山大学 Genetic algorithm-based guide sign guidance reachability optimization method

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150185033A1 (en) * 2012-08-31 2015-07-02 Bae Systems Plc Route planning
CN104808665A (en) * 2015-04-16 2015-07-29 上海大学 Multi robot path planning method based on multi-target artificial bee colony algorithm
CN105678421A (en) * 2016-01-07 2016-06-15 中山大学 Genetic algorithm-based guide sign guidance reachability optimization method

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
黄敏 等: "基于指引可达性的指路标志布设优化模型", 《中山大学学报(自然科学版)》 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107562986A (en) * 2017-07-18 2018-01-09 北京工业大学 A kind of fingerpost layout information layout optimization design method and device
CN110517484A (en) * 2019-08-06 2019-11-29 南通大学 Diamond interchange area planar crossing sign occlusion prediction model building method
CN112632663A (en) * 2020-12-18 2021-04-09 广州方纬智慧大脑研究开发有限公司 Road traffic direction mark generation method, device, equipment and medium
CN112632663B (en) * 2020-12-18 2024-01-16 广州方纬智慧大脑研究开发有限公司 Road traffic road sign generation method, device, equipment and medium

Also Published As

Publication number Publication date
CN106709599B (en) 2020-10-16

Similar Documents

Publication Publication Date Title
CN104008666B (en) A kind of fingerpost distribution method towards point of interest
CN105183955B (en) A kind of tier building optimum path planning method
Verma et al. Feeder bus routes generation within integrated mass transit planning framework
CN106709599A (en) Whole region guide maximization-based road guide sign laying method
CN111836199B (en) Indoor navigation dynamic obstacle avoidance and path finding method
CN103049829B (en) Integrated fusion method of urban and rural passenger line network and hub station
Ma et al. Modeling pedestrian space in complex building for efficient pedestrian traffic simulation
CN106228265A (en) Based on Modified particle swarm optimization always drag phase transport project dispatching algorithm
CN105678425A (en) Interurban railway train operation optimization method based on multi-beat combination
CN103258143A (en) Evaluation method for implementation effect of city scape planning
CN110796308A (en) Travel route optimization method based on fuzzy ant colony algorithm
Sun et al. Solving demand-responsive feeder transit service design with fuzzy travel demand: A collaborative ant colony algorithm approach
CN112797997B (en) Emergency path planning architecture and method based on grid road network
CN104331424B (en) The purification method of sensitive trajectory model in a kind of user's motion track
Cipriani et al. A multimodal transit network design procedure for urban areas
Wu et al. Network equilibrium for congested multi‐mode networks with elastic demand
CN103021165A (en) Urban road traffic information board layout optimizing method considering road network topological attribute
CN105678421A (en) Genetic algorithm-based guide sign guidance reachability optimization method
Qureshi et al. A Comparative Analysis of Multi-Criteria Road Network
Vanclooster et al. Calculating least risk paths in 3D indoor space
CN114817666A (en) Method for visualizing OD (origin-destination) flow among traffic cells based on road network edge binding
Mina et al. Deployment model for urban guide signs based on road network topology
CN106709011A (en) Positional concept hierarchy disambiguation calculation method based on spatial locating cluster
Nagurney Spatial equilibration in transport networks
CN108122053B (en) BMO algorithm-based newly-built river-crossing channel guidance optimization method

Legal Events

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