CN102737066B - Method and device for generating bus transfer schemes - Google Patents
Method and device for generating bus transfer schemes Download PDFInfo
- Publication number
- CN102737066B CN102737066B CN201110095587.5A CN201110095587A CN102737066B CN 102737066 B CN102737066 B CN 102737066B CN 201110095587 A CN201110095587 A CN 201110095587A CN 102737066 B CN102737066 B CN 102737066B
- 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.)
- Active
Links
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
Technical field
The present invention relates to Public Transport Transfer process field, refer to a kind of method and apparatus generating Public Transport Transfer scheme especially.
Background technology
The expression type of the data model of Geographic Information System (Geographic Information System, GIS) mainly contains: point, line, surface three kinds.In city bus passenger transfer network model, need to describe bus stop, starting point, endpoint information by GIS point model, describe routing information, the walking information of public bus network with line model.Figure 1 shows that the schematic diagram of the public traffic network model in reality.
This model is made up of public bus network, bus station, starting point, terminal, public transport section, Public Transport Transfer district, relation of getting on the bus, relation etc. of getting off.Below illustrate respectively:
(1) public bus network, each public bus network has unique number, and can by public bus network title, starting point, terminal, start operation, terminate the information such as service time and be recorded in attribute data.
(2) bus station, the stop website that on public bus network, public transport is fixing is the place that passenger can get on or off the bus.By point model, its locus is described.
(3) starting point is the starting point of passenger.By point model, its locus is described.
(4) terminal is the destination of passenger.By point model, its locus is described.
(5) public transport section, comprises the routing information of urban public bus lines.Describing its locus by line model, take bus station as end points.
(6) Public Transport Transfer district, is made up of multiple bus station, is the public transport erect-position set that passenger can change to public bus network in walking distance.Transfer relation between public bus network can only occur AT STATION and between station.If in general station and locus, station overlapped, so can think has transfer relation.Secondly, if walking distance is stood in scope user between two websites, also think to have transfer relation.
(7) to get on the bus relation, the set be made up of starting point and some bus stations.The relation of getting on the bus can only occur between starting point and bus station.If the walking distance between starting point and bus station is stood in scope user, then think to have the relation of getting on the bus.
(8) to get off relation, the set be made up of terminal and some bus stations.The relation of getting off can only occur between terminal and bus station.If the walking distance between terminal and bus station is stood in scope user, then think to have the relation of getting off.
(9) walking distance is the distance of people's pad it.Walking distance has all been used in Public Transport Transfer district, relation of getting on the bus, relation of getting off.But because pedestrian walkway data acquisition cost is higher, calculate the reasons such as more complicated, in practical application, conventional air line distance replaces.But air line distance is not because considering that rivers etc. evade factor, sometimes can fall far short with actual walking distance.Need during application to consider that rivers etc. evade factor revised.Available line model describes its locus.
In Urban Public Transportation Network, Public Transport Transfer is the major issue that passenger goes on a journey.Along with the continuous expansion of city bus scale, have the trip of considerable part to be difficult to go directly, passenger just must can arrive destination by transfer.Passenger selects the Main Basis of public bus network to be circuit traffic trip cost.Public bus network traffic trip cost refers to travel time, expense, convenience (as transfer) etc. that passenger goes on a journey on public bus network.So-called riding scheme is the alternate sequence of a website, circuit, and this sequence illustrates to take what circuit from starting point, how to change in way, until arrive destination.
Many travelers wish the weight that can set arbitrarily every 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 walking path planning.When needing walking (starting point to changing between website of getting on the bus, public transport, get-off stop to the situation of terminal), first carrying out the walking path planning of point-to-point, obtaining walking distance.When crossing over rivers, exceeding preset value by walking distance and filtering out this path needing to cross over rivers, reaching the object of evading rivers with this.The shortcoming of the method is: the method for evading rivers according to walking path planning, and algorithm is complicated, adds the complexity of public transit system.
Summary of the invention
The technical problem to be solved in the present invention is to provide a kind of method and apparatus generating Public Transport Transfer scheme, and do not need the walking path considering to cross over rivers when planning transfer path, computing method are simple.
For solving the problems of the technologies described above, embodiments of the invention provide technical scheme as follows:
On the one hand, a kind of method generating Public Transport Transfer scheme is provided, comprises:
Step 1, according to the center line of rivers, generates the broken line of the described center line of simulation;
Step 2, obtains two some elements to be assessed in Public Transport Transfer data model;
Step 3, according to the first line segment between described two some elements and the crossing situation between described broken line, sets up the relation by bus between described two some elements;
Step 4, according to the relation by bus between described two some elements, generates Public Transport Transfer scheme.
On the other hand, a kind of device generating Public Transport Transfer scheme is provided, comprises:
Broken line generation unit, according to the center line of rivers, generates the broken line of the described center line of simulation;
Point element acquiring unit, obtains two some elements to be assessed in Public Transport Transfer data model;
Relation sets up unit by bus, according to the first line segment between described two some elements and the crossing situation between described broken line, sets up the relation by bus between described two some elements;
Public Transport Transfer schemes generation unit, according to the relation by bus between described two some elements, generates Public Transport Transfer scheme.
Embodiments of the invention have following beneficial effect:
In such scheme, do not need the walking path considering to cross over rivers when generating Public Transport Transfer scheme, computing method are simple.
Accompanying drawing explanation
Figure 1 shows that the schematic diagram of the public traffic network model in 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 the step 13 of the method for the generation Public Transport Transfer scheme described in Fig. 2;
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 in embodiments of the invention, rivers are evaded in Public Transport Transfer;
Fig. 6 is step 301 ready-made rivers centreline data schematic diagram in Fig. 5;
Fig. 7 is step 302 specific implementation process flow diagram in Fig. 5;
Fig. 8 is step 303 specific implementation process flow diagram in Fig. 5;
Fig. 9 is the result schematic diagram in Fig. 5 after step 303 execution;
Figure 10 is step 304 specific implementation process flow diagram in Fig. 5;
Figure 11 is the result schematic diagram in Fig. 5 after step 304 execution;
Figure 12 is the result schematic diagram in Fig. 5 after step 305 execution;
Figure 13 is the result schematic diagram in Fig. 5 after step 306 execution;
Figure 14 is the exemplary plot of public traffic network conversion in the embodiment described in Fig. 5;
Figure 15 is the schematic diagram of rivers center line in the present invention.
Embodiment
For embodiments of the invention will be solved technical matters, technical scheme and advantage clearly, be described in detail below in conjunction with the accompanying drawings and the specific embodiments.
As shown in Figure 2, be a kind of method generating Public Transport Transfer scheme of the present invention, comprise:
Step 11, according to the center line of rivers, generates the broken line of the described center line of simulation;
Step 12, obtains two some elements to be assessed in Public Transport Transfer data model;
Step 13, according to the first line segment between described two some elements and the crossing situation between described broken line, sets up the relation by bus between described two some elements; When described two some elements are two websites, described two websites belong to different bus routes, and the distance between described two websites is less than the first predetermined value, and described relation is by bus transfer relation; When described two some elements are starting points of website and user, the distance between the starting point of described website and described user is less than the second predetermined value, and described relation is by bus the relation of getting on the bus; When described two some elements are terminals of website and user, the distance between the terminal of described website and described user is less than the 3rd predetermined value, and described relation is by bus the relation of getting off.
Step 14, according to the relation by bus between described two some elements, generates Public Transport Transfer scheme.
In implementing one, described step 11 comprises:
Step 111, obtains the center line of described rivers; As in Figure 15, suppose that center line is the curve between AD.
Step 112, gathers the point on described center line every preset distance; As in Figure 15, the point of collection is B, C.
Step 113, two end points of the described center line of adjacent connection, the described point of collection, generate at least one second line segment successively; As in Figure 15, the 4th line segment is the line segment between AB, BC, CD.
Step 114, according to all described second line segments, forms the broken line of the center line of the described rivers of simulation.As in Figure 15, broken line is be made up of the line segment between AB, BC, CD.
In another is implemented, described step 11 comprises:
Step 111, obtains the center line of described rivers; As in Figure 15, suppose that center line is the curve between AD.
Step 112, is divided at least one cross-talk center line by described center line; As in Figure 15, subcenter line is the curve between AB, BC, CD.
Step 113, connects two end points of described at least one subcenter line, generates at least two section of the 4th line segment; As in Figure 15, the 4th line segment is AB, BC, CD.
Step 114, according to described all 4th line segments, forms the broken line of the center line of the described rivers of simulation.As in Figure 15, broken line is be made up of the line segment between AB, BC, CD.
Optionally, described step 11 also comprises:
Step 115, respectively the second line segment according to every bar, generate first planar graph; That is, corresponding first planar graph of the second line segment;
Accordingly, as shown in Figure 3, described step 13 comprises:
Step 131, according to the first line segment between described two some elements, generates the second planar graph;
Step 132, judge described second planar graph and all described first planar graphs whether all non-intersect:
Step 133, if described second planar graph and all described first planar graphs all non-intersect time, then set up the by bus relation between described two some elements;
Step 134, if when described second planar graph is crossing with at least one described first planar graph, whether the second line segment then judging described first line segment and generate described the first crossing planar graph intersects and intersection point is not the end points of described first line segment, generates judged result;
Step 135, if described judged result is no, then sets up the relation by bus between described two some elements;
Step 136, if described judged result is yes, does not then set up the relation by bus between two some elements.
In one embodiment, described first planar graph is the first rectangle, and described second planar graph is the second rectangle; Described the second line segment according to every bar respectively, generates the step of first planar graph and is specially: respectively with described at least one second line segment for diagonal line, generate at least one first rectangle; Described according to the first line segment between described two some elements, the step generating the second planar graph is specially: with described first line segment for diagonal line, generate the second rectangle; When described rectangle is square, then generate unique square according to diagonal line.When described rectangle is not square, the step generating rectangle can be: suppose a coordinate system (X-axis, Y-axis), and be respectively with two of line segment end points the straight line that starting point makes to be parallel to X-axis and Y-axis, then intersection forms a rectangle.The method of following generation coordinate system and similar herein, all in the same coordinate system of hypothesis.Accordingly, compare two rectangles whether to intersect and can compare according to the coordinate figure on four of a rectangle limit.
In another embodiment, described first planar graph is the first circle, and described second planar graph is the second circle; Described the second line segment according to every bar respectively, generates the step of first planar graph and is specially: respectively with described at least one second line segment for diameter, generate that at least one is first circular; Described according to the first line segment between described two some elements, the step generating the second planar graph is specially: with described first line segment for diameter, generates the second circle.Raw conglobate step is specially: be diameter respectively with line segment, generates circular.Relatively whether two circles intersect and whether can be greater than two diameter of a circle sums according to the distance between the center of circle of two circles and judge.In above-mentioned steps, judge that the computing method whether intersected between figure are than judging that the computing method whether intersected between line segment are simple, in the present embodiment, by judging that the computing replacement part whether intersected between figure does not need the computing judging whether to intersect between line segment, therefore improve processing speed.
In one embodiment, described method can be:
First, according to the center line of rivers, generate the broken line of the center line of the described rivers of simulation;
Then, the terminal of the set of website to be assessed, the starting point of user and user is obtained;
Then, according to the first line segment in the set of described website to be assessed between two websites and the crossing situation between described broken line, set up the transfer relation of described two websites, described two websites belong to different bus routes, and the length of described first line segment is less than the first predetermined value;
Then, according to the second line segment between the website in the set of described website to be assessed and described starting point and the crossing situation between described broken line, set up the relation of getting on the bus between described starting point and described website, the length of described second line segment is less than the second predetermined value;
Then, according to the 3rd line segment between the website in the set of described website to be assessed and described terminal and the crossing situation between described broken line, set up the relation of getting off between described terminal and described website, the length of described 3rd line segment is less than the 3rd predetermined value;
Then, according to the transfer relation between described website, the relation of getting on the bus between described starting point and described website, the relation of getting off between described terminal and described website, generate Public Transport Transfer scheme.
In above-mentioned steps, during line segment intersection between the center line and some element of rivers, then illustrate and need to cross over rivers, the present invention, by the crossing situation judging between line segment, has evaded rivers.
As shown in Figure 4. be a kind of device generating 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 described center line of simulation;
Point element acquiring unit 42, obtains two some elements to be assessed in Public Transport Transfer data model;
Relation sets up unit 43 by bus, according to the first line segment between described two some elements and the crossing situation between described broken line, sets up the relation by bus between described two some elements; When described two some elements are two websites, described two websites belong to different bus routes, and the distance between described two websites is less than the first predetermined value, and described relation is by bus transfer relation; When described two some elements are starting points of website and user, the distance between the starting point of described website and described user is less than the second predetermined value, and described relation is by bus the relation of getting on the bus; When described two some elements are terminals of website and user, the distance between the terminal of described website and described user is less than the 3rd predetermined value, and described relation is by bus the relation of getting off.
Public Transport Transfer schemes generation unit 44, according to the relation by bus between described two some elements, generates Public Transport Transfer scheme.
Described broken line generation unit 41 comprises:
Obtain subelement, obtain the center line of described rivers;
Collection subelement gathers the point on described center line every preset distance;
Second line segment generates subelement, and two end points of the described center line of adjacent connection, the described point of collection, generate at least two section of second line segment successively;
Broken line generates subelement, according to all second line segments, forms the broken line of the center line of the described rivers of simulation.
The device of described generation Public Transport Transfer scheme, also comprises: planar graph generation unit 45, respectively the second line segment according to every bar, generates first planar graph; According to the first line segment between described two some elements, generate the second planar graph;
Described relation is by bus set up unit 43 and is comprised:
First judgment sub-unit, judge described second planar graph and all described first planar graphs whether all non-intersect:
First relation of riding sets up subelement, when described second planar graph and all described first planar graphs all non-intersect time, set up the by bus relation between described two some elements;
Second judgment sub-unit, when described second planar graph is crossing with at least one described first planar graph, whether the second line segment judging described first line segment and generate described the first crossing planar graph intersects and intersection point is not the end points of described first line segment, generates judged result;
Second relation of riding sets up subelement, when described judged result is no, sets up the relation by bus between described two some elements.
Described first planar graph is the first rectangle, and described second planar graph is the second rectangle; Described planar graph generation unit is specially: respectively with described at least one second line segment for diagonal line, generate at least one first rectangle; With described first line segment for diagonal line, generate the second rectangle; Or
Described first planar graph is the first circle, and described second planar graph is the second circle; Described planar graph generation unit is specially: respectively with described at least one second line segment for diameter, generate that at least one is first circular; With described first line segment for diameter, generate the second circle.
The present invention proposes the method and apparatus that rivers are evaded in a kind of Public Transport Transfer automatically, do not rely on pedestrian walkway data, only need increase and evade data on a small quantity and just can realize Public Transport Transfer and automatically evade rivers.Described method comprises:
(1), when compiling public transport data, set up rivers as follows and evade data:
Utilize map data creating instrument to make and need the rivers center line evaded, and be divided into some sections;
Obtain the boundary rectangle frame of every section of center line;
Preserve every section of center line and boundary rectangle frame is that rivers evade data.
(2), when compiling public transport data, Public Transport Transfer relation is set up as follows:
Between any two websites of non-same bus routes, air line distance is less than preset distance;
If when the boundary rectangle frame of the rectangle frame being end points with two websites and institute's own centre line is all non-intersect, these two websites set up transfer relation;
If when the rectangle frame being end points with two websites is crossing with the boundary rectangle frame of some center line, judge two websites are whether the line segment of end points and these center lines intersect successively.
If all non-intersect, these two websites set up transfer relation.If there is one to intersect, these two websites do not set up transfer relation.
(3), when Public Transport Transfer calculates, the relation of getting on the bus of starting point and bus station is set up in accordance with the following steps:
Starting point and the air line distance arbitrarily between bus station are less than preset distance;
If the rectangle frame being two end points with starting point and bus station and the boundary rectangle frame of institute's own centre line all non-intersect time, relation of getting on the bus is set up in starting point and this bus station;
If when the rectangle frame being end points with starting point and bus station is crossing with the boundary rectangle frame of some center line, judge starting point and bus station are whether the line segment of end points and these center lines intersect successively.
If all non-intersect, relation of getting on the bus is set up in starting point and this bus station.If there is one to intersect, the relation of getting on the bus is not set up in starting point and this bus station;
(4) set up the same method of relation of getting on the bus according to starting point and bus station, set up the relation of getting off of terminal and bus station.
See Fig. 5, be the process flow diagram that in the embodiment of the present invention, rivers are evaded in Public Transport Transfer, comprise the following steps:
Step 301, generates the shape data of rivers center line;
Step 302, rivers centre line shape data genaration rivers are evaded data.
When step 303, public transport data compilation, rivers are utilized to evade data genaration Public Transport Transfer district data.See Fig. 9, it is the result schematic diagram after step 303 performs;
When step 304, public transport planning, rivers are utilized to evade the relation of getting on the bus of data genaration starting point and bus station.See Figure 11, it is the result schematic diagram after step 304 performs;
When step 305, public transport planning, the method utilizing step 304 identical generates the relation of getting off of terminal and bus station.Figure 12 is the result schematic diagram after step 305 performs;
Step 306, shortest path first is utilized to calculate Public Transport Transfer scheme.Figure 13 is the result schematic diagram after step 306 performs.
Wherein, step 301 comprises:
First, the geographic coordinate of the center line of the rivers that all needs in certain city are evaded is gathered;
Then, the geographic coordinate of the center line in every bar river is divided into some groups.What change of shape was little is divided into one group.Be advisable with about 10 groups for accelerating computing velocity river.
Then, utilizing general cartography instrument (as ArcGis), being made a line style record by often organizing geographic coordinate.The shape data of line style record is the geographic coordinate of this group.The attribute data of line style record is serial number.
Then, the line style record of all generations is put together, generate rivers centre line shape data.Fig. 6 is ready-made rivers centre line shape data.
Fig. 7 is the specific implementation process flow diagram of step 302 in Fig. 5, and this process flow diagram comprises the following steps:
The rivers centre line shape data that in step 501, reading Fig. 5, step 301 generates;
Step 502, obtain the line style record number of rivers centre line shape data, and for evading line record list application space; Evading line is the abstract broken line of rivers center line.
Step 503, obtain the shape point number of all line style records of rivers centre line shape data, and be shape point list application space;
Following operation is performed to the every bar line style record in rivers centre 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 sum of all line style records before step 505, the original shape point sequence number of evading line record are;
The boundary rectangle of step 506, calculating line style record shape data, the boundary rectangle evading line record is the boundary rectangle of line style record shape data; Line of evading herein is equivalent to the above-mentioned broken line be made up of multiple 4th line segment.
Step 507, the shape data of line style record is added shape point list;
Step 508, judge whether to travel through all line style records, if so, then process ends.Otherwise, perform step 504.
Fig. 8 is the specific implementation process flow diagram of step 303 in Fig. 5, comprises the following steps:
Following operation is performed to all bus stations:
Step 701, obtain being less than or equal to a certain bus station T air line distance the bus station set Q1 of distance threshold values D1;
Following operation is performed to all bus stations in set Q1:
Step 702, to obtain with bus station B a certain in T and Q1 be the line segment L of two end points, and the boundary rectangle R of line segment L; Boundary rectangle R with line segment L for diagonal line generate.
Step 703, traversal rivers are evaded and allly in data are evaded line record, obtain evading line set of records ends P, and all boundary rectangles evading line record in P all intersect with R;
If it is empty that step 704 gathers P, then perform step 706, if set P is not empty, then perform step 705;
If step 705 is gathered in P the broken line that has a shape point data of evading line record to form and line segment L and to be intersected and intersection point is not the end points of line segment L, then perform step 707, otherwise perform 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 Q1 whether are traveled through.It is then process ends.Otherwise perform step 702;
Public Transport Transfer district data are obtained after having traveled through all bus stations.Fig. 9 is the result schematic diagram after step 303 performs;
Figure 10 is the specific implementation process flow diagram of the step 304 in Fig. 5, and this process flow diagram comprises the following steps:
Step 901, obtain being less than or equal to starting point S air line distance the bus station set Q1 of distance threshold values D2;
Following operation is performed to all bus stations in set Q1:
Step 902, to obtain with bus station B a certain in S and Q1 be the line segment L of two end points, and the boundary rectangle R of line segment L;
Step 903, traversal rivers are evaded and allly in data are evaded line record, obtain evading line set of records ends P, and all boundary rectangles evading line record in P all intersect with R;
If it is empty execution step 906 that step 904 gathers P, if set P is not sky perform step 905;
If step 905 is gathered in P the broken line that has a shape point data of evading line record to form and line segment L and to be intersected and intersection point is not the end points of line segment L, then perform step 907, otherwise perform step 906;
Step 906, B is joined the relation of getting on the bus of S;
Step 907, all bus stations in Q1 whether are traveled through.It is then process ends.Otherwise perform step 902.
The simple step describing generation Public Transport Transfer scheme below.
In public traffic network, although many public bus networks can intersect at same point spatially, this point not necessarily dockable bus station, or be not have website, thus different public bus network does not lead at this. simultaneouslyNode in public traffic network is bus station, the public transport section in Public Transport Transfer network can abstract by connected state principle be segmental arc:
A) belong to the public transport section of the adjacent bus station of same route, abstract is segmental arc (type is for riding);
B) different route but the identical bus station of physical location, realize being communicated with by original place transfer, abstract be segmental arc (type is for changing to);
C) different route but the bus station geographically closed on, realizes being communicated with by walking transfer, and abstract be segmental arc (type is for changing to);
D) starting point is to neighbouring bus station, realizes being communicated with by walking, and abstract is segmental arc (type is for getting on the bus);
E) bus station near terminal, to terminal, realizes being communicated with by walking, and abstract is segmental arc (type is for getting off);
Suppose that public traffic network has starting point S and terminal E two points, if calculate the shortest path considering transfer impact from starting point S to starting point E, the conversion of Public Transport Transfer network can be carried out, the impact that eliminate the walking of transfer point, wait for bus, public transport fares etc. is brought, do not have the general networking problem of transfer by there being the network problem of transfer to be transformed to, Public Transport Transfer problem just can be abstract in solving the transfer plan problem how obtained from a node of public traffic network digraph to another one node.Figure 14 shows that the schematic diagram that public traffic network converts.Public Transport Transfer problem can adopt shortest path first, such as dijkstra's algorithm.Shortest path first should based on the digraph data structuring model of segmental arc and node.
According to the optimum transfer plan target of user, the weight of each factor in transfer plan can be set, and give the trip cost weights (weight A to weight D is specified by optimum transfer plan) of segmental arc in digraph:
Public transport section segmental arc weight=segmental arc distance × weight A%+ (segmental arc drive time+by way of down time of website) × weight B%+ expense change × weight D%
Original place transfer segmental arc weight=average Waiting time × weight B%+ changes to weight C%+ expense change × weight D%
Walking transfer segmental arc weight=segmental arc distance × weight A%+ (segmental arc walking time+average Waiting time) × weight B%+ transfer weight C%+ expense change × weight D%
Walking is got on the bus segmental arc weight=segmental arc distance × weight A%+ (segmental arc walking time+average Waiting time) × weight B%)
Walking is got off segmental arc weight=segmental arc distance × weight A%+ (segmental arc walking time) × weight B%.
The method of evading rivers according to walking path planning in prior art has following defect:
One, the cost obtaining walking path data is higher.Walking path data because of substantial amounts, gather difficulty, change the reasons such as fast, make the cost that obtains, safeguard higher, and algorithm is complicated.
Two, the total amount of data that relies on of public transit system is larger.Because of walking path data volume comparatively large (may much larger than public transport data volume), the data volume that whole public transit system is relied on be larger.
The present invention has following beneficial effect:
One, when there is no pedestrian walkway data, the problem that leap rivers take bus can effectively be avoided;
Two, computation schema is simple, and speed is fast;
What three, additionally increase evades data, and data volume is less, and procurement cost is low, makes simple;
Four, algorithm is evaded simple, fast operation;
Five, be applicable to low cost or data volume had to the Public Transport Transfer solution of strict demand.
One of ordinary skill in the art will appreciate that, the all or part of step realized in above-described embodiment method is that the hardware that can carry out instruction relevant by program has come, described program can be stored in a computer read/write memory medium, this program is when performing, comprise the step as above-mentioned embodiment of the method, described storage medium, as: magnetic disc, CD, read-only store-memory body (Read-Only Memory, or random store-memory body (Random Access Memory, RAM) etc. ROM).
In each embodiment of the method for the present invention; the sequence number of described each step can not be used for the sequencing limiting each step; for those of ordinary skill in the art, under the prerequisite not paying creative work, the priority of each step is changed also within protection scope of the present invention.
The above is the preferred embodiment of the present invention; it should be pointed out that for those skilled in the art, under the prerequisite not departing from principle of the present invention; can also make some improvements and modifications, these improvements and modifications also should be considered as protection scope of the present invention.
Claims (6)
1. generate a method for Public Transport Transfer scheme, it is characterized in that, comprising:
Step 1, according to the center line of rivers, generates the broken line of the described center line of simulation;
Step 2, obtains two some elements to be assessed in Public Transport Transfer data model;
Step 3, according to the first line segment between described two some elements and the crossing situation between described broken line, sets up the relation by bus between described two some elements;
Step 4, according to the relation by bus between described two some elements, generates Public Transport Transfer scheme;
Wherein, described step 1 specifically comprises: the center line obtaining described rivers; The point on described center line is gathered every preset distance; Start with one of them end points of described center line, terminate to another end points, two end points of the described center line of adjacent connection, the described point of collection, generate at least two section of second line segment successively; According to all second line segments, form the broken line of the center line of the described rivers of simulation; Described step 1 also comprises: the second line segment according to every bar respectively, generates first planar graph;
Described step 3 specifically comprises:
According to the first line segment between described two some elements, generate the second planar graph;
Judge described second planar graph and all described first planar graphs whether all non-intersect;
If described second planar graph and all described first planar graphs all non-intersect time, then set up the by bus relation between described two some elements; If when described second planar graph is crossing with at least one described first planar graph, then whether the second line segment judging described first line segment and generate described the first crossing planar graph intersects and intersection point is not the end points of described first line segment, generates judged result;
If described judged result is no, then set up the relation by bus between described two some elements; If described judged result is yes, then do not set up the relation by bus between two some elements.
2. the method for generation Public Transport Transfer scheme according to claim 1, is characterized in that,
Described first planar graph is the first rectangle, and described second planar graph is the second rectangle; Described the second line segment according to every bar respectively, generates the step of first planar graph and is specially: respectively with described at least one second line segment for diagonal line, generate at least one first rectangle; Described according to the first line segment between described two some elements, the step generating the second planar graph is specially: with described first line segment for diagonal line, generate the second rectangle; Or
Described first planar graph is the first circle, and described second planar graph is the second circle; Described the second line segment according to every bar respectively, generates the step of first planar graph and is specially: respectively with described at least one second line segment for diameter, generate that at least one is first circular; Described according to the first line segment between described two some elements, the step generating the second planar graph is specially: with described first line segment for diameter, generates the second circle.
3. the method for the generation Public Transport Transfer scheme according to any one of claim 1 or 2, is characterized in that,
When described two some elements are two websites, described two websites belong to different bus routes, and the distance between described two websites is less than the first predetermined value, and described relation is by bus transfer relation;
When described two some elements are starting points of website and user, the distance between the starting point of described website and described user is less than the second predetermined value, and described relation is by bus the relation of getting on the bus;
When described two some elements are terminals of website and user, the distance between the terminal of described website and described user is less than the 3rd predetermined value, and described relation is by bus the relation of getting off.
4. generate a device for Public Transport Transfer scheme, it is characterized in that, comprising:
Broken line generation unit, according to the center line of rivers, generates the broken line of the described center line of simulation;
Point element acquiring unit, obtains two some elements to be assessed in Public Transport Transfer data model;
Relation sets up unit by bus, according to the first line segment between described two some elements and the crossing situation between described broken line, sets up the relation by bus between described two some elements;
Public Transport Transfer schemes generation unit, according to the relation by bus between described two some elements, generates Public Transport Transfer scheme; Described broken line generation unit comprises:
Obtain subelement, obtain the center line of described rivers;
Collection subelement gathers the point on described center line every preset distance;
Second line segment generates subelement, and start with one of them end points of described center line, terminate to another end points, two end points of the described center line of adjacent connection, the described point of collection, generate at least two section of second line segment successively;
Broken line generates subelement, according to all second line segments, forms the broken line of the center line of the described rivers of simulation.
Wherein, the device of described generation Public Transport Transfer scheme also comprises: planar graph generation unit, respectively the second line segment according to every bar, generates first planar graph; According to the first line segment between described two some elements, generate the second planar graph;
Described relation is by bus set up unit and is comprised:
First judgment sub-unit, judge described second planar graph and all described first planar graphs whether all non-intersect;
First relation of riding sets up subelement, when described second planar graph and all described first planar graphs all non-intersect time, set up the by bus relation between described two some elements;
Second judgment sub-unit, when described second planar graph is crossing with at least one described first planar graph, whether the second line segment judging described first line segment and generate described the first crossing planar graph intersects and intersection point is not the end points of described first line segment, generates judged result;
Second relation of riding sets up subelement, when described judged result is no, sets up the relation by bus between described two some elements.
5. the device of generation Public Transport Transfer scheme according to claim 4, is characterized in that,
Described first planar graph is the first rectangle, and described second planar graph is the second rectangle; Described planar graph generation unit is specially: respectively with described at least one second line segment for diagonal line, generate at least one first rectangle; With described first line segment for diagonal line, generate the second rectangle; Or
Described first planar graph is the first circle, and described second planar graph is the second circle; Described planar graph generation unit is specially: respectively with described at least one second line segment for diameter, generate that at least one is first circular; With described first line segment for diameter, generate the second circle.
6. the device of the generation Public Transport Transfer scheme according to any one of claim 4 or 5, is characterized in that,
When described two some elements are two websites, described two websites belong to different bus routes, and the distance between described two websites is less than the first predetermined value, and described relation is by bus transfer relation;
When described two some elements are starting points of website and user, the distance between the starting point of described website and described user is less than the second predetermined value, and described relation is by bus the relation of getting on the bus;
When described two some elements are terminals of website and user, the distance between the terminal of described website and described user is less than the 3rd predetermined value, and described relation is by bus the relation of getting off.
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 CN102737066A (en) | 2012-10-17 |
| CN102737066B true 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) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108120444B (en) * | 2016-11-29 | 2020-05-08 | 高德信息技术有限公司 | Electronic map data processing method and device |
| CN107067356A (en) * | 2017-03-29 | 2017-08-18 | 太仓鸿策腾达网络科技有限公司 | A kind of city bus changes to management system |
Citations (2)
| 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 |
-
2011
- 2011-04-15 CN CN201110095587.5A patent/CN102737066B/en active Active
Patent Citations (2)
| 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102737066A (en) | 2012-10-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105528955B (en) | Generate the method and its device of road network | |
| WO2020029601A1 (en) | Method and system for constructing transverse topological relationship of lanes in map, and memory | |
| CN103292816B (en) | Electronic map generating method, device and paths planning method, device | |
| Mathew et al. | Calibration of microsimulation models for nonlane-based heterogeneous traffic at signalized intersections | |
| CN110375760A (en) | Route determination method, apparatus, equipment and medium | |
| CN103364004B (en) | Method for searching path and path searching apparatus | |
| CN103808325B (en) | The generation method and device of traffic trip scheme | |
| CN112765753B (en) | Public transport super network construction method | |
| CN103853725B (en) | A kind of traffic track data noise-reduction method and system | |
| CN107742169A (en) | A kind of Urban Transit Network system constituting method and performance estimating method based on complex network | |
| CN107389085A (en) | A kind of determination method, apparatus, computer and the storage medium of road attribute | |
| CN109670671A (en) | Public transport network evaluation method and device | |
| CN106458239A (en) | Information processing device and operation curve generation method | |
| CN107808217A (en) | A kind of Public Transport Transfer optimization method based on Big Dipper positioning with the volume of the flow of passengers | |
| CN107631733A (en) | The method, apparatus and server of new added road are found based on floating wheel paths | |
| 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 | |
| CN102737066B (en) | Method and device for generating bus transfer schemes | |
| CN107392387A (en) | A kind of dispatching method of AGV optimal control times | |
| WO2022062206A1 (en) | System for designing train operation organization plan for rail transit | |
| CN107588779B (en) | Intelligent vehicle navigation method based on travel time between any two nodes | |
| Dallmeyer et al. | From GIS to mixed traffic simulation in urban scenarios | |
| CN103021257A (en) | Method and apparatus for generating electronic map | |
| CN109711438A (en) | Bus traffic route acquisition methods, device and equipment | |
| CN105701555A (en) | Method and system for dividing road network |
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 |