CN109341708A - Processing method, device, terminal and the computer readable storage medium of site information - Google Patents
Processing method, device, terminal and the computer readable storage medium of site information Download PDFInfo
- Publication number
- CN109341708A CN109341708A CN201810875571.8A CN201810875571A CN109341708A CN 109341708 A CN109341708 A CN 109341708A CN 201810875571 A CN201810875571 A CN 201810875571A CN 109341708 A CN109341708 A CN 109341708A
- Authority
- CN
- China
- Prior art keywords
- website
- duration
- train
- passenger
- site
- 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.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3407—Route searching; Route guidance specially adapted for specific applications
- G01C21/343—Calculating itineraries, i.e. routes leading from a starting point to a series of categorical destinations using a global route restraint, round trips, touristic trips
Landscapes
- Engineering & Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Automation & Control Theory (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Train Traffic Observation, Control, And Security (AREA)
Abstract
The present invention provides processing method, device, terminal and the computer readable storage medium of a kind of site information, this method comprises: according to train travel figure, judge whether the span line between current time start site and purpose website has stopped transport, obtains the first judging result;According to the last transfer stop between first judging result, passenger type, the start site and purpose website, the first duration needed for passenger reaches the last transfer stop from the start site is determined;According to first duration and the route map of train, judge whether the current time is commercially available the ticket up to the purpose website, and exports prompt information to passenger;Wherein, the prompt information is used to prompt the purchase state of the ticket.This method can directly export the information that prompt reaches the booking state of purpose website in terminal, can not buy the ticket of unreachable purpose website to limit passenger, and indicate the riding guidance of most short riding time.
Description
Technical field
The present invention relates to field of computer technology, more particularly to a kind of processing method of site information, device, terminal and
Computer readable storage medium.
Background technique
As urban road network route is more and more, traffic problems have become the main of major urban sustainable development
Bottleneck, first developing public transport is the important measure for alleviating urban transport problems.By taking subway as an example, in subway gauze, often
Route can formulate the runing time of this line according to the Trip distribution situation of this line, so that the service time of every route of gauze is simultaneously
Not necessarily identical, the operation initial time and end time some between each route are mutually far short of what is expected, and passenger, which needs to change to, to be got to
Destination.Since subway gauze is complicated, the passenger infrequently to take the subway is not known how to change to and most saves the time, often
The time of last bus is missed, or has purchased the ticket of last bus and is not available.
In traditional technology, the sending time of every route last bus, reminding passengers purchase are notified by the way of voice broadcast
Pay attention to the final vehicle hour when paying one's fare, passenger avoided to miss the time of last bus, or have purchased last bus ticket and can not
The case where use.
But guide rate is lower by the way of the voice broadcast reminding passengers final vehicle hour in traditional technology.
Summary of the invention
Based on this, it is necessary in traditional technology by the way of the voice broadcast reminding passengers final vehicle hour guide rate
Lower problem provides processing method, device, terminal and the readable storage medium storing program for executing of a kind of site information.
In a first aspect, the embodiment of the present invention provides a kind of processing method of site information, comprising:
According to route map of train, judge whether the span line between current time start site and purpose website has stopped
Fortune, obtains the first judging result;
According to the last transfer stop between first judging result, passenger type, the start site and purpose website,
Determine the first duration needed for passenger reaches the last transfer stop from the start site;
According to first duration and the route map of train, judge whether the current time is commercially available up to the mesh
Website ticket, and to passenger export prompt information;Wherein, the prompt information is used to prompt the purchase shape of the ticket
State.
It is described according to first judging result, passenger type, the start site and mesh in one of the embodiments,
Website between last transfer stop, when determining that passenger reaches first needed for the last transfer stop from the start site
It is long, comprising:
If first judging result is that the span line is not stopped transport, according to the passenger type and preset first
Mapping relations determine that the start site reaches the corresponding traveling duration of passenger type described in the last transfer stop;Wherein, institute
First traveling duration the sum of of the traveling duration equal to passenger between each transfer website platform is stated, first mapping relations are used
Corresponding relationship between characterization different passenger type and traveling duration;
It is determined first needed for the train reaches the last transfer stop from the start site according to the speed of train
Driving duration;
By the traveling duration and the first driving duration summation, first duration is obtained.
It is described according to first duration and the route map of train in one of the embodiments, judge described current
Whether the moment is commercially available the ticket up to the purpose website, and exports prompt information to passenger and include:
The train departure moment of the last transfer stop is determined according to the route map of train;
If being more than or equal to the train departure moment at the time of from current time after after first duration,
Determining current time not can purchase the ticket, and export the first prompt information to passenger, and first prompt information is for mentioning
Show that the ticket is that not can purchase state;
If being less than the train departure moment at the time of from current time after after first duration, it is determined that current
Moment can purchase the ticket, and export the second prompt information to passenger, and second prompt information is for prompting the ticket
For commercially available state and shortest time transfer plan.
The determining shortest time transfer plan includes: in one of the embodiments,
It obtains on the start site to all active paths and every active path between the purpose website
Transfer stop point quantity;Wherein, the active path is the path that number of transfer is less than default maximum transfer website;
It is determined second needed for the train reaches the purpose website from the last transfer stop according to the speed of train
Driving duration;
According to the duration that stops of approach website of the train on every active path, the first driving duration, described the
The two driving durations and traveling duration determine the corresponding total cost duration of every active path;
The smallest active path of the corresponding total cost duration of all active paths is determined as the shortest time transfer side
Case.
The speed according to train determines that the train is reached from the last transfer stop in one of the embodiments,
Before second driving duration needed for the purpose website, the method also includes:
Judge whether the transfer stop point quantity on every active path is greater than 0;
If so, needed for determining that the train reaches the purpose website from the last transfer stop according to the speed of train
Second driving duration.
It is described in one of the embodiments, to obtain the start site to all effective roads between the purpose website
Diameter, comprising:
The start site is obtained to communication path all between the purpose website;
Execute processing operation, the processing operation include: obtain it is adjacent with current site next on all communication paths
The first transfer stop point quantity between website and the start site and next website, and judge first transfer
Whether website quantity is more than the default maximum number of transfer, obtains third judging result;
According to the third judging result, active path is determined from all communication paths.
It is described according to the third judging result in one of the embodiments, it is determined from all communication paths effective
Path, comprising:
If the third judging result is that the first transfer stop point quantity is less than the default maximum number of transfer,
Judge whether next website is the purpose website;
If so, determining that the communication path between the start site and next website is active path;
If it is not, then using next website as new current site, and return and execute the processing operation, to determine
The new transfer stop point quantity between new current site and new next website is stated, and obtains new third judging result, directly
To the new current site, there is no until next website.
It is described according to the third judging result in one of the embodiments, it is determined from all communication paths effective
Path, further includes:
If the third judging result is that the first transfer stop point quantity is more than the default maximum number of transfer, sentence
Whether the upper website of next website of breaking is the start site, and judges remaining adjacent sites to a upper website
Whether the processing operation has been executed;
If it is not, then using a upper website as new current site, and return and execute the processing operation, to determine
The new transfer stop point quantity between new current site and new next website is stated, and obtains new third judging result, directly
To the new current site, there is no until next website.
Second aspect, the embodiment of the present invention provide a kind of site information processing unit, comprising:
First judgment module, for judging between current time start site and purpose website according to route map of train
Whether span line has stopped transport, and obtains the first judging result;
First determining module, for according to first judging result, passenger type, the start site and purpose website
Between last transfer stop, determine the first duration needed for passenger reaches the last transfer stop from the start site;
Output information module, for judging that the current time is according to first duration and the route map of train
It is no to be commercially available the ticket up to the purpose website, and prompt information is exported to passenger;Wherein, the prompt information is for prompting
The purchase state of the ticket.
The third aspect, the embodiment of the present invention provide a kind of terminal, including memory, processor, store on the memory
There is the computer program that can be run on a processor, the processor realizes step when executing the computer program:
According to route map of train, judge whether the span line between current time start site and purpose website has stopped
Fortune, obtains the first judging result;
According to the last transfer stop between first judging result, passenger type, the start site and purpose website,
Determine the first duration needed for passenger reaches the last transfer stop from the start site;
According to first duration and the route map of train, judge whether the current time is commercially available up to the mesh
Website ticket, and to passenger export prompt information;Wherein, the prompt information is used to prompt the purchase shape of the ticket
State.
Fourth aspect, a kind of computer readable storage medium provided in an embodiment of the present invention, including memory, processor,
The computer program that can be run on a processor is stored on the memory, which is characterized in that described in the processor executes
The step of method described in any of the above-described embodiment is realized when computer program.
Processing method, device, terminal and the computer readable storage medium of site information provided in this embodiment, terminal energy
Enough according to route map of train, judges whether the span line between current time start site and purpose website has stopped transport, obtain
First judging result, and according to the last transfer stop between the first judging result, passenger type, start site and purpose website,
Determine that passenger reaches the first duration needed for last transfer stop from start site, and according to the first duration and the train operation
Figure, judges whether current time is commercially available the ticket up to purpose website, and exports prompt information to passenger.Since terminal is being stood
The crossover track between current time start site and purpose website can be judged in point information process according to route map of train
Whether road has stopped transport, and the first duration needed for reaching last transfer stop from start site according to route map of train and passenger,
Judge whether current time is commercially available the ticket up to the purpose website, prompts the purchase of ticket to passenger according to judging result
State, enable the terminal to it is direct, accurately to passenger export prompt information.Therefore, using the site information of the present embodiment
Processing method, device, terminal and readable storage medium storing program for executing improve passenger's booking guide rate.
Detailed description of the invention
Fig. 1 is the flow diagram of the processing method for the site information that an embodiment provides;
Fig. 2 provides the method flow schematic diagram that prompt information is exported to passenger for another embodiment;
Fig. 3 provides the method flow schematic diagram of determining shortest time transfer plan for another embodiment;
Fig. 4 provides the method flow schematic diagram for obtaining active path for another embodiment;
Fig. 5 a is provided for another embodiment and is obtained active path method specific steps flow diagram;
Fig. 5 b is provided for another embodiment and is obtained active path method specific steps flow diagram;
Fig. 6 is the flow diagram of the processing method for the site information that another embodiment provides;
Fig. 7 is the specific steps flow diagram of the processing method for the site information that one embodiment provides;
Fig. 8 is the site information processing unit Structure and Process schematic diagram that another embodiment provides;
Fig. 9 is the site information processing unit Structure and Process schematic diagram that another embodiment provides;
Figure 10 is the site information processing unit Structure and Process schematic diagram that another embodiment provides;
Figure 11 is the site information processing unit Structure and Process schematic diagram that another embodiment provides;
Figure 12 is the internal structure chart for the terminal that another embodiment provides.
Specific embodiment
In order to make the object, technical scheme and advantages of the embodiment of the invention clearer, below in conjunction with the embodiment of the present invention
In attached drawing, technical scheme in the embodiment of the invention is clearly and completely described, it is clear that described embodiment is
A part of the embodiment of the present invention, instead of all the embodiments.Based on the embodiments of the present invention, those of ordinary skill in the art
Every other embodiment obtained without making creative work, shall fall within the protection scope of the present invention.
The processing method of site information provided in an embodiment of the present invention, executing subject can be site information processing dress
It sets, which can be implemented as some or all of of terminal by way of software, hardware or software and hardware combining.It is optional
, which can be automatic machine.The executing subject of following methods embodiment is illustrated by taking automatic machine as an example.
In order to guarantee passenger can normal booking, the ticket of unreachable destination can not be bought by limiting passenger, and the present invention is real
The method for applying example can be applied in the closed booking scene such as subway, high-speed rail, train, enable to passenger according to current time
Rationalize booking, and shortest time transfer plan can be obtained, saves passenger's travel time.
In order to make the objectives, technical solutions, and advantages of the present invention clearer, pass through following embodiments and combine attached
Figure, the further description of technical solution in the embodiment of the present invention.It should be appreciated that specific embodiment described herein
Only to explain the present invention, it is not used to limit invention.
Fig. 1 is the flow diagram of the processing method for the site information that an embodiment provides.What is involved is ends for the present embodiment
End, which passes through, judges whether the span line between current time start site and purpose website has stopped transport, and judges current time
It whether is commercially available the ticket up to the purpose website, the detailed process of the purchase state of ticket is prompted to passenger.Such as Fig. 1 institute
Show, this method comprises:
S201, according to route map of train, judge between current time start site and purpose website across path whether
It has been stopped transport that, obtain the first judging result.
Specifically, the information stored in above-mentioned route map of train can between start site and purpose website each across
More path and each can also own across corresponding multiple train operation periods on path between website two-by-two
The running speed of train, wherein service time section refers to a frequency across train in path from start site
The section at the moment of stopping of purpose website is reached with train.
When terminal executes above-mentioned S201, it is corresponding across path that terminal judges whether current time is in above-mentioned each
In the train operation period, if current time in when crossing in the corresponding train operation period of path for one, illustrates this
Item is not stopped transport across path, conversely, then illustrating that this has stopped transport across path, and above-mentioned each is crossed over to the stoppage in transit in path
Or it does not stop transport as the first judging result.Optionally, the information stored in the train schedule can also include train by every
The moment at the time of departure of a website and train stopping the moment by each website, on time by bus and booking for reminding passengers
Time.Optionally, above-mentioned to be characterized as reaching all communication paths between purpose website from start site across path, and
And in the present embodiment, the quantity across path is not construed as limiting.
Illustratively, if start site is A, purpose website is F, and only 3 paths can reach point of destination from start site
Point, respectively A → B → C → F, A → B → D → F, A → D → E → F, wherein B, C, D, E are that start site reaches purpose website
Between approach website, then above-mentioned 3 paths are the communication path that start site A reaches purpose website F, that is, start site
A arrival purpose website F's crosses over path.
It should be noted that crossing over path between start site and purpose website when the first judging result determines for terminal
Current time has stopped transport, then terminal can directly export prompt information, which can stop transport for last bus, can not
Booking.Optionally, the mode of above-mentioned output can be voice broadcast, can also show for terminal interface.
S202, according between first judging result, passenger type, the start site and purpose website finally changing
Multiply station, determines the first duration needed for passenger reaches the last transfer stop from the start site.
Optionally, the passenger type in the step can characterize the affiliated crowd's type of passenger, wherein crowd's type can wrap
It includes: between twenty and fifty, old, physical disabilities etc., and passenger determines passenger type according to oneself affiliated crowd's type.Illustratively,
Passenger oneself can be selected according to the passenger type selection interface that terminal is shown belonging to passenger type or passenger can be manual
Input the passenger type belonging to oneself, the present embodiment obtains the mode and without limitation of passenger type to terminal.Optionally, this reality
It applies in example, different passenger types can correspond to the traveling duration of different enter the station duration and intermediate conversion platform.
In addition, illustrative, if start site is A, purpose website is K, and the leap of purpose website is reached from start site
Path has 3, respectively A → B → C → K, A → D → E → F → K, A → G → H → I → J → K, then crosses in path most for 3
Transfer stop is respectively website C, website F, website J afterwards.
Based on foregoing description, after terminal obtains the first judging result, optionally, terminal can be known based on passenger type
Traveling duration during enter the station duration and the intermediate transfer platform of the passenger.In addition, last based on determined by above-mentioned terminal
Transfer stop and route map of train, train can also be calculated in terminal, and from start site traveling, transfer stop is when driving to the end
It is long.Based on above-mentioned acquired duration, terminal is assured that out that passenger reaches needed for last transfer stop from start site
One duration.
S203, according to first duration and the route map of train, judge whether the current time is commercially available and reach
The ticket of the purpose website, and prompt information is exported to passenger;Wherein, the prompt information is used to prompt the purchase of the ticket
Buy state.
Specifically, above-mentioned route map of train can be got on path for start site and purpose website span, all website column
Vehicle stops the moment, can also be the running speed of all trains between website two-by-two.When terminal executes above-mentioned S202, work as terminal
After obtaining the first duration, optionally, terminal can be based between start site and purpose website, each is crossed in route map of train
Stop moment and the last transfer stop point train dwelling duration of history of last transfer stop train on route calculate last transfer
The frequency of website train, if being the A moment at the time of current time postpones after above-mentioned first duration, terminal judges that the A moment is
The no frequency more than the calculated last transfer stop train of above-mentioned terminal finally changes if the A moment is more than that terminal is calculated
When multiplying the frequency of station train, then illustrate that current time cannot buy the ticket for reaching point of destination point, conversely, then explanation is worked as
The preceding moment is commercially available the ticket up to purpose website, and above-mentioned current time is commercially available the ticket up to purpose website,
Or current time cannot buy reach point of destination point ticket, as this information of the purchase state of ticket, terminal export to
Passenger's prompt.Optionally, the mode of output can be voice broadcast, can also show for terminal interface.
The processing method of site information provided in this embodiment, terminal can judge current time according to route map of train
Whether the span line between start site and purpose website has stopped transport, and obtains the first judging result, and tie according to the first judgement
Last transfer stop between fruit, passenger type, start site and purpose website determines that passenger reaches last transfer from start site
The first duration needed for standing, and according to the first duration and the route map of train, judge whether current time is commercially available up to mesh
Website ticket, thus to passenger export prompt information.Since terminal automatically, can be determined accurately using the above method
Whether the ticket of purpose website can purchase, and in the case where that can buy the ticket of purpose website, automatic output prompt letter
Breath enables to passenger intuitive and accurate according to the above-mentioned prompt of acquisition to avoid user is mistakenly purchased from buying the ticket that can not be ridden
Information, and simultaneously good buying ticket can be checked in time, passenger's booking guide rate is improved, is protected so that passenger goes on a journey
Barrier.
Fig. 2 is the processing method flow diagram of site information that another embodiment provides, the present embodiment what is involved is
Determine that passenger reaches a kind of optional process of the first duration needed for last transfer stop from start site.In above-described embodiment
On the basis of, optionally, as shown in Fig. 2, above-mentioned S202 may include:
If S301, first judging result are that the span line is not stopped transport, according to the passenger type and preset
The first mapping relations, determine that the start site reaches the corresponding traveling duration of passenger type described in the last transfer stop.
Wherein, the traveling duration is equal to first traveling duration the sum of of the passenger between each transfer website platform, institute
The first mapping relations are stated for characterizing the corresponding relationship between different passenger type and traveling duration.
Specifically, lifting one here simply to better understand the traveling duration in this step, the first traveling duration
Example: it is illustrative, if start site is A, purpose website D is reached by changing to twice, start site reaches purpose website
It is A → B → C → D across path, wherein website B and C are respectively that transfer stop, route where A → B train are Line 1, B twice
Route where → C train is No. 2 lines, and route where C → D train is No. 3 lines, and passenger is from start site to each purpose website
When the first traveling duration between a transfer platform can be train destinating station point B, passenger gets off from Line 1 platform and walks to No. 2
When duration T1 and train destinating station point C that line loading refuges are spent, passenger gets off from No. 2 line platforms and walks on No. 3 lines
The sum of the duration T2 that station console is spent T1+T2.Therefore, above-mentioned described " when start site reaches the traveling of last transfer stop
It is long " it is equal to T1+T2.
In the present embodiment, when terminal determines that the path current time that crosses between start site and purpose website does not stop
After fortune, the corresponding relationship between different passenger type and traveling duration can be characterized due to first mapping relations, eventually
End can directly determine out passenger and reach the corresponding traveling duration of last transfer stop passenger type from start site.Optionally, should
First mapping relations can also characterize the corresponding relationship between different passenger type and T1, T2, and therefore, terminal can also basis
First mapping relations determine T1, T2 corresponding with the passenger type respectively, then carry out summation process, obtain passenger's class
The traveling duration that type is corresponding when reaching last transfer stop from start site.
S302, needed for determining that the train reaches the last transfer stop from the start site according to the speed of train
First driving duration.
Specifically, the available running distance reached between last transfer stop from start site between website two-by-two of terminal,
And terminal can also determine the driving speed of train between website two-by-two, and terminal is again by the running distance and correspondence between website two-by-two
Driving speed carry out that quotient is asked to handle, the driving duration between every two website is obtained, then by the row between every two website
Vehicle duration carries out summation process, obtains train from start site and reaches the first driving duration that last transfer stop needs.Optionally,
Above-mentioned first driving duration can be characterized as train and reach the driving duration that last transfer stop is spent from start site.Optionally,
The corresponding driving speed of different route trains may be the same or different, and not do any restriction to this present embodiment.Example
Property, continue according to above-mentioned example, if start site is A, purpose website is D, the leap between start site and purpose website
Path is A → B → C → D, wherein website C is last transfer stop, then, the first driving duration is equal to train slave site A and reaches
The driving duration and train slave site B of website B reaches the sum of driving duration of website C.
S303, the traveling duration and the first driving duration are summed, obtains first duration.
Specifically, passenger's traveling duration of acquisition and train can be reached last transfer stop needs from start site by terminal
First driving duration summation, determine that passenger reaches the first duration needed for last transfer stop, optionally, terminal from start site
Passenger's traveling duration of acquisition, the first driving duration and reserved duration can also be summed, determine that passenger reaches from start site
First duration needed for last transfer stop.Optionally, different passenger types, identical to cross over path, the first required duration can
It, can not also be identical with identical.Optionally, above-mentioned reserved duration can characterize reserved duration when passenger goes in the wrong direction.
The processing method of site information provided in this embodiment, when terminal determine between start site and purpose website across
More path current time does not stop transport, and according to passenger type and preset first mapping relations, it is last to determine that start site reaches
Then passenger type corresponding traveling duration in transfer stop determines that train reaches last transfer from start site according to the speed of train
The first driving duration needed for standing, and by traveling duration and the first driving duration summation, obtain the first duration.Due to the above method
Middle terminal has been prefixed different passenger types and corresponding walking duration, so that terminal is in calculating process, according to terminal
The passenger type instruction received, can call directly above-mentioned preset information, reduce calculation amount, so that operation efficiency is higher.
Based on the above process, when terminal is assured that out that passenger reaches first needed for last transfer stop from start site
It is long, thus in conjunction with route map of train, terminal it may determine that current time whether be commercially available the ticket up to purpose website, and to
Passenger exports prompt information, and with continued reference to above-mentioned Fig. 2, detailed process may refer to following step:
S304, the train departure moment that the last transfer stop is determined according to the route map of train.
Specifically, terminal can be according between the start site stored in route map of train and purpose website, across on path
All website trains frequency, know the train departure moment across transfer stop last on path.Optionally, the train
Frequency can be determined according to season, festivals or holidays and Trip distribution situation.
If S305, from current time after after first duration at the time of be more than or equal to the train departure when
It carves, it is determined that current time not can purchase the ticket, and export the first prompt information to passenger, and first prompt information is used
In prompting the ticket to be that not can purchase state.
Specifically, if being more than or equal to train departure at the time of terminal is obtained from current time after after the first duration
When the moment, then terminal can determine that current time cannot buy the ticket that can reach purpose website, and terminal is simultaneously defeated to passenger
First prompt information out, in the present embodiment, it is that not can purchase this information of state that terminal, which can export ticket,.Optionally, it exports
Mode can be voice broadcast, can also show for terminal interface.Optionally, above-mentioned ticket is that not commercially available state can be with table
At the time of sign is from current time after after the first duration, last bus terminates operation and is unable to booking.
Illustratively, if current time be 20 points 15 minutes, start site A, purpose website be D, finally change to website be
Between C, i.e. start site and purpose website is A →...→ C → D across path, and the frequency of the last transfer stop of last bus is
21 points 00 minute, passenger's slave site A is 1 hour a length of when reaching needed for last transfer website C, then terminal can prompt to go through from current time
21: 15 at the time of after the first duration, last bus terminate operation and are unable to booking.
If S306, from current time after after first duration at the time of be less than the train departure moment, really
Determining current time can purchase the ticket, and export the second prompt information to passenger, and second prompt information is for prompting institute
Stating ticket is commercially available state and shortest time transfer plan.
Specifically, if at the time of terminal is obtained from current time after after the first duration be less than the train departure moment when,
Then terminal can determine that current time can buy the ticket that can reach purpose website, and terminal is simultaneously prompted to passenger's output second
Information, in the present embodiment, it is commercially available this information of state that terminal, which can export ticket,.Optionally, the mode of output can be
Voice broadcast can also show for terminal interface.Optionally, above-mentioned ticket be commercially available state can be characterized as current time can
To buy the ticket that start site reaches purpose website.
Illustratively, if current time be 13 points 30 minutes, start site A, purpose website be D, finally change to website be
Between C, i.e. start site and purpose website is A →...→ C → D across path, reaches last transfer stop from counting into website A
Passenger spend in total when it is 1 hour a length of, time of departure of train slave site C is 15 points, then, from start site booking when
Between at least also before 14 points, and the current booking time is not above at 14 points, so current time is commercially available up to mesh
The ticket terminal of website can export that ticket is commercially available state and the shortest time rides path transfer plan to passenger.
The processing method of site information provided in this embodiment, terminal determine the column of last transfer stop according to route map of train
Vehicle frequency, if from current time after after the first duration at the time of be more than or equal to the train departure moment, really
Determining current time not can purchase ticket, and export the information that prompt ticket is not commercially available state to passenger, if from it is current when
It is less than the train departure moment at the time of quarter after after the first duration, it is determined that current time is commercially available to pay one's fare, and defeated to passenger
Prompt ticket is the information of commercially available state and shortest time transfer plan out.Since terminal can be to multiplying using the above method
Whether objective automatic, accurate output current time can buy the state of ticket, to avoid the vehicle for buying unreachable purpose website
Ticket, and when terminal be determined as current time it is commercially available pay one's fare when, additionally it is possible to so that passenger intuitively obtain the shortest time transfer
Scheme, to improve passenger's booking guide rate.
Terminal determines shortest time transfer plan in above-mentioned S306 in one of the embodiments, can be by described in Fig. 3
Method realize, specifically:
S401, the start site is obtained to all active paths and every active path between the purpose website
On transfer stop point quantity;Wherein, the active path is the path that number of transfer is less than default maximum number of transfer.
Specifically, when terminal obtains start site arrival point of destination point passenger's number of transfer less than default maximum number of transfer
All active paths and each active path in transfer stop point quantity between start site and purpose website.It is optional
, above-mentioned default maximum number of transfer can be 0, or be more than or equal to 1 and be less than or equal to start site and purpose website
Between change the numerical value of quantity.In the present embodiment, traversal each active path is carried out by graph traversal algorithm, obtains each
Transfer stop point quantity on active path.
S402, needed for determining that the train reaches the purpose website from the last transfer stop according to the speed of train
Second driving duration.
Specifically, terminal can according in each active path last transfer stop and the distance between purpose website,
And the driving speed of train determines that train reaches the second driving duration needed for purpose website from last transfer stop, wherein one
The corresponding last transfer stop of active path, therefore the corresponding one second driving duration of an active path).Optionally, often
Last transfer stop can be different routes from affiliated route between purpose website in one active path.It should be noted that different
The speed of route train can be different, can also be identical.
S403, the duration that stops of approach website according to train on every active path, the first driving duration, institute
The second driving duration and the traveling duration are stated, determines the corresponding total cost duration of every active path.
Specifically, terminal is according to approach website parking duration of the train on each active path, train from initiating station
Point reaches the first driving duration, train required for the last transfer stop on this active path and reaches purpose from last transfer stop
When second driving duration and passenger needed for website reach the corresponding traveling of last transfer stop passenger type from start site
It is long, it determines in each active path and reaches the corresponding total cost duration of purpose website from start site.
Illustratively, if start site is A, purpose website is D, and train approach active path is A → B → C → D, website B
It is the approach website that purpose website is reached from start site with website C, train slave site A drives to down time when website B
For 8 points 25 minutes, train slave site B reach website C the time of departure be 8 points 30 minutes, then, when the parking of train approach website B
A length of 5 minutes, passenger was counted from into website A, and the time it takes until reaching purpose website D can be determined as this
The corresponding total cost duration of active path passenger.
S404, it the smallest active path of the corresponding total cost duration of all active paths is determined as to the shortest time changes
Multiply scheme.
Specifically, when terminal reaches the corresponding total cost of purpose website from start site according to each active path passenger
Minimum duration is chosen in length, determines that the minimum duration corresponding shortest time rides path transfer plan by minimum duration.
The processing method of site information provided in this embodiment, terminal obtain start site to owning between purpose website
Transfer stop point quantity on active path and every active path, determines train from last transfer stop according to the speed of train
Reach the second driving duration needed for purpose website, and when the stopping of approach website according to train on every active path
Long, the first driving duration, the second driving duration and traveling duration, determine the corresponding total cost duration of every active path, it
The smallest active path of the corresponding total cost duration of all active paths is determined as shortest time transfer plan afterwards.Due to terminal
According to the practical driving speed of train, the first driving duration, the second driving duration and traveling duration, can accurately obtain every
The corresponding total cost duration of active path, determines the least cost duration, so as to most short according to the determination of the least cost duration
Time transfer plan substantially increases the convenience that passenger rides so that passenger buys the ticket of shortest time transfer plan.
Terminal obtains the start site between the purpose website in above-mentioned S401 in one of the embodiments,
All active paths can realize by the method described in Fig. 4, specifically:
S501, the start site is obtained to communication path all between the purpose website.
Specifically, terminal obtains start site to communication path all between purpose website.Optionally, communication path
Quantity can any positive integer, to this present embodiment and without limitation.
S502, processing operation is executed, the processing operation includes: adjacent with current site on all communication paths of acquisition
The first transfer stop point quantity between next website and the start site and next website, and judge described first
Whether transfer stop point quantity is more than the default maximum transfer stop point quantity, obtains third judging result.
Specifically, terminal obtain next website and start site adjacent with current site on all communication paths with
The first transfer stop point quantity between next website, and judge whether the first transfer stop point quantity is more than that preset maximum is changed
Multiply number, judging result is third judging result.Optionally, the first transfer stop point quantity between start site and next website
It can be 0, or the positive integer greater than 0 is not limited in any way this present embodiment.Optionally, current site can be with
For start site, can for the purpose of website, or all stations in active path between start site and purpose website
Point.
Illustratively, if start site is A, purpose website is K, and the active path between two websites has 4, respectively
A → B → C → K, A → B → D → K, A → E → D → K, A → F → G → K, current site is start site A in 4 active paths,
Then next website current site A adjacent in 4 active paths is respectively website B, website B, website E, website F, 4 effective roads
The first transfer stop point quantity in diameter between next website start site A adjacent with current site A is respectively 0,0,0,0;If 4
Current site is respectively website B, website B, website E, website F in active path, then current site is adjacent in 4 active paths
Next website be respectively website C, website D, website D, website G, start site A is adjacent with current site in 4 active paths
Next website between the first transfer stop point quantity be respectively 1,1,1,1.
S503, according to the third judging result, active path is determined from all communication paths.
Specifically, terminal according to judge the first transfer stop point quantity whether be more than preset maximum number of transfer as a result,
Active path is determined from all communication paths that start site reaches purpose website.Optionally, active path quantity can be with
It is 1, or the number more than or equal to 1 and less than or equal to communication path, to this present embodiment and without limitation.Optionally, on
Stating S503 can be realized by following two kinds of possible embodiments, respectively referring to shown in Fig. 5 a and Fig. 5 b:
The first possible embodiment: referring to shown in Fig. 5 a, above-mentioned S603 be may include steps of:
If S601, the third judging result are that the first transfer stop point quantity is less than the default maximum transfer time
Number, then judge whether next website is the purpose website.If so, S602 is executed, if it is not, executing S603.
Specifically, in above-mentioned S502 terminal third judging result be the first transfer stop point quantity be not above it is preset
When maximum number of transfer, then terminal continues to judge whether the adjacent next website of above-mentioned current site is purpose website.Optionally,
The adjacent next website of current site can for the purpose of website, can also be for from start site to purpose website each access
Any one website in diameter in addition to start site.
Illustratively, if start site is A, purpose website is D, have between two websites a communication path be A → B →
C → D, and meet the condition that the first transfer stop point quantity is not above maximum number of transfer, if website A is current site,
The adjacent next website of current site is B website, if website B is current site, the adjacent next website of current site is C
Website, if website C is current site, the adjacent next website of current site is D website, and website D is purpose website.
S602, determine that the communication path between the start site and next website is active path.
Specifically, if when the adjacent next website of the current site that judges of terminal is purpose website, it is possible to determine
Communication path between next website adjacent with current site of start site is active path.Illustratively, if start site
For A, purpose website is D, and having a communication path between two websites is A → B → C → D, and meets the first transfer stop point quantity
It is not above the condition of maximum number of transfer, if website C is current site, is stood for the purpose of the adjacent next website of current site
Point D, then this communication path of A → B → C → D is active path.
S603, using next website as new current site, and return and execute the processing operation, described in determination
The first new transfer stop point quantity between start site and the lower website of the new current site, and obtain new third and sentence
Break as a result, there is no until next website until the new current site.
Specifically, if when the adjacent next website of current site of terminal judgement is not purpose website, terminal will
The adjacent next website of above-mentioned current site continues to return to above-mentioned S502 being handled as new current site, determines starting
The first new transfer stop point quantity between website next website adjacent with new current site, terminal simultaneously judge new first
Whether transfer stop point quantity is more than default maximum number of transfer, obtains new third judging result, the continuous above-mentioned mistake of circular treatment
Journey, until adjacent next website is not present in new current site, circulating treatment procedure stops.On it should be noted that
Stating the first new transfer stop point quantity can characterize are as follows: if when what is obtained in time treatment process is the first transfer stop point quantity,
What is then obtained in circulating treatment procedure next time is exactly the first new transfer stop point quantity, i.e., carries out one cycle processing backward,
1 more than the first transfer stop point quantity that the first new transfer stop point quantity is obtained than last treatment process.
Second of possible embodiment: referring to shown in Fig. 5 b, above-mentioned S503 may include:
If S604, the third judging result are that the first transfer stop point quantity is more than the preset maximum transfer time
Number, then judge whether a upper website for next website is the start site, and judge to a upper website remaining
Whether adjacent sites have executed the processing operation.If so, operation is ended processing, if it is not, then executing S605.
Specifically, it is more than preset maximum transfer that the judging result of terminal, which is the first transfer stop point quantity, in above-mentioned S502
When number, then terminal judges whether a upper website for the adjacent next website of current site is start site, meanwhile, terminal continues
Judge whether remaining adjacent sites of a upper website have executed the operation of above-mentioned S502.Optionally, the current site is adjacent
A upper website for next website can stand to reach any one gone out except purpose website between purpose website from start site
Point.
Illustratively, if start site is A, purpose website is K, current site B, and crosses over road between two websites
Diameter has 2, respectively A → B → C → K, A → B → D → K, then the adjacent next website of current site is C, and current site is adjacent
A upper website of next website C be B, remaining adjacent sites of upper website B are website D.When website C executed it is above-mentioned
When the processing operation of S602, (1) illustrates remaining of a website B if website D has also executed the processing operation of above-mentioned S602
Adjacent sites D has executed the processing operation of above-mentioned S602;(2) it if website D has been not carried out the processing operation of above-mentioned S602, says
Remaining adjacent sites D of bright upper website B has been not carried out the processing operation of above-mentioned S602.
S605, using next website as new current site, and return and execute the processing operation, described in determination
The first new transfer stop point quantity between start site and the lower website of the new current site, and obtain new third and sentence
Break as a result, there is no until next website until the new current site.
Specifically, if when the adjacent next website of current site of terminal judgement is not purpose website, terminal will
The adjacent next website of above-mentioned current site continues to execute above-mentioned S502 and is handled as new current site, determines starting
The first new transfer stop point quantity between website next website adjacent with new current site, terminal simultaneously judge new first
Whether transfer stop point quantity is more than default maximum number of transfer, obtains new third judging result, terminal continues to execute above-mentioned
The operation of S502 determines new the first transfer stop points between next website adjacent with new current site of start site
Amount, terminal simultaneously judge whether the first new transfer stop point quantity is more than default maximum number of transfer, obtain new third judgement knot
Fruit has then had stepped through all websites, has executed above-mentioned S502 until adjacent next website is not present in new current site
Operation stop.Optionally, which can be graph traversal algorithm.
Illustratively, if start site is A, purpose website is K, has 3 across path between start site and purpose website
Item is respectively as follows: A → B → C → E → K, A → B → D → H → G → K, A → B → D → F → K, and default maximum number of transfer is
3, current site B, transfer website are respectively B, D, E, H and F, then 3 numbers of transfer across path are respectively 2,3,3, when
Next website of preceding website B is respectively C and D, after having traversed website C and D, if continuing using website C as new current site
Website E is traversed, is continued until traverse website K, then by website K as new current site, website K and is not present adjacent at this time
Next website, if continuing to traverse H → G → K and F → K respectively using website D as new current site, after traversal,
Website K is continued as new current site again, website K and adjacent next website is not present at this time, obtain each across
Adjacent next website is not present in new current site K more on path, at this moment illustrates to have traversed all websites.
The processing method of site information provided in this embodiment, terminal obtain start site to all between purpose website
Communication path, then obtain next website and start site and next website adjacent with current site on all communication paths
Between the first transfer stop point quantity, and judge the first transfer stop point quantity whether be more than preset threshold obtain third judgement knot
Fruit judges institute if the third judging result of terminal is that the first transfer stop point quantity is less than preset maximum number of transfer
State whether next website is purpose website, if terminal judges next website for purpose website, it is determined that start site with
Path of crossing between next website is active path, if terminal judges that next website is not purpose website,
Using next website as new current site, and return to S502, with determine start site and the lower website of new current site it
Between the first new transfer stop point quantity, and new third judging result is obtained, until the next stop is not present in new current site
Until point, if it is more than preset maximum number of transfer that the third judging result of terminal, which is the first transfer stop point quantity, terminal is sentenced
Whether the upper website of next website of breaking is start site, and judges whether remaining adjacent sites to a upper website have executed
Processing operation then using a upper website as new current site, and returns to S502, to determine start site if the judgment is No
The first new transfer stop point quantity between next website of new current site, and new third judging result is obtained, directly
To new current site, there is no until next website.Since terminal traverses each communication path by third judging result,
And judge that whether remaining adjacent sites to a upper website have executed processing operation, determine active path and record, so as to
Enough all active paths accurately obtained in all communication paths, improve and determine the shortest time from all communication paths
Change to the operation efficiency in path.
Fig. 6 is the processing method flow diagram for the site information that another embodiment provides.As shown in fig. 6, above-mentioned S402
When the middle speed according to train determines the second driving needed for the train reaches the purpose website from the last transfer stop
Before length, further includes:
S701, judge whether the transfer stop point quantity on every active path is greater than 0, if so, executing S702.
Specifically, terminal judges each according to from all transfer stop point quantity between start site arrival purpose website
Whether there is transfer on active path.Illustratively, if start site is A, purpose website is K, effective road between two websites
Diameter has 3, respectively A → B → C → K, A → B → D → K, A → E → D → K, and the transfer website difference in 3 active paths
Are as follows: website B, website B and website D, website D, then the transfer stop point quantity in 3 active paths is 1,2,1.
S702, needed for determining that the train reaches the purpose website from the last transfer stop according to the speed of train
Second driving duration.
Specifically, if when terminal judges to have transfer on active path according to the transfer stop point quantity on every active path,
The driving speed of link travel train, determines on every active path where then terminal reaches purpose website according to last transfer stop
Train reaches the second driving duration needed for purpose website from last transfer stop.It should be noted that terminal is according to last transfer
It stands and reaches the running distance of purpose website, and last transfer stop reaches the driving vehicle of purpose website place link travel train
Speed determines that train reaches the second driving duration needed for purpose website from last transfer stop.Optionally, when last transfer stop is arrived
It, can also be identical up to when route difference, the second driving duration can be different where purpose website.Optionally work as, last transfer stop
It reaches the different last transfer stops of purpose website traveling train and reaches purpose website.
The processing method of site information provided in this embodiment, terminal judge the transfer stop point quantity on every active path
Whether 0 is greater than, if more than 0, then second needed for determining train from last transfer stop arrival purpose website according to the speed of train
Driving duration.Needed for train can accurately be calculated from last transfer stop arrival purpose website according to the speed of train as terminal
The second driving duration, reach duration in total required for purpose website so as to accurately obtain passenger from start site.
It is person between twenty and fifty with passenger type for the ease of the understanding of those skilled in the art, start site is Zhengzhou University station,
Purpose website is Xinzheng airport station, and executing subject is to introduce the place of site information provided by the invention for automobile automatic ticket-booking machine
Reason method, specifically, as shown in fig. 7, this method comprises:
S801, according to stored in route map of train the different train service times section, judge current time Zhengzhou University stand
Whether span line has stopped transport between reaching Xinzheng airport station, if it is not, then executing S802.
S802, determine that the person between twenty and fifty are corresponding from the Zhengzhou University last transfer website of station arrival in the span line
Traveling duration.
S803, the is determined needed for train reaches the last transfer stop from Zhengzhou University station according to the speed of train
One driving duration.
S804, to obtained in the traveling duration and S803 obtained in S802 first driving duration summation, obtain passenger from
First duration needed for the Zhengzhou University station reaches the last transfer stop.
S805, the train departure moment that the last transfer stop is determined according to the route map of train.
If S806, from current time after after first duration at the time of be more than or equal to the train departure when
It carves, it is determined that the current time not commercially available ticket that can reach Xinzheng airport station, and the Xinzheng machine is exported to passenger
The ticket of station is the first prompt information of not commercially available state.
If S807, from current time after after first duration at the time of be less than the train departure moment, really
Determine the current time commercially available ticket that can reach Xinzheng airport station, and is determined most according to the process of following S808-S819
Short transfer plan, and to the ticket that passenger exports Xinzheng airport station be commercially available state and shortest time transfer plan
Second prompt information.
Optionally, determining that the mode of the shortest time transfer plan in the second prompt information may refer to following step:
S808, the Zhengzhou University station is obtained to communication path all between the station of the Xinzheng airport.
S809, obtain next website and Zhengzhou University station adjacent with current site on all communication paths with
The first transfer stop point quantity between next website, and judge whether the first transfer stop point quantity is more than described default
Maximum number of transfer obtains third judging result.
If S810, the third judging result are that the first transfer stop point quantity is less than the default maximum transfer time
Number, then judge whether next website is Xinzheng airport station, if so, S811 is executed, if it is not, then executing S812.
S811, determine that the communication path between the Zhengzhou University station and next website is active path;
S812, using next website as new current site, and return execute S809, with the determination Zhengzhou University
The the first new transfer stop point quantity stood between next website of the new current site, and obtain new third judgement knot
Fruit, until the new current site, there is no until next website.
If S813, the third judging result are that the first transfer stop point quantity is more than the default maximum transfer time
Number then judges whether a upper website for next website is Zhengzhou University station, and judge to a upper website its
Whether remaining adjacent sites have executed S809, if it is not, then executing S814.
S814, using a upper website as new current site, and return and execute the processing operation, described in determination
The first new transfer stop point quantity between Zhengzhou University station and next website of new current site, and obtain new third and sentence
Break as a result, there is no until next website until the new current site.
In conjunction with the step of above-mentioned S808-S814, available a plurality of active path, later, automatic machine can be from
Most short transfer plan is determined in a plurality of active path, can specifically include:
Transfer stop point quantity on S815, the every active path acquired.
S816, judge whether the transfer stop point quantity on every active path is greater than 0, if so, executing S817.
S817, determined the train needed for the last transfer stop arrival Xinzheng airport station according to the speed of train
Second driving duration.
S818, the duration that stops of approach website according to train on every active path, the first driving duration, institute
The second driving duration and the traveling duration are stated, determines the corresponding total cost duration of every active path.
S819, it the smallest active path of the corresponding total cost duration of all active paths is determined as to the shortest time changes
Multiply scheme.
The implementation procedure of the above S801 to S819 specifically may refer to the description of above-described embodiment, realization principle and technology
Effect is similar, and details are not described herein.
It should be understood that although each step in the flow chart of Fig. 1-7 is successively shown according to the instruction of arrow,
These steps are not that the inevitable sequence according to arrow instruction successively executes.Unless expressly stating otherwise herein, these steps
Execution there is no stringent sequences to limit, these steps can execute in other order.Moreover, at least one in Fig. 1-7
Part steps may include that perhaps these sub-steps of multiple stages or stage are not necessarily in synchronization to multiple sub-steps
Completion is executed, but can be executed at different times, the execution sequence in these sub-steps or stage is also not necessarily successively
It carries out, but can be at least part of the sub-step or stage of other steps or other steps in turn or alternately
It executes.
Specific about site information processing unit limits the processing method that may refer to above for site information
It limits, details are not described herein.Modules in the information processing unit of above-mentioned terminal can be fully or partially through software, hardware
And combinations thereof realize.Above-mentioned each module can be embedded in the form of hardware or independently of in the processor in terminal, can also be with
Software form is stored in the memory in terminal, executes the corresponding operation of the above modules in order to which processor calls.
Fig. 8 is the site information processing unit Structure and Process schematic diagram that an embodiment provides.As shown in figure 8, the device can
To include: first judgment module 11, the first determining module 12 and output information module 13.
Specifically, first judgment module 11, for judging current time start site and point of destination according to route map of train
Whether the span line between point has stopped transport, and obtains the first judging result;
First determining module 12, for according to first judging result, passenger type, the start site and point of destination
Last transfer stop between point determines the first duration needed for passenger reaches the last transfer stop from the start site;
Output information module 13, for judging the current time according to first duration and the route map of train
It whether is commercially available the ticket up to the purpose website, and exports prompt information to passenger;Wherein, the prompt information is for mentioning
Show the purchase state of the ticket.
Site information processing unit provided in this embodiment, can execute above method embodiment, realization principle and skill
Art effect is similar, and details are not described herein.
Fig. 9 is the structural schematic diagram for the site information processing unit that another embodiment provides, as shown in figure 9, above-mentioned
On the basis of embodiment shown in Fig. 8, first determining module 12 includes: the first determination unit 121, the second determination unit
122 and computing unit 123.
Specifically, the first determination unit 121, for judging current time start site and purpose according to route map of train
When leap path between website is not stopped transport, according to the passenger type and preset first mapping relations, the starting is determined
Website reaches the corresponding traveling duration of passenger type described in the last transfer stop;Wherein, the traveling duration is equal to passenger and exists
The sum of the first traveling duration between each transfer website platform, first mapping relations are for characterizing different passenger types
With the corresponding relationship between traveling duration;
Second determination unit 122 determines the train from described in the arrival of the start site for the speed according to train
First driving duration needed for last transfer stop;
Computing unit 123, for the traveling duration and the first driving duration to be summed, when obtaining described first
It is long.
The site information processing unit of terminal provided in this embodiment can execute above method embodiment, realize former
Reason is similar with technical effect, and details are not described herein.
With continued reference to above-mentioned Fig. 9, on the basis of above-mentioned embodiment shown in Fig. 8, the output information module 13 includes:
Third determination unit 131, the first prompt unit 132 and the second prompt unit 133.
Specifically, third determination unit 131, for determining the train of the last transfer stop according to the route map of train
Frequency;
First prompt unit 132, be greater than at the time of for judging from current time after after first duration or
When equal to the train departure moment, determining current time not can purchase the ticket, and export the first prompt information to passenger,
First prompt information is that not can purchase state for prompting the ticket;
Second prompt unit 133 is less than described at the time of for judging from current time after after first duration
It when the train departure moment, determines that current time can purchase the ticket, and determines shortest time transfer plan and defeated to passenger
Second prompt information out, second prompt information are to change commercially available state and the shortest time for prompting the ticket
Multiply scheme.
Figure 10 is the structural schematic diagram for the site information processing unit that another embodiment provides.Above-mentioned shown in Fig. 9
On the basis of embodiment, as shown in Figure 10, second prompt unit 133 is specifically included: first obtains subelement 1331, first
Determine that subelement 1332, second determines that subelement 1333 and third determine subelement 1334.
First obtains subelement 1331, for obtaining the start site to all effective roads between the purpose website
Transfer stop point quantity on diameter and every active path;Wherein, the active path is that number of transfer is changed less than default maximum
Multiply the path of number.
First determines subelement 1332, determines that the train is reached from the last transfer stop for the speed according to train
Second driving duration needed for the purpose website.
Second determine subelement 1333, for the approach website according to train on every active path the duration that stops,
The first driving duration, the second driving duration and the traveling duration, determine that every active path is corresponding
It is total to spend duration.
Third determines subelement 1334, for the smallest active path of the corresponding total cost duration of all active paths is true
It is set to the shortest time transfer plan.
It is specifically used for obtaining the start site described in continued reference to shown in Figure 10, above-mentioned first obtains subelement 1331
All communication paths between purpose website, and processing operation is executed, the processing operation includes: to obtain on all communication paths
The first transfer stop points between next website adjacent with current site and the start site and next website
Amount, and judge whether the first transfer stop point quantity is more than default maximum number of transfer, obtain third judging result, Yi Jiyong
According to the third judging result, active path is determined from all communication paths.
Optionally, above-mentioned first subelement 1331 is obtained specifically for being the first transfer website in third judging result
When quantity is less than the default maximum number of transfer, judge whether next website is the purpose website, and be used for
When judging that next website is the purpose website, the communication path between the start site and next website is determined
For active path;And when for judging that next website is not the purpose website, using next website as new
Current site, and the processing operation is continued to execute, with the determination start site and the lower website of the new current site
Between the first new transfer stop point quantity, and new third judging result is obtained, until the new current site is not present
Until next website.
Optionally, above-mentioned first subelement 1331 is obtained specifically for being first transfer in the third judging result
When website quantity is more than the default maximum number of transfer, judge whether a upper website for next website is the initiating station
Point, and judge whether remaining adjacent sites to a upper website have executed the processing operation;And in judging result
When being no, using a upper website as new current site, and returns and execute the processing operation, with the determination initiating station
The first new transfer stop point quantity between point and next website of new current site, and new third judging result is obtained,
Until the new current site, there is no until next website.
Optionally, the site information processing unit of terminal provided in this embodiment, can execute above method embodiment,
The realization principle and technical effect are similar, and details are not described herein.
The structural schematic diagram for the site information processing unit that another embodiment provides.The embodiment shown in above-mentioned Figure 11
On the basis of, second prompt unit 133, further includes: the first judgment sub-unit 1335 and the 4th determines subelement 1336.
Specifically, the first judgment sub-unit 1335, for judging whether the transfer stop point quantity on every active path is big
In 0.
4th determine subelement 1336, for be according to the result of the first judgment sub-unit 1335 it is yes, according to the vehicle of train
Speed determines that the train reaches the second driving duration needed for the purpose website from the last transfer stop.
The site information processing unit of terminal provided in this embodiment can execute above method embodiment, realize former
Reason is similar with technical effect, and details are not described herein.
In one embodiment, a kind of terminal is provided, internal structure chart is shown in Fig.12.The computer equipment
Including processor, memory, network interface, display screen and the input unit connected by system bus.Wherein, the place of the terminal
Device is managed for providing calculating and control ability.The memory of the terminal includes non-volatile memory medium, built-in storage.This is non-easily
The property lost storage medium is stored with operating system and computer program.The built-in storage is the operation system in non-volatile memory medium
The operation of system and computer program provides environment.The network interface of the terminal is used for logical by network connection with external terminal
Letter.A kind of processing method of site information is realized when the computer program is executed by processor.The display screen of the terminal can be with
It is liquid crystal display or electric ink display screen, the input unit of the terminal can be the touch layer covered on display screen,
It can be the key being arranged in terminal enclosure, trace ball or Trackpad, can also be external keyboard, Trackpad or mouse etc..
It will be understood by those skilled in the art that structure shown in Figure 12, only part relevant to application scheme
The block diagram of structure, does not constitute the restriction for the terminal being applied thereon to application scheme, and specific terminal may include ratio
More or fewer components as shown in the figure perhaps combine certain components or with different component layouts.
In one embodiment, a kind of terminal, including memory and processor are provided, is stored with computer in memory
Program, the processor perform the steps of when executing computer program
According to route map of train, judge whether stopped between current time start site and purpose website across path
Fortune, obtains the first judging result;
According to the last transfer stop between first judging result, passenger type, the start site and purpose website,
Determine the first duration needed for passenger reaches the last transfer stop from the start site;
According to first duration and the route map of train, judge whether the current time is commercially available up to the mesh
Website ticket, and to passenger export prompt information;Wherein, the prompt information is used to prompt the purchase shape of the ticket
State.
In one embodiment, a kind of computer readable storage medium is provided, computer program is stored thereon with, is calculated
Machine program performs the steps of when being executed by processor
According to route map of train, judge whether stopped between current time start site and purpose website across path
Fortune, obtains the first judging result;
According to the last transfer stop between first judging result, passenger type, the start site and purpose website,
Determine the first duration needed for passenger reaches the last transfer stop from the start site;
According to first duration and the route map of train, judge whether the current time is commercially available up to the mesh
Website ticket, and to passenger export prompt information;Wherein, the prompt information is used to prompt the purchase shape of the ticket
State.
Those of ordinary skill in the art will appreciate that realizing all or part of the process in above-described embodiment method, being can be with
Relevant hardware is instructed to complete by computer program, the computer program can be stored in a non-volatile computer
In read/write memory medium, the computer program is when being executed, it may include such as the process of the embodiment of above-mentioned each method.Wherein,
To any reference of memory, storage, database or other media used in each embodiment provided herein,
Including non-volatile and/or volatile memory.Nonvolatile memory may include read-only memory (ROM), programming ROM
(PROM), electrically programmable ROM (EPROM), electrically erasable ROM (EEPROM) or flash memory.Volatile memory may include
Random access memory (RAM) or external cache.By way of illustration and not limitation, RAM is available in many forms,
Such as static state RAM (SRAM), dynamic ram (DRAM), synchronous dram (SDRAM), double data rate sdram (DDRSDRAM), enhancing
Type SDRAM (ESDRAM), synchronization link (Synchlink) DRAM (SLDRAM), memory bus (Rambus) direct RAM
(RDRAM), direct memory bus dynamic ram (DRDRAM) and memory bus dynamic ram (RDRAM) etc..
Each technical characteristic of above embodiments can be combined arbitrarily, for simplicity of description, not to above-described embodiment
In each technical characteristic it is all possible combination be all described, as long as however, the combination of these technical characteristics be not present lance
Shield all should be considered as described in this specification.
The several embodiments of the application above described embodiment only expresses, the description thereof is more specific and detailed, but simultaneously
The limitation to the application the scope of the patents therefore cannot be interpreted as.It should be pointed out that for those of ordinary skill in the art
For, without departing from the concept of this application, various modifications and improvements can be made, these belong to the guarantor of the application
Protect range.Therefore, the scope of protection shall be subject to the appended claims for the application patent.
Claims (11)
1. a kind of processing method of site information characterized by comprising
According to route map of train, whether having stopped transport between current time start site and purpose website across path judged, is obtained
To the first judging result;
According to the last transfer stop between first judging result, passenger type, the start site and purpose website, determine
First duration needed for passenger reaches the last transfer stop from the start site;
According to first duration and the route map of train, judge whether the current time is commercially available up to the point of destination
The ticket of point, and prompt information is exported to passenger;Wherein, the prompt information is used to prompt the purchase state of the ticket.
2. the method according to claim 1, wherein described according to first judging result, passenger type, institute
The last transfer stop between start site and purpose website is stated, determines that passenger reaches the last transfer stop from the start site
The first required duration, comprising:
If first judging result is that the span line is not stopped transport, according to the passenger type and preset first mapping
Relationship determines that the start site reaches the corresponding traveling duration of passenger type described in the last transfer stop;Wherein, it is described walk
Row duration is equal to first traveling duration the sum of of the passenger between each transfer website platform, and first mapping relations are used for table
Levy the corresponding relationship between different passenger type and traveling duration;
The first driving needed for the train reaches the last transfer stop from the start site is determined according to the speed of train
Duration;
By the traveling duration and the first driving duration summation, first duration is obtained.
3. according to the method described in claim 2, it is characterized in that, described according to first duration and the train operation
Figure, judges whether the current time is commercially available the ticket up to the purpose website, and exports prompt information to passenger and include:
The train departure moment of the last transfer stop is determined according to the route map of train;
If being more than or equal to the train departure moment at the time of from current time after after first duration, it is determined that
Current time not can purchase the ticket, and export the first prompt information to passenger, and first prompt information is for prompting institute
Stating ticket is that not can purchase state;
If being less than the train departure moment at the time of from current time after after first duration, it is determined that current time
It can purchase the ticket, and export the second prompt information to passenger, second prompt information can for prompting the ticket to be
Purchase state and shortest time transfer plan.
4. according to the method described in claim 3, it is characterized in that, the method for determination of the shortest time transfer plan includes:
Obtain the transfer on the start site to all active paths and every active path between the purpose website
Website quantity;Wherein, the active path is the path that number of transfer is less than default maximum number of transfer;
The second driving needed for the train reaches the purpose website from the last transfer stop is determined according to the speed of train
Duration;
According to the duration that stops of approach website of the train on every active path, the first driving duration, second row
Vehicle duration and the traveling duration determine the corresponding total cost duration of every active path;
The smallest active path of the corresponding total cost duration of all active paths is determined as the shortest time transfer plan.
5. according to the method described in claim 4, it is characterized in that, the speed according to train determines the train from described
Before last transfer stop reaches the second driving duration needed for the purpose website, the method also includes:
Judge whether the transfer stop point quantity on every active path is greater than 0;
If so, being determined needed for the train reaches the purpose website from the last transfer stop according to the speed of train
Two driving durations.
6. according to the method described in claim 4, it is characterized in that, it is described obtain the start site to the purpose website it
Between all active paths, comprising:
The start site is obtained to communication path all between the purpose website;
Processing operation is executed, the processing operation includes: to obtain next website adjacent with current site on all communication paths,
And the first transfer stop point quantity between the start site and next website, and judge the first transfer stop points
Whether amount is more than the default maximum number of transfer, obtains third judging result;
According to the third judging result, active path is determined from all communication paths.
7. according to the method described in claim 6, it is characterized in that, described according to the third judging result, from all connections
Active path is determined in path, comprising:
If the third judging result is that the first transfer stop point quantity is less than the default maximum number of transfer, judge
Whether next website is the purpose website;
If so, determining that the communication path between the start site and next website is active path;
If it is not, then using next website as new current site, and return and execute the processing operation, to determine described rise
The first new transfer stop point quantity between initial station point and next website of the new current site, and obtain new third and sentence
Break as a result, there is no until next website until the new current site.
8. according to the method described in claim 6, it is characterized in that, described according to the third judging result, from all connections
Active path is determined in path, further includes:
If the third judging result is that the first transfer stop point quantity is more than the default maximum number of transfer, institute is judged
Whether the upper website for stating next website is the start site, and judge to remaining adjacent sites of a upper website whether
The processing operation is executed;
If it is not, then using a upper website as new current site, and return and execute the processing operation, to determine described rise
The first new transfer stop point quantity between initial station point and next website of new current site, and obtain new third judgement knot
Fruit, until the new current site, there is no until next website.
9. a kind of site information processing unit characterized by comprising
First judgment module, for judging the leap between current time start site and purpose website according to route map of train
Whether route has stopped transport, and obtains the first judging result;
First determining module, for according between first judging result, passenger type, the start site and purpose website
Last transfer stop, determine the first duration needed for passenger reaches the last transfer stop from the start site;
Output information module, for judging that the current time whether may be used according to first duration and the route map of train
Purchase reaches the ticket of the purpose website, and exports prompt information to passenger;Wherein, the prompt information is described for prompting
The purchase state of ticket.
10. a kind of terminal, including memory, processor, the computer that can be run on a processor is stored on the memory
Program, which is characterized in that the processor realizes side described in any one of claims 1 to 8 when executing the computer program
The step of method.
11. a kind of computer readable storage medium, is stored thereon with computer program, which is characterized in that the computer program
The step of any one of claims 1 to 8 the method is realized when being executed by processor.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201810875571.8A CN109341708A (en) | 2018-08-03 | 2018-08-03 | Processing method, device, terminal and the computer readable storage medium of site information |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201810875571.8A CN109341708A (en) | 2018-08-03 | 2018-08-03 | Processing method, device, terminal and the computer readable storage medium of site information |
Publications (1)
Publication Number | Publication Date |
---|---|
CN109341708A true CN109341708A (en) | 2019-02-15 |
Family
ID=65296723
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201810875571.8A Pending CN109341708A (en) | 2018-08-03 | 2018-08-03 | Processing method, device, terminal and the computer readable storage medium of site information |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN109341708A (en) |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101587650A (en) * | 2009-07-10 | 2009-11-25 | 叶松 | GPS bus transfering navigation method and system thereof |
CN101614551A (en) * | 2009-07-21 | 2009-12-30 | 中国科学院地理科学与资源研究所 | Sneakernet method for building up and device, method for searching path and device |
CN102169512A (en) * | 2010-02-26 | 2011-08-31 | 同济大学 | Urban mass transit network dynamic accessibility computing method based on time window constraints |
CN103544214A (en) * | 2013-09-18 | 2014-01-29 | 北京交通大学 | System and method for guiding urban railway traffic passenger flow based on last bus time |
JP2017061269A (en) * | 2015-09-25 | 2017-03-30 | 株式会社ゼンリンデータコム | Route search device, method for searching route by using public transportation, and computer program |
-
2018
- 2018-08-03 CN CN201810875571.8A patent/CN109341708A/en active Pending
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101587650A (en) * | 2009-07-10 | 2009-11-25 | 叶松 | GPS bus transfering navigation method and system thereof |
CN101614551A (en) * | 2009-07-21 | 2009-12-30 | 中国科学院地理科学与资源研究所 | Sneakernet method for building up and device, method for searching path and device |
CN102169512A (en) * | 2010-02-26 | 2011-08-31 | 同济大学 | Urban mass transit network dynamic accessibility computing method based on time window constraints |
CN103544214A (en) * | 2013-09-18 | 2014-01-29 | 北京交通大学 | System and method for guiding urban railway traffic passenger flow based on last bus time |
JP2017061269A (en) * | 2015-09-25 | 2017-03-30 | 株式会社ゼンリンデータコム | Route search device, method for searching route by using public transportation, and computer program |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
TWI716449B (en) | Navigation method and device | |
CN106969777A (en) | Path prediction meanss and path Forecasting Methodology | |
CN102853842B (en) | Navigation path planning method, apparatus, and system | |
US8630791B2 (en) | Dynamic route guidance | |
CN105210119A (en) | Determining an amount for a toll based on location data points provided by a computing device | |
CN107038488A (en) | A kind of real-time berth reserving method in parking lot based on berth prediction and selection of stopping | |
CN103620345A (en) | Providing routes through information collection and retrieval | |
CN109871017A (en) | Automatic Pilot reference line call method, device and terminal | |
CN105377664A (en) | Traffic demand control device | |
CN108268974A (en) | The method and device that a kind of path is recommended | |
CN106092119B (en) | A kind of reminding method and mobile terminal of traffic condition | |
CN107167151A (en) | Bus routes method to set up, route planning method and device | |
Yang et al. | Automatic generation of optimal road trajectory for the rescue vehicle in case of emergency on mountain freeway using reinforcement learning approach | |
EP2428426A1 (en) | Method and device for generating and editing a railway signal diagram | |
Levin | Linear program for system optimal parking reservation assignment | |
CN108663062B (en) | Path planning method and system | |
CN109341708A (en) | Processing method, device, terminal and the computer readable storage medium of site information | |
CN108510295A (en) | Method and device for generating stroke bill information | |
CN116709233A (en) | Method, device, equipment and storage medium for tracing passenger riding path | |
CN106840186A (en) | A kind of private car circuit distribution method based on multi-platform use ETC devices | |
JP2022540458A (en) | ONLINE PARKING RESERVATION METHOD, DEVICE AND COMPUTER-READABLE STORAGE MEDIUM | |
CN115188215B (en) | Electronic equipment and prediction method of bus running duration between stations | |
KR102073713B1 (en) | System and method for changing route, apparatus applied to the same and computer readable medium having computer program recorded therefor | |
CN107103705B (en) | A kind of shared vehicle travels monitoring method and mobile terminal | |
CN109978654A (en) | Ticketing processing method, ticketing terminal and management terminal |
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 | ||
RJ01 | Rejection of invention patent application after publication | ||
RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190215 |