CN102737066A - Method and device for generating bus transfer schemes - Google Patents

Method and device for generating bus transfer schemes Download PDF

Info

Publication number
CN102737066A
CN102737066A CN2011100955875A CN201110095587A CN102737066A CN 102737066 A CN102737066 A CN 102737066A CN 2011100955875 A CN2011100955875 A CN 2011100955875A CN 201110095587 A CN201110095587 A CN 201110095587A CN 102737066 A CN102737066 A CN 102737066A
Authority
CN
China
Prior art keywords
bus
relation
line
line segment
elements
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
CN2011100955875A
Other languages
Chinese (zh)
Other versions
CN102737066B (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.)
Navinfo Co Ltd
Original Assignee
Navinfo Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Navinfo Co Ltd filed Critical Navinfo Co Ltd
Priority to CN201110095587.5A priority Critical patent/CN102737066B/en
Publication of CN102737066A publication Critical patent/CN102737066A/en
Application granted granted Critical
Publication of CN102737066B publication Critical patent/CN102737066B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Traffic Control Systems (AREA)

Abstract

The invention provides a method and a device for generating bus transfer schemes, relates to the field of bus transfer treatment, and solves the technical problem in the prior art that river-across walking distance needs to be considered when a bus transfer scheme is generated. The method for generating bus transfer schemes comprises the following steps: step 1, generating a fold line simulating a center line according to the center line of a river; step 2, acquiring two point elements to be assessed in a bus transfer data model; step 3, establishing a bus-taking relationship between the two point elements according to intersection condition of a first line segment between the two point-elements and the fold line; and step 4, generating bus transfer schemes according to bus-taking relationship between the two point-elements. The method and the device for generating bus transfer schemes do not need to take river-across walking distance into consideration, thereby being simple in calculation method.

Description

Generate the method and apparatus of Public Transport Transfer scheme
Technical field
The present invention relates to the Public Transport Transfer process field, be meant a kind of method and apparatus that generates the Public Transport Transfer scheme especially.
Background technology
(Geographic Information System, the expression type of data model GIS) mainly contains GIS-Geographic Information System: three kinds of point, line, surface.In city bus transfer network model, need bus stop, starting point, endpoint information be described through the GIS point model, routing information, the walking information of public bus network described with line model.Shown in Figure 1 is the synoptic diagram of the public traffic network model in the reality.
This model is made up of public bus network, bus station, starting point, terminal point, public transport section, Public Transport Transfer district, the relation of getting on the bus, the relation of getting off etc.Below explanation respectively:
(1) public bus network, each public bus network has unique number, and can be with public bus network title, starting point, terminal point, start operation, finish information such as service time and be recorded in the attribute data.
(2) bus station, the fixing stop website of public transport is the place that the passenger can get on or off the bus on the public bus network.Can its locus be described through point model.
(3) starting point is passenger's a starting point.Can its locus be described through point model.
(4) terminal point is passenger's destination.Can its locus be described through point model.
(5) public transport section comprises the routing information of urban public bus lines.Can describe its locus through line model, be end points with the bus station.
(6) Public Transport Transfer district is made up of a plurality of bus stations, is the passenger can change to public bus network in walking distance public transport erect-position set.Transfer relation between the public bus network can only take place AT STATION and between the station.If in general overlap on station and the locus, station, can think so has the transfer relation.Secondly, if walking distance is in the user stands scope between two websites, also think to have the transfer relation.
(7) relation of getting on the bus, the set of forming by starting point and some bus stations.The relation of getting on the bus can only take place between starting point and bus station.If the walking distance between starting point and the bus station in the user stands scope, then thinks to have the relation of getting on the bus.
(8) relation of getting off, the set of forming by terminal point and some bus stations.The relation of getting off can only take place between terminal point and bus station.If the walking distance between terminal point and the bus station in the user stands scope, then thinks to have the relation of getting off.
(9) walking distance is the distance of people's pad it.In Public Transport Transfer district, the relation of getting on the bus, the relation of getting off, all used walking distance.But because pedestrian walkway data procurement cost is higher, calculate than reasons such as complicacies, air line distance commonly used replaces in the practical application.But air line distance is evaded factor because of not considering rivers etc., sometimes can fall far short with actual walking distance.Need consider during application that rivers etc. evade factor correction.The available line model is described its locus.
In the urban public transport network, Public Transport Transfer is the major issue that the passenger goes on a journey.Along with the continuous expansion of city bus scale, there is the trip of considerable part to be difficult to go directly, the passenger must just can arrive the destination through transfer.It is circuit traffic trip cost that the passenger selects the main foundation of public bus network.Public bus network traffic trip cost is meant travel time that the passenger goes on a journey, expense, convenience (like transfer) etc. on public bus network.So-called scheme by bus is the alternate sequence of a website, circuit, and what circuit this sequence explanation takes from starting point, how to change in the way, until arriving the destination.
Many travelers hope to set arbitrarily the weight of each item factors such as traffic trip cost middle distance, time, expense, and to realize comprehensively weighing optimum transfer plan, this relates to the conversion of Public Transport Transfer network.
In more existing public traffic network transfer models, evade rivers according to the walking path planning.Needing (situation that starting point is breasted the tape to transfer, get-off stop between the website of getting on the bus, the public transport) under the situation of walking, at first carrying out the walking path planning of point-to-point, obtaining walking distance.Under the situation of crossing over rivers, surpass preset value through walking distance and filter out the path that this need cross over rivers, reach the purpose of evading rivers with this.The shortcoming of the method is: according to the method that the walking path planning is evaded rivers, complex algorithm has increased the complexity of Public Transport Transfer system.
Summary of the invention
The technical matters that the present invention will solve provides a kind of method and apparatus that generates the Public Transport Transfer scheme, when planning transfer path, need not consider to cross over the walking path of rivers, and computing method are simple.
For solving the problems of the technologies described above, embodiments of the invention provide technical scheme following:
On the one hand, a kind of method that generates the Public Transport Transfer scheme is provided, comprises:
Step 1 according to the center line of rivers, generates the broken line of the said center line of simulation;
Step 2 is obtained two some elements to be assessed in the Public Transport Transfer data model;
Step 3 according to first line segment between said two some elements and the crossing situation between the said broken line, is set up the relation by bus between said two some elements;
Step 4, the relation by bus according between said two some elements generates the Public Transport Transfer scheme.
On the other hand, a kind of device that generates the Public Transport Transfer scheme is provided, comprises:
The broken line generation unit according to the center line of rivers, generates the broken line of the said center line of simulation;
Point element acquiring unit obtains two some elements to be assessed in the Public Transport Transfer data model;
Relation is set up the unit by bus, according to first line segment between said two some elements and the crossing situation between the said broken line, sets up the relation by bus between said two some elements;
Public Transport Transfer scheme generation unit, the relation by bus according between said two some elements generates the Public Transport Transfer scheme.
Embodiments of the invention have following beneficial effect:
In the such scheme, need not consider to cross over the walking path of rivers when generating the Public Transport Transfer scheme, computing method are simple.
Description of drawings
Shown in Figure 1 is the synoptic diagram of the public traffic network model in the reality;
Fig. 2 is the schematic flow sheet of the method for generation Public Transport Transfer scheme of the present invention;
Fig. 3 is the schematic flow sheet of step 13 of the method for the described generation Public Transport Transfer of Fig. 2 scheme;
Fig. 4 is the structural representation of the device of generation Public Transport Transfer scheme of the present invention;
Fig. 5 is the process flow diagram that rivers are evaded in Public Transport Transfer in the embodiments of the invention;
Fig. 6 is the ready-made rivers centreline data of step 301 synoptic diagram among Fig. 5;
Fig. 7 is the concrete realization flow figure of step 302 among Fig. 5;
Fig. 8 is the concrete realization flow figure of step 303 among Fig. 5;
Fig. 9 is the synoptic diagram as a result after step 303 is carried out among Fig. 5;
Figure 10 is the concrete realization flow figure of step 304 among Fig. 5;
Figure 11 is the synoptic diagram as a result after step 304 is carried out among Fig. 5;
Figure 12 is the synoptic diagram as a result after step 305 is carried out among Fig. 5;
Figure 13 is the synoptic diagram as a result after step 306 is carried out among Fig. 5;
Figure 14 is the exemplary plot of public traffic network conversion among the described embodiment of Fig. 5;
Figure 15 is the synoptic diagram of rivers center line among the present invention.
Embodiment
For technical matters, technical scheme and advantage that embodiments of the invention will be solved is clearer, will combine accompanying drawing and specific embodiment to be described in detail below.
As shown in Figure 2, be a kind of method that generates the Public Transport Transfer scheme of the present invention, comprising:
Step 11 according to the center line of rivers, generates the broken line of the said center line of simulation;
Step 12 is obtained two some elements to be assessed in the Public Transport Transfer data model;
Step 13 according to first line segment between said two some elements and the crossing situation between the said broken line, is set up the relation by bus between said two some elements; When said two some elements were two websites, said two websites belonged to different bus routes, and the distance between said two websites is less than first predetermined value, and said relation by bus is the transfer relation; When said two some elements were website and user's starting point, the distance between said website and said user's the starting point was less than second predetermined value, and said relation by bus is the relation of getting on the bus; When said two some elements were website and user's terminal point, the distance between said website and said user's the terminal point was less than the 3rd predetermined value, and said relation by bus is the relation of getting off.
Step 14, the relation by bus according between said two some elements generates the Public Transport Transfer scheme.
In one implemented, said step 11 comprised:
Step 111 is obtained the center line of said rivers; In Figure 15, suppose that center line is the curve between the AD.
Step 112, every separated preset distance is gathered the point on the said center line; In Figure 15, the point of collection is B, C.
Step 113, two end points of the said center line of adjacent successively connection, the said point of collection generate at least one second line segment; In Figure 15, the 4th line segment is the line segment between AB, BC, the CD.
Step 114 according to all said second line segments, forms the broken line of the center line of the said rivers of simulation.In Figure 15, broken line is to be made up of the line segment between AB, BC, the CD.
In another was implemented, said step 11 comprised:
Step 111 is obtained the center line of said rivers; In Figure 15, suppose that center line is the curve between the AD.
Step 112 is divided at least one cross-talk center line with said center line; In Figure 15, the subcenter line is the curve between AB, BC, the CD.
Step 113 connects two end points of said at least one subcenter line, generates at least two section the 4th line segment; In Figure 15, the 4th line segment is AB, BC, CD.
Step 114 according to said all the 4th line segments, forms the broken line of the center line of the said rivers of simulation.In Figure 15, broken line is to be made up of the line segment between AB, BC, the CD.
Optional, said step 11 also comprises:
Step 115 respectively according to every said second line segment, generates one first planar graph; That is one second corresponding one first planar graph of line segment;
Accordingly, as shown in Figure 3, said step 13 comprises:
Step 131, first line segment according between said two some elements generates second planar graph;
Step 132, judge whether said second planar graph and all said first planar graphs be all non-intersect:
Step 133 when if said second planar graph and all said first planar graphs are all non-intersect, is then set up the relation by bus between said two some elements;
Step 134; When if said second planar graph and at least one said first planar graph intersect; Judge then whether said first line segment and second line segment that generates said crossing first planar graph intersect and intersection point is not the end points of said first line segment, generate judged result;
Step 135 is if said judged result is then set up the relation by bus between said two some elements for not;
Step 136 is not if said judged result, is then set up the relation by bus between two some elements for being.
In one embodiment, said first planar graph is first rectangle, and said second planar graph is second rectangle; Said respectively according to every said second line segment, the step that generates one first planar graph is specially: be diagonal line with said at least one second line segment respectively, generate at least one first rectangle; Said according to first line segment between said two some elements, the step that generates second planar graph is specially: with said first line segment is diagonal line, generates second rectangle; When said rectangle is square, then generate unique square according to diagonal line.When said rectangle is not when square, generate rectangle step can for: suppose a coordinate system (X axle, Y axle), be respectively the straight line that starting point makes to be parallel to X axle and Y axle with two end points of line segment, then intersection forms a rectangle.The method of following generation coordinate system and similar here is all in the same coordinate system of hypothesis.Accordingly, relatively whether two rectangles intersect and can compare according to the coordinate figure on four limits of rectangle.
In another embodiment, said first planar graph is first circle, and said second planar graph is second circle; Said respectively according to every said second line segment, the step that generates one first planar graph is specially: be diameter with said at least one second line segment respectively, generate at least one first circle; Said according to first line segment between said two some elements, the step that generates second planar graph is specially: with said first line segment is diameter, generates second circle.Generating circular step is specially: be respectively diameter with the line segment, generate circular.Relatively whether whether two circles intersect and can judge greater than two diameter of a circle sums according to the distance between the center of circle of two circles.In the above-mentioned steps; Judge that the computing method that whether intersect between the figure are than judging that the computing method that whether intersect between the line segment are simple; In the present embodiment; Through judging whether crossing computing instead of part need not judged the computing of whether intersecting between the line segment between the figure, has therefore improved processing speed.
In one embodiment, said method can for:
At first, according to the center line of rivers, generate the broken line of the center line of the said rivers of simulation;
Then, obtain the set of website to be assessed, user's starting point and user's terminal point;
Then; According to first line segment between two websites in the set of said website to be assessed and the crossing situation between the said broken line; Set up the transfer relation of said two websites, said two websites belong to different bus routes, and the length of said first line segment is less than first predetermined value;
Then, according to website and second line segment between the said starting point and the crossing situation between the said broken line in the set of said website to be assessed, set up the relation of getting on the bus between said starting point and the said website, the length of said second line segment is less than second predetermined value;
Then, according to website and the 3rd line segment between the said terminal point and the crossing situation between the said broken line in the set of said website to be assessed, set up the relation of getting off between said terminal point and the said website, the length of said the 3rd line segment is less than the 3rd predetermined value;
Then, the relation of getting off according between the relation of getting on the bus, said terminal point and the said website between the relation of the transfer between the said website, said starting point and the said website generates the Public Transport Transfer scheme.
In the above-mentioned steps, when the line segment intersection between the center line of rivers and the some element, then explanation needs to cross over rivers, and the present invention has evaded rivers through the crossing situation between the judgement line segment.
As shown in Figure 4. be a kind of device that generates the Public Transport Transfer scheme of the present invention, comprise:
Broken line generation unit 41 according to the center line of rivers, generates the broken line of the said center line of simulation;
Point element acquiring unit 42 obtains two some elements to be assessed in the Public Transport Transfer data model;
Relation is set up unit 43 by bus, according to first line segment between said two some elements and the crossing situation between the said broken line, sets up the relation by bus between said two some elements; When said two some elements were two websites, said two websites belonged to different bus routes, and the distance between said two websites is less than first predetermined value, and said relation by bus is the transfer relation; When said two some elements were website and user's starting point, the distance between said website and said user's the starting point was less than second predetermined value, and said relation by bus is the relation of getting on the bus; When said two some elements were website and user's terminal point, the distance between said website and said user's the terminal point was less than the 3rd predetermined value, and said relation by bus is the relation of getting off.
Public Transport Transfer scheme generation unit 44, the relation by bus according between said two some elements generates the Public Transport Transfer scheme.
Said broken line generation unit 41 comprises:
Obtain subelement, obtain the center line of said rivers;
Gather the every separated preset distance of subelement and gather the point on the said center line;
Second line segment generates subelement, and two end points of the said center line of adjacent successively connection, the said point of collection generate at least two section second line segment;
Broken line generates subelement, according to all second line segments, forms the broken line of the center line of the said rivers of simulation.
The device of described generation Public Transport Transfer scheme also comprises: planar graph generation unit 45 respectively according to every said second line segment, generates one first planar graph; First line segment according between said two some elements generates second planar graph;
Said relation is by bus set up unit 43 and is comprised:
First judgment sub-unit, judge whether said second planar graph and all said first planar graphs be all non-intersect:
First by bus relation set up subelement, when said second planar graph and all said first planar graphs are all non-intersect, set up concerning by bus between said two some elements;
Second judgment sub-unit; When said second planar graph and at least one said first planar graph intersect; Judge whether said first line segment and second line segment that generates said crossing first planar graph intersect and intersection point is not the end points of said first line segment, generate judged result;
Second by bus relation set up subelement, when said judged result for not the time, set up the relation by bus between said two some elements.
Said first planar graph is first rectangle, and said second planar graph is second rectangle; Said planar graph generation unit is specially: be diagonal line with said at least one second line segment respectively, generate at least one first rectangle; With said first line segment is diagonal line, generates second rectangle; Perhaps
Said first planar graph is first circle, and said second planar graph is second circle; Said planar graph generation unit is specially: be diameter with said at least one second line segment respectively, generate at least one first circle; With said first line segment is diameter, generates second circle.
The present invention proposes a kind of Public Transport Transfer and evade the method and apparatus of rivers automatically, do not rely on the pedestrian walkway data, only need to increase and evade data on a small quantity and just can realize that Public Transport Transfer evades rivers automatically.Said method comprises:
When (1) compiling the public transport data, set up rivers as follows and evade data:
The rivers center line that utilizes the map data creating instrument to make need to evade, and be divided into plurality of sections;
Obtain the boundary rectangle frame of every section center line;
Preserving every section center line and boundary rectangle frame thereof is that rivers are evaded data.
When (2) compiling the public transport data, set up the Public Transport Transfer relation as follows:
Air line distance is less than preset distance between any two websites of non-same bus routes;
If with two websites be the boundary rectangle frame of rectangle frame and institute's own centre line of end points when all non-intersect, these two websites are set up transfer and are concerned;
If with two websites be the boundary rectangle frame of rectangle frame and some center line of end points when intersecting, judge successively two websites are whether the line segment of end points is crossing with these center lines.
If all non-intersect, these two websites are set up the transfer relation.If there is one to intersect, these two websites are not set up the transfer relation.
When (3) Public Transport Transfer is calculated, set up the relation of getting on the bus of starting point and bus station according to following steps:
Air line distance between starting point and any bus station is less than preset distance;
If with starting point and bus station be the boundary rectangle frame of rectangle frame and institute's own centre line of two end points when all non-intersect, starting point and this bus station foundation relation of getting on the bus;
If with starting point and bus station be the boundary rectangle frame of rectangle frame and some center line of end points when intersecting, judge successively starting point and bus station are whether line segment and these center lines of end points are crossing.
If all non-intersect, starting point is set up the relation of getting on the bus with this bus station.If there is one to intersect, starting point is not set up the relation of getting on the bus with this bus station;
(4) set up the same quadrat method of getting on the bus and concerning according to starting point and bus station, set up the relation of getting off of terminal point and bus station.
Referring to Fig. 5, be the process flow diagram that rivers are evaded in Public Transport Transfer in the embodiment of the invention, may further comprise the steps:
Step 301, the shape data of generation rivers center line;
Step 302, generate rivers to rivers center line shape data and evade data.
When step 303, public transport data compilation, utilize rivers to evade data and generate Public Transport Transfer district data.Referring to Fig. 9, be the synoptic diagram as a result after step 303 is carried out;
When step 304, public transport planning, utilize rivers to evade the relation of getting on the bus that data generate starting point and bus station.Referring to Figure 11, be the synoptic diagram as a result after step 304 is carried out;
When step 305, public transport planning, utilize the identical method of step 304 to generate the relation of getting off of terminal point and bus station.Figure 12 is the synoptic diagram as a result after step 305 is carried out;
Step 306, utilize shortest path first to calculate the Public Transport Transfer scheme.Figure 13 is the synoptic diagram as a result after step 306 is carried out.
Wherein, step 301 comprises:
At first, gather the geographic coordinate of the center line of all rivers that need evade of certain city;
Then, be divided into some groups to the geographic coordinate of the center line in every river.What change in shape was little is divided into one group.Be advisable with about 10 groups for accelerating river of computing velocity.
Then, utilize general cartography instrument (like ArcGis), every group of geographic coordinate made a line style record.The shape data of line style record is the geographic coordinate of this group.The attribute data of line style record is a serial number.
Then, the line style record of all generations is put together, generate rivers center line shape data.Fig. 6 is ready-made rivers center line shape data.
Fig. 7 is the concrete realization flow figure of step 302 among Fig. 5, and this process flow diagram may further comprise the steps:
Step 501, read the rivers center line shape data that step 301 among Fig. 5 generates;
Step 502, obtain the line style record number of rivers center line shape data, and apply for the space for evading the tabulation of line record; Evading line is the abstract broken line of rivers center line.
Step 503, obtain the shape point number of all line styles of rivers center line shape data record, and apply for the space for the shape point tabulation;
Following operation carried out in every line style record in the rivers center line shape data;
Step 504, the shape point number of evading line record are the shape point number of line style record;
The shape point of all line styles records was total before step 505, the original shape point sequence number of evading line record were;
The boundary rectangle of step 506, calculating line style record shape data, the boundary rectangle of evading the line record is the boundary rectangle of line style record shape data; The line of evading here is equivalent to the above-mentioned broken line of being made up of a plurality of the 4th line segments.
Step 507, the shape data that line style is write down add the shape point tabulation;
Step 508, judge whether to travel through all line style records, if, process ends then.Otherwise, execution in step 504.
Fig. 8 is the concrete realization flow figure of step 303 among Fig. 5, may further comprise the steps:
Following operation is carried out in all bus stations:
Step 701, obtain with a certain bus station T air line distance smaller or equal to apart from the bus station of threshold values D1 set Q1;
Operation below carry out all bus stations in the pair set Q1:
Step 702, the line segment L that to obtain with a certain bus station B in T and the Q1 be two end points, and the boundary rectangle R of line segment L; Boundary rectangle R is that diagonal line generates with line segment L.
Step 703, traversal rivers evade that all evade the line record in the data, obtain evading line set of records ends P, and the boundary rectangle that all among the P are evaded the line record all intersects with R;
If step 704 set P is empty, then execution in step 706, if set P is not empty, then execution in step 705;
If the broken line that shape point data of evading the line record constitute is arranged in the step 705 set P and line segment L intersects and intersection point is not the end points of line segment L, then execution in step 707, otherwise execution in step 706;
Step 706, B is joined the Public Transport Transfer district of T, T joins the Public Transport Transfer district of B;
Step 707, all bus stations in the Q1 whether have been traveled through.It is process ends then.Otherwise execution in step 702;
Obtain Public Transport Transfer district data after having traveled through all bus stations.Fig. 9 is the synoptic diagram as a result after step 303 is carried out;
Figure 10 is the concrete realization flow figure of the step 304 among Fig. 5, and this process flow diagram may further comprise the steps:
Step 901, obtain with starting point S air line distance smaller or equal to apart from the bus station of threshold values D2 set Q1;
Operation below carry out all bus stations in the pair set Q1:
Step 902, the line segment L that to obtain with a certain bus station B in S and the Q1 be two end points, and the boundary rectangle R of line segment L;
Step 903, traversal rivers evade that all evade the line record in the data, obtain evading line set of records ends P, and the boundary rectangle that all among the P are evaded the line record all intersects with R;
If step 904 set P is empty execution in step 906, if set P is not empty execution in step 905;
If the broken line that shape point data of evading the line record constitute is arranged in the step 905 set P and line segment L intersects and intersection point is not the end points of line segment L, then execution in step 907, otherwise execution in step 906;
Step 906, B joined the relation of getting on the bus of S;
Step 907, all bus stations in the Q1 whether have been traveled through.It is process ends then.Otherwise execution in step 902.
Below the simple step that generates the Public Transport Transfer scheme of describing.
In public traffic network, though many public bus networks can intersect at the same point on the space, this point is not necessarily dockable bus station, perhaps be not that website is arranged simultaneously, thereby different public bus network does not lead at this.Node in the public traffic network is the bus station, and the public transport section in the Public Transport Transfer network can be abstract by the connected state principle is segmental arc:
A) belong to public transport section with the adjacent bus station of route, abstract is segmental arc (type for by bus);
B) different routes but the identical bus station of physical location realize being communicated with through the original place transfer, and abstract be segmental arc (type is for changing to);
C) different routes but the bus station geographically closed on realize being communicated with through the walking transfer, and abstract be segmental arc (type is for changing to);
D) starting point realizes being communicated with through walking near bus station, and abstract is segmental arc (type is for getting on the bus);
E) breast the tape near the bus station the terminal point, realizes being communicated with through walking, and abstract is segmental arc (type is for getting off);
Suppose that public traffic network has starting point S and two points of terminal point E; If calculate the shortest path of considering the transfer influence from starting point S to starting point E; Can carry out the conversion of Public Transport Transfer network; The influence that eliminate the walking of transfer point, wait for bus, public transport fares etc. brought will have the network problem of transfer to be transformed to the general networking problem that not have transfer, and how the Public Transport Transfer problem just can be abstract obtains the transfer plan problem from a node of public traffic network digraph to the another one node for solution.Shown in Figure 14 is the synoptic diagram of public traffic network conversion.The Public Transport Transfer problem can adopt shortest path first, for example dijkstra's algorithm.Shortest path first should be based on the digraph data structuring model of segmental arc and node.
According to user's optimum transfer plan target, can set the weight of each factor in the transfer plan, and give the trip cost weights (weight A to weight D specify) of segmental arc in the digraph by optimum transfer plan:
Public transport section segmental arc weight=segmental arc distance * weight A%+ (the segmental arc drive time+by way of down time of website) * weight B%+ expense variation * weight D%
Original place transfer segmental arc weight=average Waiting time * weight B%+ transfer weight C%+ expense variation * weight D%
Walking transfer segmental arc weight=segmental arc distance * weight A%+ (segmental arc walking time+average Waiting time) * weight B%+ changes to weight C%+ expense variation * weight D%
Walking segmental arc weight=segmental arc distance * weight A%+ (segmental arc walking time+average the Waiting time) * weight B% that gets on the bus)
Walking segmental arc weight=segmental arc distance * weight A%+ (segmental arc the walking time) * weight B% that gets off.
The method of evading rivers according to the walking path planning in the prior art has following defective:
One, it is higher to obtain the cost of walking path data.Walking path data factor amount is huge, collection is difficult, change reasons such as fast, makes that the cost that obtains, safeguards is higher, and complex algorithm.
Two, the total amount of data that Public Transport Transfer system relied on is bigger.Because of walking path data volume big (maybe much larger than the public transport data volume), the data volume that makes whole Public Transport Transfer system rely on be bigger.
The present invention has following beneficial effect:
One, do not having under the pedestrian walkway data conditions, can effectively avoid crossing over the problem that rivers take bus;
Two, computation schema is simple, and speed is fast;
Three, extra increase evade data, data volume is less, procurement cost is low, makes simple;
Four, it is simple to evade algorithm, fast operation;
Five, be fit to low-cost or data volume had the Public Transport Transfer solution of strict demand.
One of ordinary skill in the art will appreciate that; Realize that all or part of step in the foregoing description method is to instruct relevant hardware to accomplish through program; Described program can be stored in the computer read/write memory medium, and this program comprises the step like above-mentioned method embodiment when carrying out; Described storage medium; As: magnetic disc, CD, read-only storage memory body (Read-Only Memory, ROM) or at random store memory body (Random Access Memory, RAM) etc.
In each method embodiment of the present invention; The sequence number of said each step can not be used to limit the sequencing of each step; For those of ordinary skills, under the prerequisite of not paying creative work, the priority of each step is changed also within protection scope of the present invention.
The above is a preferred implementation of the present invention; Should be pointed out that for those skilled in the art, under the prerequisite that does not break away from principle according to the invention; Can also make some improvement and retouching, these improvement and retouching also should be regarded as protection scope of the present invention.

Claims (10)

1. a method that generates the Public Transport Transfer scheme is characterized in that, comprising:
Step 1 according to the center line of rivers, generates the broken line of the said center line of simulation;
Step 2 is obtained two some elements to be assessed in the Public Transport Transfer data model;
Step 3 according to first line segment between said two some elements and the crossing situation between the said broken line, is set up the relation by bus between said two some elements;
Step 4, the relation by bus according between said two some elements generates the Public Transport Transfer scheme.
2. the method for generation Public Transport Transfer scheme according to claim 1 is characterized in that, said step 1 comprises:
Obtain the center line of said rivers;
Every separated preset distance is gathered the point on the said center line;
Two end points of the said center line of adjacent successively connection, the said point of collection generate at least two section second line segment;
According to all second line segments, form the broken line of the center line of the said rivers of simulation.
3. the method for generation Public Transport Transfer scheme according to claim 2 is characterized in that, said step 1 also comprises: respectively according to every said second line segment, generate one first planar graph;
Said step 3 comprises:
First line segment according between said two some elements generates second planar graph;
Judge whether said second planar graph and all said first planar graphs be all non-intersect:
When if said second planar graph and all said first planar graphs are all non-intersect, then set up the relation by bus between said two some elements; When if said second planar graph and at least one said first planar graph intersect, judge then whether said first line segment and second line segment that generates said crossing first planar graph intersect and intersection point is not the end points of said first line segment, generate judged result;
If said judged result is then set up the relation by bus between said two some elements for not; If said judged result, is not then set up the relation by bus between two some elements for being.
4. the method for generation Public Transport Transfer scheme according to claim 3 is characterized in that,
Said first planar graph is first rectangle, and said second planar graph is second rectangle; Said respectively according to every said second line segment, the step that generates one first planar graph is specially: be diagonal line with said at least one second line segment respectively, generate at least one first rectangle; Said according to first line segment between said two some elements, the step that generates second planar graph is specially: with said first line segment is diagonal line, generates second rectangle; Perhaps
Said first planar graph is first circle, and said second planar graph is second circle; Said respectively according to every said second line segment, the step that generates one first planar graph is specially: be diameter with said at least one second line segment respectively, generate at least one first circle; Said according to first line segment between said two some elements, the step that generates second planar graph is specially: with said first line segment is diameter, generates second circle.
5. according to the method for each described generation Public Transport Transfer scheme of claim 1-4; It is characterized in that; When said two some elements are two websites; Said two websites belong to different bus routes, and the distance between said two websites is less than first predetermined value, and said relation by bus is the transfer relation;
When said two some elements were website and user's starting point, the distance between said website and said user's the starting point was less than second predetermined value, and said relation by bus is the relation of getting on the bus;
When said two some elements were website and user's terminal point, the distance between said website and said user's the terminal point was less than the 3rd predetermined value, and said relation by bus is the relation of getting off.
6. a device that generates the Public Transport Transfer scheme is characterized in that, comprising:
The broken line generation unit according to the center line of rivers, generates the broken line of the said center line of simulation;
Point element acquiring unit obtains two some elements to be assessed in the Public Transport Transfer data model;
Relation is set up the unit by bus, according to first line segment between said two some elements and the crossing situation between the said broken line, sets up the relation by bus between said two some elements;
Public Transport Transfer scheme generation unit, the relation by bus according between said two some elements generates the Public Transport Transfer scheme.
7. the device of generation Public Transport Transfer scheme according to claim 6 is characterized in that, said broken line generation unit comprises:
Obtain subelement, obtain the center line of said rivers;
Gather the every separated preset distance of subelement and gather the point on the said center line;
Second line segment generates subelement, and two end points of the said center line of adjacent successively connection, the said point of collection generate at least two section second line segment;
Broken line generates subelement, according to all second line segments, forms the broken line of the center line of the said rivers of simulation.
8. the device of generation Public Transport Transfer scheme according to claim 7 is characterized in that, also comprises: the planar graph generation unit respectively according to every said second line segment, generates one first planar graph; First line segment according between said two some elements generates second planar graph;
Said relation is by bus set up the unit and is comprised:
First judgment sub-unit, judge whether said second planar graph and all said first planar graphs be all non-intersect:
First by bus relation set up subelement, when said second planar graph and all said first planar graphs are all non-intersect, set up concerning by bus between said two some elements;
Second judgment sub-unit; When said second planar graph and at least one said first planar graph intersect; Judge whether said first line segment and second line segment that generates said crossing first planar graph intersect and intersection point is not the end points of said first line segment, generate judged result;
Second by bus relation set up subelement, when said judged result for not the time, set up the relation by bus between said two some elements.
9. the device of generation Public Transport Transfer scheme according to claim 8 is characterized in that,
Said first planar graph is first rectangle, and said second planar graph is second rectangle; Said planar graph generation unit is specially: be diagonal line with said at least one second line segment respectively, generate at least one first rectangle; With said first line segment is diagonal line, generates second rectangle; Perhaps
Said first planar graph is first circle, and said second planar graph is second circle; Said planar graph generation unit is specially: be diameter with said at least one second line segment respectively, generate at least one first circle; With said first line segment is diameter, generates second circle.
10. according to the device of each described generation Public Transport Transfer scheme of claim 6-9, it is characterized in that,
When said two some elements were two websites, said two websites belonged to different bus routes, and the distance between said two websites is less than first predetermined value, and said relation by bus is the transfer relation;
When said two some elements were website and user's starting point, the distance between said website and said user's the starting point was less than second predetermined value, and said relation by bus is the relation of getting on the bus;
When said two some elements were website and user's terminal point, the distance between said website and said user's the terminal point was less than the 3rd predetermined value, and said relation by bus is the relation of getting off.
CN201110095587.5A 2011-04-15 2011-04-15 Method and device for generating bus transfer schemes Active CN102737066B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201110095587.5A CN102737066B (en) 2011-04-15 2011-04-15 Method and device for generating bus transfer schemes

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201110095587.5A CN102737066B (en) 2011-04-15 2011-04-15 Method and device for generating bus transfer schemes

Publications (2)

Publication Number Publication Date
CN102737066A true CN102737066A (en) 2012-10-17
CN102737066B CN102737066B (en) 2015-03-11

Family

ID=46992586

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201110095587.5A Active CN102737066B (en) 2011-04-15 2011-04-15 Method and device for generating bus transfer schemes

Country Status (1)

Country Link
CN (1) CN102737066B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107067356A (en) * 2017-03-29 2017-08-18 太仓鸿策腾达网络科技有限公司 A kind of city bus changes to management system
CN108120444A (en) * 2016-11-29 2018-06-05 高德信息技术有限公司 A kind of electronic map data processing method and device

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101650705A (en) * 2009-07-30 2010-02-17 北京四维图新科技股份有限公司 Method and device for constructing bus transfer network
CN101661668A (en) * 2009-06-19 2010-03-03 赵钊 Electronic navigation method for public transport

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101661668A (en) * 2009-06-19 2010-03-03 赵钊 Electronic navigation method for public transport
CN101650705A (en) * 2009-07-30 2010-02-17 北京四维图新科技股份有限公司 Method and device for constructing bus transfer network

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108120444A (en) * 2016-11-29 2018-06-05 高德信息技术有限公司 A kind of electronic map data processing method and device
CN107067356A (en) * 2017-03-29 2017-08-18 太仓鸿策腾达网络科技有限公司 A kind of city bus changes to management system

Also Published As

Publication number Publication date
CN102737066B (en) 2015-03-11

Similar Documents

Publication Publication Date Title
CN108871368B (en) Method and system for constructing transverse topological relation of high-precision map lane and memory
CN105528955B (en) Generate the method and its device of road network
CN109506669B (en) Dynamic path planning method, device, system and storage medium
CN103292816B (en) Electronic map generating method, device and paths planning method, device
CN110375760A (en) Route determination method, apparatus, equipment and medium
CN102081658B (en) Hierarchical road network-based path search method and device
CN112765753B (en) Public transport super network construction method
CN104266656A (en) Method and device for searching shortest path of road network
CN108021686A (en) A kind of method of public bus network and road network in Rapid matching electronic map
CN105758410A (en) Method for quickly planning and mixing paths on basis of A-star algorithms
CN107742169A (en) A kind of Urban Transit Network system constituting method and performance estimating method based on complex network
CN103063222B (en) With the navigation system and its operating method for turning to restriction scheme
CN113312737B (en) Multilayer multi-mode traffic simulation road network construction method
CN103309917A (en) Path searching method and path search device
CN101776457B (en) Navigation method and device
CN107403550A (en) Transit network collecting method, device and terminal device
CN105704195A (en) Method and equipment for determining road network partitioning border line
CN107808217A (en) A kind of Public Transport Transfer optimization method based on Big Dipper positioning with the volume of the flow of passengers
CN114550482A (en) Low-carbon target-based navigation method and parking lot navigation method
CN108280463A (en) Optimization method and device for double-layer path of vehicle-mounted unmanned aerial vehicle
CN110135014A (en) A kind of linear road element automation modeling method and device
CN114399125B (en) Motorcade optimal trajectory control method and device, electronic equipment and storage medium
CN107392387A (en) A kind of dispatching method of AGV optimal control times
CN102737066B (en) Method and device for generating bus transfer schemes
CN113191029B (en) Traffic simulation method, program, and medium based on cluster computing

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant