CN103096272A - Public transportation transfer information search method based on global system for mobile communications (GSM) short messages - Google Patents

Public transportation transfer information search method based on global system for mobile communications (GSM) short messages Download PDF

Info

Publication number
CN103096272A
CN103096272A CN 201110335738 CN201110335738A CN103096272A CN 103096272 A CN103096272 A CN 103096272A CN 201110335738 CN201110335738 CN 201110335738 CN 201110335738 A CN201110335738 A CN 201110335738A CN 103096272 A CN103096272 A CN 103096272A
Authority
CN
China
Prior art keywords
bus
server
yes
riding
passenger
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
Application number
CN 201110335738
Other languages
Chinese (zh)
Inventor
黄诗盛
姚薇
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
SHANGHAI YAOWEI (GROUP) CO Ltd
Original Assignee
SHANGHAI YAOWEI (GROUP) CO Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by SHANGHAI YAOWEI (GROUP) CO Ltd filed Critical SHANGHAI YAOWEI (GROUP) CO Ltd
Priority to CN 201110335738 priority Critical patent/CN103096272A/en
Publication of CN103096272A publication Critical patent/CN103096272A/en
Pending legal-status Critical Current

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The invention relates to a public transportation transfer information search method based on global system for mobile communications (GSM) short messages. The method comprises the steps that 1) passenger mobile phone terminals send starting point information and terminal point information to a server; 2) the server judges whether one-time bus taking is successful or not through a one-time bus taking judgment function, if yes, optimal time bus taking route information is selected, and if no, a step 3) is executed; 3) the server judges whether second bus taking is successful or not through a second bus taking judgment function, if yes, optimal time bus taking route information is selected, and if no, a step 4) is executed; 4) the server selects a next route which passes through the starting point; 5) a next station of the route is selected; and 6) the server uses the station as a starting point and judges whether bus taking is successful or not through a second bus taking judgment function, if yes, a step 7) is executed, and if no, the steps such as the step 5) is returned. Compared with the prior art, the public transportation transfer information search method based on the GSM short messages has the advantages of saving computation time and system overhead and the like.

Description

Bus Transfer Information querying method based on the GSM note
Technical field
The present invention relates to a kind of Bus Transfer Information processing method, especially relate to a kind of Bus Transfer Information querying method based on the GSM note.
Background technology
In urban transportation, usually want conversion repeatedly bus routes just can arrive the destination.Portable belt roadbook not when going out due to the passenger, also unconditionally move desktop programs, so lack the convenient method that obtains optimum transfer plan in strange location, therefore intend the exploitation SMS platform, the transfer plan of equal available handsets note Free Acquisition optimum when the passenger goes on a journey.
The Typical Representative of several network shortest path algorithms commonly used is dijkstra's algorithms, and this algorithm is described as main body with real space, can realize preferably shortest path.This algorithm adopts matrix structure to carry out data storage computing.In actual applications, need the public traffic network scale of calculating usually all larger, computational speed is slower.The down town is similar to checkerboard type public bus network network usually, as Fig. 1, although this algorithm of algorithm example has found shortest path, altogether will take bus No. 12 the tunnel, the 78 tunnel, the 27 tunnel, the 87 tunnel 4 times.The analysis showed that this algorithm shortest path that covets, be fit to the self driving travelling, should not be used in bus trip.
Summary of the invention
Purpose of the present invention is exactly to provide a kind of Bus Transfer Information querying method based on the GSM note for the defective that overcomes above-mentioned prior art existence.
Purpose of the present invention can be achieved through the following technical solutions:
A kind of Bus Transfer Information querying method based on the GSM note is characterized in that, comprises the following steps:
1) passenger's mobile phone terminal transmission starting point and endpoint information are to server;
2) server by once by bus discriminant function judge once by bus whether success, if yes, access time, optimum riding route information, and sent to passenger's mobile phone terminal with time optimal riding route information, if NO, execution in step 3);
3) server judges by bus whether success of secondary by the secondary discriminant function of riding, and if yes, access time, optimum riding route information, and sent to passenger's mobile phone terminal with time optimal riding route information, if NO, and execution in step 4);
4) server next circuit of starting point of learning from else's experience;
5) get next website of this circuit;
6) server this website judge whether successfully by the secondary discriminant function of riding as starting point, if yes, execution in step 7), if NO, return to step 5);
7) storage possibility information, and judge whether not attempt circuit in addition, if yes, return to step 4), if NO, execution in step 8);
8) server judges whether to store possibility, and if yes, access time, optimum riding route information, and sent to passenger's mobile phone terminal with time optimal riding route information, if NO, sends three failure informations of riding to passenger's mobile phone terminal.
The described discriminant function of once riding is specially:
Whether search starting point, terminal point have common line number, and if yes, show and take advantage of a bus just can reach home, otherwise failure.
The described secondary discriminant function of riding is specially: whether each website of analyzing one by one by way of each circuit of starting point once can arrive by bus to terminal point, if yes, shows secondary success by bus, otherwise failure.
Described time optimal riding route is the shortest time riding route.
Described passenger's mobile phone terminal is connected with server by the GSM network equipment.
Compared with prior art, the present invention has and has the following advantages:
1, the minimum priority algorithm of number of transfer that adopts of the present invention is only selected optimal solution in that minimum a collection of solution of number of transfer, but and station data table application data base index technology search speed is optimized.Thereby computing time and overhead have been saved.
2, select again the shortest priority scheme of riding time when spending is identical.Compare with other searching algorithm, the minimum priority scheme of number of transfer is near passenger's psychological needs.
Description of drawings
Fig. 1 is the exemplary plot of existing dijkstra's algorithm;
Fig. 2 is flow chart of the present invention;
Fig. 3 is hardware configuration schematic diagram of the present invention.
Embodiment
The present invention is described in detail below in conjunction with the drawings and specific embodiments.
Embodiment
The passenger can consider that usually number of transfer minimum preferential scheme, particularly public transport add time-consuming section of summer air-conditioning, and often changing a circuit will increase the spending of 2 yuan more.Select again the shortest priority scheme of riding time when spending is identical.Compare with other searching algorithm, the minimum priority scheme of number of transfer is near passenger's psychological needs.This paper has designed search procedure shown in Figure 2.
1) model " discriminant function of once riding ", whether search starting point, terminal point have common line number.Have, show and take advantage of a bus just can reach home, this function returns very, and gets the time optimal scheme and be path by bus.
2) set up " secondary ride discriminant function ", use each website that " once discriminant function " by bus analyze one by one by way of each circuit of starting point and once whether can arrive by bus to terminal point.If it is true that " discriminant function of once riding " returns, show from starting point by an intermediate transit point; If secondary can be reached home by bus, " secondary ride discriminant function " returns very, and access time, optimal case was path by bus.
3) press Fig. 2 flow process under the support of 2 functions and launch the transfer plan search, this flow process essence is to consider that at first number of transfer is minimum preferential, then considers that riding time is the shortest preferential.
4) analyze from passenger mentality, must take bus more than 4 times if reach home, the passenger generally can select hire a car or public transport mix with other the trip mode.
Detailed process comprises the following steps as shown in Figure 2 and Figure 3:
1) passenger's mobile phone terminal 4 transmission starting points and endpoint information are to server;
2) server 1 by once by bus discriminant function judge once by bus whether success, if yes, access time, optimum riding route information, and sent to passenger's mobile phone terminal 4 with time optimal riding route information, if NO, execution in step 3);
3) server 1 judges by bus whether success of secondary by the secondary discriminant function of riding, and if yes, access time, optimum riding route information, and sent to passenger's mobile phone terminal 4 with time optimal riding route information, if NO, and execution in step 4);
4) server 1 next circuit of starting point of learning from else's experience;
5) get next website of this circuit;
6) server 1 this website judge whether successfully by the secondary discriminant function of riding as starting point, if yes, execution in step 7), if NO, return to step 5);
7) storage possibility information, and judge whether not attempt circuit in addition, if yes, return to step 4), if NO, execution in step 8);
8) server 1 judges whether to store possibility, and if yes, access time, optimum riding route information, and sent to passenger's mobile phone terminal 4 with time optimal riding route information, if NO, sends three failure informations of riding to passenger's mobile phone terminal.
Described passenger's mobile phone terminal 4 is connected with server 1 by the GSM network equipment, and the described GSM network equipment comprises that GSM accesses terminal 2 and GSM base station 3.
Shortest path first and tree-like searching algorithm are all to try to achieve after all solutions of various numbers of transfer contrast again to select an optimum solution, and some websites reach several minutes computing time, and the passenger can't wait for, thereby lose Practical significance.The minimum priority algorithm of number of transfer is only selected optimal solution in that minimum a collection of solution of number of transfer, but and station data table application data base index technology search speed is optimized.Thereby computing time and overhead have been saved.
Interface with SMS platform
SMS platform has gateway note and 2 kinds of modes of GSM MODEM note.Apply for that to commmunication company the formality of gateway shortcode is complicated, monthly rent is expensive at present, a month note traffic volume requires to reach 1,000,000 levels.Entrust third party SP business to have the shortcomings such as the data turnover is slow, information is easily divulged a secret.Especially under bad SP business claimed for charge at random impact in early days, SP business's gateway number had lost too many user's trust in China.GSMMODEM note essence is exactly the regular handset note, only 10 yuan of monthly rents, and month note use amount is unrestricted, also the arbitrary imposition of fees phenomenon can not occur, thereby be suitable for bearing the public welfare short message service.
The platform of this paper exploitation is based on serial ports GSM MODEM pattern auto-answer of short message platform, sees Fig. 3.Adopt AT command set to realize the automatic short message transmitting-receiving, the AT command set that must use is as follows: AT+CMGL short message enquiry breath; AT+CMGR short message reading breath; AT+CMGS sends short message; AT+CMGD deleting short message breath.Auxiliary AT instruction is mainly that signal strength detection, airborne electric weight detect, arrange instant note triggering Serial Port Event, device initialize etc., can consult the AT grammer of support from the random specification of equipment.Reserve " having received short message interface ", " interface to be sent short messages " on SMS platform, by the transfer of SQL SERVER database, be easier to realize the secondary development based on SMS platform.

Claims (5)

1. the Bus Transfer Information querying method based on the GSM note, is characterized in that, comprises the following steps:
1) passenger's mobile phone terminal transmission starting point and endpoint information are to server;
2) server by once by bus discriminant function judge once by bus whether success, if yes, access time, optimum riding route information, and sent to passenger's mobile phone terminal with time optimal riding route information, if NO, execution in step 3);
3) server judges by bus whether success of secondary by the secondary discriminant function of riding, and if yes, access time, optimum riding route information, and sent to passenger's mobile phone terminal with time optimal riding route information, if NO, and execution in step 4);
4) server next circuit of starting point of learning from else's experience;
5) get next website of this circuit;
6) server this website judge whether successfully by the secondary discriminant function of riding as starting point, if yes, execution in step 7), if NO, return to step 5);
7) storage possibility information, and judge whether not attempt circuit in addition, if yes, return to step 4), if NO, execution in step 8);
8) server judges whether to store possibility, and if yes, access time, optimum riding route information, and sent to passenger's mobile phone terminal with time optimal riding route information, if NO, sends three failure informations of riding to passenger's mobile phone terminal.
2. a kind of Bus Transfer Information querying method based on the GSM note according to claim 1, is characterized in that, the described discriminant function of once riding is specially:
Whether search starting point, terminal point have common line number, and if yes, show and take advantage of a bus just can reach home, otherwise failure.
3. a kind of Bus Transfer Information querying method based on the GSM note according to claim 1, it is characterized in that, the described secondary discriminant function of riding is specially: whether each website of analyzing one by one by way of each circuit of starting point once can arrive by bus to terminal point, if yes, show secondary success by bus, otherwise failure.
4. a kind of Bus Transfer Information querying method based on the GSM note according to claim 1, is characterized in that, described time optimal riding route is the shortest time riding route.
5. a kind of Bus Transfer Information querying method based on the GSM note according to claim 1, is characterized in that, described passenger's mobile phone terminal is connected with server by the GSM network equipment.
CN 201110335738 2011-10-29 2011-10-29 Public transportation transfer information search method based on global system for mobile communications (GSM) short messages Pending CN103096272A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 201110335738 CN103096272A (en) 2011-10-29 2011-10-29 Public transportation transfer information search method based on global system for mobile communications (GSM) short messages

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 201110335738 CN103096272A (en) 2011-10-29 2011-10-29 Public transportation transfer information search method based on global system for mobile communications (GSM) short messages

Publications (1)

Publication Number Publication Date
CN103096272A true CN103096272A (en) 2013-05-08

Family

ID=48208303

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 201110335738 Pending CN103096272A (en) 2011-10-29 2011-10-29 Public transportation transfer information search method based on global system for mobile communications (GSM) short messages

Country Status (1)

Country Link
CN (1) CN103096272A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103984767A (en) * 2014-05-30 2014-08-13 百度在线网络技术(北京)有限公司 Bus scheme query method and device

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103984767A (en) * 2014-05-30 2014-08-13 百度在线网络技术(北京)有限公司 Bus scheme query method and device

Similar Documents

Publication Publication Date Title
CN102306455B (en) Taxi intelligent service system and service method thereof
WO2020042812A1 (en) Boarding billing method and apparatus
CN101498585A (en) Taxi navigation system
CN101203041A (en) Method and system for implementation of automatic connecting vicinal taxi by mobile fixing technique
CN104052802A (en) Mobile social network implementation system and method based on vehicle communication
CN104615788A (en) Information notifying method, equipment and system
Shi et al. Tour-guide: Providing location-based tourist information on mobile phones
CN103914991A (en) Vehicle position sharing method
CN105848152B (en) A kind of method for network access, apparatus and system
CN103456162A (en) Positioning system based method for self-help taxi calling and logistics application
CN101039476B (en) Method and system for helping others navigation through mobile phone
CN102867031A (en) Method and system for optimizing point of interest (POI) searching results, mobile terminal and server
CN203015132U (en) A DVD vehicle-mounted navigation terminal Wi-Fi system based on an internet of vehicles
CN101329814A (en) Wireless system for enquiring public transport information
CN103327451A (en) Mobile phone location system, mobile phone location method and mobile phone
CN102469112B (en) Position tracking implementation method, Apparatus and system
CN111985965A (en) Vehicle-mounted advertisement pushing method and device, cloud server and vehicle-mounted terminal
CN101754092A (en) Intelligent weather service delivery method and system based on mobile terminal
JP2015137929A (en) Transfer guide system, transfer guide method and computer program
Lin et al. A cloud computing framework for real-time carpooling services
CN109409549A (en) Electric car changes method, system, server and the storage medium of electricity
CN103096272A (en) Public transportation transfer information search method based on global system for mobile communications (GSM) short messages
CN103379623A (en) WIFI positioning method in travel
CN103533503A (en) Method and system for recording and acquiring bus time table through photographing
CN101315284B (en) Processing method, device and system for global satellite positioning system information

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C02 Deemed withdrawal of patent application after publication (patent law 2001)
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20130508