CN108537362B - Bus transfer method based on bidirectional search and estimation function pruning mode - Google Patents
Bus transfer method based on bidirectional search and estimation function pruning mode Download PDFInfo
- Publication number
- CN108537362B CN108537362B CN201810182963.6A CN201810182963A CN108537362B CN 108537362 B CN108537362 B CN 108537362B CN 201810182963 A CN201810182963 A CN 201810182963A CN 108537362 B CN108537362 B CN 108537362B
- Authority
- CN
- China
- Prior art keywords
- station
- transfer
- line
- bus
- riding
- 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
- 238000000034 method Methods 0.000 title claims abstract description 26
- 230000002457 bidirectional effect Effects 0.000 title claims abstract description 13
- 238000013138 pruning Methods 0.000 title claims abstract description 13
- 238000004364 calculation method Methods 0.000 claims abstract description 41
- 238000006243 chemical reaction Methods 0.000 description 1
- YDLQKLWVKKFPII-UHFFFAOYSA-N timiperone Chemical compound C1=CC(F)=CC=C1C(=O)CCCN1CCC(N2C(NC3=CC=CC=C32)=S)CC1 YDLQKLWVKKFPII-UHFFFAOYSA-N 0.000 description 1
- 229950000809 timiperone Drugs 0.000 description 1
Images
Classifications
-
- 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
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- 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
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
-
- 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
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Entrepreneurship & Innovation (AREA)
- General Business, Economics & Management (AREA)
- Marketing (AREA)
- Physics & Mathematics (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Educational Administration (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention discloses a bus transfer method based on a bidirectional search and estimation function pruning mode, which comprises the following steps: step 1: the server respectively carries out direct line and special vehicle line calculation, primary transfer line calculation with walking before transfer, twice transfer line calculation with walking before the first transfer, twice transfer line calculation with walking before the second transfer and twice transfer line calculation with walking before the two transfers according to the starting station and the ending station which are transmitted by the client by the following methods: step 2: and (3) respectively calculating the required time of the available bus taking scheme in the step (1) by the server according to the starting station and the ending station which are transmitted by the client, and recommending the bus taking scheme with the least consumed time to the client. The invention can effectively improve the traveling efficiency of citizens.
Description
Technical Field
The invention relates to the technical field of bus system transfer, in particular to a bus transfer method based on a bidirectional search and estimation function pruning mode.
Background
With the development of urbanization and modernization, public transportation becomes a significant civil problem which must be faced by each developing city. The increasingly complex bus lines lead citizens to easily get on or off the bus, wait for too long time and the like; the method has a good transfer method, can reduce the walking distance of citizens, shorten waiting time, reduce riding time and the like, greatly brings convenience to the citizens, and saves the traveling time of the citizens. The existing bus transfer scheme generally uses breadth-first search (BFS) to obtain a pile of results, then uses Dijkstra algorithm to sequentially search K short circuits, and then sorts the results; the method has low calculation and transfer efficiency and poor performance, does not fully consider the autonomy requirement of inquiry, and cannot meet various riding requirements of users; in addition, the situation is limited by a calculation mode, too many transfer schemes are generated, the vehicle dispatching operation situation is lacked, the vehicle operation situation cannot be captured in time, and a better transfer scheme cannot be reasonably provided.
Disclosure of Invention
The invention aims at the technical problems and provides a bus transfer method based on a bidirectional search and estimation function pruning mode, and the method can find a relatively superior and complete bus transfer scheme in complicated traffic and map data.
In order to achieve the purpose, the invention designs a public transportation transfer method based on a bidirectional search and estimation function pruning mode, which comprises the following steps:
step 1: the server respectively carries out direct line and special vehicle line calculation, primary transfer line calculation with walking before transfer, twice transfer line calculation with walking before the first transfer, twice transfer line calculation with walking before the second transfer and twice transfer line calculation with walking before the two transfers according to the starting station and the ending station which are transmitted by the client by the following methods:
the method for calculating the direct route and the special vehicle route comprises the following steps:
calculating x (p) ═ y (q) (1)
X (p) represents the line number of the bus line passing through the start station set, and y (q) represents the line number of the bus line passing through the end station set;
if the result is a non-empty set, a direct riding scheme is represented, and a starting station number I, a riding line number p and an end station number J corresponding to the intersection element in the formula 1 are obtained;
the calculation method of the primary transfer line comprises the following steps:
all stations included in each line number p in a set X (I, p) representing bus lines passing through a start station set, I representing the number of a start station, p representing a bus line number, which represents a first-time bus line number, in a set Y (J, q), U representing a transfer station number in the start station set, a set Y (J, q) representing bus lines passing through an end station set, J representing an end station number, q representing a bus line number before an end point, V representing a transfer station number in the end station set, are represented as a station set a1(I, p, U) representing bus lines passing through the start station set, and all stations included in a bus line number q before the end point in a set Y (J, q),
calculation a1(U) ═ b (v) (2)
If the result is a non-empty set, representing a one-transfer riding scheme, and obtaining a starting station number I, a riding line number p, a riding line number before the end point and a riding line number before the end point, wherein the starting station number I, the riding line number p, the riding line number before the first riding line number, the riding line number before the end point and the end point number J correspond to the intersection elements in the formula 2;
the first transfer route with walking before transfer is calculated as:
for a transfer station U in each starting station set in the station set A1(I, p, U), searching other bus stations within a preset radius range around, wherein the other bus stations are marked as a station set A2(I, p, U, M), and M represents the number of transfer stations;
calculation a2(M) ═ b (v) (3)
If the result is a non-empty set, the scheme indicates that a primary transfer line scheme with walking before transfer exists, V indicates the number of the transfer station in the destination station set, and the number I of the starting station corresponding to the intersection element in the formula 3, the number p of the bus line, which indicates the number of the first bus line, the number U of the transfer station, which indicates the number of the transfer departure station, the number M of the transfer departure station, the number q of the bus line before the destination, and the number J of the destination station are obtained;
the two transfer lines are calculated as:
the bus lines passing through each transfer station U in the initial station set in the station set A1(I, p, U) are recorded as a line set A3(I, p, U, k), k represents the serial number of the lines for the second time, all stations passing through each line in the line set A3(I, p, U, k) are recorded as a station set A4(I, p, U, k, S), and S represents the serial number of the stations for the second time;
calculation a4(S) ═ b (v) (4)
If the result is a non-empty set, the riding scheme with twice transfer is shown, and a starting station number I, a riding line number p, a first riding line number and a transfer station number U which correspond to the intersection elements in the formula 4 are obtained, wherein the first riding line number is shown here, the first transfer getting-off station number is shown here, the second riding line number k is shown here, the second transfer getting-off station number is shown here, the riding line number q before the terminal is shown here, and the terminal station number J is shown here;
the two transfer routes with a walk before the first transfer are calculated as:
the bus lines passing through each station transfer getting-on station number M in the station set A2(I, p, U, M) are recorded as a line set A5(I, p, U, M, k), all stations passing through each line in the line set A5(I, p, U, M, k) are recorded as a station set A6(I, p, U, M, k, S), and S is the station number of the second transfer getting-off station;
calculation a6(S) ═ b (v) (5)
If the result is a non-empty set, the scheme indicates that two transfer lines with walking before the first transfer are available, and a starting station number I, a riding line number p, a first riding line number, a first transfer station number U, a first transfer getting-off station number, a transfer getting-on station number M, a first transfer getting-on station number, a second riding line number k, a second transfer getting-off station number S, a riding line number q before the terminal and a terminal station number J, which correspond to the intersection element in formula 5 are obtained;
the two transfer routes with a walk before the second transfer are calculated as:
for each second-time transfer getting-on/off station number S in the station set A4(I, p, U, k, S), searching other bus stations within a preset radius range around, and marking as a station set A7(I, p, U, k, S, G), wherein G represents an getting-on station number of a riding route before a terminal;
calculation a7(G) ═ b (v) (6)
If the result is a non-empty set, the scheme indicates that two transfer lines with walking before the second transfer are available, and a starting station number I, a riding line number p, a first riding line number, a transfer station number U, a first transfer getting-off station number, a second riding line number k, a second transfer getting-off station number S, a getting-on station number G of a riding line before the terminal, a riding line number q before the terminal and a terminal station number J, which correspond to the intersection element in formula 6 are obtained;
the two transfer routes with walking before the two transfers are calculated as:
for each second transfer getting-on/off station number S in the station set A6(I, p, U, M, k, S), searching other bus stations within a preset radius range around, and marking as a station set A8(I, p, U, M, k, S, G) which represents the getting-on station number of a bus line before the terminal;
calculation A8(G) ═ b (v) (7)
If the result is a non-empty set, the scheme indicates that two transfer lines with walking before two transfers are available, and a starting station number I, a taking line number p, a first taking line number, a transfer station number U, a first transfer getting-off station number, a transfer getting-on station number M, a first transfer getting-on station number, a second taking line number k, a second transfer getting-off station number S, a getting-on station number G of a taking line before the terminal, a taking line number q before the terminal and a terminal station number J corresponding to the intersection element in formula 7 are obtained;
step 2: and (3) respectively calculating the required time of the available bus taking scheme in the step (1) by the server according to the starting station and the ending station which are transmitted by the client, and recommending the bus taking scheme with the least consumed time to the client.
According to the method, a large number of lines and station coordinates in the virtual map are utilized, and the riding scheme of citizens is predicted through the transfer scheme. Compared with the traditional method introduced in the background technology, the method has the advantages of simple algorithm, less calculation amount, high efficiency, complete predicted transfer lines and the like; the method utilizes the bus route and station information drawn in the map, filters some too far stations by using a bidirectional search and valuation function pruning mode for reference, avoids the calculation of too many invalid routes, can obtain the running condition of vehicles on the corresponding routes according to a scheduling system, and calculates the transfer scheme of citizens going out by combining the transfer routes, the weight calculation and the vehicle running state.
Drawings
FIG. 1 is a direct line or a dedicated line;
FIG. 2 is a circuit of one-time transfer;
fig. 3 shows a quadratic conversion circuit.
In the figure, dots indicate respective stations, lines indicate routes by bus, and dotted circles indicate radius ranges to be searched.
Detailed Description
The invention is described in further detail below with reference to the figures and the specific embodiments.
The invention discloses a bus transfer method based on a bidirectional search and valuation function pruning mode, which comprises the following steps:
step 1: the server respectively utilizes database information (bus lines and station information drawn in a digital map) in the server to calculate direct lines and special vehicle lines, calculate a transfer line for one time with walking before transfer, calculate transfer lines for two times with walking before the first transfer, calculate transfer lines for two times with walking before the second transfer and calculate transfer lines for two times with walking before the two transfers according to the starting station and the ending station transmitted by the client by the following methods:
the method for calculating the direct route and the special vehicle route comprises the following steps:
as shown in fig. 1, x (p) ═ y (q) (1) is calculated
X (p) represents the line number of the bus line passing through the start station set, and y (q) represents the line number of the bus line passing through the end station set;
if the result is a non-empty set, a direct riding scheme is represented, a starting station number I, a riding line number p and an end station number J corresponding to the intersection element in the formula 1 are obtained, and if the result is an empty set, the calculation is ignored;
the calculation method of the primary transfer line comprises the following steps:
all stations included in each line number p in a set X (I, p) representing bus lines passing through a start station set, I representing the number of a start station, p representing a bus line number, which represents a first-time bus line number, in a set Y (J, q), U representing a transfer station number in the start station set, a set Y (J, q) representing bus lines passing through an end station set, J representing an end station number, q representing a bus line number before an end point, V representing a transfer station number in the end station set, are represented as a station set a1(I, p, U) representing bus lines passing through the start station set, and all stations included in a bus line number q before the end point in a set Y (J, q),
as shown in fig. 2, a1(U) ═ b (v) (2) is calculated
If the result is a non-empty set, representing a one-transfer riding scheme, obtaining a starting station number I, a riding line number p, which represents a first riding line number, a transfer station number U, a riding line number q before the terminal and a terminal station number J corresponding to the intersection element in formula 2, and if the result is an empty set, ignoring the calculation;
the first transfer route with walking before transfer is calculated as:
for each transfer station U in the initial station set in the station set A1(I, p, U), searching other bus stations within a radius range of 350 meters around, and recording the other bus stations as a station set A2(I, p, U, M), wherein M represents the number of transfer stations;
as shown in fig. 2, a2(M) ═ b (v) (3) is calculated
If the result is a non-empty set, the scheme indicates that a primary transfer route scheme of walking before transfer exists, V indicates the number of transfer stations in the destination station set, and the number I of the starting station corresponding to the intersection element in the formula 3, the number p of the bus line, which indicates the number of the first bus line, the number U of the transfer station, which indicates the number of the bus station for transferring, the number M of the bus station for transferring, the number q of the bus line before the destination and the number J of the destination station are obtained;
the two transfer lines are calculated as:
the bus lines passing through each transfer station U in the initial station set in the station set A1(I, p, U) are recorded as a line set A3(I, p, U, k), k represents the serial number of the lines for the second time, all stations passing through each line in the line set A3(I, p, U, k) are recorded as a station set A4(I, p, U, k, S), and S represents the serial number of the stations for the second time;
as in fig. 3, a4(S) ═ b (v) (4) is calculated
If the result is a non-empty set, the riding scheme with twice transfer is shown, and the starting station number I, the riding line number p, the first riding line number and the transfer station number U which correspond to the intersection elements in the formula 4 are obtained, wherein the first transfer getting-off station number, the second riding line number k, the second transfer getting-off station number S, the riding line number q before the terminal and the terminal station number J are shown, and if the result is an empty set, the calculation is omitted;
the two transfer routes with a walk before the first transfer are calculated as:
the bus lines passing through each station transfer getting-on station number M in the station set A2(I, p, U, M) are recorded as a line set A5(I, p, U, M, k), all stations passing through each line in the line set A5(I, p, U, M, k) are recorded as a station set A6(I, p, U, M, k, S), and S is the station number of the second transfer getting-off station;
as in fig. 3, a6(S) ═ b (v) (5) is calculated
If the result is a non-empty set, the scheme indicates that two transfer lines with walking before the first transfer are available, and a starting station number I, a riding line number p, a first riding line number, a transfer station number U, a first transfer lower station number, a transfer upper station number M, a first transfer upper station number, a second riding line number k, a second transfer lower station number S, a riding line number q before the terminal and a terminal station number J corresponding to the intersection element in the formula 5 are obtained, and if the result is an empty set, the calculation is omitted;
the two transfer routes with a walk before the second transfer are calculated as:
for each second-time transfer getting-on/off station number S in the station set A4(I, p, U, k, S), searching other bus stations within a radius range of 350 meters around, and marking as a station set A7(I, p, U, k, S, G), wherein G represents an getting-on station number of a riding route before a terminal;
as in fig. 3, a7(G) ═ b (v) (6) is calculated
If the result is a non-empty set, the scheme indicates that two transfer lines with walking before the second transfer are available, and a starting station number I, a riding line number p, a first riding line number, a transfer station number U, a first transfer getting-off station number, a second riding line number k, a second transfer getting-off station number S, a getting-on station number G of a riding line before the terminal, a riding line number q before the terminal and a terminal station number J corresponding to the intersection element in the formula 6 are obtained, and if the result is an empty set, the calculation is ignored;
the two transfer routes with walking before the two transfers are calculated as:
for each second transfer getting-on/off station number S in the station set A6(I, p, U, M, k, S), searching other bus stations within a radius range of 350 meters around, and marking as a station set A8(I, p, U, M, k, S, G) wherein G represents an getting-on station number of a riding route before a terminal;
as in fig. 3, A8(G) ═ b (v) (7) is calculated
If the result is a non-empty set, the scheme indicates that two transfer lines with walking before two transfers are available, and a starting station number I, a taking line number p, a first taking line number, a first transfer station number U, a first transfer getting-off station number, a transfer getting-on station number M, a first transfer getting-on station number, a second taking line number k, a second transfer getting-off station number S, a getting-on station number G of a taking line before the terminal, a taking line number q before the terminal and a terminal station number J corresponding to the intersection element in the formula 7 are obtained, and if the result is an empty set, the calculation is omitted;
step 2: and (3) respectively calculating the required time of the available bus taking scheme in the step (1) by the server according to the starting station and the ending station which are transmitted by the client, and recommending the bus taking scheme with the least consumed time to the client.
In the step 2 of the technical scheme, the server lists and recommends the available bus taking schemes in the step 2 to the client according to the sequence of time from less to more.
In the above technical scheme, when calculating the required time of the bus taking scheme available in step 1, the required time per kilometer of the vehicle for driving is determined to be 1.5 minutes, the required time per hundred meters for walking is determined to be 1.5 minutes, the required time per one station of the bus for driving is determined to be 2 minutes, the required time per hundred meters for walking is determined to be 1.5 minutes, and the required time for the transfer waiting time is determined to be 5 minutes.
Aiming at the lines and the stations mentioned in the scheme, a large amount of data are collected in advance, a corresponding data structure is constructed, information such as the stations, the relationship between the lines and the stations, line information and the like is stored, and the corresponding stations and lines are drawn in a map; the 7 transfer schemes are obtained by using a bidirectional search and valuation function pruning mode as a reference; the direct and special line scheme comprises the following steps: searching effective stations in the range at the same time at the starting point and the end point, and then, through a line corresponding to the stations, overlapping the line found at the starting point with the line found at the end point, namely a direct or special line scheme; a first transfer scheme: searching effective stations in a range at the same time at a starting point and an end point, then obtaining respective stations by lines through the lines corresponding to the stations, matching the stations of the two lines at the starting point, wherein the stations of the two lines in the searching scheme are a one-time transfer scheme; a secondary transfer scheme: similar to the first transfer scheme, after the starting point is matched with the first matching line, the station of the line needs to be matched with the station of the second line and the corresponding line, and then is matched with the station of the destination station, and the station which is in line with the search range is the second transfer scheme; a large number of repeated schemes exist in the transfer scheme obtained according to the above-mentioned scheme, and the time required by each scheme needs to be calculated;
aiming at a special car, direct, once-and-twice transfer scheme is adopted for duplication removal:
1. and (3) removing the weight of the special vehicle through scheme: and selecting the scheme with the minimum required time by taking the line in the first scheme (the direct riding scheme) as the unique identifier.
2. One-time transfer scheme deduplication: the scheme with the minimum required time is selected by two lines (p-q) in a second scheme and a third scheme (a riding scheme for one transfer and a one-transfer line scheme for walking before the transfer).
3. And (3) duplicate removal by a quadratic transfer scheme: and selecting the scheme with the minimum required time according to three lines (p-k-q) in four schemes (a riding scheme with twice transfer, a two-transfer-line scheme with walking before the first transfer, a two-transfer-line scheme with walking before the second transfer and a two-transfer-line scheme with walking before the two transfers) of 4 th, 5 th, 6 th and 7 th.
And then, the running state of the vehicle is obtained through a dispatching system, all the optimal riding schemes are finally obtained, and the least walking, the least time, the least transfer and the least travel cost and the nearest vehicle can be calculated according to the corresponding schemes, so that convenience is brought to the traveling of citizens.
Details not described in this specification are within the skill of the art that are well known to those skilled in the art.
Claims (4)
1. A public transportation transfer method based on a bidirectional search and estimation function pruning mode is characterized by comprising the following steps:
step 1: the server respectively carries out direct line and special vehicle line calculation, primary transfer line calculation with walking before transfer, twice transfer line calculation with walking before the first transfer, twice transfer line calculation with walking before the second transfer and twice transfer line calculation with walking before the two transfers according to the starting station and the ending station which are transmitted by the client by the following methods:
the method for calculating the direct route and the special vehicle route comprises the following steps:
calculating x (p) ═ y (q) (1)
X (p) represents the line number of the bus line passing through the start station set, and y (q) represents the line number of the bus line passing through the end station set;
if the result is a non-empty set, a direct riding scheme is represented, and a starting station number I, a riding line number p and an end station number J corresponding to the intersection element in the formula 1 are obtained;
the calculation method of the primary transfer line comprises the following steps:
all stations included in each line number p in a set X (I, p) representing bus lines passing through a start station set, I representing the number of a start station, p representing a bus line number, which represents a first-time bus line number, in a set Y (J, q), U representing a transfer station number in the start station set, a set Y (J, q) representing bus lines passing through an end station set, J representing an end station number, q representing a bus line number before an end point, V representing a transfer station number in the end station set, are represented as a station set a1(I, p, U) representing bus lines passing through the start station set, and all stations included in a bus line number q before the end point in a set Y (J, q),
calculation a1(U) ═ b (v) (2)
If the result is a non-empty set, representing a one-transfer riding scheme, and obtaining a starting station number I, a riding line number p, a riding line number before the end point and a riding line number before the end point, wherein the starting station number I, the riding line number p, the riding line number before the first riding line number, the riding line number before the end point and the end point number J correspond to the intersection elements in the formula 2;
the first transfer route with walking before transfer is calculated as:
for a transfer station U in each starting station set in the station set A1(I, p, U), searching other bus stations within a preset radius range around, wherein the other bus stations are marked as a station set A2(I, p, U, M), and M represents the number of transfer stations;
calculation a2(M) ═ b (v) (3)
If the result is a non-empty set, the scheme indicates that a primary transfer line scheme with walking before transfer exists, V indicates the number of the transfer station in the destination station set, and the number I of the starting station corresponding to the intersection element in the formula 3, the number p of the bus line, which indicates the number of the first bus line, the number U of the transfer station, which indicates the number of the transfer departure station, the number M of the transfer departure station, the number q of the bus line before the destination, and the number J of the destination station are obtained;
the two transfer lines are calculated as:
the bus lines passing through each transfer station U in the initial station set in the station set A1(I, p, U) are recorded as a line set A3(I, p, U, k), k represents the serial number of the lines for the second time, all stations passing through each line in the line set A3(I, p, U, k) are recorded as a station set A4(I, p, U, k, S), and S represents the serial number of the stations for the second time;
calculation a4(S) ═ b (v) (4)
If the result is a non-empty set, the riding scheme with twice transfer is shown, and a starting station number I, a riding line number p, a first riding line number and a transfer station number U which correspond to the intersection elements in the formula 4 are obtained, wherein the first riding line number is shown here, the first transfer getting-off station number is shown here, the second riding line number k is shown here, the second transfer getting-off station number is shown here, the riding line number q before the terminal is shown here, and the terminal station number J is shown here;
the two transfer routes with a walk before the first transfer are calculated as:
the bus lines passing through each station transfer getting-on station number M in the station set A2(I, p, U, M) are recorded as a line set A5(I, p, U, M, k), all stations passing through each line in the line set A5(I, p, U, M, k) are recorded as a station set A6(I, p, U, M, k, S), and S is the station number of the second transfer getting-off station;
calculation a6(S) ═ b (v) (5)
If the result is a non-empty set, the scheme indicates that two transfer lines with walking before the first transfer are available, and a starting station number I, a riding line number p, a first riding line number, a first transfer station number U, a first transfer getting-off station number, a transfer getting-on station number M, a first transfer getting-on station number, a second riding line number k, a second transfer getting-off station number S, a riding line number q before the terminal and a terminal station number J, which correspond to the intersection element in formula 5 are obtained;
the two transfer routes with a walk before the second transfer are calculated as:
for each second-time transfer getting-on/off station number S in the station set A4(I, p, U, k, S), searching other bus stations within a preset radius range around, and marking as a station set A7(I, p, U, k, S, G), wherein G represents an getting-on station number of a riding route before a terminal;
calculation a7(G) ═ b (v) (6)
If the result is a non-empty set, the scheme indicates that two transfer lines with walking before the second transfer are available, and a starting station number I, a riding line number p, a first riding line number, a transfer station number U, a first transfer getting-off station number, a second riding line number k, a second transfer getting-off station number S, a getting-on station number G of a riding line before the terminal, a riding line number q before the terminal and a terminal station number J, which correspond to the intersection element in formula 6 are obtained;
the two transfer routes with walking before the two transfers are calculated as:
for each second transfer getting-on/off station number S in the station set A6(I, p, U, M, k, S), searching other bus stations within a preset radius range around, and marking as a station set A8(I, p, U, M, k, S, G) which represents the getting-on station number of a bus line before the terminal;
calculation A8(G) ═ b (v) (7)
If the result is a non-empty set, the scheme indicates that two transfer lines with walking before two transfers are available, and a starting station number I, a taking line number p, a first taking line number, a transfer station number U, a first transfer getting-off station number, a transfer getting-on station number M, a first transfer getting-on station number, a second taking line number k, a second transfer getting-off station number S, a getting-on station number G of a taking line before the terminal, a taking line number q before the terminal and a terminal station number J corresponding to the intersection element in formula 7 are obtained;
step 2: and (3) respectively calculating the required time of the available bus taking scheme in the step (1) by the server according to the starting station and the ending station which are transmitted by the client, and recommending the bus taking scheme with the least consumed time to the client.
2. The bus transfer method based on the bidirectional search and estimation function pruning mode as claimed in claim 1, wherein: and the server in the step 2 lists the available bus taking schemes in the step 2 according to the sequence of time from less to more and recommends the available bus taking schemes to the client.
3. The bus transfer method based on the bidirectional search and estimation function pruning mode as claimed in claim 1, wherein: and (3) when the required time of the available bus taking scheme in the step (1) is calculated, the required time of the bus running per kilometer, the required time of walking per hundred meters, the required time of the bus running at one station, the required time of walking per hundred meters and the required time of the bus transfer waiting time are all preset values.
4. The bus transfer method based on the bidirectional search and estimation function pruning mode as claimed in claim 1, wherein: in the step 1, the search range for searching other bus stops around is within 350 m of the radius.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810182963.6A CN108537362B (en) | 2018-03-06 | 2018-03-06 | Bus transfer method based on bidirectional search and estimation function pruning mode |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810182963.6A CN108537362B (en) | 2018-03-06 | 2018-03-06 | Bus transfer method based on bidirectional search and estimation function pruning mode |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108537362A CN108537362A (en) | 2018-09-14 |
| CN108537362B true CN108537362B (en) | 2022-01-18 |
Family
ID=63485619
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810182963.6A Active CN108537362B (en) | 2018-03-06 | 2018-03-06 | Bus transfer method based on bidirectional search and estimation function pruning mode |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108537362B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109816979B (en) * | 2019-02-19 | 2021-07-27 | 辽宁师范大学 | Bus route recommendation method considering bus arrival frequency and riding comfort |
| CN110956315A (en) * | 2019-11-20 | 2020-04-03 | 深圳市活力天汇科技股份有限公司 | Method for determining air-rail transport transfer scheme |
| CN113888953B (en) * | 2020-07-01 | 2023-08-22 | 腾讯科技（深圳）有限公司 | Subway line drawing method and equipment and computer readable storage medium |
| CN114936711B (en) * | 2022-06-15 | 2023-05-02 | 广东工业大学 | Large-scale plate-type custom furniture order kneading optimization method |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103092843A (en) * | 2011-10-29 | 2013-05-08 | 上海遥薇(集团)有限公司 | WebGIS (geographic information system) based bus taking guide line information processing method |
| CN103294708A (en) * | 2012-02-28 | 2013-09-11 | 北京四维图新科技股份有限公司 | Route planning method and device based on public traffic system |
| US8972185B1 (en) * | 2012-10-01 | 2015-03-03 | Google Inc. | Constructing a transit transfer network from transit data |
| CN105468761A (en) * | 2015-12-02 | 2016-04-06 | 常州普适信息科技有限公司 | Weighting public transportation transfer method |
| CN105844362A (en) * | 2016-03-30 | 2016-08-10 | 西南交通大学 | Urban traffic comprehensive travel decision-making model |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6437796B2 (en) * | 1998-02-17 | 2002-08-20 | Sun Microsystems, Inc. | Multiple processor visibility search system and method |
| US6624823B2 (en) * | 1998-02-17 | 2003-09-23 | Sun Microsystems, Inc. | Graphics system configured to determine triangle orientation by octant identification and slope comparison |
-
2018
- 2018-03-06 CN CN201810182963.6A patent/CN108537362B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103092843A (en) * | 2011-10-29 | 2013-05-08 | 上海遥薇(集团)有限公司 | WebGIS (geographic information system) based bus taking guide line information processing method |
| CN103294708A (en) * | 2012-02-28 | 2013-09-11 | 北京四维图新科技股份有限公司 | Route planning method and device based on public traffic system |
| US8972185B1 (en) * | 2012-10-01 | 2015-03-03 | Google Inc. | Constructing a transit transfer network from transit data |
| CN105468761A (en) * | 2015-12-02 | 2016-04-06 | 常州普适信息科技有限公司 | Weighting public transportation transfer method |
| CN105844362A (en) * | 2016-03-30 | 2016-08-10 | 西南交通大学 | Urban traffic comprehensive travel decision-making model |
Non-Patent Citations (5)
| Title |
|---|
| Rearch on urban public traffic network with multi-weights based on single bus transfer junction;An Xinlei等;《Physica A：Statistical Mechanics and its Application》;20151015;第436卷;748-755页 * |
| 公交出行最优路径搜索的有向赋权图模型;姚春龙等;《计算机应用研究》;20130415;第30卷(第04期);1058-1063页 * |
| 基于GIS的公交数据模型研究及换乘算法实现;付仲良等;《测绘通报》;20100725(第7期);15-39页 * |
| 基于二维有向集合扩散的公交网路径搜索算法研究;陆悠等;《计算机与现代化》;20091215(第12期);25-32页 * |
| 基于公交需求变化的柔性公交线网设计;孙庆军;《中国优秀硕士学位论文全文数据库 工程科技II辑》;20160215;C034-594 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108537362A (en) | 2018-09-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108537362B (en) | Bus transfer method based on bidirectional search and estimation function pruning mode | |
| US10976170B2 (en) | Electric vehicle routing system | |
| CN101661668B (en) | Electronic navigation method for public transport | |
| CN104931063B (en) | Path planning method | |
| CN102788584B (en) | The energy consumption prediction unit of road grade data generating device and generation method, vehicle console device and vehicle | |
| CN103337189B (en) | A kind of vehicle route guidance method dynamically divided based on section | |
| US10157242B2 (en) | Charger arrangement planning supporting apparatus, charger arrangement planning supporting method, and program | |
| US10281286B2 (en) | Movement information processing device, movement information processing method, and driving assistance system | |
| US9513135B2 (en) | Stochastic range | |
| CN105844362B (en) | Urban traffic comprehensive trip decision-making device | |
| CN104821624B (en) | A kind of search based on Quick charging station for electric vehicle and air navigation aid and system | |
| CN106042963B (en) | The cooperative optimization method and system of electrified transportation network and electric system | |
| CN102052926B (en) | Reduce the method for fuel consumption and cost | |
| CN107101643B (en) | Car pooling matching method | |
| CN108647221B (en) | Bus route planning method based on GIS | |
| CN110222786B (en) | Dynamic car pooling method and system based on travel information | |
| CN104766473A (en) | Traffic trip feature extraction method based on multi-mode public transport data matching | |
| CN104217249A (en) | Dynamic car sharing and matching method based on time and cost constraints | |
| JP2011170686A (en) | Method and device for deciding transfer point, and car navigation device | |
| US20130218366A1 (en) | System for providing information on power consumption amount of electric vehicle | |
| EP3556601A1 (en) | Vehicle routing | |
| CN109636067B (en) | Electric automobile charging scheduling optimization method based on particle swarm algorithm | |
| KR20050015306A (en) | Method and System for Providing Routing Information with Heterogeneous Public Transportation Vehicles | |
| CN103748432B (en) | Image processing apparatus, image procossing managing device, terminal, processing means and image processing method | |
| CN110753917A (en) | Data processing method for realizing multi-hop car pooling |
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 | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20220811 Address after: 518000 a2901-2902, building 10, Shenzhen Bay science and technology ecological park, No. 10, Gaoxin South ninth Road, high tech Zone community, Yuehai street, Nanshan District, Shenzhen City, Guangdong Province Patentee after: SHENZHEN EMPEROR TECHNOLOGY Co.,Ltd. Address before: No.3-6, 3 / F, building A3, phase 4.1, optical valley software park, 1 Guanshan Avenue, Donghu New Technology Development Zone, Wuhan City, Hubei Province, 430000 Patentee before: WUHAN LANTAIYUAN INFORMATION TECHNOLOGY Co.,Ltd. |