CN1629839A - Bus change search system - Google Patents
Bus change search system Download PDFInfo
- Publication number
- CN1629839A CN1629839A CN 200310104011 CN200310104011A CN1629839A CN 1629839 A CN1629839 A CN 1629839A CN 200310104011 CN200310104011 CN 200310104011 CN 200310104011 A CN200310104011 A CN 200310104011A CN 1629839 A CN1629839 A CN 1629839A
- Authority
- CN
- China
- Prior art keywords
- module
- transfer
- database
- server
- data
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Abstract
This invention discloses an inquiry system for conveniently changing buses including an user end and a system server, among which, the user and includes an input device, an output device and a customer end communication device, the system server end includes server end communication equipments and public traffic database process devices. The system mainly designs a program inquiry and computation module containing a computing module and database module to realize a best bus-change scheme with the optimum bus line and least changing times.
Description
Technical field:
The present invention relates to a kind of inquiry system, particularly a kind of, transfer various at urban public bus lines calculated inconvenience and the inquiry system of convenient transfer public transit vehicle, the utilization computing machine has solved various, the inconvenient problem of transfer calculating of urban public bus lines in the real life, only need the bus routes data are put into database, just can improve the efficient of trip by multiple modes such as touch-screen, SMS efficiently for citizen, nonlocal visitor provide optimum transfer plan.
Background technology:
At present, along with the expansion day by day of urbanization, the extension of urban public bus lines, the development of subway, urban light rail, the setting up of numerous circuits and website, the transfer problem of bus but seems more and more serious.We but do not know how to change trains or buses to arrive the point of destination point often facing to the direction board of hundreds and thousands of public bus networks; Or calculated the transfer plan of oneself according to the circuit board, arrive the destination at last and find that just this is not an optimal scheme.This loaded down with trivial details, complicated route transfer is calculated and is tended to waste our a large amount of time, reduced and line efficiency, particularly in the tourist city, on business the intersection guideboard does not indicate clear, calculate very inconvenience by the circuit board, and the visitor can not be aggregated into a bus routes data that the city is all, influences economic benefit and social benefit.
At present, there has been public transportation enquiry system to occur, but generally can only have calculated the once situation of transfer, be based on the map reference search, accomplish the inquiry of changing to, just must collect the map in city, then the station be retouched a little on map one by one coordinate is imported in the computing machine, whole data volume is very huge, the data of setting up a city transfer need a large amount of previous works, simultaneously, after data changed, entire database just needed to change.
Summary of the invention:
The inquiry system that the purpose of this invention is to provide a kind of convenient transfer public transit vehicle, this inquiry system is based on that the way of mathematical set makes, database is simple, the change data are convenient, the repeatedly calculating of transfer can be provided, the present invention is according to initial website and destination website, with riding time and circuit distance is standard, realize the preferred plan of the best transfer circuit with the number of transfer of minimum of shortest time and bee-line combination, line efficiency thereby improve, accelerate rhythm of life, for citizen provide convenience.
Concrete technical scheme of the present invention is as follows:
A kind of Public Transport Transfer inquiry system, comprise user side and system server terminal, user side comprises input equipment, output device and client communication apparatus, system server terminal comprises server end communication apparatus, transit database treatment facility, it is characterized in that: be provided with the public transportation enquiry transfer calculation procedure module that comprises computing module and database module in the transit database treatment facility, wherein:
A, database module comprise module, database server relevant public bus network data of retrieval whether judgement is existed by the data of the initial website of user side input and purpose website and retrieval module, record start website and purpose website and the buffer memory storehouse writing module of priority level in the buffer memory storehouse of returning to computational server in the buffer memory storehouse;
B, computing module comprise the module that receives the user side data, to the database server request of sending and inform initial website and purpose website and user's input priority module, receive the database server data and constitute the route set and non-directed graph adjacency list and be stored in module in the server memory, judge the module of User Priority, the module of number of transfer and range ability and comparison, the transfer route in the internal memory is sent to module in the database server cache database, transfer route is sent to the module of server end communication coding device.
Initial website and purpose site number are stored in and concentrate in the module of number of transfer of the present invention and range ability and comparison, and the common factor in twos of the union of the combination of the number of transfer that produces is not an empty set.
Initial website and purpose site number are stored in the adjacency list in the module of number of transfer of the present invention and range ability and comparison, and the shortest range ability number that backstepping relatively produces is stored in the database server cache database.
The shortest range ability number that occur simultaneously in twos and the backstepping of the union of the combination of the number of transfer that the module of number of transfer of the present invention and range ability and comparison produces relatively produces, calculate minimum transfer number and the bee-line number that the summation operation mode calculates and compare judgement to separate in the process of implementation, be recorded in the database server cache database.
Be provided with in the cache database of the present invention between the station apart from number, like this, the calculating of the distance by every kind of scheme before program output transfer plan, the shortest scheme of last only output distance.
The present invention can select TXT text database or MSSQL database or ORACLE database etc. for use.
Flow process of the present invention is: the initial website and the destination website that at first the input of user side input equipment are needed the inquiry transfer, then by sending to the server end communication apparatus behind the user side communication apparatus coding, and by being sent to after its decoding in the Public Transport Transfer inquiry calculation procedure module, program module reads out corresponding data from database, after after calculating transfer plan being transferred to server end communication apparatus coding, be sent to the user side communication apparatus, and tell the user by output device by its decoding back.
Idiographic flow in the system server of the present invention is: after the server end communication apparatus is received the signal of user side communication apparatus, data signal transmission is inquired about in the calculation procedure module to Public Transport Transfer, after Public Transport Transfer inquiry calculation procedure module is received the user side data, send request to database server, the priority of the initial website of announcement and destination website and user's input, the judgement whether the buffer memory storehouse writing module in the buffer memory storehouse exists, the data that the retrieval judgement exists are delivered to the user side communication apparatus by server end communication coding device; After the data that do not retrieve are retrieved relevant public bus network data through treatment facility, return to the calculation procedure module, through receiving the database server data and constituting route set and non-directed graph adjacency list and be stored in the calculating of the module in the server memory, after judging User Priority, according to number of transfer and range ability and comparison principle, data after the module computing of number of transfer and range ability and comparison are sent in the database server cache database, and, data-signal is sent to the client communication apparatus by the module that transfer route is sent to server end communication coding device.
The present invention be with each station as the set unit, through the public bus network at this station as element, perhaps with every public bus network as all stations on element, this route as element.If with the unit of every route as a set, specific implementation is: setting up bus is the one-dimension array of record type, and its name territory is the title that character string type is represented route, and the st territory is that the aggregate type of integer 0 to 249 is represented the station set; Stname is the one-dimension array of character string type, stores all station titles, corresponding the numbering at station is inserted in the station set in the route; Busnum and stnum write down bus routes number and station number respectively.So just finish data and from database, taken out the process that is put in the calculator memory.Point out the user to import initial website and purpose website then, judge that respectively it is present in the array numbering that searches out in the stname array separately after, numbering is stored in fromdata and todata variable.
An original set can be dispersed into a plurality of set for metropolitan words quantity, and still treat on the function as a set.Such as original set A becomes set A [N] now, and we need put into set to a numeral 2501 now, can with 2501 divide exactly 250 10,2501MOD 250 1, promptly put A[10 to 1 into] go in the set.After revising after this manner, other calculating process only needs some the little changes of corresponding do in the program, as when asking union, adds for circulation each small set is merged respectively, can solve the little problem of collective data amount.
The present invention can show by visual picture by combining with the GPS location technology.
The present invention can realize that communication exchanges by multiple modes such as phone, telephonograph, cellphone information, online enquiries.
The present invention is based on that the way of mathematical set makes, database is simple, the change data are convenient, the repeatedly calculating of transfer can be provided, and the present invention is standard according to initial website and destination website with riding time and circuit distance, realize the preferred plan of the best transfer circuit with the number of transfer of minimum of shortest time and bee-line combination, line efficiency thereby improve, accelerate rhythm of life, for citizen provide convenience.
Accompanying drawing and drawing explanation:
Fig. 1 logic block-diagram of the present invention
The flow logic block scheme of Fig. 2 system server of the present invention
The logic block-diagram that Fig. 3 number of transfer of the present invention calculates
The logic block-diagram that Fig. 4 range ability of the present invention calculates
The logic block-diagram that Fig. 5 number of transfer of the present invention and range ability relatively calculate
The logic block-diagram that Fig. 6 range ability of the present invention and number of transfer relatively calculate
Fig. 7 system server of the present invention, flow implementation figure
Embodiment:
Embodiment 1
A kind of Public Transport Transfer inquiry system, comprise user side and system server terminal as Fig. 1, user side comprises input equipment, output device and client communication apparatus, system server terminal comprises server end communication apparatus, transit database treatment facility, it is characterized in that: be provided with the public transportation enquiry transfer calculation procedure module that comprises computing module and database module in the transit database treatment facility, as Fig. 2, wherein:
A, database module comprise module, database server relevant public bus network data of retrieval whether judgement is existed by the data of the initial website of user side input and purpose website and retrieval module, record start website and purpose website and the buffer memory storehouse writing module of priority level in the buffer memory storehouse of returning to computational server in the buffer memory storehouse;
B, computing module comprise the module that receives the user side data, to the database server request of sending and inform initial website and purpose website and user's input priority module, receive the database server data and constitute the route set and non-directed graph adjacency list and be stored in module in the server memory, judge the module of User Priority, the module of number of transfer and range ability and comparison, the transfer route in the internal memory is sent to module in the database server cache database, transfer route is sent to the module of server end communication coding device.
Initial website and purpose site number are stored in and concentrate in the module of number of transfer of the present invention and range ability and comparison, and the common factor in twos of the union of the combination of the number of transfer that produces is not an empty set.
Initial website and purpose site number are stored in the adjacency list in the module of number of transfer of the present invention and range ability and comparison, and the shortest range ability number that backstepping relatively produces is stored in the database server cache database.
The shortest range ability number that occur simultaneously in twos and the backstepping of the union of the combination of the number of transfer that the module of number of transfer of the present invention and range ability and comparison produces relatively produces, calculate minimum transfer number and the bee-line number that the summation operation mode calculates and compare judgement to separate in the process of implementation, be recorded in the database server cache database.
Embodiment 2
Flow process of the present invention is: the initial website and the destination website that at first the input of user side input equipment are needed the inquiry transfer, then by sending to the server end communication apparatus behind the user side communication apparatus coding, and by being sent to after its decoding in the Public Transport Transfer inquiry calculation procedure module, program module reads out corresponding data from database, after after calculating transfer plan being transferred to server end communication apparatus coding, be sent to the user side communication apparatus, and tell the user by output device by its decoding back.
Idiographic flow such as Fig. 7 in the system server of the present invention are: after the server end communication apparatus is received the signal of user side communication apparatus, data signal transmission is inquired about in the calculation procedure module to Public Transport Transfer, after Public Transport Transfer inquiry calculation procedure module is received the user side data, send request to database server, the priority of the initial website of announcement and destination website and user's input, the judgement whether the buffer memory storehouse writing module in the buffer memory storehouse exists, the data that the retrieval judgement exists are delivered to the user side communication apparatus by server end communication coding device; After the data that do not retrieve are retrieved relevant public bus network data through treatment facility, return to the calculation procedure module, through receiving the database server data and constituting route set and non-directed graph adjacency list and be stored in the calculating of the module in the server memory, after judging User Priority, according to number of transfer and range ability and comparison principle, data after the module computing of number of transfer and range ability and comparison are sent in the database server cache database, and, data-signal is sent to the client communication apparatus by the module that transfer route is sent to server end communication coding device.
Embodiment 3
The data memory format of text database of the present invention, selected form as follows:
Beijing
City bus, subway
2003-10-24
9 the tunnel
* the sub-* Xiao Zhuan of JinTai Road * water-powered trip-hammer * Hu Jia building *. * Qianmen, (slightly middle) .* justice road
In this form, the title in the first behavior city, the public transport type that second behavior comprises, the third line is the final updating time of data, is track data below, and wherein line name accounts for delegation, and route accounts for delegation.The form that route is capable is " * name of station * name of station * ... ", row end end @@.The public transport data in each city are a file, and filename is the city title just, and all data files all are positioned in the data catalogue.
Embodiment 4
The flow process that number of transfer of the present invention calculates is as follows: see Fig. 3
A) the number of combinations sequence of the nothing repetition of n numeral composition is produced by solve7 process recurrence.
N here is solve7 process recurrence border in the control program, controls number of transfer indirectly.
B) do not need the situation of the situation (being n=1) of changing in program, to handle by solve06.
The union of asking in the process flow diagram has guaranteed to contain in the sequence initial website and purpose website, meets bar
Part sequence is asked in twos occured simultaneously, and requires to occur simultaneously in twos just not guaranteed initial website for empty this
Be communicated with between the purpose website, in program, be responsible for by the solve09 process.
C) the array exfa of storage transfer plan is defined as the two-dimensional array of integer, and one dimension is that storage is multiple
The numbering of scheme, another dimension are storage transfer route orders.
D) output procedure is made up of a plurality of processes and function.
Claims (7)
1, a kind of Public Transport Transfer inquiry system, comprise user side and system server terminal, user side comprises input equipment, output device and client communication apparatus, system server terminal comprises server end communication apparatus, transit database treatment facility, it is characterized in that: be provided with the public transportation enquiry transfer calculation procedure module that comprises computing module and database module in the transit database treatment facility, wherein:
A, database module comprise module, database server relevant public bus network data of retrieval whether judgement is existed by the data of the initial website of user side input and purpose website and retrieval module, record start website and purpose website and the buffer memory storehouse writing module of priority level in the buffer memory storehouse of returning to computational server in the buffer memory storehouse;
B, computing module comprise the module that receives the user side data, to the database server request of sending and inform initial website and purpose website and user's input priority module, receive the database server data and constitute the route set and non-directed graph adjacency list and be stored in module in the server memory, judge the module of User Priority, the module of number of transfer and range ability and comparison, the transfer route in the internal memory is sent to module in the database server cache database, transfer route is sent to the module of server end communication coding device.
2, a kind of Public Transport Transfer inquiry system according to claim 1, it is characterized in that: initial website and purpose site number are stored in and concentrate in the module of described number of transfer and range ability and comparison, and the common factor in twos of the union of the combination of the number of transfer that produces is not an empty set.
3, a kind of Public Transport Transfer inquiry system according to claim 1, it is characterized in that: initial website and purpose site number are stored in the adjacency list in the module of described number of transfer and range ability and comparison, and the shortest range ability number that backstepping relatively produces is stored in the database server cache database.
4, a kind of Public Transport Transfer inquiry system according to claim 1, it is characterized in that: the shortest range ability number that occur simultaneously in twos and the backstepping of the union of the combination of the number of transfer that the module of described number of transfer and range ability and comparison produces relatively produces, calculate minimum transfer number and the bee-line number that the summation operation mode calculates and compare judgement to separate in the process of implementation, be recorded in the database server cache database.
5, a kind of Public Transport Transfer inquiry system according to claim 1, it is characterized in that: be provided with in the described cache database between the station apart from number, like this, the calculating of the distance by every kind of scheme before program output transfer plan, the shortest scheme of last only output distance.
6, a kind of Public Transport Transfer inquiry system according to claim 1, it is characterized in that: described idiographic flow is: idiographic flow of the present invention is: initial website and the destination website of at first user side input equipment input needs being inquired about transfer, then by sending to the server end communication apparatus behind the user side communication apparatus coding, and by being sent to after its decoding in the Public Transport Transfer inquiry calculation procedure module, program module reads out corresponding data from database, after after calculating transfer plan being transferred to server end communication apparatus coding, be sent to the user side communication apparatus, and tell the user by output device by its decoding back.
7, according to claim 1 or 6 described a kind of Public Transport Transfer inquiry systems, it is characterized in that: the idiographic flow in the described system server is: after the server end communication apparatus is received the signal of user side communication apparatus, data signal transmission is inquired about in the calculation procedure module to Public Transport Transfer, after Public Transport Transfer inquiry calculation procedure module is received the user side data, send request to database server, the priority of the initial website of announcement and destination website and user's input, the judgement whether the buffer memory storehouse writing module in the buffer memory storehouse exists, the data that the retrieval judgement exists are delivered to the user side communication apparatus by server end communication coding device; After the data that do not retrieve are retrieved relevant public bus network data through treatment facility, return to the calculation procedure module, through receiving the database server data and constituting route set and non-directed graph adjacency list and be stored in the calculating of the module in the server memory, after judging User Priority, according to number of transfer and range ability and comparison principle, data after the module computing of number of transfer and range ability and comparison are sent in the database server cache database, and, data-signal is sent to the client communication apparatus by the module that transfer route is sent to server end communication coding device.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN 200310104011 CN1629839B (en) | 2003-12-15 | 2003-12-15 | Bus change search system |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN 200310104011 CN1629839B (en) | 2003-12-15 | 2003-12-15 | Bus change search system |
Publications (2)
Publication Number | Publication Date |
---|---|
CN1629839A true CN1629839A (en) | 2005-06-22 |
CN1629839B CN1629839B (en) | 2010-09-01 |
Family
ID=34842917
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN 200310104011 Expired - Fee Related CN1629839B (en) | 2003-12-15 | 2003-12-15 | Bus change search system |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN1629839B (en) |
Cited By (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101187996B (en) * | 2007-10-08 | 2011-01-26 | 西安交通大学 | A quick bus line selection algorithm based on self-adapted backbone network |
CN101630440B (en) * | 2009-06-01 | 2011-03-16 | 北京交通大学 | Operation coordination optimizing method of common public transit connecting with urban rail transit and system thereof |
CN102446179A (en) * | 2010-10-09 | 2012-05-09 | Tcl集团股份有限公司 | Bus line inquiry method |
CN103020097A (en) * | 2012-06-01 | 2013-04-03 | 腾讯科技(深圳)有限公司 | Method and device for public transport transfer program recommendation |
CN104572811A (en) * | 2014-11-25 | 2015-04-29 | 百度在线网络技术(北京)有限公司 | Intelligent recommendation method for bus route, device and equipment |
CN106295906A (en) * | 2016-08-22 | 2017-01-04 | 万马联合新能源投资有限公司 | A kind of urban public bus lines querying method based on degree of depth study |
CN108763518A (en) * | 2018-05-30 | 2018-11-06 | 武汉轻工大学 | Recommendation method, apparatus, terminal device and the readable storage medium storing program for executing of riding scheme |
CN108763549A (en) * | 2018-05-31 | 2018-11-06 | 武汉轻工大学 | Method for quickly querying, device, terminal device and the storage medium of public bus network |
Family Cites Families (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1282935A (en) * | 1999-08-02 | 2001-02-07 | 赵继恝 | Electronic traffic information inquiry system |
CN2588454Y (en) * | 2002-09-26 | 2003-11-26 | 薛慧丽 | Palm type public traffic bus-taking guide |
-
2003
- 2003-12-15 CN CN 200310104011 patent/CN1629839B/en not_active Expired - Fee Related
Cited By (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101187996B (en) * | 2007-10-08 | 2011-01-26 | 西安交通大学 | A quick bus line selection algorithm based on self-adapted backbone network |
CN101630440B (en) * | 2009-06-01 | 2011-03-16 | 北京交通大学 | Operation coordination optimizing method of common public transit connecting with urban rail transit and system thereof |
CN102446179A (en) * | 2010-10-09 | 2012-05-09 | Tcl集团股份有限公司 | Bus line inquiry method |
CN103020097A (en) * | 2012-06-01 | 2013-04-03 | 腾讯科技(深圳)有限公司 | Method and device for public transport transfer program recommendation |
CN103020097B (en) * | 2012-06-01 | 2015-07-22 | 腾讯科技(深圳)有限公司 | Method and device for public transport transfer program recommendation |
CN104572811A (en) * | 2014-11-25 | 2015-04-29 | 百度在线网络技术(北京)有限公司 | Intelligent recommendation method for bus route, device and equipment |
CN104572811B (en) * | 2014-11-25 | 2018-06-05 | 百度在线网络技术(北京)有限公司 | Intelligent bus route recommendation method, apparatus and equipment |
CN106295906A (en) * | 2016-08-22 | 2017-01-04 | 万马联合新能源投资有限公司 | A kind of urban public bus lines querying method based on degree of depth study |
CN108763518A (en) * | 2018-05-30 | 2018-11-06 | 武汉轻工大学 | Recommendation method, apparatus, terminal device and the readable storage medium storing program for executing of riding scheme |
CN108763518B (en) * | 2018-05-30 | 2020-10-30 | 武汉轻工大学 | Recommendation method and device for riding scheme, terminal equipment and readable storage medium |
CN108763549A (en) * | 2018-05-31 | 2018-11-06 | 武汉轻工大学 | Method for quickly querying, device, terminal device and the storage medium of public bus network |
Also Published As
Publication number | Publication date |
---|---|
CN1629839B (en) | 2010-09-01 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Tu et al. | Exploring nonlinear effects of the built environment on ridesplitting: Evidence from Chengdu | |
CN110645983A (en) | Path planning method, device and system for unmanned vehicle | |
CN102265118A (en) | Methodology and system for routing optimization in gps-based navigation, combining dynamic traffic data | |
US11092448B2 (en) | System and method for determining routing by learned selective optimization | |
CN103036977A (en) | Business pushing method and pushing system based on content distribution network | |
CN111339230B (en) | Vehicle information display method and device, electronic equipment and storage medium | |
CN111383005B (en) | Digital currency flow direction tracking method and device | |
CN101242583A (en) | Public bus transfer inquiry system, mobile communication terminal and public bus transfer inquiry method | |
WO2021189897A1 (en) | Road matching method and apparatus, and electronic device and readable storage medium | |
CN1629839A (en) | Bus change search system | |
Jaballah et al. | The time-dependent shortest path and vehicle routing problem | |
CN105989145B (en) | Automatic updating method, device and system for bus line | |
CN105989177A (en) | Bus information inquiring method and bus information inquiring apparatus | |
CN1570565A (en) | Data storage and update method for electronic map | |
CN103038718A (en) | Localized data affinity system and hybrid method | |
CN114201571A (en) | Gas station recommendation method and device, electronic equipment and storage medium | |
CN1195368C (en) | Selection of information units for mobile client computers | |
CN103001967A (en) | Source station server and business push method | |
CN103533503A (en) | Method and system for recording and acquiring bus time table through photographing | |
CN112883195A (en) | Method and system for constructing traffic knowledge map of individual trip | |
CN112200336A (en) | Method and device for planning vehicle driving path | |
Ferreira et al. | Multi-modal transportation advisor system | |
CN1557654A (en) | Vehicle guidance system and guiding method thereof | |
CN111353759B (en) | Dynamic calculation method, device, equipment and storage medium for line transportation cost | |
CN1269031C (en) | Transfer ticket classifying method in urban track communication |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
C14 | Grant of patent or utility model | ||
GR01 | Patent grant | ||
C17 | Cessation of patent right | ||
CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20100901 Termination date: 20121215 |