CN111046123B - Traffic transfer directed graph generation method and system - Google Patents
Traffic transfer directed graph generation method and system Download PDFInfo
- Publication number
- CN111046123B CN111046123B CN201911284540.6A CN201911284540A CN111046123B CN 111046123 B CN111046123 B CN 111046123B CN 201911284540 A CN201911284540 A CN 201911284540A CN 111046123 B CN111046123 B CN 111046123B
- Authority
- CN
- China
- Prior art keywords
- directed graph
- identification string
- basic
- generating
- basis
- 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
- 238000012546 transfer Methods 0.000 title claims abstract description 46
- 238000000034 method Methods 0.000 title claims abstract description 22
- 238000012545 processing Methods 0.000 claims description 6
- 238000012216 screening Methods 0.000 claims description 6
- 230000000694 effects Effects 0.000 abstract description 4
- 230000005611 electricity Effects 0.000 abstract description 4
- 238000004134 energy conservation Methods 0.000 abstract description 2
- 125000006850 spacer group Chemical group 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010586 diagram Methods 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
- 238000010845 search algorithm Methods 0.000 description 1
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
-
- G06Q50/40—
-
- 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
Abstract
The invention discloses a traffic transfer directed graph generation method and a system, which are characterized in that a demand identification string is generated according to a query request of a user to judge, and a line represented by the directed graph can be obtained if and only if the demand identification string is matched with the directed graph identification string, so that judgment on the type of a traffic tool and the operation time of the line under specific conditions can be greatly reduced in operation, a large number of uncorrelated nodes are avoided from being traversed, the operation speed can be improved, the query accuracy is improved, repeated operation and unnecessary redundant operation are effectively avoided, the hardware cost can be reduced, the consumption of server resources is reduced, the electricity consumption is reduced, and the effects of energy conservation and emission reduction are achieved.
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 traffic transfer line planning field, the traffic line data is abstracted into a topological network or a directed graph, then transfer path planning operation is carried out on the basis, in general, people regard bus stations as network nodes, the connection between stations generated through buses and walking based on a certain threshold value is regarded as a connecting edge, then a graph is abstracted and obtained, and a transfer scheme is obtained through operation of Dijkstra algorithm or breadth first search algorithm.
People have obvious tendency according to different crowds, for example, most people obviously prefer to track traffic or BRT buses, and certain users have specific time requirements when traveling, for example, traveling at 23:00 pm, and can only take night buses at the moment; the public transport system is characterized in that a fixed bus is arranged in some communities, people in the communities often take the bus line of the community as a main line when going out, the required transfer scheme is sought by radiating outwards, and when the transfer problem of different space distances is solved, huge urban public transport data is often required to face, so that the problems of high operation redundancy, low operation speed and the like are caused, and the situations of error of an inquiry result, overlong inquiry time and the like are caused.
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 inquiry.
The technical scheme of the invention is realized as follows:
the traffic transfer directed graph generation method specifically comprises the following steps:
step S1, initial traffic data are collected, an urban public transportation basic directed graph, a domestic long-distance basic directed graph and an international basic directed graph are generated, and directed graph identification strings corresponding to each basic directed graph are given;
step S2, a user inputs a query request, and a demand identification string is generated according to the query request;
step S3, judging whether a directed graph identification string which is the same as the demand identification string exists, if so, executing step S4, and if not, executing step S5;
s4, carrying out line transfer operation on the directed graph represented by the directed graph identification string which is the same as the demand identification string, and sending an operation result to a user;
and S5, generating a directed graph matched with the demand identification string according to the existing directed graph, performing line transfer operation on the generated directed graph, and sending an operation result to a user.
As a further alternative to the traffic transfer directed graph generating method, the step S1 includes the steps of:
step S11, collecting initial traffic data, and generating the initial traffic data according to the initial traffic data;
step S12, generating an urban bus basic directed graph, a domestic long-distance basic directed graph and an international basic directed graph according to the original traffic data, and storing the generated urban bus basic directed graph, the domestic long-distance basic directed graph and the international basic directed graph in a database;
step S13, generating directed graph identification strings corresponding to each basis directed graph according to the urban public transport basis directed graph, the domestic long-distance basis directed graph and the international basis directed graph.
As a further alternative to the traffic transfer directed graph generating method, the step S11 includes the steps of:
step S111, collecting information of each bus route;
step S112, collecting information of each site;
step S113, collecting site information with walking relationship around each site;
step S114, the information of the bus route, the information of each station and the station information with walking relation around each station are stored in a database for processing, and original bus data is generated.
As a further alternative of the method for generating a public transportation transfer directed graph, the step S12 includes the following steps:
step S121, screening out bus routes with the operation range in the city, establishing a riding arc between every two adjacent passing stations according to the running direction of the vehicle according to the running sequence of the bus routes, and establishing walking arcs between stations with walking relationship to generate a basic directed graph of the public transportation in the city;
step S122, long-distance routes with the operation range between cities are screened, and a riding arc is established between every two adjacent passing stations according to the running direction of the vehicles according to the running sequence of the vehicles, so that a domestic long-distance basic directed graph is generated;
step S123, screening international routes with the operation range between countries, and establishing a riding arc between every two adjacent passing stations according to the running direction of the vehicle according to the running sequence of the vehicle to generate an international basis directed graph;
and step S124, the generated urban public transport base directed graph, the domestic long-distance base directed graph and the international base directed graph are sent to a database for storage.
As a further alternative of the method for generating a public transportation transfer directed graph, the step S13 includes the following steps:
step S131, obtaining the region, the traffic tool and the service time represented by each basis directed graph according to the urban bus basis directed graph, the domestic long-distance basis directed graph and the international basis directed graph;
step S132, endowing identifiers for distinguishing areas, vehicles and service time;
step S133, generating corresponding directed graph identification strings according to the regions, vehicles and service time represented by each base directed graph.
As a further alternative of the method for generating a public transportation transfer directed graph, the step S2 includes the following steps:
step S21, a user inputs a query request, and the departure place and destination, the type of the transportation means and the riding time of the user are obtained according to the query request;
step S22, a demand identification string is generated according to the departure place and destination of the user, the type of the vehicle and the riding time.
As a further alternative of the method for generating a public transportation transfer directed graph, the step S5 includes the following steps:
step S51, analyzing the demand identification string, and acquiring departure places and destinations, vehicle types and riding time input by a user;
step S52, obtaining one or more than one of an urban public transportation foundation directed graph, a domestic long-distance foundation directed graph and an international foundation directed graph according to a departure place and a destination;
and step S53, deleting the vehicles which do not accord with the vehicle type and the service time which do not accord with the riding time from the obtained basic directed graph according to the vehicle type and the riding time, thereby generating the directed graph 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 a public transportation transfer directed graph, the step S52 includes the steps of:
step S521, determining whether the departure place and the destination are in the same city, if yes, obtaining an urban public transportation basic 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 basis directed graph and a domestic long distance basis directed graph of the city to which the departure place and the destination belong, and if not, executing step S523;
step S523, an urban public transportation base directed graph, a domestic long-distance base directed graph and an international base directed graph of the 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 the line and the station to obtain initial bus data;
the data making unit is used for making and obtaining the original bus data according to the original bus data;
the basic directed graph generating unit is used for generating an urban public transportation basic directed graph, a domestic long-distance basic directed graph and an international basic directed graph according to the original public transportation 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 identifying the generated directed graph according to the user demand;
an identifier-assigning unit for assigning an identifier for distinguishing a region, a vehicle, and a service time;
a directed graph identification string generating unit, configured to generate a directed graph identification string corresponding to each base directed graph according to the identifier;
the demand identification string generation unit is used for generating a demand identification string according to a query request input by a user;
a judging unit, configured to determine whether a directed graph identification string identical to the demand identification string exists;
the demand identification string analysis unit is used for analyzing the demand identification string;
the directed graph generating unit is used for generating a new directed graph based on the existing directed graph;
and the circuit transfer operation unit is used for carrying out circuit transfer operation based on the given directed graph.
The beneficial effects of the invention are as follows: by adopting the method and the system, the demand identification string is generated according to the inquiry request of the user to judge, and if and only if the demand identification string is matched with the directed graph identification string, the line represented by the directed graph can be obtained, so that the judgment on the type of the traffic tool and the operation time of the line under specific conditions can be greatly reduced in operation, a large number of uncorrelated nodes are avoided from being traversed, the operation speed can be improved, the inquiry accuracy is improved, the repeated operation and unnecessary redundant operation are effectively avoided, the hardware cost is reduced, the consumption of server resources is reduced, the electricity consumption is reduced, and the energy conservation and emission reduction effects are achieved.
Drawings
In order to more clearly illustrate the embodiments of the invention or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described, it being obvious that the drawings in the following description are only some embodiments of the invention, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flow chart of a traffic transfer directed graph generation method of the present invention;
FIG. 2 is a schematic diagram of the components of a traffic transfer directed graph generating system according to the present invention;
FIG. 3 is a partially schematic representation of a base urban directed graph of the invention;
FIG. 4 is a partial schematic representation of a directed graph of the city where only subway networks remain after pruning in accordance with the present invention;
FIG. 5 is a partial schematic representation of a long distance base directed graph of the present invention;
fig. 6 is a partial schematic representation of a combined urban directed graph of two cities and a long distance directed graph of the country in which the present invention is located.
Detailed Description
The following description of the technical solutions in the embodiments of the present invention will be clear and complete, and it is obvious that the described embodiments are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
Referring to fig. 1-2, a traffic transfer directed graph generating method specifically includes the following steps:
step S1, initial traffic data are collected, an urban public transportation basic directed graph, a domestic long-distance basic directed graph and an international basic directed graph are generated, and directed graph identification strings corresponding to each basic directed graph are given;
step S2, a user inputs a query request, and a demand identification string is generated according to the query request;
step S3, judging whether a directed graph identification string which is the same as the demand identification string exists, if so, executing step S4, and if not, executing step S5;
s4, carrying out line transfer operation on the directed graph represented by the directed graph identification string which is the same as the demand identification string, and sending an operation result to a user;
and S5, generating a directed graph matched with the demand identification string according to the existing directed graph, performing line transfer operation on the generated directed graph, and sending an operation result to a user.
In this embodiment, the requirement identification string is generated according to the query request of the user to perform judgment, if and only if the requirement identification string is matched with the directed graph identification string, the line represented by the directed graph can be obtained, so that judgment on the type of the traffic tool and the operation time of the line under specific conditions can be greatly reduced in operation, and a large number of uncorrelated nodes are avoided from being traversed, the operation speed can be improved, the query accuracy is improved, repeated operation and unnecessary redundant operation are effectively avoided, the hardware cost can be reduced, the consumption of server resources is reduced, the electricity consumption is reduced, and the energy saving and emission reduction effects are achieved; the coding format of the directed graph identification string is expressed in a manner of "mw [ #mx ] & [ #cy ] & [ #tz ] & gt. The digitized time value in "minutes" refers to a value obtained by multiplying an hour value made by 24 hours by 60 and adding the minute value, for example, 08:30, calculated by 8×60+30 to obtain 510, and calculated by 21:15 by 21×60+15 to obtain 1275; in addition, each identifier in the identification string is added with a numerical value, namely an identifier plus a numerical value, to form a parameter pair, the number of the identifier is a spacer among a plurality of parameter pairs, each identification string at least comprises an mw parameter pair, and a plurality of parameter pairs of the same identifier type in the identification string are connected in series and are arranged in a sequence 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 the initial traffic data according to the initial traffic data;
step S12, generating an urban bus basic directed graph, a domestic long-distance basic directed graph and an international basic directed graph according to the original traffic data, and storing the generated urban bus basic directed graph, the domestic long-distance basic directed graph and the international basic directed graph in a database;
step S13, generating directed graph identification strings corresponding to each basis directed graph according to the urban public transport basis directed graph, the domestic long-distance basis directed graph and the international basis directed graph.
In this embodiment, by collecting initial traffic data to generate a base directed graph, and storing the generated base directed graph in a database, each base directed graph has a unique identification string, when a required identification string is exactly the same as an identification string matched with a base directed graph stored in the database, the base directed graph can be directly obtained, and no operation is required, so that the operation task of the system is further reduced, and the time for a user to obtain a query result is further shortened.
Preferably, the step S11 includes the steps of:
step S111, collecting information of each bus route;
step S112, collecting information of each site;
step S113, collecting site information with walking relationship around each site;
step S114, the information of the bus route, the information of each station and the station information with walking relation around each station are stored in a database for processing, and original bus data is generated.
In this embodiment, information such as a name, a vehicle type, an operation time or a shift schedule, a passing station and the like of each bus line are collected, information such as a position coordinate, a name, a type and the like of each station are collected, station information with a walking relationship around each station is collected, the collected information is input into a database, and raw bus data are obtained after processing and manufacturing, so that traffic conditions of each region can be clarified, and travel modes required by users can be well screened.
Preferably, the step S12 includes the steps of:
step S121, screening out bus routes with the operation range in the city, establishing a riding arc between every two adjacent passing stations according to the running direction of the vehicle according to the running sequence of the bus routes, and establishing walking arcs between stations with walking relationship to generate a basic directed graph of the public transportation in the city;
step S122, long-distance routes with the operation range between cities are screened, and a riding arc is established between every two adjacent passing stations according to the running direction of the vehicles according to the running sequence of the vehicles, so that a domestic long-distance basic directed graph is generated;
step S123, screening international routes with the operation range between countries, and establishing a riding arc between every two adjacent passing stations according to the running direction of the vehicle according to the running sequence of the vehicle to generate an international basis directed graph;
and step S124, the generated urban public transport base directed graph, the domestic long-distance base directed graph and the international base directed graph are sent to a database for storage.
In this embodiment, an independent urban public transportation base directed graph is generated by each city, such a domestic long-distance base directed graph is generated by each country, and an international base directed graph is generated between internations, so that the urban or national base directed graph required by the user can be directly obtained, unnecessary base directed graphs are directly removed, the operation data is greatly reduced, and the operation speed is also greatly improved.
Preferably, the step S13 includes the steps of:
step S131, obtaining the region, the traffic tool and the service time represented by each basis directed graph according to the urban bus basis directed graph, the domestic long-distance basis directed graph and the international basis directed graph;
step S132, endowing identifiers for distinguishing areas, vehicles and service time;
step S133, generating corresponding directed graph identification strings according to the regions, vehicles and service time represented by each base directed graph.
In this embodiment, each base directed graph is independent, and represents the vehicles and the service time of the vehicles in a region, and by representing different regions, vehicles and service times with different identifiers, a directed graph identification string corresponding to the base directed graph is generated, and each directed graph identification string is unique, so that different points of each base directed graph can be better shown.
Preferably, the step S2 includes the steps of:
step S21, a user inputs a query request, and the departure place and destination, the type of the transportation means and the riding time of the user are obtained according to the query request;
step S22, a demand identification string is generated according to the departure place and destination of the user, the type of the vehicle and the riding time.
In this embodiment, according to conditions such as departure place and destination, vehicle type, riding time and the like in a user query request, a requirement identification string is generated by combining a spatial distance relation between the departure place and the destination, wherein the requirement identification string is represented according to a coding format of a directed graph identification string;
for example, if the departure place and the destination belong to one city, and the city number is "1003", the identifier of the departure place and the destination is "m1003"; if the user requests a vehicle with a vehicle type number of "786420" to be specified, the identifier of the vehicle type is "#c786420"; if the user requests that the riding time is "12:30", the riding time is converted into the digital time value in the unit of "minutes" to obtain 750, the riding time identifier is "#t750", and the requirement identification string is "m1003#c786420#t750" in summary.
Preferably, the step S5 includes the steps of:
step S51, analyzing the demand identification string, and acquiring departure places and destinations, vehicle types and riding time input by a user;
step S52, obtaining one or more than one of an urban public transportation foundation directed graph, a domestic long-distance foundation directed graph and an international foundation directed graph according to a departure place and a destination;
and step S53, deleting the vehicles which do not accord with the vehicle type and the service time which do not accord with the riding time from the obtained basic directed graph according to the vehicle type and the riding time, thereby generating the directed graph matched with the requirement identification string, and sending the generated directed graph to a database for storage.
In this embodiment, whether the user is urban transfer or domestic transfer or international transfer is judged by the departure place and the destination, so that a basic directed graph meeting the requirements is screened out, then a traffic tool and riding time meeting the requirements of the user are selected from the screened basic directed graph, so that a directed graph matched with the user query request is generated, the generated directed graph is sent to a database for storage, and when the user queries the same request next time, the directed graph can be directly obtained in the database without generating the directed graph according to the requirement identification string, the query efficiency and accuracy are improved, and the experience of the user query is also improved.
Preferably, the step S52 includes the steps of:
step S521, determining whether the departure place and the destination are in the same city, if yes, obtaining an urban public transportation basic 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 basis directed graph and a domestic long distance basis directed graph of the city to which the departure place and the destination belong, and if not, executing step S523;
step S523, an urban public transportation base directed graph, a domestic long-distance base directed graph and an international base directed graph of the country to which the departure place and the destination belong are obtained.
In this embodiment, whether the departure place and the destination are in the same city or the same country is determined by adopting a multi-layer determination manner, so that a corresponding basic directed graph is obtained, processing can be performed based on the obtained basic directed graph, processing of all the basic directed graphs is not required, operation data is greatly reduced, and operation speed is improved.
A traffic transfer directed graph generation system, comprising:
the data acquisition unit is used for acquiring information of the line and the station to obtain initial bus data;
the data making unit is used for making and obtaining the original bus data according to the original bus data;
the basic directed graph generating unit is used for generating an urban public transportation basic directed graph, a domestic long-distance basic directed graph and an international basic directed graph according to the original public transportation 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 identifying the generated directed graph according to the user demand;
an identifier-assigning unit for assigning an identifier for distinguishing a region, a vehicle, and a service time;
a directed graph identification string generating unit, configured to generate a directed graph identification string corresponding to each base directed graph according to the identifier;
the demand identification string generation unit is used for generating a demand identification string according to a query request input by a user;
a judging unit, configured to determine whether a directed graph identification string identical to the demand identification string exists;
the demand identification string analysis unit is used for analyzing the demand identification string;
the directed graph generating unit is used for generating a new directed graph based on the existing directed graph;
and the circuit transfer operation unit is used for carrying out circuit 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 to perform judgment, if and only if the requirement identification string is matched with the directed graph identification string, the line represented by the directed graph can be obtained, so that judgment on the type of the traffic tool and the operation time of the line under specific conditions can be greatly reduced in operation, and a large number of uncorrelated nodes are avoided from being traversed, the operation speed can be improved, the query accuracy is improved, repeated operation and unnecessary redundant operation are effectively avoided, the hardware cost can be reduced, the consumption of server resources is reduced, the electricity consumption is reduced, and the energy saving and emission reduction effects are achieved; the coding format of the directed graph identification string is expressed in a manner of "mw [ #mx ] & [ #cy ] & [ #tz ] & gt. The digitized time value in "minutes" refers to a value obtained by multiplying an hour value made by 24 hours by 60 and adding the minute value, for example, 08:30, calculated by 8×60+30 to obtain 510, and calculated by 21:15 by 21×60+15 to obtain 1275; in addition, each identifier in the identification string is added with a numerical value, namely an identifier plus a numerical value, to form a parameter pair, the number of the identifier is a spacer among a plurality of parameter pairs, each identification string at least comprises an mw parameter pair, and a plurality of parameter pairs of the same identifier type in the identification string are connected in series and are arranged in a sequence from small to large according to the numerical value.
The foregoing description of the preferred embodiments of the invention is not intended to be limiting, but rather is intended to cover all modifications, equivalents, alternatives, and improvements that fall within the spirit and scope of the invention.
Claims (7)
1. The traffic transfer directed graph generation method is characterized by comprising the following steps of:
step S1, initial traffic data are collected, an urban public transportation basic directed graph, a domestic long-distance basic directed graph and an international basic directed graph are generated, and directed graph identification strings corresponding to each basic directed graph are given;
step S2, a user inputs a query request, and a demand identification string is generated according to the query request;
step S3, judging whether a directed graph identification string which is the same as the demand identification string exists, if so, executing step S4, and if not, executing step S5;
s4, carrying out line transfer operation on the directed graph represented by the directed graph identification string which is the same as the demand identification string, and sending an operation result to a user;
step S5, generating a directed graph matched with the demand identification string according to the existing directed graph, performing line transfer operation on the generated directed graph, and sending an operation result to a user;
wherein, the step S1 includes the following steps:
step S11, collecting initial traffic data, and generating the initial traffic data according to the initial traffic data;
step S12, generating an urban bus basic directed graph, a domestic long-distance basic directed graph and an international basic directed graph according to the original traffic data, and storing the generated urban bus basic directed graph, the domestic long-distance basic directed graph and the international basic directed graph in a database;
step S13, generating directed graph identification strings corresponding to each basis directed graph according to the urban bus basis directed graph, the domestic long-distance basis directed graph and the international basis directed graph;
the step S12 includes the steps of:
step S121, screening out bus routes with the operation range in the city, establishing a riding arc between every two adjacent passing stations according to the running direction of the vehicle according to the running sequence of the bus routes, and establishing walking arcs between stations with walking relationship to generate a basic directed graph of the public transportation in the city;
step S122, long-distance routes with the operation range between cities are screened, and a riding arc is established between every two adjacent passing stations according to the running direction of the vehicles according to the running sequence of the vehicles, so that a domestic long-distance basic directed graph is generated;
step S123, screening international routes with the operation range between countries, and establishing a riding arc between every two adjacent passing stations according to the running direction of the vehicle according to the running sequence of the vehicle to generate an international basis directed graph;
and step S124, the generated urban public transport base directed graph, the domestic long-distance base directed graph and the international base directed graph are sent to a database for storage.
2. The traffic transfer directed graph generating method according to claim 1, wherein the step S11 includes the steps of:
step S111, collecting information of each bus route;
step S112, collecting information of each site;
step S113, collecting site information with walking relationship around each site;
step S114, the information of the bus route, the information of each station and the station information with walking relation around each station are stored in a database for processing, and original bus data is generated.
3. The traffic transfer directed graph generating method according to claim 2, wherein the step S13 includes the steps of:
step S131, obtaining the region, the traffic tool and the service time represented by each basis directed graph according to the urban bus basis directed graph, the domestic long-distance basis directed graph and the international basis directed graph;
step S132, endowing identifiers for distinguishing areas, vehicles and service time;
step S133, generating corresponding directed graph identification strings according to the regions, vehicles and service time represented by each base directed graph.
4. The traffic transfer directed graph generating method according to claim 3, wherein the step S2 comprises the steps of:
step S21, a user inputs a query request, and the departure place and destination, the type of the transportation means and the riding time of the user are obtained according to the query request;
step S22, a demand identification string is generated according to the departure place and destination of the user, the type of the vehicle and the riding time.
5. The traffic transfer directed graph generating method according to claim 4, wherein the step S5 comprises the steps of:
step S51, analyzing the demand identification string, and acquiring departure places and destinations, vehicle types and riding time input by a user;
step S52, obtaining one or more than one of an urban public transportation foundation directed graph, a domestic long-distance foundation directed graph and an international foundation directed graph according to a departure place and a destination;
and step S53, deleting the vehicles which do not accord with the vehicle type and the service time which do not accord with the riding time from the obtained basic directed graph according to the vehicle type and the riding time, thereby generating the directed graph matched with the requirement identification string, and sending the generated directed graph to a database for storage.
6. The traffic transfer directed graph generating method according to claim 5, wherein said step S52 comprises the steps of:
step S521, determining whether the departure place and the destination are in the same city, if yes, obtaining an urban public transportation basic 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 basis directed graph and a domestic long distance basis directed graph of the city to which the departure place and the destination belong, and if not, executing step S523;
step S523, an urban public transportation base directed graph, a domestic long-distance base directed graph and an international base directed graph of the country to which the departure place and the destination belong are obtained.
7. A traffic transfer directed graph generation system, comprising:
the data acquisition unit is used for acquiring information of the line and the station to obtain initial bus data;
the data making unit is used for making and obtaining the original bus data according to the original bus data;
the basic directed graph generating unit is used for generating an urban public transportation basic directed graph, a domestic long-distance basic directed graph and an international basic directed graph according to the original public transportation 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 identifying the generated directed graph according to the user demand;
an identifier-assigning unit for assigning an identifier for distinguishing a region, a vehicle, and a service time;
a directed graph identification string generation unit for generating directed graph identification strings corresponding to each base directed graph;
the demand identification string generation unit is used for generating a demand identification string according to a query request input by a user;
a judging unit, configured to determine whether a directed graph identification string identical to the demand identification string exists;
the demand identification string analysis unit is used for analyzing the demand identification string;
the directed graph generating unit is used for generating a new directed graph based on the existing directed graph;
and the circuit transfer operation unit is used for carrying out circuit 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 CN111046123A (en) | 2020-04-21 |
| CN111046123B true 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 (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8417409B2 (en) * | 2009-11-11 | 2013-04-09 | Google Inc. | Transit routing system for public transportation trip planning |
-
2019
- 2019-12-13 CN CN201911284540.6A patent/CN111046123B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
|---|
| 李丹，黄正东.顾及换乘距离的城市公交系统出行路径优化研究.《交通运输工程与信息学报》.2008,第第6卷卷(第第6卷期),正文. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111046123A (en) | 2020-04-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103177561B (en) | Method for generating bus real-time traffic status | |
| CN102136192B (en) | Method for identifying trip mode based on mobile phone signal data | |
| CN111581315B (en) | Public service facility reachability calculation method and device | |
| CN108320501A (en) | Public bus network recognition methods based on user mobile phone signaling | |
| De Bona et al. | Analysis of public bus transportation of a Brazilian city based on the theory of complex networks using the P-space | |
| CN105674995A (en) | Method for acquiring commuting route based on user's travel locus, and apparatus thereof | |
| 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 | |
| CN110012120A (en) | A kind of IP City-level location algorithm based on PoP network topology | |
| CN110309936A (en) | A kind of sub-interchange recognition methods combined based on mobile phone location data and path estimating | |
| CN112215427A (en) | Vehicle driving track reconstruction method and system under condition of bayonet data loss | |
| GB2475486A (en) | Means for identifying a part of a map to be updated based on reroute positions | |
| CN102096702A (en) | Process system of vehicle travel mileage and process method thereof | |
| CN113887617A (en) | Urban railway travel track identification method and device and storage medium | |
| CN116504050A (en) | Special event city partitioning method based on multi-mode public transport trip data | |
| KR20210117235A (en) | Method for managing travel route database based on location and server for the method | |
| CN111046123B (en) | Traffic transfer directed graph generation method and system | |
| CN105468595A (en) | Bus route planning method and system | |
| CN111612240A (en) | Power supply point access line optimization method and technical system of intelligent multi-factor network | |
| McCormack | Using a GIS to enhance the value of travel diaries | |
| Hoogendoorn-Lanser et al. | Home–Activity Approach to Multimodal Travel Choice Modeling | |
| CN102542617B (en) | Path identification station arranging method of complicated road net | |
| CN115860520A (en) | High-speed railway hub and urban public traffic dynamic and static space-time accessibility assessment method | |
| CN111966768A (en) | Address description method and device, electronic equipment and storage medium | |
| CN113269353B (en) | Subway income sorting method and system based on shortest path algorithm |
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 |