CN110750554B - System and method for matching optimal train scheme - Google Patents

System and method for matching optimal train scheme Download PDF

Info

Publication number
CN110750554B
CN110750554B CN201910928398.8A CN201910928398A CN110750554B CN 110750554 B CN110750554 B CN 110750554B CN 201910928398 A CN201910928398 A CN 201910928398A CN 110750554 B CN110750554 B CN 110750554B
Authority
CN
China
Prior art keywords
site
city
user
county
station
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201910928398.8A
Other languages
Chinese (zh)
Other versions
CN110750554A (en
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.)
Suzhou Chuanglv Tianxia Information Technology Co ltd
Original Assignee
Suzhou Chuanglv Tianxia Information Technology 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 Suzhou Chuanglv Tianxia Information Technology Co ltd filed Critical Suzhou Chuanglv Tianxia Information Technology Co ltd
Priority to CN201910928398.8A priority Critical patent/CN110750554B/en
Publication of CN110750554A publication Critical patent/CN110750554A/en
Application granted granted Critical
Publication of CN110750554B publication Critical patent/CN110750554B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24Querying
    • G06F16/242Query formulation
    • G06F16/2428Query predicate definition using graphical user interfaces, including menus and forms
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24Querying
    • G06F16/245Query processing
    • G06F16/2457Query processing with adaptation to user needs
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24Querying
    • G06F16/248Presentation of query results
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/29Geographical information databases

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Databases & Information Systems (AREA)
  • Data Mining & Analysis (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Computational Linguistics (AREA)
  • Human Computer Interaction (AREA)
  • Mathematical Physics (AREA)
  • Remote Sensing (AREA)
  • Train Traffic Observation, Control, And Security (AREA)

Abstract

The invention discloses a system and a method for matching an optimal train scheme, relates to the technical field of internet, and aims to solve the problem that a train ticket inquiry system causes great inconvenience to users. The technical scheme is that the system comprises a train ticket query program, a rear-end server, a database module and a query module; after a user selects a departure site and an arrival site on a site selection page of the train ticket query program, the back-end server returns a corresponding train ticket query list to a query list interface of the train ticket query program for display; meanwhile, the inquiry module inquires the grade city to which the current site belongs from the database module according to the starting site inquired by the user, inquires the site of the prefecture city managed by the inquiry module according to the obtained grade city, and displays the obtained prefecture city site on an inquiry list interface for the user to select if the prefecture city site exists, so that the condition that the user returns to a site selection page to reselect the site is avoided, and the convenience is greatly improved.

Description

System and method for matching optimal train scheme
Technical Field
The invention relates to the technical field of internet, in particular to a system and a method for matching an optimal train scheme.
Background
The train ticket inquiring system generally comprises a train ticket inquiring program at a user side and a back-end server for providing service for the train ticket inquiring program, after a user selects a departure station and an arrival station, the train ticket inquiring program carries out corresponding inquiry from a database of the back-end server according to the station selected by the user and presents a data list, and the user can sort the list presented by the train ticket inquiring program according to departure time, arrival time or consumed time. For example: when a user inquires the train tickets from Suzhou to Shanghai, the user interface of the train ticket inquiry program presents the train tickets from all sites in Suzhou to all sites in Shanghai, a sequencing function is provided on the user interface, and the user can actively trigger sequencing.
However, the above prior art solutions have the following drawbacks: when a user queries a local-level city site or a county-level city site, the site classification problem is encountered, and the situation that the site needs to be reselected for query due to incomplete data lists presented by a user interface is easy to occur; for example, when the user selects to query all train data from suzhou city to shanghai city, data from all sites under suzhou prefecture to all sites in shanghai city are obtained, but the sites such as kunshan site and kunshan site in the prefecture city of suzhou city are not included, so that the user is required to reselect the site for query, which causes great inconvenience to the user.
Disclosure of Invention
It is an object of the present invention to provide a system and method for matching an optimal train scheme.
The invention aims at: the system for matching the optimal train scheme is provided, a grade city to which a current station belongs can be inquired from a database according to a starting station inquired by a user, then the station of a prefecture city in which the current station belongs is inquired according to the obtained grade city, if the station of the prefecture city exists, the station is displayed on a user interface of a displayed train data list and is selected by the user, the situation that the user returns to a station selection page again and inputs the station which needs to be inquired actually is avoided, and great convenience is provided for the user;
the second purpose of the invention is that: the method for matching the optimal train scheme has the advantages that when a user inquires the train scheme corresponding to the grade city site, the county city site can be pushed according to the inquired grade city site, so that the inquiry efficiency of the user side is improved, and the operation is simplified.
The above object of the present invention is achieved by the following technical solutions:
a system for matching an optimal train plan, comprising:
the train ticket query program is used for forming a site selection page for a user to select a departure site and an arrival site, and skipping to a corresponding query list interface according to the departure site and the arrival site selected by the user;
the back-end server is used for acquiring a departure site and an arrival site selected by a user on a site selection page, and returning a train ticket query list displayed on the query list interface to the train ticket query program according to the selected departure site and arrival site;
the database module is used for inputting the information of the local-level city and the information of the county-level city and establishing a mapping relation between the local-level city and the county-level city; the system is also used for inputting site information and configuring the city to which each site belongs; and the number of the first and second groups,
the query module is used for querying the grade city to which the current site belongs from the database module according to the starting site selected by the user, and querying the site information of the county-level city corresponding to the grade city according to the grade city obtained by querying;
when a prefecture level city corresponding to a starting station selected by a user has a prefecture level city site, the query module acquires site information of the corresponding prefecture level city, and sends the acquired prefecture level city site and the corresponding prefecture level city site to a train ticket query program on a user side and displays the train ticket query program in a set area of a query list interface;
and when one site which is displayed in the set area of the inquiry list interface and is different from the departure site selected by the user is selected, the departure site selected by the user is replaced by the currently selected site by the train ticket inquiry program, and the train ticket inquiry list displayed on the inquiry list interface is refreshed.
By adopting the technical scheme, after a user selects a departure station and an arrival station, the query module can query the grade city to which the current departure station belongs from the database module, then queries the station of the prefecture city belonging to the departure station according to the obtained grade city, if the prefecture city station exists, the station is displayed on the query list interface of the displayed train data list and is selected by the user, and after the user selects the corresponding station on the query list interface, the train ticket query list on the query list interface can be correspondingly refreshed, so that the condition that the user returns to the station selection page again and re-inputs the station which needs to be queried actually is avoided, the query efficiency of the user side is improved, and great convenience is provided for the user.
The invention is further configured to: the query module comprises an information acquisition unit for acquiring the geographical position information of the user, and the database module records the geographical position information of each site; and the query module is also used for calculating the distance between the current position of the user and the corresponding grade city site and the corresponding county city site according to the geographical position information of the user when the county city site exists in the grade city corresponding to the starting site queried by the user, and sending the calculated distance to the train ticket query program and displaying the train ticket in the corresponding area of the query list interface.
By adopting the technical scheme, the distances from all starting sites to the current position in the current query result can be calculated according to the current geographical position information of the user and displayed on the user interface, so that the decision cost of the user is reduced, and the user experience is improved.
The invention is further configured to: the process of calculating the distance between the current position of the user and each site by the query module is a calculation node, and each calculation node is asynchronously executed on different threads.
By adopting the technical scheme, the calculation of the distance between the user and each site is asynchronously executed, the response efficiency of the system is improved, and the result can be timely fed back to the user.
The invention is further configured to: the site selection page comprises a site display area for displaying the site and a site input area for a user to input the site, wherein the site display area comprises a first site position and a second site position;
the query module is used for querying a county-level city and a prefecture-level city corresponding to the geographic position information according to the geographic position information of the user acquired by the information acquisition unit, and sending a first-class characteristic information for displaying a site of the current county-level city at a first-class site position and displaying a first-class characteristic information for displaying a site of the prefecture-level city at a second-class site position to a train ticket query program when the geographic position information of the user corresponds to the county-level city and the corresponding county-level city has a train station;
the query module is further used for sending a second type of characteristic information to the train ticket query program when the geographic position information of the user does not correspond to the county-level city or no train station exists in the current county-level city, wherein the second type of characteristic information is used for displaying the site of the prefecture-level city to which the current county-level city belongs at the first type of site position and displaying the site searched by the user in history at the second type of site position.
By adopting the technical scheme, the user is positioned when the site selects the page, the positioning is accurate to the county-level city, the prefecture-level city is searched upwards according to the county-level city, if the current county-level city has the railway station, the current county-level city is displayed at the position of the first-class site, and the prefecture-level city to which the current county-level city belongs is displayed at the position of the second-class site; if no railway station exists in the county-level city or the county-level city does not exist in the county-level city, searching the prefecture-level city upwards, displaying prefecture-level city sites at the first site position, and displaying sites/cities searched by a user in history at the second site position; therefore, the error probability of user query is greatly reduced, and the user experience is further improved.
The invention is further configured to: the query list interface comprises a first display area for displaying a county-level municipal site and a prefecture-level municipal site corresponding to a starting site selected by a user and a second display area for displaying the county-level municipal site and the prefecture-level municipal site corresponding to an arrival site selected by the user, and a set area of the query list interface is the first display area;
when a prefecture-level city site corresponding to the arrival site selected by the user exists, the query module acquires site information of the corresponding prefecture-level city, and sends the acquired prefecture-level city site and the corresponding prefecture-level city site to a train ticket query program on the user side and displays the train ticket query program in the second display area;
and after a certain site shown in the second display area and a site different from the arrival site selected by the user are selected, replacing the arrival site selected by the user with the currently selected site by the train ticket inquiry program and refreshing a train ticket inquiry list displayed on an inquiry list interface.
By adopting the technical scheme, the inquired departure site and the inquired arrival site are respectively displayed in the first display area and the second display area for selection of a user, site selection is provided for the user from two dimensions of the departure site and the arrival site, and the inquiry efficiency of the user side is further improved.
The second aim of the invention is realized by the following technical scheme:
a method for matching the optimal train scheme is based on the system for matching the optimal train scheme, and comprises the following steps:
s100, creating a city information database, and establishing a mapping relation between a local city and a county city;
s200, establishing a train station information database, wherein the train station information database comprises geographical position information of each station and a city to which each station belongs;
s300, obtaining a departure site and an arrival site selected by a user;
s400, according to the departure site selected by the user, inquiring a grade city site and a county grade city site under a grade city to which the current departure site belongs based on the city information database and the train site information database;
s500, judging whether a county-level municipal site is inquired in the step S400; if yes, go to step S600; if not, go to step S700;
s600, displaying all the inquired county-level city sites and the prefecture-level city sites on an inquiry list interface of a train ticket inquiry program on a user side;
and S700, displaying all the inquired grade city sites on an inquiry list interface of a train ticket inquiry program at the user side.
By adopting the technical scheme, when a user inquires the train scheme corresponding to the grade city site, the county city site can be pushed for the user according to the inquired grade city site, and the train inquiry list on the inquiry list interface can be refreshed after the user selects the corresponding county city site, so that the operation is simplified, and the inquiry efficiency of the user side is improved.
The invention is further configured to: the step S300 specifically includes:
acquiring geographical position information of a user and a departure site and an arrival site selected by the user;
the step S400 specifically includes:
inquiring a grade city site and a county grade city site under a grade city to which the current departure site belongs according to the departure site selected by the user and based on the city information database and the train site information database, and calculating the distance between the current position of the user and the inquired grade city site and county grade city site;
in step S600 and step S700, the stations displayed on the query list interface of the user-side train ticket query program include station name information and station distance information.
By adopting the technical scheme, the user can visually see not only the county-level city sites and the corresponding prefecture-level city sites pushed for the user on the query list interface, but also the county-level city sites and the distances between the prefecture-level city sites and the prefecture-level city sites, so that the decision cost of the user is reduced, and the query efficiency is improved.
The invention is further configured to: the step S300 includes the following sub-steps:
s301, acquiring geographical position information of a user;
s302, inquiring a county-level city and a ground-level city corresponding to the geographic position information of the user; when a railway station exists in the current county-level city, the substep S303 is entered; when the geographic position information of the user does not correspond to a county-level city or no train station exists in the current county-level city, the substep S304 is carried out;
s303, displaying the sites of the county-level cities, which can be selected by the user, and the sites of the local cities to which the current county-level cities belong on a site selection page;
s304, displaying the sites of the corresponding grade cities, which can be selected by the user, on the site selection page;
s305, obtaining the departure site and the arrival site selected by the user.
By adopting the technical scheme, when the user selects the site on the site selection page, the corresponding information of the local city and the county city is recommended to the user according to the geographical position information, so that the error probability of user query is further reduced, and the user experience is greatly improved.
The invention is further configured to: the step S400 specifically includes:
according to a departure station and an arrival station selected by a user, inquiring a grade city station and a county grade city station under a grade city where the current departure station and the arrival station belong based on the city information database and the train station information database;
in step S600 and step S700, all the sites queried according to the departure site selected by the user and all the sites queried according to the arrival site selected by the user are respectively displayed in different areas on the query list interface.
By adopting the technical scheme, the departure site selected by the user and the grade city site and the county grade city site under the grade city to which the arrival site belongs are displayed on the query list interface for the user to select, and after the user selects the corresponding site, the query list interface is refreshed in real time, so that the query efficiency of the user side is improved from two dimensions of the departure site and the arrival site.
In summary, the beneficial technical effects of the invention are as follows:
1. through the arrangement of the back-end server, the database module and the query module, the situation that the user returns to the site selection page again and re-inputs the site which needs to be queried actually is avoided, and great convenience is provided for the user;
2. the distance between each station and the user can be displayed in real time through the arrangement of the information acquisition unit, so that the decision cost of the user is reduced, and the query efficiency is improved;
3. through the setting of website display area, first display area and second display area, from two dimensions of departure website and arrival site for the user provides accurate website recommendation, very big promotion user experience.
Drawings
Fig. 1 is a schematic diagram showing an overall configuration of a system for matching an optimal train scheme according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram of a site selection page according to an embodiment of the present invention;
FIG. 3 is a schematic structural diagram illustrating a query list interface according to an embodiment of the present invention;
fig. 4 is a flowchart illustrating a method of matching an optimal train scheme according to a second embodiment of the present invention;
fig. 5 is a flowchart of step S300 according to the second embodiment of the present invention.
In the figure, 1, a train ticket inquiry program; 11. a site selection page; 111. a candidate region; 12. a site input area; 13. a site display area; 14. a class of site locations; 15. a second type of site location; 16. three types of site locations; 17. a query list interface; 171. an information display area; 172. a list display area; 18. a first display area; 19. a second display area; 2. a back-end server; 3. a database module; 4. a query module; 41. an information acquisition unit.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings.
Example one
Referring to fig. 1, the system for matching an optimal train scheme disclosed by the invention comprises a train ticket query program 1, a back-end server 2, a database module 3 and a query module 4. The train ticket query program 1 is configured to form a station selection page 11 (see fig. 2) for the user to select a departure station and an arrival station, and is further configured to jump to a corresponding query list interface 17 (see fig. 3) according to the departure station and the arrival station selected by the user on the station selection page 11; the back-end server 2 is used for acquiring a departure site and an arrival site selected by the user on the site selection page 11, and returning a train ticket query list displayed on the query list interface 17 to the train ticket query program 1 according to the selected departure site and arrival site; the database module 3 is used for the staff to input the information of the local city, the information of the county city, the information of each site, configure the city to which each site belongs and establish the mapping relationship between the local city and the county city; the query module 4 is configured to query, from the database module 3, a grade city to which the current site belongs according to the departure site selected by the user, and query, according to the grade city obtained by the query, site information of a county-level city corresponding to the grade city.
When a prefecture level city corresponding to the departure point selected by the user has a prefecture level city site, the query module 4 acquires site information of the corresponding prefecture level city, and sends the acquired prefecture level city site and the corresponding prefecture level city site to the train ticket query program 1 on the user side and displays the site information in a set area of the query list interface 17. Both the prefecture-level city site and the county-level city site displayed in the set area of the query list interface 17 can be selected, and when a site different from the departure site selected by the user is selected in the set area of the query list interface 17, the train ticket query program 1 replaces the departure site selected by the user with the currently selected site and refreshes the train ticket query list displayed on the query list interface 17.
Referring to fig. 1, the query module 4 includes an information obtaining unit 41, where the information obtaining unit 41 is configured to obtain geographic location information of a user through the backend server 2, and in addition, geographic location information of each site is recorded in the database module 3. When a prefecture level city corresponding to the departure point inquired by the user has a prefecture level city site, the inquiry module 4 calculates the distance between the current position of the user and the corresponding prefecture level city site according to the geographical position information of the user, and sends the calculated distance and the corresponding site information together to the train ticket inquiry program 1 through the back-end server 2 and displays the distance and the corresponding site information in a corresponding area of the inquiry list interface 17. The process of calculating the distance between the current position of the user and each site by the query module 4 is one calculation node, and each calculation node is asynchronously executed on different threads, namely, the calculation of the distance between the current position of the user and each site is synchronously performed, so that the response efficiency of the system is greatly improved.
Referring to fig. 1 and 2, the site selection page 11 includes a site display area 13 for displaying sites, a site input area 12 for a user to input sites, and a candidate area 111 for displaying popular sites, where the site display area 13 includes a first-type site location 14, a second-type site location 15, and a third-type site location 16, which are arranged in sequence, one first-type site location 14 and one second-type site location 15 are provided, and a plurality of third-type site locations 16 are provided. The query module 4 queries the county-level city and the prefecture-level city corresponding to the geographic position information according to the geographic position information of the user acquired by the information acquisition unit 41, and when the geographic position information of the user corresponds to the county-level city and the corresponding county-level city has a train station, the query module sends a class of characteristic information of a site/city displaying the current county-level city at a class-one site position 14, a site/city displaying the prefecture-level city to which the current county-level city belongs at a class-two site position 15, and a site/city searched by the user in history at a class-three site position 16 to the train ticket query program 1 through the back-end server 2; when the geographic position information of the user does not correspond to the county level city or no train station exists in the current county level city, the query module 4 sends a site displaying the local level city to which the current county level city belongs at the first-class site position 14, and second-class feature information of sites/cities searched by the user in history is displayed at the second-class site position 15 and the third-class site position 16 to the train ticket query program 1 through the back-end server 2.
Referring to fig. 1 and 3, the query list interface 17 includes an information display area 171 for displaying departure site and arrival site information, a list display area 172 for displaying a train ticket query list, a first display area 18 for displaying a prefecture site and a prefecture site corresponding to a departure site selected by a user, and a second display area 19 for displaying a prefecture site and a prefecture site corresponding to an arrival site selected by a user, a set area of the query list interface 17 is the first display area 18, the first display area 18 and the second display area 19 may display a plurality of site information, and the site areas displayed by the first display area 18 and the second display area 19 are sequentially arranged from left to right in an order of increasing a distance from the user, each site information includes a site and corresponding distance information. When a prefecture-level city corresponding to the arrival site selected by the user has a prefecture-level city site, the query module 4 acquires site information of the corresponding prefecture-level city, and sends the acquired prefecture-level city site and the corresponding prefecture-level city site to the train ticket query program 1 on the user side through the back-end server 2 and displays the train ticket query program in the second display area 19. Both the prefecture-level city site and the county-level city site shown in the second display area 19 can be selected, and when a site different from the arrival site selected by the user is selected, the train ticket inquiring program 1 replaces the arrival site in the information display area 171 with the currently selected site, and refreshes the train ticket inquiring list displayed in the list display area 172 on the inquiry list interface 17.
Example two
Referring to fig. 4, a method for matching an optimal train scheme based on a system for matching an optimal train scheme in the first embodiment of the present invention includes the following steps:
s100, creating a city information database, and establishing a mapping relation between a local city and a county city;
s200, establishing a train station information database, wherein the train station information database comprises geographical position information of each station and a city to which each station belongs; only one city to which each site belongs, namely a county-level city or a ground-level city; it should be noted that the prefecture city in this embodiment includes a direct prefecture city;
s300, acquiring a departure site and an arrival site selected by a user; specifically, the method specifically comprises the following steps: acquiring geographical position information of a user and a departure site and an arrival site selected by the user;
s400, according to the starting site selected by the user, inquiring a grade city site and a county grade city site under a grade city to which the current starting site belongs based on the city information database and the train site information database, and calculating the distance between the current position of the user and the inquired grade city site and county grade city site;
s500, judging whether a county-level municipal site is inquired in the step S400; if yes, go to step S600; if not, go to step S700;
s600, displaying all the inquired county-level city sites and the prefecture-level city sites on an inquiry list interface 17 of the train ticket inquiry program 1 on the user side;
s700, displaying all inquired site of the grade city on an inquiry list interface 17 of the train ticket inquiry program 1 at the user side;
in step S600 and step S700, the stations displayed on the query list interface 17 of the user-side train ticket query program 1 include station name information and station distance information.
Referring to fig. 5, step S300 includes the following sub-steps:
s301, acquiring geographical position information of a user;
s302, inquiring a county-level city and a prefecture-level city corresponding to the geographic position information of the user; when a railway station exists in the current county-level city, the substep S303 is entered; when the geographic position information of the user does not correspond to a county-level city or no train station exists in the current county-level city, the substep S304 is carried out;
s303, displaying the county-level city sites which can be selected by the user and the prefecture-level city sites to which the current county-level city belongs on the site selection page 11;
s304, displaying the sites of the corresponding grade city which can be selected by the user on the site selection page 11;
s305, obtaining the departure site and the arrival site selected by the user.
Referring to fig. 3 and 4, step S400 specifically includes: according to a departure station and an arrival station selected by a user, inquiring a current departure station and a grade city station and a county grade city station under a grade city to which the arrival station belongs based on a city information database and a train station information database; in step S600 and step S700, all the sites queried according to the departure site selected by the user and all the sites queried according to the arrival site selected by the user are respectively displayed on the first display area 18 and the second display area 19 on the query list interface 17.
The embodiments of the present invention are all preferred embodiments of the present invention, and the scope of the present invention is not limited thereby, so: all equivalent changes made according to the structure, shape and principle of the invention are covered by the protection scope of the invention.

Claims (5)

1. A system for matching an optimal train solution, comprising:
the train ticket inquiring program (1) is used for forming a station selection page (11) for a user to select a departure station and an arrival station, and is also used for jumping to a corresponding inquiry list interface (17) according to the departure station and the arrival station selected by the user;
the back-end server (2) is used for acquiring a departure site and an arrival site selected by a user on the site selection page (11), and returning a train ticket query list displayed on the query list interface (17) to the train ticket query program (1) according to the selected departure site and arrival site;
the database module (3) is used for inputting the information of the local-level city and the information of the county-level city and establishing the mapping relation between the local-level city and the county-level city; the system is also used for inputting site information and configuring the city to which each site belongs; and (c) a second step of,
the query module (4) is used for querying the grade city to which the current site belongs from the database module (3) according to the starting site selected by the user, and querying the site information of the county-level city corresponding to the grade city according to the grade city obtained by querying;
when a prefecture-level city corresponding to a starting station selected by a user has a prefecture-level city site, the query module (4) acquires site information of the corresponding prefecture-level city, and sends the acquired prefecture-level city site and the corresponding prefecture-level city site to the train ticket query program (1) on the user side and displays the site information in a set area of a query list interface (17);
the regional city sites and the county city sites displayed in the set area of the query list interface (17) can be selected, and when one site displayed in the set area of the query list interface (17) and different from the departure site selected by the user is selected, the train ticket query program (1) replaces the departure site selected by the user with the currently selected site and refreshes a train ticket query list displayed on the query list interface (17);
the query module (4) comprises an information acquisition unit (41) for acquiring the geographical position information of the user, and the database module (3) records the geographical position information of each website; the inquiry module (4) is also used for calculating the distance between the current position of the user and the corresponding grade city site and the corresponding county city site according to the geographical position information of the user when the county city site exists in the grade city corresponding to the departure site inquired by the user, and sending the calculated distance to the train ticket inquiry program (1) and displaying the train ticket in the corresponding area of the inquiry list interface (17);
the site selection page (11) comprises a site display area (13) for displaying sites, a site input area (12) for a user to input the sites and a candidate area (111) for displaying popular sites, wherein the site display area (13) comprises a first-type site position (14), a second-type site position (15) and a third-type site position (16) which are sequentially arranged, one first-type site position (14) and one second-type site position (15) are arranged, and a plurality of third-type site positions (16) are arranged; the inquiry module (4) is used for inquiring a county-level city and a ground-level city corresponding to the geographic position information according to the geographic position information of the user acquired by the information acquisition unit (41), and when the geographic position information of the user corresponds to the county-level city and the corresponding county-level city has a train station, the rear-end server (2) is used for sending a train ticket inquiry program (1) to display a site/city of the current county-level city at the first-class site position (14), display a site/city of the ground-level city to which the current county-level city belongs at the second-class site position (15) and display first-class characteristic information of the sites/cities searched by the user in history at the third-class site positions (16); when the geographic position information of the user does not correspond to a county-level city or no train station exists in the current county-level city, the query module (4) sends a site displaying the local-level city to which the current county-level city belongs at the first-class site position (14), and second-class characteristic information of the sites/cities searched by the user in history is displayed at the second-class site position (15) and the third-class site position (16) to the train ticket query program (1) through the back-end server (2).
2. The system for matching best train scenario according to claim 1, wherein the process of the query module (4) calculating the distance between the user's current location and each station is one computing node, each of which is executed asynchronously on a different thread.
3. The system for matching an optimal train scheme as claimed in claim 1, wherein the search list interface (17) includes a first display area (18) for displaying a prefecture level city site and a prefecture level city site corresponding to a departure site selected by a user and a second display area (19) for displaying a prefecture level city site and a prefecture level city site corresponding to an arrival site selected by a user, the first display area (18) being a set area of the search list interface (17);
when a prefecture-level city corresponding to an arrival site selected by a user has a prefecture-level city site, the query module (4) acquires site information of the corresponding prefecture-level city, and sends the acquired prefecture-level city site and the corresponding prefecture-level city site to the train ticket query program (1) on the user side and displays the train ticket query program in the second display area (19);
and the local-level city site and the county-level city site shown in the second display area (19) can be selected, and when one site shown in the second display area (19) and a site different from the arrival site selected by the user are selected, the train ticket inquiry program (1) replaces the arrival site selected by the user with the currently selected site and refreshes a train ticket inquiry list displayed on the inquiry list interface (17).
4. A method of matching an optimal train scheme, characterized in that the method of matching an optimal train scheme is based on the system of matching an optimal train scheme of claim 1, comprising the steps of:
s100, creating a city information database, and establishing a mapping relation between a local city and a county city;
s200, establishing a train station information database, wherein the train station information database comprises geographical position information of each station and a city to which each station belongs;
s300, obtaining a departure site and an arrival site selected by a user;
s400, according to a departure station selected by a user, inquiring a grade city station and a county grade city station under a grade city to which the current departure station belongs based on the city information database and the train station information database;
s500, judging whether a county-level municipal site is inquired in the step S400; if yes, go to step S600; if not, go to step S700;
s600, displaying all inquired county-level city sites and prefecture-level city sites on an inquiry list interface (17) of a train ticket inquiry program (1) on a user side;
s700, displaying all inquired site of the grade city on an inquiry list interface (17) of a train ticket inquiry program (1) at a user side;
the step S300 specifically includes:
acquiring geographical position information of a user and a departure site and an arrival site selected by the user;
the step S400 specifically includes:
inquiring a grade city site and a county grade city site under a grade city to which the current departure site belongs according to the departure site selected by the user and based on the city information database and the train site information database, and calculating the distance between the current position of the user and the inquired grade city site and county grade city site;
in step S600 and step S700, the stations displayed on the query list interface (17) of the user-side train ticket query program (1) include station name information and station distance information;
the step S300 includes the following sub-steps:
s301, acquiring geographical position information of a user;
s302, inquiring a county-level city and a ground-level city corresponding to the geographic position information of the user; when a railway station exists in the current county-level city, the substep S303 is entered; when the geographic position information of the user does not correspond to a county-level city or no train station exists in the current county-level city, the substep S304 is carried out;
s303, displaying the sites of the county-level cities, which can be selected by the user, and the sites of the local cities to which the current county-level cities belong on a site selection page (11);
s304, displaying the site of the corresponding city grade which can be selected by the user on the site selection page (11);
s305, obtaining the departure site and the arrival site selected by the user.
5. The method for matching an optimal train scheme as claimed in claim 4, wherein the step S400 comprises:
according to a departure station and an arrival station selected by a user, inquiring a grade city station and a county grade city station under a grade city where the current departure station and the arrival station belong based on the city information database and the train station information database;
in step S600 and step S700, all the sites queried according to the departure site selected by the user and all the sites queried according to the arrival site selected by the user are respectively displayed in different areas on the query list interface (17).
CN201910928398.8A 2019-09-28 2019-09-28 System and method for matching optimal train scheme Active CN110750554B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910928398.8A CN110750554B (en) 2019-09-28 2019-09-28 System and method for matching optimal train scheme

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910928398.8A CN110750554B (en) 2019-09-28 2019-09-28 System and method for matching optimal train scheme

Publications (2)

Publication Number Publication Date
CN110750554A CN110750554A (en) 2020-02-04
CN110750554B true CN110750554B (en) 2022-07-12

Family

ID=69277295

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910928398.8A Active CN110750554B (en) 2019-09-28 2019-09-28 System and method for matching optimal train scheme

Country Status (1)

Country Link
CN (1) CN110750554B (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106802944A (en) * 2017-01-06 2017-06-06 中国东方航空股份有限公司 A kind of flight searching system and method
CN107392660A (en) * 2017-07-14 2017-11-24 深圳市活力天汇科技股份有限公司 A kind of budget fare lookup method
CN107844611A (en) * 2017-12-15 2018-03-27 携程旅游网络技术(上海)有限公司 Multiple spot to multiple spot flight search method, system, equipment and storage medium
CN108288209A (en) * 2017-12-26 2018-07-17 武汉长江通信智联技术有限公司 A kind of trip ticket-booking system and method based on wechat public platform

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090119001A1 (en) * 2007-11-07 2009-05-07 Public Routes. Com, Llc Method and system for finding multimodal transit route directions based on user preferred transport modes
US20160292594A1 (en) * 2015-03-30 2016-10-06 NIIT Technologies Ltd Facilitating transportation providers to make recommendations for passengers at different stages related to journeys

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106802944A (en) * 2017-01-06 2017-06-06 中国东方航空股份有限公司 A kind of flight searching system and method
CN107392660A (en) * 2017-07-14 2017-11-24 深圳市活力天汇科技股份有限公司 A kind of budget fare lookup method
CN107844611A (en) * 2017-12-15 2018-03-27 携程旅游网络技术(上海)有限公司 Multiple spot to multiple spot flight search method, system, equipment and storage medium
CN108288209A (en) * 2017-12-26 2018-07-17 武汉长江通信智联技术有限公司 A kind of trip ticket-booking system and method based on wechat public platform

Also Published As

Publication number Publication date
CN110750554A (en) 2020-02-04

Similar Documents

Publication Publication Date Title
KR102194962B1 (en) System for providing bigdata based artificial intelligence automatic allocation matching service using assignmanet problem and simulated annealing
CN109151168B (en) Switching method and device of riding codes, mobile terminal and readable storage medium
CN104854884B (en) Method and system for labeling visited locations based on contact information
JP6141393B2 (en) Method and apparatus for determining a target position
US10473475B2 (en) Method and apparatus for determining a location of a point of interest
CN101371515B (en) On-device mapping of WIFI hotspots via direct connection of WIFI-enabled and GPS-enabled mobile devices
US7263437B2 (en) Vehicle dispatching system and management server for the same
CA2602879A1 (en) System and method for real-time travel path prediction and automatic incident alerts
CN104751312B (en) A kind of logistics information of freight source active obtaining system and method based on LBS
CN105205092A (en) Tile-based distribution of searchable geospatial data to client devices
CN101371513A (en) Generating and dynamically updating databases of WIFI hotspots locations and performance metrics via location mappers
US8843480B2 (en) Server, information-management method, information-management program, and computer-readable recording medium with said program recorded thereon, for managing information input by a user
KR102301086B1 (en) Travel route recommendation system on big data and travel route recommendation method
CN102902689A (en) Application of matching method and system based on traveling line geometrical characteristics to social network
CN102917309A (en) Information push method and server
CN109885643A (en) A kind of position prediction algorithm and storage medium based on semantic track
Yang et al. A GIS‐based method to identify cost‐effective routes for rural deviated fixed route transit
CN105300398A (en) Method, device and system for acquiring site information
CN104751396A (en) Geographic position-based community service recommending method
CN110750554B (en) System and method for matching optimal train scheme
CN116823535B (en) Journey planning and intelligent navigation system based on multi-mode large model
CN102984644A (en) Location and information pushing method of terminal optical character reader (OCR)
CN102917310A (en) Information push system
JP2003196351A (en) Visiting spot extraction program and interest level evaluation program
CN110992081A (en) Data processing method and device for offline service provider

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant