CN111046123A - Traffic transfer directed graph generation method and system - Google Patents
Traffic transfer directed graph generation method and system Download PDFInfo
- Publication number
- CN111046123A CN111046123A CN201911284540.6A CN201911284540A CN111046123A CN 111046123 A CN111046123 A CN 111046123A CN 201911284540 A CN201911284540 A CN 201911284540A CN 111046123 A CN111046123 A CN 111046123A
- Authority
- CN
- China
- Prior art keywords
- directed graph
- basic
- identification string
- generating
- digraph
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000012546 transfer Methods 0.000 title claims abstract description 47
- 238000000034 method Methods 0.000 title claims abstract description 24
- 238000012216 screening Methods 0.000 claims description 6
- 238000012545 processing Methods 0.000 claims description 5
- 230000000694 effects Effects 0.000 abstract description 4
- 238000004134 energy conservation Methods 0.000 abstract description 4
- 238000010586 diagram Methods 0.000 description 2
- 125000006850 spacer group Chemical group 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000013138 pruning Methods 0.000 description 1
- 230000005855 radiation Effects 0.000 description 1
- 238000010845 search algorithm Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/40—Business processes related to the transportation industry
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02A—TECHNOLOGIES FOR ADAPTATION TO CLIMATE CHANGE
- Y02A30/00—Adapting or protecting infrastructure or their operation
- Y02A30/60—Planning or developing urban green infrastructure
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- General Health & Medical Sciences (AREA)
- Remote Sensing (AREA)
- General Engineering & Computer Science (AREA)
- Health & Medical Sciences (AREA)
- Economics (AREA)
- Data Mining & Analysis (AREA)
- Human Resources & Organizations (AREA)
- Marketing (AREA)
- Primary Health Care (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention discloses a traffic transfer directed graph generating method and system, which can generate a demand identification string for judgment according to a query request of a user, and can acquire a route represented by a directed graph only when the demand identification string is matched with the directed graph identification string, thereby greatly reducing the judgment of the type of a vehicle and the route operation time under specific conditions in operation, avoiding traversing a large number of unrelated nodes, improving the operation speed, improving the query accuracy, effectively avoiding repeated operation and unnecessary redundant operation, reducing the hardware cost, reducing the consumption of server resources, reducing the power consumption and achieving the effects of energy conservation and emission reduction.
Description
Technical Field
The invention relates to the field of traffic transfer route planning, in particular to a traffic transfer directed graph generation method and system.
Background
In the current field of traffic transfer route planning, traffic route data can be abstracted into a topological network or a directed graph, then transfer route planning operation is carried out on the basis, generally, people regard bus stations as network nodes, regard the connection between the stations generated by buses and walking based on a certain threshold value as a connecting edge, abstract the connecting edge to obtain a graph, and then calculate the graph by using a Dijkstra algorithm or an breadth first search algorithm to obtain a transfer scheme.
People's trips are obviously inclined according to different crowds, for example, most people are obviously inclined to rail transit or BRT (bus by bus), and some users have specific time requirements when going out, for example, going out at 23:00 o' clock at night, and only can take a night bus; some communities have fixed buses, people in the communities often use the bus line of the community as a main line when going out, and the required transfer scheme is sought by means of outward radiation.
Disclosure of Invention
In view of the above, the invention provides a traffic transfer directed graph generating method and system with less operation and accurate query.
The technical scheme of the invention is realized as follows:
a traffic transfer directed graph generating method specifically comprises the following steps:
step S1, collecting initial traffic data, generating an urban public transport basis directed graph, a domestic long distance basis directed graph and an international basis directed graph, and endowing a directed graph identification string corresponding to each basic directed graph;
step S2, a user inputs a query request and generates a demand identification string according to the query request;
step S3, judging whether there is a directed graph identification string same as the required identification string, if yes, executing step S4, if not, executing step S5;
step S4, performing circuit transfer operation on the directed graph represented by the directed graph identification string which is the same as the requirement identification string, and sending the operation result to the user;
and step S5, generating a directed graph matched with the requirement identification string according to the existing directed graph, performing line transfer operation on the generated directed graph, and sending the operation result to the user.
As a further alternative of the traffic transfer directed graph generating method, the step S1 includes the steps of:
step S11, collecting initial traffic data, and generating original traffic data according to the initial traffic data;
step S12, generating an urban public transport basis digraph, a domestic long distance basis digraph and an international basis digraph according to the original traffic data, and storing the urban public transport basis digraph, the domestic long distance basis digraph and the international basis digraph in a database;
and step S13, generating a directed graph identification string corresponding to each basic directed graph according to the urban public transportation basic directed graph, the domestic long distance basic directed graph and the international basic directed graph.
As a further alternative of the traffic transfer directed graph generating method, the step S11 includes the steps of:
step S111, collecting information of each bus line;
step S112, collecting information of each site;
step S113, collecting station information of which the periphery of each station has a walking relationship;
and step S114, storing the information of the bus routes, the information of each stop and the stop information with the walking relationship around each stop into a database for processing, and generating original bus data.
As a further alternative of the method for generating the bus transfer directed graph, the step S12 includes the following steps:
s121, screening out the bus routes with the operation range in the city, establishing riding arcs between every two adjacent passing stops according to the driving direction of the bus according to the driving sequence of the bus routes, and establishing walking arcs between stops with walking relation to each other to generate a directed graph of the urban bus foundation;
s122, screening long-distance lines with an operation range between cities, establishing riding arcs between every two adjacent passing sites according to the driving direction of the vehicles according to the driving sequence of the vehicles, and generating a domestic long-distance basic directed graph;
s123, selecting international lines with operation ranges between countries, establishing riding arcs between every two adjacent passing sites according to the driving direction of the vehicles according to the driving sequence of the vehicles, and generating an international basic directed graph;
and step S124, sending the generated urban public transport basis directed graph, domestic long distance basis directed graph and international basis directed graph to a database for storage.
As a further alternative of the method for generating the bus transfer directed graph, the step S13 includes the following steps:
step S131, acquiring the region, the vehicle and the service time represented by each basic digraph according to the urban public transportation basic digraph, the domestic long distance basic digraph and the international basic digraph;
step S132, endowing identifiers for distinguishing regions, vehicles and service time;
and step S133, generating a corresponding directed graph identification string according to the region, the vehicle and the service time represented by each basic directed graph.
As a further alternative of the method for generating the bus transfer directed graph, the step S2 includes the following steps:
step S21, the user inputs the inquiry request, and the departure place and the destination, the type of the vehicle and the riding time of the user are obtained according to the inquiry request;
and step S22, generating a demand identification string according to the departure place and the destination of the user, the type of the vehicle and the riding time.
As a further alternative of the method for generating the bus transfer directed graph, the step S5 includes the following steps:
step S51, analyzing the demand identification string, and acquiring the departure place and the destination, the type of the vehicle and the riding time input by the user;
step S52, acquiring one or more basic digraphs of an urban public transport basic digraph, a domestic long distance basic digraph and an international basic digraph according to a departure place and a destination;
and step S53, according to the type of the vehicle and the riding time, deleting the vehicle which does not accord with the type of the vehicle and the service time which does not accord with the riding time in the obtained basic directed graph, so as to generate a directed graph which is matched with the requirement identification string, and sending the generated directed graph to a database for storage.
As a further alternative of the method for generating the bus transfer directed graph, the step S52 includes the following steps:
step S521, judging whether the departure place and the destination are in the same city, if so, acquiring an urban public transport basis directed graph of the city, and if not, executing step S522;
step S522, judging whether the departure place and the destination are in the same country, if so, acquiring an urban public transportation basic digraph and a domestic long distance basic digraph of the city to which the departure place and the destination belong, and if not, executing step S523;
step S523, an urban public transportation basic digraph of a city to which the departure place and the destination belong, a domestic long distance basic digraph and an international basic digraph of a country to which the departure place and the destination belong are obtained.
A traffic transfer directed graph generation system, comprising:
the data acquisition unit is used for acquiring information of lines and stations to obtain initial bus data;
the data making unit is used for making and obtaining original bus data according to the initial bus data;
the basic directed graph generating unit is used for generating an urban public transport basic directed graph, a domestic long-distance basic directed graph and an international basic directed graph according to original public transport data;
the storage unit is used for generating an urban public transport basis directed graph, a domestic long distance basis directed graph and an international basis directed graph and generating a directed graph according to a user requirement identification string;
an identifier assigning unit for assigning an identifier for distinguishing a region, a vehicle, and a service time;
the directed graph identification string generating unit is used for generating a directed graph identification string corresponding to each basic directed graph according to the identifier;
the demand identification string generating unit is used for generating a demand identification string according to a query request input by a user;
the judging unit is used for judging whether a directed graph identification string identical to the required identification string exists or not;
the requirement identification string analysis unit is used for analyzing the requirement identification string;
the directed graph generating unit is used for generating a new directed graph on the basis of the existing directed graph;
and the line transfer operation unit is used for performing line transfer operation based on the given directed graph.
The invention has the beneficial effects that: by adopting the method and the system, the demand identification string is generated according to the query request of the user for judgment, and the line represented by the directed graph can be obtained only when the demand identification string is matched with the directed graph identification string, so that the judgment on the type of the vehicle and the line operation time under specific conditions can be greatly reduced in operation, the traversal of a large number of unrelated nodes is avoided, the operation speed can be increased, the query accuracy is improved, the repeated operation and unnecessary redundant operation are effectively avoided, the hardware cost can be reduced, the consumption of server resources is reduced, the power consumption is reduced, and the effects of energy conservation and emission reduction are achieved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
FIG. 1 is a flow chart of a traffic transfer directed graph generation method according to the present invention;
FIG. 2 is a schematic diagram illustrating a traffic transfer directed graph generation system according to the present invention;
FIG. 3 is a partially schematic presentation of a basic urban directed graph of the present invention;
FIG. 4 is a partially schematic presentation of an urban digraph with only subway networks left after pruning in accordance with the present invention;
FIG. 5 is a partially schematic presentation of a long distance basic directed graph of the present invention;
fig. 6 is a partially schematic presentation diagram of a directed graph formed by combining urban directed graphs of two cities and a long distance directed graph of a country where the two cities are located.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Referring to fig. 1-2, a traffic transfer directed graph generation method specifically includes the following steps:
step S1, collecting initial traffic data, generating an urban public transport basis directed graph, a domestic long distance basis directed graph and an international basis directed graph, and endowing a directed graph identification string corresponding to each basic directed graph;
step S2, a user inputs a query request and generates a demand identification string according to the query request;
step S3, judging whether there is a directed graph identification string same as the required identification string, if yes, executing step S4, if not, executing step S5;
step S4, performing circuit transfer operation on the directed graph represented by the directed graph identification string which is the same as the requirement identification string, and sending the operation result to the user;
and step S5, generating a directed graph matched with the requirement identification string according to the existing directed graph, performing line transfer operation on the generated directed graph, and sending the operation result to the user.
In this embodiment, the requirement identification string is generated according to the query request of the user for judgment, and the route represented by the directed graph can be obtained only when the requirement identification string is matched with the directed graph identification string, so that the judgment of the type of the vehicle and the route operation time under a specific condition can be greatly reduced in the operation, the traversal of a large number of unrelated nodes is avoided, the operation speed can be increased, the query accuracy is improved, the repeated operation and unnecessary redundant operation are effectively avoided, the hardware cost can be reduced, the consumption of server resources is reduced, the power consumption is reduced, and the effects of energy conservation and emission reduction are achieved; it should be noted that the encoding format of the directed graph identification string is expressed in the form of "mw [ # mx ]. - [ # cy ] - [ # tz ] -" where "m" is a parameter identifier of a city or a country, "c" is a vehicle parameter identifier, "t" is a riding time identifier, "w" and "x" are unique number numbers of the city or the country, "y" is a unique number of a vehicle type, and "z" is a digitized time value in units of "minutes". The numerical time value in minutes is a value obtained by multiplying the hour value of 24 hours by 60 and adding the minute value, for example 08:30, 510 by 8 by 60+30, 21:15, 1275 by 21 by 60+ 15; in addition, each identifier in the identification string is added with a numerical value, namely the identifier plus the numerical value, to form a parameter pair, the # number is a spacer between a plurality of parameter pairs, each identification string needs to at least contain one mw parameter pair, and a plurality of parameter pairs of the same identifier type in the identification string need to be connected in series and are arranged in the order from small to large according to the numerical value.
Preferably, the step S1 includes the steps of:
step S11, collecting initial traffic data, and generating original traffic data according to the initial traffic data;
step S12, generating an urban public transport basis digraph, a domestic long distance basis digraph and an international basis digraph according to the original traffic data, and storing the urban public transport basis digraph, the domestic long distance basis digraph and the international basis digraph in a database;
and step S13, generating a directed graph identification string corresponding to each basic directed graph according to the urban public transportation basic directed graph, the domestic long distance basic directed graph and the international basic directed graph.
In the embodiment, the basic directed graph is generated by collecting initial traffic data, the generated basic directed graph is stored in the database, each basic directed graph has a unique identification string, and when the requirement identification string is just the same as the identification string matched with the basic directed graph stored in the database, the basic directed graph can be directly obtained without performing operation again, so that the operation task of the system is further reduced, and the time for obtaining the query result by a user can be accelerated.
Preferably, the step S11 includes the steps of:
step S111, collecting information of each bus line;
step S112, collecting information of each site;
step S113, collecting station information of which the periphery of each station has a walking relationship;
and step S114, storing the information of the bus routes, the information of each stop and the stop information with the walking relationship around each stop into a database for processing, and generating original bus data.
In the embodiment, information such as the position coordinate, the name and the type of each station is acquired by acquiring information such as the name of each bus line, the type of a vehicle, the operating time or a shift schedule and passing stations, information such as the station information of the walking relationship around each station is acquired, the acquired information is recorded into a database, and original bus data is acquired after processing and manufacturing, so that the traffic condition of each area can be clear, and the travel modes required by a user can be well screened out.
Preferably, the step S12 includes the steps of:
s121, screening out the bus routes with the operation range in the city, establishing riding arcs between every two adjacent passing stops according to the driving direction of the bus according to the driving sequence of the bus routes, and establishing walking arcs between stops with walking relation to each other to generate a directed graph of the urban bus foundation;
s122, screening long-distance lines with an operation range between cities, establishing riding arcs between every two adjacent passing sites according to the driving direction of the vehicles according to the driving sequence of the vehicles, and generating a domestic long-distance basic directed graph;
s123, selecting international lines with operation ranges between countries, establishing riding arcs between every two adjacent passing sites according to the driving direction of the vehicles according to the driving sequence of the vehicles, and generating an international basic directed graph;
and step S124, sending the generated urban public transport basis directed graph, domestic long distance basis directed graph and international basis directed graph to a database for storage.
In the embodiment, an independent urban public transport basis directed graph is generated in each city, such a domestic long distance basis directed graph is generated in each country, and international basis directed graphs are generated internationally, so that the city or country basis directed graph required by a user can be directly obtained, the unnecessary basis directed graphs are directly eliminated, the operation data is greatly reduced, and the operation speed is greatly improved.
Preferably, the step S13 includes the steps of:
step S131, acquiring the region, the vehicle and the service time represented by each basic digraph according to the urban public transportation basic digraph, the domestic long distance basic digraph and the international basic digraph;
step S132, endowing identifiers for distinguishing regions, vehicles and service time;
and step S133, generating a corresponding directed graph identification string according to the region, the vehicle and the service time represented by each basic directed graph.
In the embodiment, each basic directed graph is independent and represents vehicles and service time of the vehicles included in one region, and different identifiers represent different regions, vehicles and service time, so that directed graph identification strings corresponding to the basic directed graphs are generated, each directed graph identification string is unique, and different points of each basic directed graph can be better shown.
Preferably, the step S2 includes the steps of:
step S21, the user inputs the inquiry request, and the departure place and the destination, the type of the vehicle and the riding time of the user are obtained according to the inquiry request;
and step S22, generating a demand identification string according to the departure place and the destination of the user, the type of the vehicle and the riding time.
In this embodiment, a demand identification string is generated according to conditions such as a departure place and a destination, a vehicle type, riding time and the like in a user query request and by combining a spatial distance relationship between the departure place and the destination, wherein the demand identification string is represented according to a coding format of a directed graph identification string;
for example, if the departure point and the destination belong to the same city, and the city number is "1003", the identifiers of the departure point and the destination are "m 1003"; if a vehicle of vehicle type number "786420" is specified in the user inquiry request, the identifier of the vehicle type is "# c 786420"; if the user inquiry request specifies that the riding time is 12:30, and the riding time is converted into a digitized time value in units of minutes to obtain 750, the identifier of the riding time is "# t 750", and in summary, the demand identification string is "m 1003# c786420# t 750".
Preferably, the step S5 includes the steps of:
step S51, analyzing the demand identification string, and acquiring the departure place and the destination, the type of the vehicle and the riding time input by the user;
step S52, acquiring one or more basic digraphs of an urban public transport basic digraph, a domestic long distance basic digraph and an international basic digraph according to a departure place and a destination;
and step S53, according to the type of the vehicle and the riding time, deleting the vehicle which does not accord with the type of the vehicle and the service time which does not accord with the riding time in the obtained basic directed graph, so as to generate a directed graph which is matched with the requirement identification string, and sending the generated directed graph to a database for storage.
In the embodiment, whether a user is urban transfer or domestic transfer or international transfer is judged by a departure place and a destination, so that a basic directed graph meeting requirements is screened out, then vehicles and riding time meeting the requirements of the user are selected from the screened basic directed graph, and a directed graph matched with a user query request is generated and sent to a database for storage.
Preferably, the step S52 includes the steps of:
step S521, judging whether the departure place and the destination are in the same city, if so, acquiring an urban public transport basis directed graph of the city, and if not, executing step S522;
step S522, judging whether the departure place and the destination are in the same country, if so, acquiring an urban public transportation basic digraph and a domestic long distance basic digraph of the city to which the departure place and the destination belong, and if not, executing step S523;
step S523, an urban public transportation basic digraph of a city to which the departure place and the destination belong, a domestic long distance basic digraph and an international basic digraph of a country to which the departure place and the destination belong are obtained.
In the embodiment, whether the departure place and the destination are in the same city and the same country is judged by adopting a multi-layer judgment mode, so that the corresponding basic directed graph is obtained, the obtained basic directed graph can be processed on the basis of no need of processing all the basic directed graphs, the operation data is greatly reduced, and the operation speed is improved.
A traffic transfer directed graph generation system, comprising:
the data acquisition unit is used for acquiring information of lines and stations to obtain initial bus data;
the data making unit is used for making and obtaining original bus data according to the initial bus data;
the basic directed graph generating unit is used for generating an urban public transport basic directed graph, a domestic long-distance basic directed graph and an international basic directed graph according to original public transport data;
the storage unit is used for generating an urban public transport basis directed graph, a domestic long distance basis directed graph and an international basis directed graph and generating a directed graph according to a user requirement identification string;
an identifier assigning unit for assigning an identifier for distinguishing a region, a vehicle, and a service time;
the directed graph identification string generating unit is used for generating a directed graph identification string corresponding to each basic directed graph according to the identifier;
the demand identification string generating unit is used for generating a demand identification string according to a query request input by a user;
the judging unit is used for judging whether a directed graph identification string identical to the required identification string exists or not;
the requirement identification string analysis unit is used for analyzing the requirement identification string;
the directed graph generating unit is used for generating a new directed graph on the basis of the existing directed graph;
and the line transfer operation unit is used for performing line transfer operation based on the given directed graph.
In this embodiment, the requirement identification string is generated according to the query request of the user for judgment, and the route represented by the directed graph can be obtained only when the requirement identification string is matched with the directed graph identification string, so that the judgment of the type of the vehicle and the route operation time under a specific condition can be greatly reduced in the operation, the traversal of a large number of unrelated nodes is avoided, the operation speed can be increased, the query accuracy is improved, the repeated operation and unnecessary redundant operation are effectively avoided, the hardware cost can be reduced, the consumption of server resources is reduced, the power consumption is reduced, and the effects of energy conservation and emission reduction are achieved; it should be noted that the encoding format of the directed graph identification string is expressed in the form of "mw [ # mx ]. - [ # cy ] - [ # tz ] -" where "m" is a parameter identifier of a city or a country, "c" is a vehicle parameter identifier, "t" is a riding time identifier, "w" and "x" are unique number numbers of the city or the country, "y" is a unique number of a vehicle type, and "z" is a digitized time value in units of "minutes". The numerical time value in minutes is a value obtained by multiplying the hour value of 24 hours by 60 and adding the minute value, for example 08:30, 510 by 8 by 60+30, 21:15, 1275 by 21 by 60+ 15; in addition, each identifier in the identification string is added with a numerical value, namely the identifier plus the numerical value, to form a parameter pair, the # number is a spacer between a plurality of parameter pairs, each identification string needs to at least contain one mw parameter pair, and a plurality of parameter pairs of the same identifier type in the identification string need to be connected in series and are arranged in the order from small to large according to the numerical value.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like that fall within the spirit and principle of the present invention are intended to be included therein.
Claims (9)
1. A traffic transfer directed graph generation method is characterized by comprising the following steps:
step S1, collecting initial traffic data, generating an urban public transport basis directed graph, a domestic long distance basis directed graph and an international basis directed graph, and endowing a directed graph identification string corresponding to each basic directed graph;
step S2, a user inputs a query request and generates a demand identification string according to the query request;
step S3, judging whether there is a directed graph identification string same as the required identification string, if yes, executing step S4, if not, executing step S5;
step S4, performing circuit transfer operation on the directed graph represented by the directed graph identification string which is the same as the requirement identification string, and sending the operation result to the user;
and step S5, generating a directed graph matched with the requirement identification string according to the existing directed graph, performing line transfer operation on the generated directed graph, and sending the operation result to the user.
2. The traffic transfer directed graph generating method according to claim 1, wherein the step S1 includes the steps of:
step S11, collecting initial traffic data, and generating original traffic data according to the initial traffic data;
step S12, generating an urban public transport basis digraph, a domestic long distance basis digraph and an international basis digraph according to the original traffic data, and storing the urban public transport basis digraph, the domestic long distance basis digraph and the international basis digraph in a database;
and step S13, generating a directed graph identification string corresponding to each basic directed graph according to the urban public transportation basic directed graph, the domestic long distance basic directed graph and the international basic directed graph.
3. The traffic transfer directed graph generating method according to claim 2, wherein the step S11 includes the steps of:
step S111, collecting information of each bus line;
step S112, collecting information of each site;
step S113, collecting station information of which the periphery of each station has a walking relationship;
and step S114, storing the information of the bus routes, the information of each stop and the stop information with the walking relationship around each stop into a database for processing, and generating original bus data.
4. The traffic transfer directed graph generation method according to claim 3, wherein the step S12 comprises the steps of:
s121, screening out the bus routes with the operation range in the city, establishing riding arcs between every two adjacent passing stops according to the driving direction of the bus according to the driving sequence of the bus routes, and establishing walking arcs between stops with walking relation to each other to generate a directed graph of the urban bus foundation;
s122, screening long-distance lines with an operation range between cities, establishing riding arcs between every two adjacent passing sites according to the driving direction of the vehicles according to the driving sequence of the vehicles, and generating a domestic long-distance basic directed graph;
s123, selecting international lines with operation ranges between countries, establishing riding arcs between every two adjacent passing sites according to the driving direction of the vehicles according to the driving sequence of the vehicles, and generating an international basic directed graph;
and step S124, sending the generated urban public transport basis directed graph, domestic long distance basis directed graph and international basis directed graph to a database for storage.
5. The traffic transfer directed graph generation method according to claim 4, wherein the step S13 includes the steps of:
step S131, acquiring the region, the vehicle and the service time represented by each basic digraph according to the urban public transportation basic digraph, the domestic long distance basic digraph and the international basic digraph;
step S132, endowing identifiers for distinguishing regions, vehicles and service time;
and step S133, generating a corresponding directed graph identification string according to the region, the vehicle and the service time represented by each basic directed graph.
6. The traffic transfer directed graph generating method according to claim 5, wherein the step S2 includes the steps of:
step S21, the user inputs the inquiry request, and the departure place and the destination, the type of the vehicle and the riding time of the user are obtained according to the inquiry request;
and step S22, generating a demand identification string according to the departure place and the destination of the user, the type of the vehicle and the riding time.
7. The traffic transfer directed graph generation method according to claim 6, wherein the step S5 includes the steps of:
step S51, analyzing the demand identification string, and acquiring the departure place and the destination, the type of the vehicle and the riding time input by the user;
step S52, acquiring one or more basic digraphs of an urban public transport basic digraph, a domestic long distance basic digraph and an international basic digraph according to a departure place and a destination;
and step S53, according to the type of the vehicle and the riding time, deleting the vehicle which does not accord with the type of the vehicle and the service time which does not accord with the riding time in the obtained basic directed graph, so as to generate a directed graph which is matched with the requirement identification string, and sending the generated directed graph to a database for storage.
8. The traffic transfer directed graph generating method according to claim 7, wherein the step S52 includes the steps of:
step S521, judging whether the departure place and the destination are in the same city, if so, acquiring an urban public transport basis directed graph of the city, and if not, executing step S522;
step S522, judging whether the departure place and the destination are in the same country, if so, acquiring an urban public transportation basic digraph and a domestic long distance basic digraph of the city to which the departure place and the destination belong, and if not, executing step S523;
step S523, an urban public transportation basic digraph of a city to which the departure place and the destination belong, a domestic long distance basic digraph and an international basic digraph of a country to which the departure place and the destination belong are obtained.
9. A traffic transfer directed graph generation system, comprising:
the data acquisition unit is used for acquiring information of lines and stations to obtain initial bus data;
the data making unit is used for making and obtaining original bus data according to the initial bus data;
the basic directed graph generating unit is used for generating an urban public transport basic directed graph, a domestic long-distance basic directed graph and an international basic directed graph according to original public transport data;
the storage unit is used for generating an urban public transport basis directed graph, a domestic long distance basis directed graph and an international basis directed graph and generating a directed graph according to a user requirement identification string;
an identifier assigning unit for assigning an identifier for distinguishing a region, a vehicle, and a service time;
the directed graph identification string generation unit is used for generating a directed graph identification string corresponding to each basic directed graph;
the demand identification string generating unit is used for generating a demand identification string according to a query request input by a user;
the judging unit is used for judging whether a directed graph identification string identical to the required identification string exists or not;
the requirement identification string analysis unit is used for analyzing the requirement identification string;
the directed graph generating unit is used for generating a new directed graph on the basis of the existing directed graph;
and the line transfer operation unit is used for performing line transfer operation based on the given directed graph.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911284540.6A CN111046123B (en) | 2019-12-13 | 2019-12-13 | Traffic transfer directed graph generation method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911284540.6A CN111046123B (en) | 2019-12-13 | 2019-12-13 | Traffic transfer directed graph generation method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111046123A true CN111046123A (en) | 2020-04-21 |
| CN111046123B CN111046123B (en) | 2024-01-12 |
Family
ID=70236253
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911284540.6A Active CN111046123B (en) | 2019-12-13 | 2019-12-13 | Traffic transfer directed graph generation method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111046123B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110112759A1 (en) * | 2009-11-11 | 2011-05-12 | Google Inc. | Transit routing system for public transportation trip planning |
| CN102103599A (en) * | 2009-12-16 | 2011-06-22 | 罗文辉 | Portable bus transfer information query device and query method thereof |
| CN102436466A (en) * | 2011-09-09 | 2012-05-02 | 中国航天科工集团第三研究院第八三五八研究所 | Bus transfer inquiry method based on geographic information system (GIS) classification |
| CN102880642A (en) * | 2012-08-20 | 2013-01-16 | 浙江工业大学 | Bus transfer method based on weighted directed network model |
| CN108062860A (en) * | 2018-01-16 | 2018-05-22 | 毛国强 | Road bottleneck identification method and its system based on propagation of congestion analysis |
-
2019
- 2019-12-13 CN CN201911284540.6A patent/CN111046123B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110112759A1 (en) * | 2009-11-11 | 2011-05-12 | Google Inc. | Transit routing system for public transportation trip planning |
| CN102103599A (en) * | 2009-12-16 | 2011-06-22 | 罗文辉 | Portable bus transfer information query device and query method thereof |
| CN102436466A (en) * | 2011-09-09 | 2012-05-02 | 中国航天科工集团第三研究院第八三五八研究所 | Bus transfer inquiry method based on geographic information system (GIS) classification |
| CN102880642A (en) * | 2012-08-20 | 2013-01-16 | 浙江工业大学 | Bus transfer method based on weighted directed network model |
| CN108062860A (en) * | 2018-01-16 | 2018-05-22 | 毛国强 | Road bottleneck identification method and its system based on propagation of congestion analysis |
Non-Patent Citations (1)
| Title |
|---|
| 李丹，黄正东: "顾及换乘距离的城市公交系统出行路径优化研究", vol. 6, no. 6 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111046123B (en) | 2024-01-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103177561B (en) | Method for generating bus real-time traffic status | |
| CN105674995A (en) | Method for acquiring commuting route based on user's travel locus, and apparatus thereof | |
| CN111581315B (en) | Public service facility reachability calculation method and device | |
| CN110796337B (en) | System for evaluating service accessibility of urban bus stop | |
| CN110972073B (en) | Living circle defining method based on mobile phone big data and walking accessibility | |
| CN112215427A (en) | Vehicle driving track reconstruction method and system under condition of bayonet data loss | |
| CN104636457B (en) | A kind of method and device of location finding cognition | |
| Oluwadare et al. | Solving school bus routing problem using genetic algorithm-based model | |
| CN112988936A (en) | Travel track prediction method and device, computing equipment and storage medium | |
| CN107808217A (en) | A kind of Public Transport Transfer optimization method based on Big Dipper positioning with the volume of the flow of passengers | |
| CN107545318A (en) | The determination of public bus network priority, bus transfer lines sort method and device | |
| Sun et al. | Solving demand-responsive feeder transit service design with fuzzy travel demand: A collaborative ant colony algorithm approach | |
| Bayram et al. | Could petrol stations play a key role in transportation electrification? a gis-based coverage maximization of fast ev chargers in urban environment | |
| CN111008730B (en) | Crowd concentration prediction model construction method and device based on urban space structure | |
| Yang et al. | Optimization of station-skip in a cyclic express subway service | |
| CN111046123B (en) | Traffic transfer directed graph generation method and system | |
| CN111612240A (en) | Power supply point access line optimization method and technical system of intelligent multi-factor network | |
| CN111797145A (en) | Power customer tolerance evaluation classification method | |
| Hoogendoorn-Lanser et al. | Home–Activity Approach to Multimodal Travel Choice Modeling | |
| CN111226254A (en) | Reliability of network maps | |
| CN110688436A (en) | Improved GeoHash road clustering method based on driving track | |
| CN115311887A (en) | Method, equipment and storage medium for constructing high-quality public service resource accessibility model | |
| Gil et al. | Patterns of sustainable mobility and the structure of modality in the Randstad city-region | |
| KR102374342B1 (en) | Food waste management support apparatus and method | |
| CN109858567B (en) | Method and system for judging travel form of vehicle owner |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |