WO2018130084A1 - 交通信息的获取方法、装置及非暂态计算机可读存储介质 - Google Patents

交通信息的获取方法、装置及非暂态计算机可读存储介质 Download PDF

Info

Publication number
WO2018130084A1
WO2018130084A1 PCT/CN2017/119673 CN2017119673W WO2018130084A1 WO 2018130084 A1 WO2018130084 A1 WO 2018130084A1 CN 2017119673 W CN2017119673 W CN 2017119673W WO 2018130084 A1 WO2018130084 A1 WO 2018130084A1
Authority
WO
WIPO (PCT)
Prior art keywords
city
destination
plan information
information
traffic
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.)
Ceased
Application number
PCT/CN2017/119673
Other languages
English (en)
French (fr)
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.)
Alibaba Group Holding Ltd
Original Assignee
Alibaba Group Holding 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 Alibaba Group Holding Ltd filed Critical Alibaba Group Holding Ltd
Publication of WO2018130084A1 publication Critical patent/WO2018130084A1/zh
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/40—Business processes related to the transportation industry

Definitions

  • the present invention relates to the field of intelligent transportation technologies, and in particular, to a method and device for acquiring traffic information and a transitory computer readable storage medium.
  • the main navigation software gives the following implementations:
  • the first type path solution under driving mode.
  • the second type large transportation schemes between cities, such as railway shifts, air shifts, and shipping shifts.
  • the first way is mainly for driving users.
  • the second option is more.
  • the user does not only have a big traffic problem between the destinations in another city that arrives from the origin of the current city, but also needs to solve how to arrive at the origin from the current city.
  • travel from one location in one city to one location in another is called point-to-point travel.
  • the travel planning software such as travel software, map software, navigation software, etc.
  • a user can obtain a transportation plan recommendation between cities using a travel software installed on a mobile terminal.
  • these trip planning applications cannot obtain the transportation plan from the location of the current city and the terminal, train station or long-distance station while obtaining the transportation plan between the cities, and can not obtain the transportation plan.
  • the terminal, train station or long-distance station arrives at the transportation plan between the destinations, and it is even more inefficient to integrate the urban transportation scheme and the inter-city transportation scheme to provide users with more A transportation plan for efficient point-to-point travel.
  • the embodiment of the present invention provides a method, a device, and a transitory computer readable storage medium for acquiring traffic information, which are used to solve the problem that the prior art cannot provide a more efficient point-to-point travel solution to the user.
  • the problem is a method, a device, and a transitory computer readable storage medium for acquiring traffic information, which are used to solve the problem that the prior art cannot provide a more efficient point-to-point travel solution to the user.
  • an embodiment of the present invention provides a method for acquiring traffic information, including:
  • the inter-city transportation plan information, the in-city in-city transportation plan information, and the in-city in-city transportation plan information are aggregated to obtain traffic plan information between the originating place and the destination.
  • the aspect as described above and any possible implementation manner further provide an implementation manner, according to the information about the inter-city transportation plan, obtaining the traffic plan information in the originating city and the traffic plan information in the destination city, including:
  • the aspect as described above and any possible implementation manner further provide an implementation manner, according to the departure time, obtaining information about the inter-city transportation plan of the destination city where the originating place is located and the destination city where the destination is located, including :
  • an implementation manner is further provided, and the available traffic plan information is filtered according to the departure time to obtain the inter-city transportation solution information, including:
  • the available traffic plan information that the remaining resources satisfy the predetermined condition is selected as the inter-city transportation plan information.
  • the receiving user provides an origin, a destination, and a departure time, further comprising: receiving, by the user, the origin and the destination The transit distance between the transfer places and the transfer place;
  • the inter-city transportation plan information of the destination city where the origin is located and the destination city where the destination is located including: obtaining the start according to the origin, the transit place, and the departure time
  • Obtaining information about the transportation plan in the originating city and the traffic plan information in the destination city according to the information of the inter-city transportation plan including: inter-city transportation plan information according to the transit city where the originating city and the transit place where the origin is located, The inter-city transportation plan information of the transit city where the transfer place is located and the destination city where the destination is located, obtain the traffic plan information in the originating city, the traffic plan information in the transit city, and the traffic plan information in the destination city;
  • the inter-city transportation plan information, the in-transit city intra-city transportation plan information, and the destination city intra-city transportation plan information including: the in-city urban transportation plan information, the transit city intra-city transportation plan information, and the destination city
  • the information of the internal transportation plan, the inter-city transportation plan information of the transit city where the originating place is located and the transit city where the transfer place is located, the transit city where the transfer place is located, and the inter-city transportation plan information of the destination city where the destination is located are aggregated. Traffic plan information between the origin and the destination.
  • an embodiment of the present invention provides a device for acquiring traffic information, including:
  • a receiving unit configured to receive an origin, a destination, and a departure time provided by the user
  • a pre-calculation unit configured to obtain, according to the departure time, information about inter-city transportation schemes of an origin city where the origin is located and a destination city where the destination is located;
  • a real-time computing unit configured to obtain, according to the inter-city transportation plan information, information about the transportation plan in the originating city and the traffic plan information in the destination city; and, the information about the inter-city transportation plan, and the transportation plan in the originating city
  • the information and the traffic plan information in the destination city are aggregated to obtain traffic plan information between the origin and the destination.
  • the available traffic plan information that the remaining resources satisfy the predetermined condition is selected as the inter-city transportation plan information.
  • the receiving unit is further configured to: receive a transit ground provided by the user between the origin and the destination, and the transit place Length of stay;
  • the pre-computing unit is configured to: obtain, according to the origin, the transit, and the departure time, information about inter-city transportation schemes of the originating city where the origin is located and the transit city where the transit location is located, And, according to the length of stay of the transit place, obtaining the inter-city transportation plan information of the transit city where the transit place is located and the destination city where the destination is located;
  • the real-time computing unit is specifically configured to: the inter-city transportation plan information of the transit city where the originating city and the transit place where the originating place is located, the transit city where the transit place is located, and the inter-city traffic of the destination city where the destination is located
  • the inter-city transportation plan information of the transit city where the originating place is located and the transit city where the transit place is located, the transit city where the transfer place is located, and the inter-city transportation plan information of the destination city where the destination is located are aggregated, and the origination is obtained. Traffic plan information between the ground and the destination.
  • the real-time computing unit is further configured to: perform traffic between the origin and the destination according to a specified sorting manner
  • the program information is sorted to obtain a sort result
  • the apparatus further includes: a first output unit for outputting some or all of the sorting results.
  • the receiving unit is further configured to acquire another destination provided by the user and a departure time of the transit place;
  • the real-time computing unit is further configured to obtain traffic plan information between the transit destination and the another destination according to a departure time of the transit place; and, the origin and the transit place
  • the traffic plan information between the two, the traffic plan information between the transfer destination and the other destination is aggregated, and the traffic plan information between the origin and the other destination is obtained.
  • the above-mentioned aspect and any possible implementation manner further provide an implementation manner, where the real-time computing unit is further configured to: send the origin to the other destination according to a specified sorting manner Sort the traffic plan information to get the sort result;
  • the method further includes: a second output unit, configured to output part or all of the sorting result.
  • An information application unit configured to navigate according to the obtained traffic plan information; and/or to generate an electronic map according to the obtained traffic plan information; and/or to perform travel planning according to the obtained traffic plan information; And/or for displaying, according to the obtained traffic plan information, a point of interest related to each destination, and additional service information showing the point of interest; and/or for sharing the obtained traffic plan information.
  • embodiments of the present invention provide a non-transitory computer readable storage medium storing computer instructions for causing the computer to perform the following processes:
  • the inter-city transportation plan information, the in-city in-city transportation plan information, and the in-city in-city transportation plan information are aggregated to obtain traffic plan information between the originating place and the destination.
  • the embodiment of the solution can determine the traffic plan information in the originating city and the traffic plan information in the destination city, and then the traffic plan in the originating city, the traffic plan in the destination city, and the inter-city transportation plan.
  • the aggregation process is carried out to obtain a transportation plan between the origin and the destination, and the transportation plan between the cities can be obtained together with the transportation plan in the current city and the transportation plan in the city, and the traffic in the city can be effectively carried out.
  • the integration of multiple solutions between the solution and the inter-city transportation solution provides users with a more efficient point-to-point transportation solution, which solves the problem of not providing more efficient point-to-point transportation to users in the prior art. The problem with the program.
  • FIG. 1 is a schematic flow chart of a method for acquiring traffic information provided by an embodiment of the present solution
  • FIG. 2 is a schematic flowchart of a method for implementing step 102 provided by an embodiment of the present solution
  • FIG. 3 is a diagram showing an example of an origin, a destination, an originating city, and a destination city provided by an embodiment of the present solution;
  • FIG. 4 is a schematic structural diagram of a method for acquiring traffic information provided by an embodiment of the present solution
  • FIG. 5a is an exemplary diagram of a graph model for inter-city traffic provided by an embodiment of the present solution
  • FIG. 5b is an exemplary diagram of a Beijing-Shanghai-Hangzhou graph model provided by an embodiment of the present invention.
  • FIG. 6 is another schematic flowchart of a method for acquiring traffic information provided by an embodiment of the present solution
  • FIG. 7 is a diagram showing an example of an origin, a transit, another destination, an originating city, a transit city, and another destination city provided by the embodiment of the present solution;
  • FIG. 8 is another schematic flowchart of a method for acquiring traffic information provided by an embodiment of the present solution.
  • FIG. 9 is a diagram showing an example of an origin, a transit, a destination, an originating city, a transit city, and a destination city provided by an embodiment of the present solution;
  • FIG. 10 is a schematic diagram of an overall interaction process in a method for acquiring traffic information provided by an embodiment of the present solution
  • FIG. 11 is another schematic diagram of an overall interaction process in a method for acquiring traffic information provided by an embodiment of the present solution
  • FIG. 12 is a functional block diagram of an apparatus for acquiring traffic information provided by an embodiment of the present invention.
  • FIG. 13 is a simplified block diagram of the server.
  • the word “if” as used herein may be interpreted as “when” or “when” or “in response to determining” or “in response to detecting.”
  • the phrase “if determined” or “if detected (conditions or events stated)” may be interpreted as “when determined” or “in response to determination” or “when detected (stated condition or event) “Time” or “in response to a test (condition or event stated)”.
  • the server obtains the originating city and the purpose After the city's inter-city transportation plan, the arrival area within the originating city is automatically determined according to the inter-city transportation plan, and the departure place within the destination city is automatically determined, and then the origin city and the arrival place in the originating city are obtained, and the origin city is obtained.
  • the transportation plan and, according to the destination and destination within the destination city, obtain the transportation plan within the destination city, and finally obtain the above-mentioned transportation plan within the origin city, the inter-city transportation plan of the originating city and the destination city, and the traffic within the destination city.
  • the solution is aggregated to obtain a transportation plan between the origin and the destination.
  • Mobile terminals can be like mobile phones, tablets, desktops, and the like.
  • the server can be integrated on the network side.
  • the method for obtaining the traffic information provided by the embodiment of the present invention may be executed in a server, and the process thereof is as shown in FIG. 1 , and includes:
  • the information of the inter-city transportation plan obtain the information of the transportation plan in the originating city and the traffic plan information in the destination city.
  • step 101 the embodiment of the solution provides two possible implementation manners, including:
  • the client installed in the mobile terminal can display an input interface to the user, through which the origin, destination and departure time of the user input are received, and then the mobile terminal inputs the origin and destination of the user.
  • the departure time is sent to the server so that the server can obtain the origin, destination and departure time provided by the user.
  • the second type the client installed in the mobile terminal can trigger the positioning module of the mobile terminal to perform positioning according to the user instruction, obtain the current geographic location of the user, and use the current geographic location of the user as the origin, or the client according to the geographic location.
  • the location provides the user with a number of candidate origins, with the candidate origin of the user selection as the origin.
  • the client may also provide the user with a number of candidate destinations, with the candidate destination selected by the user as the destination; or the client may also receive the destination entered by the user in the input box.
  • the client can display the calendar to the user and then receive the date selected by the user in the calendar as the departure time.
  • the mobile terminal transmits the origin, destination and departure time provided by the user to the server, so that the server can obtain the origin, destination and departure time provided by the user.
  • the foregoing origin is the real origin of the user
  • the destination is the real destination of the user
  • the departure time may be a certain day, or may be accurate to a specific moment of a certain day. No particular limitation is imposed.
  • step 102 the embodiment of the present solution provides a feasible implementation manner, as shown in FIG. 2, including:
  • FIG. 3 is an example diagram of an origin, a destination, an originating city, and a destination city provided by an embodiment of the present invention.
  • the server receives the mobile terminal. After the origin and destination, you can first identify the originating city to which the origin is located and identify the destination city to which the destination belongs.
  • the solid line shown in Figure 3 represents the real traffic plan
  • the dotted line represents the traffic plan to be finally obtained
  • the traffic plan information between the origin and the destination is obtained, but the destination is from the origin to the destination.
  • the real traffic plan includes: first executing the information of the in-town urban transportation plan between the originating place and the arrival place in the originating city, and then performing the inter-city transportation plan information of the originating city and the destination city, and finally performing the departure in the destination city. Information on the transportation plan within the destination city between the destination and the destination.
  • the user travels from “Zhongkun Building” to “Disney”, so it is necessary to obtain information on the transportation plan between “Zhongkun Building” and “Disney”.
  • the actual situation is to go from “Zhongkun Building” to “Beijing South Railway Station” ( From the “Beijing South Railway Station” to “Shanghai Hongqiao” (intercity transportation plan information), and finally “Shanghai Hongqiao” to “Disney” (in the destination city traffic plan information).
  • the server includes an input interface, a pre-computation engine, a traffic search engine, a real-time computing engine, and Output Interface.
  • the input interface and the output interface are used for communication between the server and the mobile terminal, the input interface is used for receiving information output by the mobile terminal, and the output interface is used for outputting information to the mobile terminal.
  • the Pre-computation Engine pre-sets a Point of Interest (POI) database, a city database, an airplane's flight library, a long-distance car's train library, a train's train library, and a historical information base.
  • Traffic search engines include large traffic search engines and small traffic search engines.
  • the input interface in the server may be used to receive the origin and destination sent by the mobile terminal, and then output to the pre-calculation engine.
  • the pre-calculation engine can perform an approximate matching in the point of interest database according to the latitude and longitude information of the origin, so that the closest point of interest to the origin can be identified, and then the query is performed in the city database according to the point of interest to obtain the The city to which the point of interest belongs, that is, the city to which the origin is originated, is called the originating city.
  • the approximate matching can be performed in the point of interest database according to the latitude and longitude information of the destination, so that the closest point of interest to the destination can be identified, and then the query is performed in the city database according to the point of interest to obtain the point of interest.
  • the city to which it belongs that is, the city to which the destination belongs, is called the destination city.
  • the pre-calculation engine may also perform matching in the city database according to the latitude and longitude information of the origin, so that the city to which the origin is originated may be identified.
  • the pre-calculation engine can also match in the city database according to the latitude and longitude information of the destination, so that the city to which the destination belongs can be identified.
  • the point of interest database is used to store points of interest within a certain geographic range, and each point of interest includes some description information, such as latitude and longitude information, categories, and names of the points of interest. Therefore, the closest point of interest can be found from the point of interest database by given latitude and longitude information.
  • the city database is used to store specific geographic information of each city, such as the points of interest in each city and the latitude and longitude range of each city. Therefore, the city database can identify the city to which the given point of interest belongs, or through the city database. Identify the city to which a given latitude and longitude belongs. It can be understood by those skilled in the art that the cities involved in the embodiments of the present invention may belong to the same area, or may belong to different areas, and the embodiment of the present solution does not specifically limit this.
  • the inquiring is performed according to the originating city and the destination city in the historical information database. Whether the information about the available transportation scheme between the originating city and the destination city has been calculated before; if it has been calculated, the previously calculated result can be directly obtained from the historical information base, that is, the available transportation scheme between the originating city and the destination city. Information; otherwise, if not calculated, the pre-calculation engine calculates the available traffic plan information between the originating city and the destination city, and then saves the calculation result to the historical information base to update the historical information base.
  • a graph model may be preset in the pre-calculation engine, and the graph model may be pre-generated and configured in the pre-calculation engine.
  • the graph model can be used in the precomputation engine to calculate the available traffic plan information between the originating city and the destination city.
  • FIG. 5a is an exemplary diagram of a graph model for inter-city traffic provided by an embodiment of the present embodiment
  • the graph model includes nodes and connecting lines, and one node represents a city.
  • the connection between the nodes indicates whether there is traffic between the cities to connect, that is, whether it is directly reachable. If there is a connection line between the two nodes, it means that the traffic between the two nodes is connected, directly reachable. If not, the indication is There is no traffic connection between the two nodes, it is not directly reachable, and it is indirect.
  • the direction of the arrow of the connecting line is used to indicate the direction directly accessible.
  • each node can label the corresponding attribute information of the node, such as name, level and label.
  • the connection line between each two nodes can also mark the corresponding attribute information of the connection line, such as traffic type, distance and duration.
  • the graph model also includes sub-nodes (not shown) of the above nodes, which represent points of interest of a traffic type in the city, such as airports, train stations, and long-distance stations.
  • the connection between the child nodes indicates whether there is traffic between the points of interest to connect, that is, whether it is directly reachable. If there is a connection line between the child nodes, it means that there is a traffic connection between the two child nodes. Directly reachable. If not, it means that there is no traffic connection between the two child nodes, which cannot be directly reachable, and is indirectly reachable. .
  • the direction of the arrow of the connecting line is used to indicate the direction directly accessible.
  • each child node can also mark the corresponding attribute information of the node, such as name, level, and label.
  • the connection line between each two child nodes can also mark the corresponding attribute information of the connection line, such as the type of vehicle, distance and duration.
  • FIG. 5b is an example diagram of a Beijing-Shanghai-Hangzhou graph model provided by the embodiment of the present invention.
  • the city “Beijing” includes a traffic type interest point “Beijing North Railway Station” and “ “Beijing West Railway Station”, “Beijing South Railway Station” and “Capital Airport”, "Beijing North Railway Station” and “Beijing West railway Station” have a connecting line, indicating that there is direct access between the two; "Beijing North Railway Station” and "Beijing South There is a connecting line between the stations, which means that there is direct connection between the two; there is a connecting line between "Beijing West railway Station” and “Beijing South railway Station", indicating that there is direct connection between the two; "Beijing North Railway Station” and “Capital Airport” There is a connecting line between them, indicating that there is direct connection between the two; there is a connecting line between "Beijing West railway Station”
  • the pre-calculation engine inputs the originating city, the destination city, and the screening condition into the above graph model, and the graph model can be calculated based on the shortest path algorithm (such as the Dijkstra Dijkstra algorithm or the shortest path Shortest algorithm).
  • the candidate transportation plan information between the city and the destination city may include traffic plan information that needs to be transferred, and may also include traffic plan information that does not need to be transferred, and the traffic plan information that can be directly reached.
  • the graph model uses the input screening conditions to filter the candidate traffic plan information, and finally outputs the reachable traffic plan information between the originating city and the destination city obtained after the screening.
  • the pre-calculation engine may also input only the originating city and the destination city into the above graph model, and the graph model calculates candidate traffic plan information between the originating city and the destination city, and outputs candidate traffic plan information, and the pre-calculation engine utilizes the screening.
  • the condition selects the candidate traffic plan information output by the graph model, and finally obtains the available traffic plan information between the originating city and the destination city.
  • the candidate traffic plan information may include one or more of the following information: origin, origin city, destination, destination city, traffic type, shift And time. If there is indirectly reachable traffic plan information, the candidate traffic plan information or the reachable traffic plan information may further include a transit point quantity and detailed information, and the detailed information may include an origination place, an originating city, and a departure city in each section of the transportation plan. Destination and destination city, traffic type, shift and duration.
  • the available traffic plan information may include one or more of the following information: origin of the traffic plan information, origin city, destination, destination city, traffic type, shift, and duration. If there is indirectly reachable traffic plan information, the available traffic plan information may also include the number of transfer points and detailed information, which may include the origin, origin, destination, destination city in each transport plan, Traffic type, shift and duration.
  • the screening conditions may include, but are not limited to, at least one of the following: direction, time, and number of transit points of the candidate traffic plan information.
  • the direction of the candidate traffic plan information needs to be consistent with the direction of the originating city to the destination city, and the information of the inconsistent candidate traffic plan needs to be screened out.
  • the time between the originating city and the destination city in the candidate traffic plan information is required to not exceed a specified time threshold, and if it is exceeded, the candidate traffic plan information needs to be screened out.
  • the number of transit points in the screening condition that requires candidate traffic plan information cannot exceed a specified number threshold, and if exceeded, the candidate traffic plan information needs to be screened out.
  • the cities involved in the city and the long-distance trains are marked with the connection lines between the cities in the figure, and the traffic types corresponding to the connecting lines can also be marked. In this way, an inter-city traffic reachable map can be generated.
  • This embodiment of the scheme is called a graph model.
  • the pre-computing engine After obtaining the available transportation plan information between the originating city and the destination city, the pre-computing engine further needs to filter the available traffic plan information according to the departure time, and obtain the inter-city transportation plan information of the originating city and the destination city. .
  • the pre-calculation engine may obtain the remaining resources corresponding to the available traffic plan information according to the departure time, and then select the available traffic plan information that the remaining resources meet the predetermined condition, as the originating city and the destination city. Intercity transportation plan information.
  • the pre-calculation engine sends the departure time and available traffic plan information to a large traffic search engine in the traffic search engine, and the large traffic search engine separately performs the flight ticket search according to the departure time and the available traffic plan information.
  • train ticket search and long-distance ticket search obtain the remaining resources of the airline ticket, the remaining resources of the train ticket and the remaining resources of the long-distance ticket, these remaining resources are the remaining resources corresponding to the available traffic plan information, and return the obtained remaining resources to the pre-calculation engine. It can be understood that the remaining resources here specifically refer to the remaining votes.
  • the large traffic search engine can call the interface of the airline ticket database, conduct the flight ticket search, and can call the interface of the train ticket database, conduct train ticket search, and call the interface of the long-distance bus database to search for long-distance tickets to obtain corresponding Search results.
  • the pre-calculation engine receives the remaining resources corresponding to the available traffic plan information from the large traffic search engine, the available traffic plan information that the remaining resources meet the predetermined condition is selected as the inter-city traffic plan information of the originating city and the destination city.
  • the predetermined condition may be that the remaining resources are greater than the specified number, and the specified number may be determined according to the number of traveled by the user, for example, the specified number may be greater than or equal to the number of traveled.
  • the remaining resource of the available traffic plan information 1 is 5, indicating the remaining 5 tickets
  • the remaining resource of the available traffic plan information 2 is 1, indicating the remaining one ticket
  • the remaining resource of the available traffic plan information 3 is 10, indicating the remaining 10 Tickets.
  • the number of trips given by the user is 3, so the pre-calculation engine determines that the specified number is 3 according to the number 3, and then screens out the available traffic plan information 2 in the available traffic plan information 1 to 3, and retains the available traffic plan information 1 and 3, Since the remaining resources of the available traffic plan information 2 are 1, the predetermined condition that the remaining resources are greater than 3 is not satisfied.
  • step 103 the embodiment of the present solution provides a feasible implementation manner, including:
  • the user needs to go from the originating city to the destination city, and the real traffic route of the user is to first go to the point of interest of the vehicle in the originating city from the originating place in the originating city ( The embodiment of the solution is called the arrival point in the originating city, and then the vehicle is taken to the destination city from the point of interest, and finally the point of interest in the destination city where the vehicle is docked (this embodiment is called the destination city in the destination). Then, the user also needs to go from the point of interest in the destination city to the destination in the destination city. Therefore, the essence of the inter-city transportation scheme information of the originating city and the target city obtained is one or more departures in the originating city. A collection of traffic plan information between the ground and one or more destinations within the destination city. Therefore, the real-time calculation engine can determine the departure place within the originating city and the destination city within the origin city according to the inter-city transportation plan information.
  • the pre-calculation engine outputs the obtained inter-city transportation plan information of the originating city and the target city to the real-time computing engine, and the number of the inter-city transportation plan information may be one or more.
  • the real-time calculation engine can obtain the starting point in the inter-city transportation plan information, use it as the arrival place in the originating city, and obtain the end point in the inter-city transportation plan information, and take it as the purpose. The starting point within the city.
  • the originating city is Beijing
  • the destination city is Shanghai
  • the inter-city transportation plan information from Beijing to Shanghai may include: traffic plan information 1: Beijing South Railway Station ⁇ Shanghai Hongqiao; traffic plan information 2: Capital Airport ⁇ Pudong Airport. It can be seen that the traffic plan information from Beijing to Shanghai is a large transportation plan between cities.
  • the essence is the traffic plan information from the starting point of “Beijing South Railway Station” to the end point “Shanghai Hongqiao”, and the starting point “Capital Airport” to the end point “Pudong Airport” "Traffic plan information.” If the traffic plan information 1 is used, the user needs to arrive at the "Beijing South Railway Station” from the origin in the originating city "Beijing”, then take the high-speed train to Shanghai, get off at "Shanghai Hongqiao", and then in the destination city “Shanghai” From “Shanghai Hongqiao” to the destination.
  • the user needs to arrive at the “Capital Airport” from the origin in the originating city “Beijing”, then take the flight to “Pudong Airport” and then from the “Shanghai” in the destination city. Pudong Airport” goes to the destination.
  • the originating place in the originating city and the starting place in the destination city can be automatically identified, and then the automatic identification is utilized.
  • the calculation of the subsequent transportation plan information is completed in the departure place in the originating city and the departure place in the destination city.
  • the embodiment of the solution avoids the user manually inputting the arrival place in the originating city and the departure place in the destination city, which can reduce user operations, improve information acquisition efficiency, and improve user experience.
  • the real-time calculation engine determines the traffic plan information in the originating city according to the arrival place in the originating place and the originating city, and according to the departure place in the destination city. And the destination to determine the transportation plan information within the destination city.
  • the real-time calculation engine may send the origin in the originating city and the arrival location in the originating city to the small traffic search engine in the traffic search engine, the small traffic search engine.
  • the origination place in the originating city and the arrival place in the originating city real-time search is performed, the traffic plan information in the originating city is obtained, and the traffic plan information in the originating city is returned to the real-time calculation engine.
  • the number of traffic plan information in the originating city may be one or more.
  • the traffic plan information in each originating city may include, but is not limited to, the following information: the type of traffic, the estimated duration of the traffic plan information in the originating city, the route, and the price.
  • the real-time calculation engine can send the departure place and destination in the destination city to the small traffic search engine in the traffic search engine, and the small traffic search engine performs real-time according to the departure place and destination in the destination city. Search, obtain the traffic plan information in the destination city, and return the traffic plan information in the destination city to the real-time calculation engine.
  • the traffic plan information in each destination city may include, but is not limited to, the following information: the type of traffic, the estimated duration of the traffic plan information in the destination city, the route, and the price.
  • the traffic type in the above-mentioned origin city or destination city may include a subway, a bus, or a taxi (including a special train, an express train, or a general taxi), etc., and those skilled in the art may understand that the embodiment of the present invention does not specifically limit this.
  • step 104 the embodiment of the present solution provides a feasible implementation manner, including:
  • the real-time calculation engine can aggregate the obtained inter-city transportation plan information, the in-city urban transportation plan information, and the destination city internal traffic plan information, and obtain the traffic plan information between the originating place and the destination.
  • the real-time calculation engine may match the starting point in each inter-city transportation solution information with the arrival location in the originating city in each of the initiating urban traffic plan information, if they match,
  • the intercity traffic plan information can be aggregated with the traffic plan information in the originating city.
  • each inter-city transportation plan information can be matched with the departure place in the destination city in the traffic plan information in each destination city. If they match, the inter-city The traffic plan information can be aggregated with the traffic plan information in the destination city.
  • the information of the inter-city transportation plan can be aggregated with the information of the traffic plan in the originating city, or the information of the traffic plan in the destination city can be aggregated at the same time.
  • the information of the traffic plan obtained after the inter-city traffic plan information is aggregated is the origin and the Traffic plan information between destinations.
  • the embodiment of the solution further provides an optional step, which comprises: outputting part or all of the traffic plan information between the origin and the destination.
  • the real-time computing engine of the server may pass some or all of the traffic plan information through the output interface of the server after obtaining the traffic plan information between the origin and the destination.
  • the output is output to the mobile terminal, so that the mobile terminal can further provide the received traffic plan information to the user.
  • the real-time calculation engine may sort the obtained traffic plan information between the origin and the destination according to a specified sorting manner, and then output the top ranked traffic plan information in the sorting result through the output.
  • the interface outputs to implement traffic plan information between the origin and destination of the output portion.
  • traffic plan information between multiple aggregated origins and destinations may be obtained.
  • the real-time calculation engine can filter and/or sort the obtained traffic plan information between the origin and the destination according to the specified sorting/filtering manner, and then output the sorting result through the output interface to realize the output origin.
  • Traffic plan information with the destination may be a sorting manner preset by the user, or may be a sorting manner temporarily selected by the user, or may be a default sorting manner.
  • the filtering method can be a performance threshold or a threshold range set by the user or the system for excluding scenario information that does not meet the expected performance.
  • the screening method can be that the price is within the development interval and the time is not longer than the development time.
  • the sorting method may be sorted according to the price from low to high, so that the lowest-priced traffic plan information can be recommended to the user as the optimal traffic plan information.
  • the sorting manner may also be sorted by time from short to long, such that the traffic plan information with the least time consumption is recommended to the user as the optimal traffic plan information.
  • the above sorted and/or filtered output may be (not exhaustive and non-limiting):
  • the aggregated traffic plan information is filtered and/or sorted and output, and the user can be provided with optimized integrity multi-level point-to-point traffic plan planning in one station, eliminating the user's Switching and manual statistics between multiple applications or query tools greatly improve user convenience.
  • the embodiment of the solution further provides an optional step, which is applied to the case where the destination is transit, as shown in FIG. 6, including:
  • the mobile terminal can acquire the departure time of another destination and the transit place, and then send the departure time of the other destination and the transit place to the input interface of the server, so that the server can acquire another Departure time for a destination and transit.
  • the departure time implementation scheme for the mobile terminal to acquire another destination and transit location may include, but is not limited to, the client installed in the mobile terminal may display an input interface to the user, through which another destination and transit destination input by the user is received. Departure time.
  • FIG. 7 is an example diagram of an origin, a transit point, another destination, an originating city, a transit city, and another destination city provided by the embodiment of the present embodiment.
  • the above-mentioned transit place is shown in FIG. 7 . It is the real origin of the user when going to another destination, at this time, the other destination is the user's next destination.
  • the departure time of the transit place may be a certain day, or may be accurate to a specific time of a certain day, and the embodiment of the present embodiment does not specifically limit this.
  • the server needs to obtain the inter-city transportation plan information (shown by the dotted line in Figure 7) of the transit city and the city of another destination (referred to as another destination city), and then determine the transit city in accordance with the inter-city transportation plan information.
  • another destination city the transit point within the transit city and the departure point in another destination city, and then obtain the intra-city transportation plan information between the transit place and the transit point within the transit city (shown by the solid line in Fig. 7), and Obtaining information about the intra-city transportation plan between the destination and the other destination in another destination city (shown by the solid line in Fig. 7), and finally synthesizing the information of the transportation plan between the two cities and the information of the inter-city transportation plan. Get traffic plan information between the transit point and another destination.
  • the server obtains an implementation scheme of the traffic plan information between the transit destination and another destination according to the departure time, and obtains the traffic plan information between the origin and the destination.
  • the implementation principle is the same, so I won't go into details here.
  • the server may aggregate the traffic plan information between the originating place and the transit place with the traffic plan information between the transfer destination and another destination to obtain the origin to another Traffic plan information between destinations.
  • the aggregation mode aggregates the intra-city transportation plan information between the originating place and the destination in the originating city and the inter-city transportation plan information of the originating city and the destination city, or the city of the originating city and the destination city.
  • the principle of aggregation of the traffic plan information between the origin and the destination in the destination city is the same, and those skilled in the art can understand that it will not be described here.
  • the server may output some or all of the origin to another destination to the mobile terminal through its own output interface. Traffic plan information between the two, so that the mobile terminal further provides the traffic plan information to the user.
  • the obtained traffic plan information between the originating destination and another destination may be sorted in a sorting manner, and then the top ranked traffic plan information in the sorting result is output through the output interface. To achieve traffic plan information between the origin of the output portion and another destination.
  • the real-time computing engine may sort the obtained traffic plan information between the originating destination and another destination in a sorting manner, and then output the sorting result through the output interface to implement outputting all. Traffic plan information from origin to another destination.
  • the sorting method may be sorting according to the price from low to high, or it may be sorted according to the time from short to long.
  • the two sorting methods are only examples, and are not used to limit the sorting method mentioned in the scheme. .
  • the other destination may be a destination in a city other than the originating city and the destination city, or another destination may be the same as the origin (ie, the user) From the origin to the destination, and then from the destination back to the origin, or another destination can also belong to the same city as the origin (the user goes from the origin to the destination, then from the destination) Go back to the city where the origin was issued).
  • the user travels from the originating "Zhongkun Building” to the destination “Disney”, and then the destination “Disney” goes to another destination “West Lake”. Or, for example, the user travels from the originating "Zhongkun Building” to the destination “Disney”, and then from the destination "Disney” to another destination “Zhongkun Building”. Or, for example, the user travels from the originating "Zhongkun Building” to the destination “Disney”, and then the destination “Disney” to another destination, such as "Hua Qing" in the city of "Beijing" Jiayuan” community.
  • the solution embodiment of the present solution further includes another feasible implementation solution, as shown in FIG. 8, including:
  • the inter-city transportation plan information of the transit city where the originating city where the origin is located and the transit city where the transit place is located obtain the information of the inter-city transportation plan of the destination city where the transfer place is located, Traffic plan information, traffic plan information within the transit city, and traffic plan information within the destination city.
  • the information of the transportation plan in the city, the information of the transportation plan in the transit city, the information of the transportation plan in the destination city, the information of the inter-city transportation plan of the transit city where the originating place is located and the transit city where the transit place is located, and the transfer place are aggregated to obtain traffic plan information between the origin and the destination.
  • steps 801 to 804 may be another implementation of steps 101 to 104, respectively.
  • the mobile terminal can also acquire the departure time of the transit ground and the transit ground, and then send the departure time of the transit ground and the transit ground to the input interface of the server, so that the server can obtain the transit ground and the transit. Departure time of the ground.
  • the departure time implementation scheme of the mobile terminal acquiring the transit ground and the transit ground may include, but is not limited to, the client installed in the mobile terminal may display an input interface to the user, and receive the departure time of the transit ground and the transit destination input by the user through the input interface.
  • FIG. 9 is an example diagram of an origin, a transit destination, a destination, an originating city, a transit city, and a destination city provided by the embodiment of the present invention.
  • the departure time of the transit ground may be One day, or may be accurate to a specific moment of a certain day, the embodiment of the present embodiment does not specifically limit this.
  • the traffic plan information in the transit city may include two pieces of traffic plan information, one of which is a city between the departure place and the transit place in the transit city obtained according to the inter-city transportation plan information of the originating city and the transit city.
  • the internal traffic plan information, and the other section is the intra-city traffic plan information between the transit land in the transit city and the arrival place in the transit city according to the information of the inter-city transportation plan of the transit city and the destination city.
  • Program information that is, information on Tianjin's transportation plan between “Tianjin Railway Station” and “Tianjin Eye”. Then, after visiting the “Eye of Tianjin”, the user needs to fly to Shanghai immediately. Therefore, it is necessary to obtain information on another transportation plan in the transit city “Tianjin”, namely “Tianjin Eye” and “Tianjin Binhai International Airport”. Inter-city transportation plan information in Tianjin, therefore, when there is a transit land, the intra-city transportation plan information in the transit city will involve two itineraries.
  • the server needs to obtain the inter-city transportation plan information of the transit city where the originating place is located and the transit city where the transit place is located, and obtain the transit city where the transit place is located and the destination city where the destination is located.
  • Inter-city transportation plan information (both shown in dotted lines in Figure 9). Then, according to the inter-city transportation plan information of the transit city where the originating place is located and the transit city where the transit place is located, the information of the intra-city traffic plan between the originating place and the arriving place in the originating city is determined, and the transit city is determined. Information on the transportation plan within the transit city between the starting point and the transit point.
  • the traffic plan information of the three cities and the traffic plan information of the two cities are aggregated, and the traffic plan information between the origin and the destination when there is a transit land is obtained.
  • the server obtains an implementation scheme of the traffic plan information between the originating place and the transit place according to the departure time, and an implementation scheme of the traffic plan information between the transit destination and the destination,
  • the implementation principle of the traffic plan information between the origin and the destination is the same as that of the above-mentioned when there is no transit, and those skilled in the art can understand that no further details are provided here.
  • the server may aggregate the three intra-city traffic plan information and the two inter-city traffic plan information to obtain the traffic plan information between the origin and the destination.
  • the principle of the aggregation of the traffic plan information between the origin and the destination in the destination city is the same as that of the destination city, and those skilled in the art can understand that no further details are provided here.
  • the server may output some or all of the traffic from the origin to the destination to the mobile terminal through its own output interface.
  • the solution information is such that the mobile terminal further provides the traffic plan information to the user.
  • the obtained traffic plan information between the origin and the destination may be sorted according to a sorting manner, and then the top ranked traffic plan information in the sorting result is output through the output interface to implement The traffic plan information between the origin of the output part and the destination.
  • the real-time computing engine may sort the obtained traffic plan information between the origin and the destination according to the sorting manner, and then output the sorting result through the output interface to realize all the originating outputs. Traffic plan information between the destination and the destination.
  • the sorting method may be sorting according to the price from low to high, or it may be sorted according to the time from short to long.
  • the two sorting methods are only examples, and are not used to limit the sorting method mentioned in the scheme. .
  • the embodiment of the present solution provides the application mode of the traffic plan information, and the embodiment provides the following application modes, including:
  • the first type navigation based on the obtained traffic plan information.
  • the third type travel planning based on the obtained traffic plan information.
  • the fifth type sharing the obtained traffic plan information.
  • the navigation may be performed according to the selected traffic plan information, where the navigation includes: actual navigation or simulated navigation, and further, the actual navigation includes: The user provides the actual navigation service, and the simulated navigation includes: providing the user with a simulated driving service, so that the user can intuitively obtain the specific information of the traffic plan information.
  • the electronic map may be generated according to the traffic plan information, where the electronic map includes the labeling of the traffic plan information, and the label allows the user to intuitively obtain the traffic plan information. Relevant circumstances, such as: the total mileage of the transportation plan information, the driving distance of each road section, the weather of each city or each location.
  • the road information in each city in the traffic plan information may also be displayed according to the traffic plan information, where the road information includes: the type of road to be passed (eg, viaduct, high speed, The user can determine whether or not to refer to the transportation plan information based on the displayed road information, such as the road, the road in the cell, the width information of the road to be passed, and the environmental information of the road to be passed.
  • the type of road to be passed e.g, viaduct, high speed
  • the destination-related points of interest include: a point of interest within a specified range of the destination and a point of interest on the road between the two destinations, and the types of the points of interest may specifically include: restaurants, parking lots, shopping malls, convenience stores, playgrounds And hotel, etc., and provide additional service information of the point of interest, such as consumption information of the point of interest (average consumption information, consumption information per unit time), whether the point of interest has a preferential activity, address information of the point of interest, and the like.
  • the traffic plan information can also be shared, so that other users can obtain the traffic plan information and increase the interaction mode between the users.
  • FIG. 10 is a schematic diagram of the overall interaction process in the method for acquiring traffic information provided by the embodiment, as shown in FIG. 10 .
  • Methods can include:
  • the user inputs, on the mobile terminal, an origination time, a transit destination, a destination, a departure time of the origination place, and a stay duration of the transit place.
  • the mobile terminal sends the departure time, the transit destination, the destination, the departure time of the origination place, and the stay duration of the transit place input by the user to the server.
  • the server identifies a point of interest that matches the origin (the present embodiment is referred to as an originating point of interest, which corresponds to the origin in the above embodiment), and a point of interest that matches the transit place (this embodiment) It is called a transit interest point, which corresponds to the transit point in the above-described implementation, and a point of interest that matches the destination (this embodiment is called a destination point of interest, which corresponds to the destination in the above embodiment).
  • the server identifies, according to the identified points of interest, the originating city to which the origin is originated, the transit city to which the transit place belongs, and the destination city to which the destination belongs.
  • the server generates two five-tuples according to the departure time, the transit time of the transit place, the originating interest point, the transit interest point, the destination interest point, the originating city, the transit city, and the destination city, including:
  • Wuyuan 2 Departure time of transit interest points - transit interest points - transit cities - destination cities - destination points of interest
  • the server calculates traffic plan information between the originating point of interest and the transit point of interest according to the element in the quintuple 1.
  • the server calculates the inter-city transportation plan information of the originating city and the transit city according to the departure time.
  • the server determines the arrival place in the originating city and the departure place in the transit city according to the inter-city transportation plan information 1.
  • the server calculates the intra-city transportation plan information 2 between the originating point of interest and the arriving place in the originating city, and calculates the intra-city transportation plan information 3 between the departure place and the transit point of interest in the transit city.
  • the server aggregates the inter-city transportation plan information 1, the intra-city transportation plan information 2, and the intra-city transportation plan information 3, and obtains the traffic plan information A between the originating point of interest and the transit point of interest.
  • the server calculates traffic plan information between the transit point of interest and the target point of interest according to the element in the quintuple 2.
  • the server calculates the departure time of the transit interest point according to the arrival time and the stay duration of the transit interest point, and calculates the inter-city transportation plan information of the transit city and the destination city according to the departure time of the transit interest point.
  • the server determines the arrival place in the transit city and the departure place in the destination city according to the inter-city transportation plan information 4.
  • the server calculates the intra-city transportation plan information 5 between the transit interest point and the arrival place in the transit city, and calculates the intra-city transportation plan information 6 between the departure place and the destination interest point in the destination city.
  • the server aggregates the inter-city transportation plan information 4, the intra-city transportation plan information 5, and the intra-city transportation plan information 6 to obtain the transportation plan information B between the transit interest point and the destination interest point.
  • the server aggregates the traffic plan information A between the originating point of interest and the transit point of interest, and aggregates the traffic plan information B between the transit point of interest and the destination point of interest to obtain a relationship between the originating point of interest and the destination point of interest. Traffic plan information C.
  • the server sorts the traffic plan information C between the originating point of interest and the target point of interest according to a specified sorting manner, and obtains the sorting result.
  • the server outputs, according to the sorting result, part or all of the traffic plan information between the originating interest point and the target interest point to the mobile terminal.
  • the mobile terminal displays, to the user, traffic plan information between the originating interest point and the target interest point received from the server.
  • the embodiment of the present solution further provides a specific implementation manner for the overall process.
  • the origin is “Zhongkun Building” (Beijing)
  • the destination is Disney (Shanghai)
  • the departure is The date is November 11th as an example to illustrate the implementation of the transportation plan information between “Zhongkun Building” and “Disney”.
  • FIG. 11 is another schematic diagram of the overall interaction process in the method for acquiring traffic information provided by the embodiment of the present invention. As shown in FIG. 11 , the method may include:
  • the mobile terminal receives the current location of the user input "Zhongkun Building", the destination "Disney” (Shanghai), and the departure date "November 11".
  • the mobile terminal sends the current “Zhongkun Building”, the destination “Disney”, and the departure date “November 11” to the server.
  • the server identifies the originating city to be "Beijing” according to the originating "Zhongkun Building", and identifies the destination city to be Shanghai according to the destination "Disney”.
  • server generation quintuple November 11 - Zhongkun Building - Beijing - Shanghai - Disney.
  • the server first obtains candidate traffic plan information between Beijing and Shanghai according to the five-tuple and uses the graph model shown in FIG. 5b.
  • the server inputs “Beijing” and “Shanghai” into the graph model.
  • the graph model is calculated, it can be found by taking the high-speed rail or aircraft from Beijing to Shanghai to obtain the following candidate traffic plan information:
  • Candidate transportation plan information 1 Beijing South Railway Station (Beijing) ⁇ Shanghai Hongqiao (Shanghai) high-speed rail G5 duration 4 hours 55 minutes
  • Candidate Traffic Plan Information 5 Capital Airport (Beijing) ⁇ Pudong Airport (Shanghai) Aircraft CA1501 Duration: 2 hours and 10 minutes
  • Candidate Traffic Plan Information 6 Capital Airport (Beijing) ⁇ Pudong Airport (Shanghai) Aircraft MU8571 Duration: 2 hours and 10 minutes
  • the server may further filter the candidate traffic plan information according to the duration.
  • the duration threshold is 10 hours, so the candidate traffic plan information 3 and 4 are screened, and the candidate traffic plan information 1, 2, 5, and 6 are selected.
  • traffic options 1, 2, 3 and 4 can be used.
  • Available transportation plan information 3 Capital Airport (Beijing) ⁇ Pudong Airport (Shanghai) aircraft CA1501 duration 2 hours 10 minutes
  • Available transportation plan information 4 Capital Airport (Beijing) ⁇ Pudong Airport (Shanghai) aircraft MU8571 duration 2 hours 10 minutes
  • the server searches for the number of votes according to the departure time and the available traffic plan information 1, 2, 3, and 4, respectively, and obtains the remaining votes of each shift in November 11. Then, based on the specified number (such as the number of users 2 people), the number of remaining votes of each shift, and the available traffic plan information 1, 2, 3, and 4, the server finds that the number of remaining tickets of the available traffic plan information 2 and 4 is 2, so Screened out and obtained the following inter-city transportation plan information from Beijing to Shanghai:
  • Inter-city transportation plan information 1 Beijing South Railway Station (Beijing) ⁇ Shanghai Hongqiao (Shanghai) high-speed rail G5, duration 4 hours 55 minutes 553 yuan
  • Inter-city transportation plan information 2 Capital Airport (Beijing) ⁇ Pudong Airport (Shanghai) Air China CA1501 flight time 2 hours 10 minutes 760 yuan
  • the server identifies, according to the inter-city transportation plan information 1, that the arrival place in the originating city is Beijing South railway Station, and, according to the inter-city transportation plan information 2, identifies that the departure place in the destination city is Pudong Airport.
  • the server obtains the information of the urban transportation plan between the Zhongkun Building and the Beijing South railway Station in the originating city.
  • the server obtains information about the intra-city transportation plan between the Pudong Airport and the Disney in the destination city.
  • the server obtains Zhongkun according to the inter-city transportation plan information, the inter-city transportation plan information, the urban transportation plan information between Zhongkun Building and Beijing South Railway Station, and the intra-city transportation plan information between Pudong Airport and Disney.
  • Information on transportation options between the building and Disney such as:
  • the server sorts the traffic plan information 1 to 2 according to the price from low to high, and then outputs some or all of the sorting results to the mobile terminal.
  • Embodiments of the present invention further provide an apparatus embodiment for implementing the steps and methods in the foregoing method embodiments.
  • the embodiment of the present invention further provides a device for acquiring traffic information, which is disposed in the server.
  • a device for acquiring traffic information which is disposed in the server.
  • FIG. 12 is a functional block diagram of the device for acquiring traffic information provided by the embodiment of the present invention, as shown in FIG. 12 . include:
  • the receiving unit 201 is configured to receive an origin, a destination, and a departure time provided by the user;
  • the pre-calculation unit 202 is configured to obtain, according to the departure time, the inter-city transportation plan information of the origin city where the origin is located and the destination city where the destination is located;
  • the real-time calculation unit 203 is configured to acquire the transportation plan information in the originating city and the traffic plan information in the destination city according to the inter-city transportation plan information; and, the inter-city transportation plan information, the beginning The traffic plan information in the city and the traffic plan information in the destination city are aggregated to obtain traffic plan information between the origin and the destination.
  • the real-time computing unit 203 is specifically configured to:
  • the real-time computing unit 203 is specifically configured to:
  • the pre-calculation unit 202 is specifically configured to:
  • the pre-calculation unit 202 is specifically configured to:
  • the available traffic plan information that the remaining resources satisfy the predetermined condition is selected as the inter-city transportation plan information.
  • the receiving unit 201 is further configured to: receive a transit distance between the origin and the destination provided by the user, and a stay duration of the transit place;
  • the pre-calculation unit 202 is configured to: obtain, according to the origin, the transit, and the departure time, information about inter-city transportation schemes of an originating city where the origin is located and a transit city where the transit location is located And, according to the length of stay of the transit place, obtaining the inter-city transportation plan information of the transit city where the transit place is located and the destination city where the destination is located;
  • the real-time computing unit 203 is specifically configured to: inter-city transportation plan information according to the transit city where the originating city and the transit place where the origin is located, the transit city where the transfer place is located, and the inter-city city where the destination is located.
  • the information, the inter-city transportation plan information of the transit city where the originating place is located and the transit city where the transit place is located, the transit city where the transfer place is located, and the inter-city transportation plan information of the destination city where the destination is located are aggregated, and the information is obtained. Traffic plan information between the place of origin and the destination.
  • the real-time computing unit 203 is further configured to sort the traffic plan information between the origin and the destination according to a specified sorting manner, to obtain a sorting result;
  • the apparatus further includes a first output unit 204 for outputting some or all of the sorting results.
  • the receiving unit 201 is further configured to acquire another destination provided by the user and a departure time of the transit place;
  • the real-time computing unit 203 is further configured to obtain, according to a departure time of the transit place, traffic plan information between the transit destination and the another destination; and, the origin and the transit.
  • the traffic plan information between the grounds, the traffic plan information between the transfer destinations and the other destinations is aggregated, and traffic plan information between the origins to the other destinations is obtained.
  • the real-time computing unit 203 is further configured to: sort the traffic plan information between the originating destination and the another destination according to a specified sorting manner, and obtain the sorting. result;
  • the method further includes: a second output unit 205, configured to output part or all of the sorting result.
  • the specified ordering includes sorting by time from short to long and/or sorting by price from low to high.
  • the method further includes:
  • the information application unit 206 is configured to perform navigation according to the obtained traffic plan information; and/or to generate an electronic map according to the obtained traffic plan information; and/or to perform travel planning according to the obtained traffic plan information. And/or for displaying, according to the obtained traffic plan information, points of interest related to the respective destinations, and additional service information showing the points of interest; and/or for sharing the obtained traffic plan information.
  • the inter-city transportation plan information, the in-city in-city transportation plan information, and the in-city in-city transportation plan information are aggregated to obtain traffic plan information between the originating place and the destination.
  • the embodiment of the present solution further provides a server.
  • FIG. 13 is a simplified block diagram of the server 100.
  • the server 100 can include a processor 101 coupled to one or more data storage tools, which can include a storage medium 102 and a memory unit 103.
  • Server 100 may also include an input interface 104, an output interface 105 for communicating with another device or system.
  • the program code executed by the CPU of the processor 101 can be stored in the storage medium 102 or the memory unit 103.
  • the processor 101 in the server 100 calls the program code stored in the storage medium 102 or the memory unit 103 to perform the following steps:
  • the traffic plan information is aggregated to obtain traffic plan information between the origin and the destination.
  • the processor 101 determines, according to the inter-city transportation plan information, a destination within the originating city and a departure place within the destination city; according to the origin and the origin Receiving the transportation plan information in the originating city; and acquiring the traffic plan information in the destination city according to the destination and the departure place in the destination city.
  • the processor 101 acquires a starting point in the inter-city transportation plan information as an arrival point in the originating city; and acquires an end point in the inter-city transportation plan information as a location Describe the starting point within the city.
  • the processor 101 acquires available traffic plan information between the originating city and the destination city; and filters the available traffic plan information according to the departure time to obtain the Intercity transportation plan information.
  • the processor 101 acquires the remaining resources corresponding to the available traffic plan information according to the departure time, and selects the available traffic plan information that the remaining resources meet the predetermined condition, as the inter-city traffic plan information. .
  • the processor 101 receives, by using the input interface 104, a transit distance between the origin and the destination provided by the user, and a stay duration of the transit ground; according to the origin, the Transit place and the departure time, obtain the inter-city transportation plan information of the transit city where the originating place is located and the transit city where the transit place is located, and obtain the transit city and destination where the transit place is located according to the transit time of the transit place Information about the inter-city transportation plan of the destination city; and the inter-city transportation plan information of the transit city where the originating city and the transit place where the origin is located, the transit city where the transit place is located, and the destination city where the destination is located Inter-city transportation plan information, information on the transportation plan in the originating city, information on the transportation plan in the transit city, and information on the transportation plan in the destination city; and information on the transportation plan in the city, the traffic plan information in the transit city, and the destination city Traffic plan information, the originating city where the origin is located, and the inter-city of the transit city where
  • the processor 101 sorts the traffic plan information between the origin and the destination according to a specified sorting manner to obtain a sorting result; and outputs a part through the output interface 105 or All of the sort results.
  • the processor 101 may also acquire another destination provided by the user and a departure time of the transit place; according to the departure time of the transit place, Obtaining traffic plan information between the transfer destination and the other destination; transferring traffic plan information between the origin and the transit place, and transferring the transfer between the other destinations
  • the traffic plan information is aggregated to obtain traffic plan information between the origin and the other destination.
  • the processor 101 sorts the traffic plan information between the origin and the other destination according to a specified sorting manner to obtain a sorting result; and outputs the output through the output interface 105. Part or all of the sorting results.
  • the specified ordering includes sorting by time from short to long and/or sorting by price from low to high.
  • the processor 101 may further perform navigation according to the obtained traffic plan information; and/or generate an electronic map according to the obtained traffic plan information; and/or, according to the obtained traffic plan information, Performing trip planning; and/or, according to the obtained traffic plan information, displaying points of interest related to each destination, and additional service information showing the points of interest; and/or sharing the obtained traffic plan information.

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Theoretical Computer Science (AREA)
  • Tourism & Hospitality (AREA)
  • General Physics & Mathematics (AREA)
  • Marketing (AREA)
  • General Business, Economics & Management (AREA)
  • Physics & Mathematics (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Game Theory and Decision Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Development Economics (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Navigation (AREA)
  • Traffic Control Systems (AREA)

Abstract

本方案实施例提供了一种交通信息的获取方法、装置及非暂态计算机可读存储介质。本方案实施例中，接收用户提供的始发地、目的地和出发时间；根据所述出发时间，获取始发地所在的始发城市与目的地所在的目的城市的城市间交通方案信息；根据所述城市间交通方案信息，获取所述始发城市内交通方案信息和所述目的城市内交通方案信息；将所述城市间交通方案信息、所述始发城市内交通方案信息和所述目的城市内交通方案信息进行聚合，得到所述始发地与所述目的地之间的交通方案信息。本方案实施例用以解决现有技术中无法向用户提供更为高效的点到点出行的交通方案的问题。

Description

交通信息的获取方法、装置及非暂态计算机可读存储介质
本申请要求2017年01月12日递交的申请号为201710023102.9、发明名称为“交通信息的获取方法、装置及非暂态计算机可读存储介质”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本发明涉及智能交通技术领域，尤其涉及一种交通信息的获取方法、装置及暂态计算机可读存储介质。
背景技术
对于城市之间的大交通问题，目前传统的出行方式主要依赖航空、铁路或者公路等。目前主要导航软件给出的是如下几种实现方式：
第一种：驾车方式下的路径解决方案。
第二种：城市之间的大交通方案，例如，铁路班次、航空班次、航运班次。
第一种方式中主要针对驾车用户。对于更多的普通用户，尤其是长途旅行用户，更多的是选择第二种方式。
但是，第二种方式下，用户从当前所在城市内的始发地到达的另一城市内的目的地之间不只是大交通问题，还需要解决从当前所在城市内的始发地如何到达航站楼、火车站或者长途车站的交通问题，相应的，还需要解决从另一城市内的航站楼、火车站或者长途车站到达目的地之间的交通问题。目前，从一个城市的一个地点到另一个城市的一个地点的出行称为点到点出行。
现有技术中，行程规划类软件，如旅游类软件、地图类软件、导航类软件等，能够实现城市到城市之间的交通方案推荐。例如，用户使用移动终端上安装的旅游类软件，能够得到城市之间的交通方案推荐。然而，这些行程规划类应用无法在获取城市之间交通方案的同时一并获取到从当前所在城市内的位置与达航站楼、火车站或者长途车站之间的交通方案，也无法获取到从另一城市内的航站楼、火车站或者长途车站到达目的位置之间的交通方案，而且更加无法有效地将城市内交通方案和城市间交通方案的多个方案的整合，以向用户提供更为高效的点到点出行的交通方案。
发明内容
有鉴于此，本方案实施例提供了一种交通信息的获取方法、装置及暂态计算机可读存储介质，用以解决现有技术中无法向用户提供更为高效的点到点出行的交通方案的问题。
一方面，本发明实施例提供了一种交通信息的获取方法，包括：
接收用户提供的始发地、目的地和出发时间；
根据所述出发时间，获取始发地所在的始发城市与目的地所在的目的城市的城市间交通方案信息；
根据所述城市间交通方案信息，获取始发城市内交通方案信息和目的城市内交通方案信息；
将所述城市间交通方案信息、所述始发城市内交通方案信息和所述目的城市内交通方案信息进行聚合，得到所述始发地与所述目的地之间的交通方案信息。
如上所述的方面和任一可能的实现方式，进一步提供一种实现方式，根据所述城市间交通方案信息，获取始发城市内交通方案信息和目的城市内交通方案信息，包括：
根据所述城市间交通方案信息，确定所述始发城市内到达地和所述目的城市内出发地；
根据所述始发地和所述始发城市内到达地，获取所述始发城市内交通方案信息；以及，根据所述目的地和所述目的城市内出发地，获取所述目的城市内交通方案信息。
如上所述的方面和任一可能的实现方式，进一步提供一种实现方式，根据所述城市间交通方案信息，确定所述始发城市内到达地和所述目的城市内出发地，包括：
获取所述城市间交通方案信息中的起点，以作为所述始发城市内到达地；
获取所述城市间交通方案信息中的终点，以作为所述目的城市内出发地。
如上所述的方面和任一可能的实现方式，进一步提供一种实现方式，根据所述出发时间，获取始发地所在的始发城市与目的地所在的目的城市的城市间交通方案信息，包括：
获取所述始发城市与所述目的城市之间的可用交通方案信息；
根据所述出发时间，对所述可用交通方案信息进行筛选，得到所述城市间交通方案信息。
如上所述的方面和任一可能的实现方式，进一步提供一种实现方式，根据所述出发时间，对所述可用交通方案信息进行筛选，得到所述城市间交通方案信息，包括：
根据所述出发时间，获取所述可用交通方案信息对应的剩余资源；
选取剩余资源满足预定条件的可用交通方案信息，作为所述城市间交通方案信息。
如上所述的方面和任一可能的实现方式，进一步提供一种实现方式，所述接收用户提供的始发地、目的地和出发时间还包括：接收用户提供的位于始发地和目的地之间的中转地、所述中转地的停留时长；
根据所述出发时间，获取始发地所在的始发城市与目的地所在的目的城市的城市间交通方案信息，包括：根据所述始发地、所述中转地和所述出发时间，获取始发地所在的始发城市与中转地所在的中转城市的城市间交通方案信息，以及，根据中转地的停留时长，获取中转地所在的中转城市与目的地所在的目的城市的城市间交通方案信息；
根据所述城市间交通方案信息，获取始发城市内交通方案信息和目的城市内交通方案信息，包括：根据始发地所在的始发城市与中转地所在的中转城市的城市间交通方案信息、中转地所在的中转城市与目的地所在的目的城市的城市间交通方案信息，获取始发城市内交通方案信息、中转城市内交通方案信息和目的城市内交通方案信息；
将所述城市间交通方案信息、所述始发城市内交通方案信息和所述目的城市内交通方案信息进行聚合，包括：将始发城市内交通方案信息、中转城市内交通方案信息、目的城市内交通方案信息、始发地所在的始发城市与中转地所在的中转城市的城市间交通方案信息、中转地所在的中转城市与目的地所在的目的城市的城市间交通方案信息进行聚合，得到所述始发地与所述目的地之间的交通方案信息。
如上所述的方面和任一可能的实现方式，进一步提供一种实现方式，还包括：
根据指定的排序方式，对所述始发地与所述目的地之间的交通方案信息进行排序，得到排序结果；
输出部分或者全部的所述排序结果。
如上所述的方面和任一可能的实现方式，进一步提供一种实现方式，当所述目的地为中转地时，还包括：
获取用户提供的另一目的地和所述中转地的出发时间；
根据所述中转地的出发时间，获得所述中转地到所述另一目的地之间的交通方案信息；
将所述始发地与所述中转地之间的交通方案信息、所述中转地到所述另一目的地之间的交通方案信息进行聚合，得到所述始发地到所述另一目的地之间的交通方案信息。
如上所述的方面和任一可能的实现方式，进一步提供一种实现方式，还包括：
根据指定的排序方式，对所述始发地到所述另一目的地之间的交通方案信息进行排 序，得到排序结果；
输出部分或者全部的所述排序结果。
如上所述的方面和任一可能的实现方式，进一步提供一种实现方式，所述指定的排序方式包括按照时间由短到长进行排序和/或按照价格由低到高进行排序。
如上所述的方面和任一可能的实现方式，进一步提供一种实现方式，还包括：
根据获得的交通方案信息，进行导航；和/或，
根据获得的交通方案信息，生成电子地图；和/或，
根据获得的交通方案信息，进行行程规划；和/或，
根据获得的交通方案信息，显示与各目的地相关的兴趣点，以及显示该兴趣点的附加服务信息；和/或，
将获得的交通方案信息进行共享。
另一方面，本发明实施例提供了一种交通信息的获取装置，包括：
接收单元，用于接收用户提供的始发地、目的地和出发时间；
预计算单元，用于根据所述出发时间，获取始发地所在的始发城市与目的地所在的目的城市的城市间交通方案信息；
实时计算单元，用于根据所述城市间交通方案信息，获取始发城市内交通方案信息和目的城市内交通方案信息；以及，将所述城市间交通方案信息、所述始发城市内交通方案信息和所述目的城市内交通方案信息进行聚合，得到所述始发地与所述目的地之间的交通方案信息。
如上所述的方面和任一可能的实现方式，进一步提供一种实现方式，所述实时计算单元具体用于：
根据所述城市间交通方案信息，确定所述始发城市内到达地和所述目的城市内出发地；
根据所述始发地和所述始发城市内到达地，获取所述始发城市内交通方案信息；以及，根据所述目的地和所述目的城市内出发地，获取所述目的城市内交通方案信息。
如上所述的方面和任一可能的实现方式，进一步提供一种实现方式，所述实时计算单元具体用于：
获取所述城市间交通方案信息中的起点，以作为所述始发城市内到达地；
获取所述城市间交通方案信息中的终点，以作为所述目的城市内出发地。
如上所述的方面和任一可能的实现方式，进一步提供一种实现方式，所述预计算单 元具体用于：
获取所述始发城市与所述目的城市之间的可用交通方案信息；
根据所述出发时间，对所述可用交通方案信息进行筛选，得到所述城市间交通方案信息。
如上所述的方面和任一可能的实现方式，进一步提供一种实现方式，所述预计算单元具体用于：
根据所述出发时间，获取所述可用交通方案信息对应的剩余资源；
选取剩余资源满足预定条件的可用交通方案信息，作为所述城市间交通方案信息。
如上所述的方面和任一可能的实现方式，进一步提供一种实现方式，所述接收单元，还用于：接收用户提供的位于始发地和目的地之间的中转地、所述中转地的停留时长；
所述预计算单元，具体用于：根据所述始发地、所述中转地和所述出发时间，获取始发地所在的始发城市与中转地所在的中转城市的城市间交通方案信息，以及，根据中转地的停留时长，获取中转地所在的中转城市与目的地所在的目的城市的城市间交通方案信息；
所述实时计算单元，具体用于：根据始发地所在的始发城市与中转地所在的中转城市的城市间交通方案信息、中转地所在的中转城市与目的地所在的目的城市的城市间交通方案信息，获取始发城市内交通方案信息、中转城市内交通方案信息和目的城市内交通方案信息；以及，将始发城市内交通方案信息、中转城市内交通方案信息、目的城市内交通方案信息、始发地所在的始发城市与中转地所在的中转城市的城市间交通方案信息、中转地所在的中转城市与目的地所在的目的城市的城市间交通方案信息进行聚合，得到所述始发地与所述目的地之间的交通方案信息。
如上所述的方面和任一可能的实现方式，进一步提供一种实现方式，所述实时计算单元，还用于根据指定的排序方式，对所述始发地与所述目的地之间的交通方案信息进行排序，得到排序结果；
所述装置还包括：第一输出单元，用于输出部分或者全部的所述排序结果。
如上所述的方面和任一可能的实现方式，进一步提供一种实现方式，当所述目的地为中转地时，
所述接收单元，还用于获取用户提供的另一目的地和所述中转地的出发时间；
所述实时计算单元，还用于根据所述中转地的出发时间，获得所述中转地到所述另一目的地之间的交通方案信息；以及，将所述始发地与所述中转地之间的交通方案信息、 所述中转地到所述另一目的地之间的交通方案信息进行聚合，得到所述始发地到所述另一目的地之间的交通方案信息。
如上所述的方面和任一可能的实现方式，进一步提供一种实现方式，所述实时计算单元，还用于：根据指定的排序方式，对所述始发地到所述另一目的地之间的交通方案信息进行排序，得到排序结果；
还包括：第二输出单元，用于输出部分或者全部的所述排序结果。
如上所述的方面和任一可能的实现方式，进一步提供一种实现方式，所述指定的排序方式包括按照时间由短到长进行排序和/或按照价格由低到高进行排序。
如上所述的方面和任一可能的实现方式，进一步提供一种实现方式，还包括：
信息应用单元，用于根据获得的交通方案信息，进行导航；和/或，用于根据获得的交通方案信息，生成电子地图；和/或，用于根据获得的交通方案信息，进行行程规划；和/或，用于根据获得的交通方案信息，显示与各目的地相关的兴趣点，以及显示该兴趣点的附加服务信息；和/或，用于将获得的交通方案信息进行共享。
另一方面，本发明实施例提供了一种非暂态计算机可读存储介质，非暂态计算机可读存储介质存储计算机指令，所述计算机指令用于使所述计算机执行以下流程：
接收用户提供的始发地、目的地和出发时间；
根据所述出发时间，获取始发地所在的始发城市与目的地所在的目的城市的城市间交通方案信息；
根据所述城市间交通方案信息，获取始发城市内交通方案信息和目的城市内交通方案信息；
将所述城市间交通方案信息、所述始发城市内交通方案信息和所述目的城市内交通方案信息进行聚合，得到所述始发地与所述目的地之间的交通方案信息。
上述技术方案中的一个技术方案具有如下有益效果：
本方案实施例能够在得到城市间交通方案之后，确定始发城市内交通方案信息和目的城市内交通方案信息，然后将始发城市内的交通方案、目的城市内的交通方案、城市间交通方案进行聚合，得到始发地与目的地之间的交通方案，能够在获取城市之间交通方案的同时一并和获取到当前所在城市内交通方案以及前往城市内交通方案，有效地将城市内交通方案和城市间交通方案的多个方案的整合，从而向用户提供了更为高效的点到点出行的交通方案，解决了现有技术中无法向用户提供更为高效的点到点出行的交通方案的问题。
附图说明
为了更清楚地说明本发明实施例的技术方案，下面将对实施例中所需要使用的附图作简单地介绍，显而易见地，下面描述中的附图仅仅是本发明的一些实施例，对于本领域普通技术人员来讲，在不付出创造性劳动性的前提下，还可以根据这些附图获得其它的附图。
图1是本方案实施例所提供的交通信息的获取方法的一种流程示意图；
图2是本方案实施例所提供的步骤102的实现方法的流程示意图；
图3是本方案实施例所提供的始发地、目的地、始发城市和目的城市的示例图；
图4是本方案实施例所提供的实现交通信息的获取方法的架构示意图；
图5a是本方案实施例所提供的针对城市间交通的图模型的示例图；
图5b是本方案实施例所提供的北京—上海—杭州的图模型的示例图；
图6是本方案实施例所提供的交通信息的获取方法的另一流程示意图；
图7是本方案实施例所提供的始发地、中转地、另一目的地、始发城市、中转城市和另一目的城市的示例图；
图8是本方案实施例所提供的交通信息的获取方法的另一流程示意图；
图9是本方案实施例所提供的始发地、中转地、目的地、始发城市、中转城市和目的城市的示例图；
图10是本方案实施例所提供的交通信息的获取方法中总体交互流程的示意图；
图11是本方案实施例所提供的交通信息的获取方法中总体交互流程的另一示意图；
图12是本方案实施例所提供的交通信息的获取装置的功能方块图；
图13是服务器的简化框图。
具体实施方式
为了更好的理解本发明的技术方案，下面结合附图对本发明实施例进行详细描述。
应当明确，所描述的实施例仅仅是本发明一部分实施例，而不是全部的实施例。基于本发明中的实施例，本领域普通技术人员在没有作出创造性劳动前提下所获得的所有其它实施例，都属于本发明保护的范围。
在本发明实施例中使用的术语是仅仅出于描述特定实施例的目的，而非旨在限制本发明。在本发明实施例和所附权利要求书中所使用的单数形式的“一种”、“所述”和 “该”也旨在包括多数形式，除非上下文清楚地表示其他含义。
应当理解，本文中使用的术语“和/或”仅仅是一种描述关联对象的关联关系，表示可以存在三种关系，例如，A和/或B，可以表示：单独存在A，同时存在A和B，单独存在B这三种情况。另外，本文中字符“/”，一般表示前后关联对象是一种“或”的关系。
取决于语境，如在此所使用的词语“如果”可以被解释成为“在……时”或“当……时”或“响应于确定”或“响应于检测”。类似地，取决于语境，短语“如果确定”或“如果检测(陈述的条件或事件)”可以被解释成为“当确定时”或“响应于确定”或“当检测(陈述的条件或事件)时”或“响应于检测(陈述的条件或事件)”。
针对现有技术所存在的无法获取从用户当前所在城市内的始发地与达航站楼、火车站或者长途车站之间的交通方案，相应的，也无法获取从另一城市内的航站楼、火车站或者长途车站到达目的地之间的交通方案，所导致的无法获取点到点出行的交通方案的问题，本方案实施例提供了相应的解决思路：服务器在获得始发城市与目的城市的城市间交通方案之后，根据城市间交通方案自动确定始发城市内到达地，以及自动确定目的城市内出发地，然后根据始发城市内的始发地和到达地，获得始发城市内交通方案，以及，根据目的城市内出发地与目的地，获得目的城市内交通方案，最后将上述获得的始发城市内交通方案、始发城市与目的城市的城市间交通方案、目的城市内交通方案进行聚合，得到始发地与目的地之间的交通方案。
需要说明的是，本方案实施例可以应用于包括移动终端和服务器的系统。移动终端可以如手机、平板电脑、台式机等。服务器可集成在网络侧。
本发明实施例提供的交通信息的获取方法可以执行在服务器中，其流程如图1所示，包括：
101、接收用户提供的始发地、目的地和出发时间。
102、根据所述出发时间，获取始发地所在的始发城市与目的地所在的目的城市的城市间交通方案信息。
103、根据城市间交通方案信息，获取始发城市内交通方案信息和目的城市内交通方案信息。
104、将城市间交通方案信息、始发城市内交通方案信息和目的城市内交通方案信息进行聚合，得到始发地与目的地之间的交通方案信息。
针对步骤101的实现，本方案实施例在此提供了两种可行的实施方式，包括：
第一种：移动终端中安装的客户端可以向用户显示输入界面，通过该输入界面接收用户输入的始发地、目的地和出发时间，然后移动终端将用户输入的始发地、目的地和出发时间发送给服务器，如此，服务器可以获得用户提供的始发地、目的地和出发时间。
第二种：移动终端中安装的客户端可以根据用户指令，触发移动终端的定位模块进行定位，获得用户当前所在地理位置，将用户当前所在地理位置作为始发地，或者，客户端根据该地理位置向用户提供若干候选始发地，将用户选择的候选始发地作为始发地。
客户端还可以向用户提供若干候选目的地，将用户选择的候选目的地作为目的地；或者，客户端也可以接收用户在输入框中输入的目的地。
另外，客户端可以向用户显示日历，然后接收用户在日历中选择的日期作为出发时间。
移动终端将用户提供的始发地、目的地和出发时间发送给服务器，如此，服务器可以获得用户提供的始发地、目的地和出发时间。
可以理解的是，上述始发地是用户的真实始发地，目的地是用户的真实目的地，出发时间可以是某一天，或者也可以精确到某一天的具体时刻，本方案实施例对此不进行特别限定。
针对步骤102的实现，本方案实施例在此提供了一种可行的实施方式，如图2所示，包括：
201、获取所述始发城市与所述目的城市之间的可用交通方案信息。
202、根据所述出发时间，对所述可用交通方案信息进行筛选，得到所述城市间交通方案信息。
请参考图3，其为本方案实施例所提供的始发地、目的地、始发城市和目的城市的示例图，如图3所示，本方案实施例中，服务器在从移动终端接收到始发地和目的地之后，可以先识别出始发地所属的始发城市，以及识别出目的地所属的目的城市。其中，图3中所示的实线表示真实的交通方案，虚线表示最终要获得的交通方案，最终要获得始发地与目的地之间的交通方案信息，但是该从始发地前往目的地真实的交通方案包括：先执行始发地与始发城市内到达地之间的始发城市内交通方案信息，然后执行始发城市与目的城市的城市间交通方案信息，最后执行目的城市内出发地与目的地之间的目的城市内交通方案信息。
例如，用户由“中坤大厦”前往“迪士尼”，因此需要获得“中坤大厦”与“迪士尼”之间的交通方案信息，实际情况是先由“中坤大厦”前往“北京南站”(始发城市 内交通方案信息)，再由“北京南站”前往“上海虹桥”(城市间交通方案信息)，最后由“上海虹桥”前往“迪士尼”(目的城市内交通方案信息)。
举例说明，请参考图4，其为本方案实施例所提供的实现交通信息的获取方法的架构示意图，如图4所示，服务器包括输入接口、预计算引擎、交通搜索引擎、实时计算引擎和输出接口。其中，输入接口和输出接口都用于服务器与移动终端之间进行通信，输入接口用于接收移动终端输出的信息，输出接口用于向移动终端输出信息。预计算引擎中预先设置兴趣点(Point of Interest，POI)数据库、城市数据库、飞机的航班库、长途车的车次库、火车的车次库和历史信息库。交通搜索引擎包括大交通搜索引擎和小交通搜索引擎。
在一个具体的实现方案中，如图4所示，服务器中的输入接口可以用于接收移动终端发送的始发地和目的地，然后输出给预计算引擎。预计算引擎可以根据始发地的经纬度信息，在兴趣点数据库中进行近似匹配，从而可以识别出与始发地最接近的兴趣点，然后根据该兴趣点在城市数据库中进行查询，以获得该兴趣点所属的城市，即获得始发地所属的城市，称为始发城市。同理，可以根据目的地的经纬度信息，在兴趣点数据库中进行近似匹配，从而可以识别出与目的地最接近的兴趣点，然后根据该兴趣点在城市数据库中进行查询，以获得该兴趣点所属的城市，即获得目的地所属的城市，称为目的城市。
或者，在另一个具体的实现方案中，如图4所示，预计算引擎也可以根据始发地的经纬度信息在城市数据库中进行匹配，从而可以识别出始发地所属的城市。同理，预计算引擎也可以根据目的地的经纬度信息在城市数据库中进行匹配，从而可以识别出目的地所属的城市。
可以理解的是，兴趣点数据库中用于保存一定地理范围内的兴趣点，每个兴趣点包括一些描述信息，如该兴趣点的经纬度信息、类别和名称等。因此，通过给定的经纬度信息能够从兴趣点数据库中找到最接近的兴趣点。另外，城市数据库中用于保存各城市的具体地理信息，如各城市中的兴趣点和各城市的经纬度范围等，因此通过城市数据库可以识别出给定兴趣点所属的城市，也可以通过城市数据库识别出给定经纬度所属的城市。本领域技术人员可以理解的是，本方案实施例中涉及的城市可以属于同一个地区，或者也可以属于不同地区，本方案实施例对此不进行特别限定。
本方案实施例中，如图4所示，预计算引擎确定出始发地所属的始发城市以及目的地所属的目的城市之后，根据始发城市和目的城市在历史信息库中进行查询，判断是否 之前已经计算过始发城市与目的城市之间的可用交通方案信息；如果已经计算过，可以从历史信息库中直接获取之前计算的结果，即始发城市与目的城市之间的可用交通方案信息；反之，如果没有计算过，则预计算引擎进行始发城市与目的城市之间的可用交通方案信息的计算，然后将计算结果保存至历史信息库中，实现对历史信息库的更新。
在一个具体的实现方案中，如图4所示，预计算引擎中可以预先设置图模型，该图模型是可以预先生成并配置在预计算引擎中的。预计算引擎中可以使用该图模型，计算始发城市与目的城市之间的可用交通方案信息。
需要说明的是，请参考图5a，其为本方案实施例所提供的针对城市间交通的图模型的示例图，如图5a所示，图模型包括节点和连接线，其中一个节点表示一个城市，如图5a中的城市A～城市F。节点之间的连线表示城市之间是否有交通来连接，即是否直接可达，如果两个节点之间有连接线，表示两个节点之间交通来连接，直接可达，如果没有，表示两个节点之间没有交通连接，不能直接可达，是间接可达。其中，连接线的箭头方向用来指示直接可达的方向。另外，每个节点可以标注节点相应的属性信息，如名称、级别和标签等。每两个节点之间的连接线也可以标注连接线相应的属性信息，如交通类型、距离和时长等。
此外，图模型还包括上述节点的子节点(图中未示出)，子节点表示城市中的一个交通类型的兴趣点，如机场、火车站和长途车站等。子节点之间的连线(图中未示出)表示兴趣点之间是否有交通来连接，即是否直接可达，如果子节点之间有连接线，表示两个子节点之间有交通连接，直接可达，如果没有，表示两个子节点之间没有交通连接，不能直接可达，是间接可达。。其中，连接线的箭头方向用来指示直接可达的方向。另外，每个子节点也可以标注节点相应的属性信息，如名称、级别和标签等。每两个子节点之间的连接线也可以标注连接线相应的属性信息，如交通工具类型、距离和时长等。
请参考图5b，其为本方案实施例所提供的北京—上海—杭州的图模型的示例图，如图5b所示，城市“北京”中包括交通类型的兴趣点“北京北站”、“北京西站”、“北京南站”和“首都机场”，“北京北站”与“北京西站”之间具有连接线，表示两者之间可直达；“北京北站”与“北京南站”之间具有连接线，表示两者之间可直达；“北京西站”与“北京南站”之间具有连接线，表示两者之间可直达；“北京北站”与“首都机场”之间具有连接线，表示两者之间可直达；“北京西站”与“首都机场”之间具有连接线，表示两者之间可直达；“北京南站”与“首都机场”之间具有连接线，表示两者之间可直达。图5b所示的上海和杭州中的兴趣点及其连接线的解释与上述北京中的 兴趣点及其连接线的解释原理相同，这里不再赘述。
本方案实施例中，预计算引擎将始发城市、目的城市和筛选条件输入上述图模型，该图模型可以基于最短路径算法(如迪杰斯特拉Dijkstra算法或者最短路径Shortest算法等)计算始发城市与目的城市之间的候选交通方案信息，候选交通方案信息中可以包括需要中转的交通方案信息，还可以包括不需要中转的交通方案信息，即可直达的交通方案信息。然后图模型利用输入的筛选条件对候选交通方案信息进行筛选，最后输出筛选后得到的始发城市与目的城市之间的可达交通方案信息。或者，预计算引擎也可以只将始发城市、目的城市输入上述图模型，该图模型计算始发城市与目的城市之间的候选交通方案信息，并输出候选交通方案信息，预计算引擎利用筛选条件对图模型输出的候选交通方案信息进行筛选，最后得到始发城市与目的城市之间的可用交通方案信息。
在一个具体的实现方案中，如果存在直接可达的交通方案信息，候选交通方案信息可以包括以下信息中一个或多个：始发地、始发城市、目的地、目的城市、交通类型、班次和时长。如果存在间接可达的交通方案信息，候选交通方案信息或者可达交通方案信息中还可以包括中转点数量和详细信息，该详细信息可以包括每段交通方案中的始发地、始发城市、目的地和目的城市、交通类型、班次和时长等。
在一个具体的实现方案中，可用交通方案信息中可以包括以下信息中一个或者多个：该交通方案信息的始发地、始发城市、目的地、目的城市、交通类型、班次和时长。如果存在间接可达的交通方案信息，可用交通方案信息中还可以包括中转点数量和详细信息，该详细信息可以包括每段交通方案中的始发地、始发城市、目的地、目的城市、交通类型、班次和时长。
在一个具体的实现方案中，筛选条件可以包括但不限于以下条件中至少一个：候选交通方案信息的方向、时间和中转点数量。例如，筛选条件中要求候选交通方案信息中方向需要与始发城市前往目的城市的方向一致，对于不一致的候选交通方案信息需要筛除。或者，又例如，筛选条件中要求候选交通方案信息中始发城市到达目的城市之间的时间不能超过指定的时间阈值，如果超过，则该候选交通方案信息需要筛除。或者，又例如，筛选条件中要求候选交通方案信息的中转点数量不能超过指定的数量阈值，如果超过，则该候选交通方案信息需要筛除。
下面给出一种可行的生成图模型的实现方案：首先，通过飞机的航班库查询每个航班涉及的两个城市、相关机场和航班详细信息，以及，通过火车的车次库查询出每个车次涉及的两个城市、火车站和车次详细信息，以及，通过长途车的车次库查询出每个车 次涉及的城市、长途车站和车次详细信息。然后，将查询出的城市作为父节点标在图上，该城市内的机场、火车站和长途车站作为该父节点的子节点也标在图上，最后根据航班涉及的城市、火车的车次涉及的城市以及长途车车次涉及的城市，在图中标注城市之间的连接线，还可以标出连接线对应的交通类型。如此就可以生成一个城市间的交通可达图，本方案实施例称为图模型。
预计算引擎在得到始发城市与目的城市之间的可用交通方案信息之后，还需要进一步根据所述出发时间，对可用交通方案信息进行筛选，得到始发城市与目的城市的城市间交通方案信息。在一种可行的实现方案中，预计算引擎可以根据所述出发时间，获取可用交通方案信息对应的剩余资源，然后选取剩余资源满足预定条件的可用交通方案信息，作为始发城市与目的城市的城市间交通方案信息。
在一种具体的实现方案中，预计算引擎将出发时间和可用交通方案信息发送给交通搜索引擎中的大交通搜索引擎，大交通搜索引擎根据出发时间和可用交通方案信息，分别进行飞机票搜索、火车票搜索和长途车票搜索，获得飞机票的剩余资源、火车票的剩余资源和长途车票的剩余资源，这些剩余资源就是可用交通方案信息对应的剩余资源，将获得的剩余资源返回给预计算引擎。可以理解的是，这里的剩余资源具体指的是剩余票数。其中，大交通搜索引擎可以调用飞机票数据库的接口，进行飞机票搜索，以及可以调用火车票数据库的接口，进行火车票搜索，以及调用长途车数据库的接口，进行长途车票的搜索，以获得相应的搜索结果。
进一步的，预计算引擎从大交通搜索引擎接收到可用交通方案信息对应的剩余资源之后，选取剩余资源满足预定条件的可用交通方案信息，作为始发城市与目的城市的城市间交通方案信息。
在一个可行的实现方案中，预定条件可以是剩余资源大于指定数目，该指定数目可以根据用户输入的出行人数确定，如指定数目可以大于或者等于出行人数。例如，可用交通方案信息1的剩余资源是5，表示剩余5张票，可用交通方案信息2的剩余资源是1，表示剩余1张票，可用交通方案信息3的剩余资源是10，表示剩余10张票。用户给定的出行人数是3，因此，预计算引擎根据数目3确定指定数目是3，然后在可用交通方案信息1～3中筛除可用交通方案信息2，保留可用交通方案信息1和3，因为可用交通方案信息2的剩余资源是1，不满足剩余资源大于3的预定条件。
针对步骤103的实现，本方案实施例在此提供了一种可行的实施方式，包括：
可以理解的是，如图3所示，用户需要从始发城市前往目的城市，用户的真实交通 路线是，先从始发城市中的始发地前往始发城市中乘坐交通工具的兴趣点(本方案实施例称为始发城市内到达地)，然后从该兴趣点乘坐交通工具前往目的城市，最终到达目的城市中该交通工具停靠的兴趣点(本方案实施例称为目的城市内出发地)，然后用户还需要从目的城市中的该兴趣点前往目的城市中的目的地，因此，获得的始发城市与目标城市的城市间交通方案信息的实质是始发城市内一个或多个出发地与目的城市内一个或多个到达地之间的交通方案信息的集合，因此，实时计算引擎可以根据城市间交通方案信息确定始发城市内到达地和目的城市内出发地。
如图4所示，预计算引擎将获得的始发城市与目标城市的城市间交通方案信息输出给实时计算引擎，该城市间交通方案信息的数量可以是一个或者多个。对于每个城市间交通方案信息，实时计算引擎可以获取该城市间交通方案信息中的起点，将其作为始发城市内到达地，并获取该城市间交通方案信息中的终点，将其作为目的城市内出发地。
例如，始发城市是北京，目的城市是上海，北京到上海的城市间交通方案信息可以包括：交通方案信息1：北京南站→上海虹桥；交通方案信息2：首都机场→浦东机场。可以看出，北京到上海的交通方案信息是城市间的大交通方案，其实质是起点“北京南站”到终点“上海虹桥”的交通方案信息，以及起点“首都机场”到终点“浦东机场”的交通方案信息。如果采用交通方案信息1，用户需要在始发城市“北京”内从始发地先到达“北京南站”，然后乘坐高铁前往上海，在“上海虹桥”下车，然后在目的城市“上海”内从“上海虹桥”前往目的地。同理，如果采用交通方案信息2，用户需要在始发城市“北京”内从始发地先到达“首都机场”，然后乘坐飞机前往“浦东机场”，然后在目的城市“上海”内从“浦东机场”前往目的地。
可以理解的是，本方案实施例中，在获得始发城市与目的城市的城市间交通方案信息之后，可以自动识别出其中始发城市内到达地和目的城市内出发地，进而利用自动识别的始发城市内到达地和目的城市内出发地完成后续交通方案信息的计算，与现有技术中，用户想要获取城市内交通方案信息时，手动输入目的地和/或始发地的实现方式相比，本方案实施例避免了用户手动输入始发城市内到达地和目的城市内出发地，能够减少用户操作，提高信息获取效率，提升用户体验。
进一步的，实时计算引擎在获得始发城市内到达地和目的城市内出发地之后，根据始发地和始发城市内到达地，确定始发城市内交通方案信息，并根据目的城市内出发地和目的地，确定目的城市内交通方案信息。
在一个具体的实现方案中，如图4所示，实时计算引擎可以将始发城市内的始发地 和始发城市内到达地发送给交通搜索引擎中的小交通搜索引擎，小交通搜索引擎根据始发城市内的始发地和始发城市内到达地，进行实时搜索，得到始发城市内交通方案信息，并将该始发城市内交通方案信息返回给实时计算引擎。可以理解的是，始发城市内交通方案信息的数量可以是一个或者多个。每个始发城市内交通方案信息中可以包括但不限于以下信息：交通类型、始发城市内交通方案信息的预估时长、路线和价格。
同理，如图4所示，实时计算引擎可以将目的城市内出发地和目的地发送给交通搜索引擎中的小交通搜索引擎，小交通搜索引擎根据目的城市内出发地和目的地，进行实时搜索，得到目的城市内交通方案信息，并将该目的城市内交通方案信息返回给实时计算引擎。可以理解的是，目的城市内交通方案信息的数量可以是一个或者多个。其中，每个目的城市内交通方案信息中可以包括但不限于以下信息：交通类型、目的城市内交通方案信息的预估时长、路线和价格。
上述始发城市或者目的城市内的交通类型可以包括地铁、公交车或者出租车(包括专车、快车或者普通出租车)等，本领域技术人员可以理解，本方案实施例对此不进行特别限定。
针对步骤104的实现，本方案实施例在此提供了一种可行的实施方式，包括：
实时计算引擎可以将得到的城市间交通方案信息、始发城市内交通方案信息和目的城市内交通方案信息进行聚合，得到始发地与目的地之间的交通方案信息。
在一种可行的实现方案中，实时计算引擎可以将每个城市间交通方案信息中的起点分别与各始发城市内交通方案信息中的始发城市内到达地进行匹配，如果相匹配，则该城市间交通方案信息可以与该始发城市内交通方案信息进行聚合.
同理，在一种可行的实现方案中，可以将每个城市间交通方案信息的终点分别与各目的城市内交通方案信息中的目的城市内出发地进行匹配，如果相匹配，则该城市间交通方案信息可以与目的城市内交通方案信息进行聚合。
可见，城市间交通方案信息可以与始发城市内交通方案信息聚合，也可以同时与目的城市内交通方案信息聚合，城市间交通方案信息经过两次聚合后得到的交通方案信息是始发地与目的地之间的交通方案信息。
在上述步骤105之后，本方案实施例在此基础上还提供了可选步骤，该可选步骤包括：输出部分或者全部的始发地与目的地之间的交通方案信息。
在一个具体的实现方案中，如图4所示，服务器的实时计算引擎在获得始发地与目的地之间的交通方案信息之后，可以将部分或者全部的该交通方案信息通过服务器的输 出接口输出给移动终端，以便于移动终端可以将接收到的交通方案信息进一步提供给用户。
在一个具体的实现方案中，实时计算引擎可以按照指定的排序方式将获得的始发地与目的地之间的交通方案信息进行排序，然后将排序结果中排名靠前的若干交通方案信息通过输出接口输出，以实现输出部分的始发地与目的地之间的交通方案信息。
在另一个具体的实现方案中，由于路线选择、交通方式选择的不同，可能得到多个聚合后的始发地与目的地之间的交通方案信息。实时计算引擎可以按照指定的排序/筛选方式将获得的始发地与目的地之间的交通方案信息进行筛选和/或排序，然后将排序结果通过输出接口输出，以实现输出全部的始发地与目的地之间的交通方案信息。其中，指定的排序方式可以是用户预先设置好的排序方式，或者，也可以是用户临时选择的一种排序方式，或者，还可以是默认的排序方式。筛选方式可以是用户或系统设置的性能阈值或阈值范围，用于排除不符合预期性能的方案信息。
例如，筛选方式可以是价格在制定区间内，耗时不长于制定时长。
又例如，排序方式可以是按照价格由低到高进行排序，这样，价格最低的交通方案信息可以作为最优的交通方案信息而被推荐给用户。或者，又例如，排序方式也可以是按照时间由短到长进行排序，这样，时间消耗最少的交通方案信息作为最优的交通方案信息而被推荐给用户。本领域技术人员可以理解，这两种排序方式仅为举例说明，并不用于限制本方案提到的排序方式。
举例而言，从北京的望京地区至上海的徐家汇地区可以有飞机、高铁两种主要的城市间交通方式。而从望京地区至机场或高铁车站有机场快速铁路、机场公交、出租车、等(北京)城市内交通方式，而从上海的虹桥机场或虹桥火车站至徐家汇地区也有地铁、机场公交、出租车、等(上海)城市内交通方式。基于用户输入的出发时间，可以得到多种聚合后的交通方案信息。随后可以按照多种筛选/排序方式进行筛选和/或排序。参考信息标准可以包括但不限于：所用总时长、所用总费用、指定到达时间、费用超过500元单程、等。
举例而言，上述排序和/或筛选后的输出结果可是(并非穷举且非限制性)：
所用总时长(从短至长)：
1：始发地-步行-北京望京地区机场快速铁路-首都机场北京至上海航班-上海虹桥地铁二号线-徐家汇地区公交车-目的地
2：始发地-出租车-首都机场北京至上海航班-上海虹桥出租车-目的地
3：始发地-地铁-北京火车南站北京至上海高铁-上海虹桥地铁二号线-徐家汇地区公交车-目的地
4：始发地-出租车-北京火车南站北京至上海高铁-上海虹桥地铁二号线-徐家汇地区公交车-目的地
由此，基于多种筛选/排序方式对聚合后的交通方案信息进行筛选和/或排序并输出，可以一站式为用户提供优化的完整性多层次点到点交通方案规划，免除了用户在多种应用或查询工具间的切换和人工统计，极大提高了用户的使用便利性。
在上述步骤104之后，本方案实施例在此基础上还提供了可选步骤，该可选步骤应用于当目的地为中转地的情况，如图6所示，包括：
105、获取用户提供的另一目的地和所述中转地的出发时间。
106、根据中转地的出发时间，获得中转地到另一目的地之间的交通方案信息。
107、将始发地与中转地之间的交通方案信息、中转地到另一目的地之间的交通方案信息进行聚合，得到始发地到另一目的地之间的交通方案信息。
在一种可行的实现方案中，移动终端可以获取另一目的地和中转地的出发时间，然后将另一目的地和中转地的出发时间发送给服务器的输入接口，如此，服务器可以获取到另一目的地和中转地的出发时间。
移动终端获取另一目的地和中转地的出发时间实现方案可以包括但不限于：移动终端中安装的客户端可以向用户显示输入界面，通过该输入界面接收用户输入的另一目的地和中转地的出发时间。
请参考图7，其为本方案实施例所提供的始发地、中转地、另一目的地、始发城市、中转城市和另一目的城市的示例图，如图7所示，上述中转地是用户前往另一目的地时的真实始发地，此时，另一目的地是用户的下一个目的地。另外，中转地的出发时间可以是某一天，或者也可以精确到某一天的具体时刻，本方案实施例对此不进行特别限定。服务器需要先获得中转城市与另一目的地所在城市(称为另一目的城市)的城市间交通方案信息(图7中虚线所示)，然后根据该城市间交通方案信息，确定中转城市中前往另一目的城市时，该中转城市内到达地以及另一目的城市内出发地，然后获得中转地与中转城市内到达地之间的城市内交通方案信息(图7中实线所示)，以及获得另一目的城市中到达地与另一目的地之间的城市内交通方案信息(图7中实线所示)，最后进行两个城市内交通方案信息与一个城市间交通方案信息的聚合，得到中转地与另一目的地之间的交通方案信息。
需要说明的是，本方案实施例中，服务器根据出发时间，获得中转地到另一目的地之间的交通方案信息的实现方案，与上述获得始发地与目的地之间的交通方案信息的实现原理相同，因此这里不再赘述。
在一种可行的实现方案中，服务器可以将始发地与中转地之间的交通方案信息，与中转地到另一目的地之间的交通方案信息进行聚合，以获得始发地到另一目的地之间的交通方案信息。该聚合方式与上述将始发地与始发城市内目的地之间的城市内交通方案信息与始发城市与目的城市的城市间交通方案信息进行聚合，或者将始发城市与目的城市的城市间交通方案与目的城市内始发地与目的地之间的交通方案信息进行聚合的原理相同，本领域技术人员可以理解，这里不再赘述。
进一步的，如图4所示，服务器在获得始发地到另一目的地之间的交通方案信息之后，可以通过自身的输出接口向移动终端输出部分或者全部的始发地到另一目的地之间的交通方案信息，以便于移动终端进一步向用户提供该交通方案信息。
在一个具体的实现方案中，可以按照排序方式将获得的始发地到另一目的地之间的交通方案信息进行排序，然后将排序结果中排名靠前的若干交通方案信息通过输出接口输出，以实现输出部分的始发地到另一目的地之间的交通方案信息。
在另一个具体的实现方案中，实时计算引擎可以按照排序方式将获得的始发地到另一目的地之间的交通方案信息进行排序，然后将排序结果通过输出接口输出，以实现输出全部的始发地到另一目的地之间的交通方案信息。
例如，排序方式可以是按照价格由低到高进行排序，或者，也可以是按照时间由短到长进行排序，这两种排序方式仅为举例说明，并不用于限制本方案提到的排序方式。
可以理解的是，本方案实施例中，上述另一目的地可以是除始发城市、目的城市以外的其他城市中的目的地，或者，另一目的地也可以与始发地相同(即用户从始发地前往目的地，然后又由目的地回到始发地)，或者，另一目的地还可以与始发地属于同一城市(用户从始发地前往目的地，然后又由目的地回到始发地所属城市)。
例如，用户由始发地“中坤大厦”前往目的地“迪士尼”，然后由该目的地“迪士尼”前往另一目的地“西湖”。或者，又例如，用户由始发地“中坤大厦”前往目的地“迪士尼”，然后由目的地“迪士尼”前往另一目的地“中坤大厦”。或者，又例如，用户由始发地“中坤大厦”前往目的地“迪士尼”，然后由目的地“迪士尼”前往另一目的地，如“中坤大厦”所在城市“北京”的“华清嘉园”小区。
本方案实施例还在包括另一种可行的实现方案，如图8所示，包括：
801、还接收用户提供的位于始发地和目的地之间的中转地、所述中转地的停留时长。
802、根据所述始发地、所述中转地和所述出发时间，获取始发地所在的始发城市与中转地所在的中转城市的城市间交通方案信息，以及，根据中转地的停留时长，获取中转地所在的中转城市与目的地所在的目的城市的城市间交通方案信息。
803、根据始发地所在的始发城市与中转地所在的中转城市的城市间交通方案信息、中转地所在的中转城市与目的地所在的目的城市的城市间交通方案信息，获取始发城市内交通方案信息、中转城市内交通方案信息和目的城市内交通方案信息。
804、将始发城市内交通方案信息、中转城市内交通方案信息、目的城市内交通方案信息、始发地所在的始发城市与中转地所在的中转城市的城市间交通方案信息、中转地所在的中转城市与目的地所在的目的城市的城市间交通方案信息进行聚合，得到所述始发地与所述目的地之间的交通方案信息。
上述步骤801至步骤804可以分别为步骤101至步骤104的另一种实现方式。
在一种可行的实现方案中，移动终端还可以获取中转地和中转地的出发时间，然后将中转地和中转地的出发时间发送给服务器的输入接口，如此，服务器可以获取到中转地和中转地的出发时间。
移动终端获取中转地和中转地的出发时间实现方案可以包括但不限于：移动终端中安装的客户端可以向用户显示输入界面，通过该输入界面接收用户输入的中转地和中转地的出发时间。
请参考图9，其为本方案实施例所提供的始发地、中转地、目的地、始发城市、中转城市和目的城市的示例图，如图9所示，中转地的出发时间可以是某一天，或者也可以精确到某一天的具体时刻，本方案实施例对此不进行特别限定。
需要说明的是，中转城市内交通方案信息可以包括两段交通方案信息，其中一段是根据始发城市与中转城市的城市间交通方案信息，获得的中转城市内出发地与中转地之间的城市内交通方案信息，另一段是根据中转城市与目的城市的城市间交通方案信息，获得的中转城市内中转地与中转城市内到达地之间的城市内交通方案信息。
以始发城市“北京”、始发地“西直门”、中转城市“天津”、中转地“天津之眼”、目的城市“上海”以及目的地“东方明珠”为例进行说明，如果用户从始发地“西直门”前往“北京南站”，在“北京南站”乘坐高铁前往天津，则中转城市“天津”内出发地为“天津火车站”，因此需要获得中转城市“天津”内的一段交通方案信息，即“天津火车站”与“天津之眼”之间的天津市内交通方案信息。然后，用户在游览完“天津之 眼”之后，需要立即乘飞机前往上海，因此，需要获得中转城市“天津”内另一段交通方案信息，即“天津之眼”与“天津滨海国际机场”之间的天津市内交通方案信息，因此，当存在中转地时，中转城市中的城市内交通方案信息将涉及两段行程。
在一种可行的实现方案中，服务器需要先获取始发地所在的始发城市与中转地所在的中转城市的城市间交通方案信息，以及获取中转地所在的中转城市与目的地所在的目的城市的城市间交通方案信息(均如图9中虚线所示)。然后，根据始发地所在的始发城市与中转地所在的中转城市的城市间交通方案信息，确定始发地与始发城市内到达地之间的城市内交通方案信息，以及，确定中转城市内出发地与中转地之间的中转城市内交通方案信息。
同理，获取中转城市中前往目的城市时，该中转城市内到达地以及目的城市内出发地，然后获得中转地与中转城市内到达地之间的城市内交通方案信息(图9中实线所示)，以及可以获得目的城市中出发地与目的地之间的城市内交通方案信息(图9中实线所示)。
最后进行三个城市内交通方案信息与两个城市间交通方案信息的聚合，得到当存在中转地时始发地与目的地之间的交通方案信息。
需要说明的是，本方案实施例中，服务器根据出发时间，获得始发地到中转地之间的交通方案信息的实现方案，以及，中转地到目的地之间的交通方案信息的实现方案，都与上述当不存在中转地时，获得始发地与目的地之间的交通方案信息的实现原理相同，本领域技术人员可以理解，这里不再赘述。
在一种可行的实现方案中，服务器可以将三个城市内交通方案信息与两个城市间交通方案信息进行聚合，以获得始发地到目的地之间的交通方案信息时，所使用的聚合方式与上述将始发地与始发城市内目的地之间的城市内交通方案信息与始发城市与目的城市的城市间交通方案信息进行聚合，或者将始发城市与目的城市的城市间交通方案与目的城市内始发地与目的地之间的交通方案信息进行聚合的原理相同，本领域技术人员可以理解，这里不再赘述。
进一步的，如图4所示，服务器在获得始发地到目的地之间的交通方案信息之后，可以通过自身的输出接口向移动终端输出部分或者全部的始发地到目的地之间的交通方案信息，以便于移动终端进一步向用户提供该交通方案信息。
在一个具体的实现方案中，可以按照排序方式将获得的始发地到目的地之间的交通方案信息进行排序，然后将排序结果中排名靠前的若干交通方案信息通过输出接口输出， 以实现输出部分的始发地到目的地之间的交通方案信息。
在另一个具体的实现方案中，实时计算引擎可以按照排序方式将获得的始发地到目的地之间的交通方案信息进行排序，然后将排序结果通过输出接口输出，以实现输出全部的始发地到目的地之间的交通方案信息。
例如，排序方式可以是按照价格由低到高进行排序，或者，也可以是按照时间由短到长进行排序，这两种排序方式仅为举例说明，并不用于限制本方案提到的排序方式。
针对步骤104、步骤107或者步骤804中获得的交通方案信息，本方案实施例在此提供这些交通方案信息的应用方式，本方案实施例提供以下几种应用方式，包括：
第一种：根据获得的交通方案信息，进行导航。
第二种：根据获得的交通方案信息，生成电子地图。
第三种：根据获得的交通方案信息，进行行程规划。
第四种：根据获得的交通方案信息，显示与各目的地相关的兴趣点，以及显示该兴趣点的附加服务信息。
第五种：将获得的交通方案信息进行共享。
需要说明的是，上述五种应用方式中，可以单独应用于其中一种，或者也可以组合应用其中的两种以上，本领域技术人员可以理解，本方案实施例对此不进行特别限定。
举例说明，在用户从提供的交通方案信息中选择一个交通方案信息后，可以根据该选出的交通方案信息进行导航，其中，导航包括：实际导航或模拟导航，进一步的，实际导航包括：为用户提供实际导航服务，模拟导航包括：为用户提供模拟行驶服务，以便于让用户可以直观获取在该交通方案信息的具体情况。
在用户选出一个交通方案信息后，还可以根据该交通方案信息，生成电子地地图，其中，该电子地图中包括对该交通方案信息的标注，通过该标注可以让用户直观获取交通方案信息的相关情况，如：交通方案信息的总里程、各个路段的行驶距离、各城市或者各地点的天气等。
在用户选出一个交通方案信息后，还可以根据该交通方案信息，显示该交通方案信息中各城市内的道路信息，其中，该道路信息包括：要经过的道路类型(如：高架桥、高速、公路、小区内的道路等)、要经过的道路的宽度信息和要经过的道路的环境信息等，用户可以根据显示的道路信息确定是否参照交通方案信息。
在用户选出一个交通方案信息后，还可以根据该交通方案信息，显示与各目的地相关的兴趣点，以及该兴趣点的附加服务信息，以便于用户根据自身需求选择兴趣点，其 中，与目的地相关的兴趣点包括：在目的地指定范围内的兴趣点和两个目的地之间道路上的兴趣点，兴趣点的类型具体可以包括：餐馆、停车场、商场、便利店、游乐场和酒店等，并且提供的该兴趣点的附加服务信息，如该兴趣点的消费信息(平均消费信息、单位时间的消费信息)、该兴趣点是否有优惠活动、该兴趣点的地址信息等。
在用户选出一个交通方案信息后，还可以将交通方案信息进行共享，以便于其他用户获取该交通方案信息，增加了用户之间的互动方式。
本方案实施例还提供了总体交互流程的一种具体实现方式，请参考图10，其为本方案实施例所提供的交通信息的获取方法中总体交互流程的示意图，如图10所示，该方法可以包括：
1001、用户在移动终端上输入始发地、中转地、目的地、始发地的出发时间和中转地的停留时长。
1002、移动终端将用户输入的始发地、中转地、目的地、始发地的出发时间和中转地的停留时长发送给服务器。
1003、服务器识别出与所述始发地相匹配的兴趣点(本实施称为始发兴趣点，相当于上述实施例中的始发地)、与中转地相匹配的兴趣点(本实施例称为中转兴趣点，相当于上述实施中的中转地)、与目的地相匹配的兴趣点(本实施例称为目的兴趣点，相当于上述实施例中的目的地)。
1004、服务器根据识别出的各兴趣点，分别识别出始发地所属的始发城市、中转地所属的中转城市和目的地所属的目的城市。
1005、服务器根据出发时间、中转地的停留时间、始发兴趣点、中转兴趣点、目的兴趣点、始发城市、中转城市和目的城市，生成两个五元组，包括：
五元组1：出发时间—始发兴趣点—始发城市—中转城市—中转兴趣点
五元组2：中转兴趣点的出发时间—中转兴趣点—中转城市—目的城市—目的兴趣点
1006、服务器根据五元组1中的元素计算始发兴趣点与中转兴趣点之间的交通方案信息。
1006a、服务器根据出发时间，计算始发城市与中转城市的城市间交通方案信息1。
1006b、服务器根据城市间交通方案信息1，确定始发城市中到达地以及中转城市中出发地。
1006c、服务器计算始发兴趣点与始发城市中到达地之间的城市内交通方案信息2， 以及，计算中转城市中出发地与中转兴趣点之间的城市内交通方案信息3。
1006d、服务器将城市间交通方案信息1、城市内交通方案信息2和城市内交通方案信息3进行聚合，得到始发兴趣点与中转兴趣点之间的交通方案信息A。
1007、服务器根据五元组2中的元素计算中转兴趣点与目的兴趣点之间的交通方案信息。
1007a、服务器根据中转兴趣点的到达时间和停留时长计算中转兴趣点的出发时间，并根据该中转兴趣点的出发时间，计算中转城市与目的城市的城市间交通方案信息4。
1007b、服务器根据城市间交通方案信息4，确定中转城市中到达地以及目的城市中出发地。
1007c、服务器计算中转兴趣点与中转城市中到达地之间的城市内交通方案信息5，以及计算目的城市中出发地与目的兴趣点之间的城市内交通方案信息6。
1007d、服务器将城市间交通方案信息4、城市内交通方案信息5和城市内交通方案信息6进行聚合，得到中转兴趣点与目的兴趣点之间的交通方案信息B。
1008、服务器将始发兴趣点与中转兴趣点之间的交通方案信息A，与中转兴趣点与目的兴趣点之间的交通方案信息B进行聚合，得到始发兴趣点与目的兴趣点之间的交通方案信息C。
1009、服务器将始发兴趣点与目的兴趣点之间的交通方案信息C按照指定的排序方式进行排序，获得排序结果。
1010、服务器根据排序结果，输出部分或者全部的始发兴趣点与目的兴趣点之间的交通方案信息给移动终端。
1011、移动终端向用户显示从服务器接收到的始发兴趣点与目的兴趣点之间的交通方案信息。
基于前述总体流程，本方案实施例还提供了针对总体流程的一种具体实现方式，本实施例中，以始发地是“中坤大厦”(北京)、目的地是迪士尼(上海)、出发日期是11月11日为例，对获得“中坤大厦”与“迪士尼”之间的交通方案信息的实现方案进行举例说明。请参考图11，其为本方案实施例所提供的交通信息的获取方法中总体交互流程的另一示意图，如图11所示，该方法可以包括：
1101、移动终端接收用户输入的当前位置“中坤大厦”、目的地“迪士尼”(上海)、出发日期“11月11日”。
1102、移动终端将接收的当前“中坤大厦”、目的地“迪士尼”、出发日期“11月 11日”发送给服务器。
1103、服务器根据始发地“中坤大厦”识别出所属的始发城市为“北京”，以及根据目的地“迪士尼”识别出所属的目的城市为上海。
1104、服务器生成五元组:11月11日—中坤大厦—北京—上海—迪士尼。
1105、服务器先根据五元组，利用图5b所示的图模型，获得北京与上海之间的候选交通方案信息。
具体的，如图5b所示，服务器将“北京”和“上海”输入图模型，图模型计算时发现可以乘坐高铁或者飞机由北京前往上海，获得以下候选交通方案信息：
候选交通方案信息1：北京南站(北京)→上海虹桥(上海)高铁G5时长4小时55分
候选交通方案信息2：：北京南站(北京)→上海虹桥(上海)高铁G11时长5小时10分
候选交通方案信息3：北京南站(北京)→上海虹桥(上海)动车D313时长10小时7分
候选交通方案信息4：北京南站(北京)→上海虹桥(上海)特快T109时长15小时10分
候选交通方案信息5：首都机场(北京)→浦东机场(上海)飞机CA1501时长2小时10分
候选交通方案信息6：首都机场(北京)→浦东机场(上海)飞机MU8571时长2小时10分
1106、服务器可以进一步基于时长对上述候选交通方案信息进行筛选，本实施例中，时长阈值时10小时，因此筛除候选交通方案信息3和4，将候选交通方案信息1、2、5和6作为可用交通方案信息，即可用交通方案1、2、3和4。
可用交通方案信息1：北京南站(北京)→上海虹桥(上海)高铁G5时长4小时55分
可用交通方案信息2：北京南站(北京)→上海虹桥(上海)高铁G11时长5小时10分
可用交通方案信息3：首都机场(北京)→浦东机场(上海)飞机CA1501时长2小时10分
可用交通方案信息4：首都机场(北京)→浦东机场(上海)飞机MU8571时长2 小时10分
1107、服务器根据出发时间和可用交通方案信息1、2、3和4，分别进行票数搜索，获得11月11日中各班次的剩余票数。然后，服务器根据指定数目(如用户人数2人)、各班次的剩余票数、可用交通方案信息1、2、3和4，发现其中可用交通方案信息2和4的剩余票数是2，因此被筛除，获得如下北京→上海的城市间交通方案信息：
城市间交通方案信息1：北京南站(北京)→上海虹桥(上海)高铁G5，时长4小时55分钟553元
城市间交通方案信息2：首都机场(北京)→浦东机场(上海)国航CA1501航班时长2小时10分钟760元
1108、服务器根据城市间交通方案信息1识别出始发城市内到达地为北京南站，以及，根据城市间交通方案信息2识别出目的城市内出发地为浦东机场。
1109、服务器获取始发城市内中坤大厦到北京南站之间的城市内交通方案信息。
如：中坤大厦→首都机场 出租车 时长60分钟 140元
中坤大厦→北京南站 地铁4号线 时长20分钟 3元
1110、服务器获取目的城市内浦东机场到迪士尼之间的城市内交通方案信息。
如：浦东机场→迪士尼 出租车 时长2小时50分钟 71元
上海虹桥→迪士尼 地铁2号线→2号线→16号线→11号线 时长1小时30分钟 10元
1111、服务器根据城市间交通方案信息1、城市间交通方案信息2、中坤大厦到北京南站之间的城市内交通方案信息、浦东机场到迪士尼之间的城市内交通方案信息，获得中坤大厦与迪士尼之间的交通方案信息，如：
交通方案信息1：
中坤大厦→首都机场 出租车 时长60分钟 140元
首都机场(北京)→浦东机场(上海)国航CA1501航班 时长2小时10分钟 760元
浦东机场→迪士尼 出租车 时长2小时50分钟 71元
交通方案信息2：
中坤大厦→北京南站 出租车 时长35分钟 40元
北京南站(北京)→上海虹桥(上海)高铁G5，时长4小时55分钟 553元
上海虹桥→迪士尼 地铁2号线→2号线→16号线→11号线 时长1小时30分钟  10元
1112、服务器将上述交通方案信息1～2按照价格由低到高进行排序，然后将部分或者全部的排序结果输出给移动终端。
本发明实施例进一步给出实现上述方法实施例中各步骤及方法的装置实施例。
本方案实施例还提供一种交通信息的获取装置，设置于上述服务器中，请参考图12，其为本方案实施例所提供的交通信息的获取装置的功能方块图，如图12所示，包括：
接收单元201，用于接收用户提供的始发地、目的地和出发时间；
预计算单元202，用于根据所述出发时间，获取始发地所在的始发城市与目的地所在的目的城市的城市间交通方案信息；
实时计算单元203，用于根据所述城市间交通方案信息，获取所述始发城市内交通方案信息和所述目的城市内交通方案信息；以及，将所述城市间交通方案信息、所述始发城市内交通方案信息和所述目的城市内交通方案信息进行聚合，得到所述始发地与所述目的地之间的交通方案信息。
在一种可行的实现方案中，所述实时计算单元203具体用于：
根据所述城市间交通方案信息，确定所述始发城市内到达地和所述目的城市内出发地；
根据所述始发地和所述始发城市内到达地，获取所述始发城市内交通方案信息；以及，根据所述目的地和所述目的城市内出发地，获取所述目的城市内交通方案信息。
在一种可行的实现方案中，所述实时计算单元203具体用于：
获取所述城市间交通方案信息中的起点，以作为所述始发城市内到达地；
获取所述城市间交通方案信息中的终点，以作为所述目的城市内出发地。
在一种可行的实现方案中，所述预计算单元202，具体用于：
获取所述始发城市与所述目的城市之间的可用交通方案信息；
根据所述出发时间，对所述可用交通方案信息进行筛选，得到所述城市间交通方案信息。
在一种可行的实现方案中，所述预计算单元202，具体用于：
根据所述出发时间，获取所述可用交通方案信息对应的剩余资源；
选取剩余资源满足预定条件的可用交通方案信息，作为所述城市间交通方案信息。
在一种可行的实现方案中，所述接收单元201，还用于：接收用户提供的位于始发地和目的地之间的中转地、所述中转地的停留时长；
所述预计算单元202，具体用于：根据所述始发地、所述中转地和所述出发时间，获取始发地所在的始发城市与中转地所在的中转城市的城市间交通方案信息，以及，根据中转地的停留时长，获取中转地所在的中转城市与目的地所在的目的城市的城市间交通方案信息；
所述实时计算单元203，具体用于：根据始发地所在的始发城市与中转地所在的中转城市的城市间交通方案信息、中转地所在的中转城市与目的地所在的目的城市的城市间交通方案信息，获取始发城市内交通方案信息、中转城市内交通方案信息和目的城市内交通方案信息；以及，将始发城市内交通方案信息、中转城市内交通方案信息、目的城市内交通方案信息、始发地所在的始发城市与中转地所在的中转城市的城市间交通方案信息、中转地所在的中转城市与目的地所在的目的城市的城市间交通方案信息进行聚合，得到所述始发地与所述目的地之间的交通方案信息。
在一种可行的实现方案中，所述实时计算单元203，还用于根据指定的排序方式，对所述始发地与所述目的地之间的交通方案信息进行排序，得到排序结果；
所述装置还包括：第一输出单元204，用于输出部分或者全部的所述排序结果。
在一种可行的实现方案中，当所述目的地为中转地时，
所述接收单元201，还用于获取用户提供的另一目的地和所述中转地的出发时间；
所述实时计算单元203，还用于根据所述中转地的出发时间，获得所述中转地到所述另一目的地之间的交通方案信息；以及，将所述始发地与所述中转地之间的交通方案信息、所述中转地到所述另一目的地之间的交通方案信息进行聚合，得到所述始发地到所述另一目的地之间的交通方案信息。
在一种可行的实现方案中，所述实时计算单元203，还用于：根据指定的排序方式，对所述始发地到所述另一目的地之间的交通方案信息进行排序，得到排序结果；
还包括：第二输出单元205，用于输出部分或者全部的所述排序结果。
在一种可行的实现方案中，所述指定的排序方式包括按照时间由短到长进行排序和/或按照价格由低到高进行排序。
在一种可行的实现方案中，还包括：
信息应用单元206，用于根据获得的交通方案信息，进行导航；和/或，用于根据获得的交通方案信息，生成电子地图；和/或，用于根据获得的交通方案信息，进行行程规划；和/或，用于根据获得的交通方案信息，显示与各目的地相关的兴趣点，以及显示该兴趣点的附加服务信息；和/或，用于将获得的交通方案信息进行共享。
本方案实施例还提供一种非暂态计算机可读存储介质，该非暂态计算机可读存储介质存储计算机指令，所述计算机指令用于使所述计算机执行以下流程：
接收用户提供的始发地、目的地和出发时间；
根据所述出发时间，获取始发地所在的始发城市与目的地所在的目的城市的城市间交通方案信息；
根据所述城市间交通方案信息，获取所述始发城市内交通方案信息和所述目的城市内交通方案信息；
将所述城市间交通方案信息、所述始发城市内交通方案信息和所述目的城市内交通方案信息进行聚合，得到所述始发地与所述目的地之间的交通方案信息。
本方案实施例还提供一种服务器，请参考图13，其为服务器100的简化框图。该服务器100可以包括与一个或多个数据存储工具连接的处理器101，该数据存储工具可以包括存储介质102和内存单元103。服务器100还可以包括输入接口104、输出接口105，用于与另一装置或系统进行通信。被处理器101的CPU执行的程序代码可存储在存储介质102或内存单元103中。
服务器100中的处理器101调用存储在存储介质102或内存单元103的程序代码，以执行下面各步骤：
通过输入接口104接收用户提供的始发地、目的地和出发时间；根据所述出发时间，获取始发地所在的始发城市与目的地所在的目的城市的城市间交通方案信息；根据所述城市间交通方案信息，获取所述始发城市内交通方案信息和所述目的城市内交通方案信息；将所述城市间交通方案信息、所述始发城市内交通方案信息和所述目的城市内交通方案信息进行聚合，得到所述始发地与所述目的地之间的交通方案信息。
在一种可行的实现方案中，处理器101根据所述城市间交通方案信息，确定所述始发城市内到达地和所述目的城市内出发地；根据所述始发地和所述始发城市内到达地，获取所述始发城市内交通方案信息；以及，根据所述目的地和所述目的城市内出发地，获取所述目的城市内交通方案信息。
在一种可行的实现方案中，处理器101获取所述城市间交通方案信息中的起点，以作为所述始发城市内到达地；获取所述城市间交通方案信息中的终点，以作为所述目的城市内出发地。
在一种可行的实现方案中，处理器101获取所述始发城市与所述目的城市之间的可用交通方案信息；根据所述出发时间，对所述可用交通方案信息进行筛选，得到所述城 市间交通方案信息。
在一种可行的实现方案中，处理器101根据所述出发时间，获取所述可用交通方案信息对应的剩余资源；选取剩余资源满足预定条件的可用交通方案信息，作为所述城市间交通方案信息。
在一种可行的实现方案中，处理器101通过输入接口104接收用户提供的位于始发地和目的地之间的中转地、所述中转地的停留时长；根据所述始发地、所述中转地和所述出发时间，获取始发地所在的始发城市与中转地所在的中转城市的城市间交通方案信息，以及，根据中转地的停留时长，获取中转地所在的中转城市与目的地所在的目的城市的城市间交通方案信息；以及，根据始发地所在的始发城市与中转地所在的中转城市的城市间交通方案信息、中转地所在的中转城市与目的地所在的目的城市的城市间交通方案信息，获取始发城市内交通方案信息、中转城市内交通方案信息和目的城市内交通方案信息；以及，将始发城市内交通方案信息、中转城市内交通方案信息、目的城市内交通方案信息、始发地所在的始发城市与中转地所在的中转城市的城市间交通方案信息、中转地所在的中转城市与目的地所在的目的城市的城市间交通方案信息进行聚合，得到所述始发地与所述目的地之间的交通方案信息。
在一种可行的实现方案中，处理器101根据指定的排序方式，对所述始发地与所述目的地之间的交通方案信息进行排序，得到排序结果；并通过输出接口105输出部分或者全部的所述排序结果。
在一种可行的实现方案中，当所述目的地为中转地时，处理器101还可以获取用户提供的另一目的地和所述中转地的出发时间；根据所述中转地的出发时间，获得所述中转地到所述另一目的地之间的交通方案信息；将所述始发地与所述中转地之间的交通方案信息、所述中转地到所述另一目的地之间的交通方案信息进行聚合，得到所述始发地到所述另一目的地之间的交通方案信息。
在一种可行的实现方案中，处理器101根据指定的排序方式，对所述始发地到所述另一目的地之间的交通方案信息进行排序，得到排序结果；并通过输出接口105输出部分或者全部的所述排序结果。
在一种可行的实现方案中，所述指定的排序方式包括按照时间由短到长进行排序和/或按照价格由低到高进行排序。
在一种可行的实现方案中，处理器101还可以根据获得的交通方案信息，进行导航；和/或，根据获得的交通方案信息，生成电子地图；和/或，根据获得的交通方案信息，进 行行程规划；和/或，根据获得的交通方案信息，显示与各目的地相关的兴趣点，以及显示该兴趣点的附加服务信息；和/或，将获得的交通方案信息进行共享。
所属领域的技术人员可以清楚地了解到，为描述的方便和简洁，上述描述的系统，装置和单元的具体工作过程，可以参考前述方法实施例中的对应过程，在此不再赘述。
以上所述仅为本发明的较佳实施例而已，并不用以限制本发明，凡在本发明的精神和原则之内，所做的任何修改、等同替换、改进等，均应包含在本发明保护的范围之内。

Claims (23)

  1. 一种交通信息的获取方法，其特征在于，包括：
    接收用户提供的始发地、目的地和出发时间；
    根据所述出发时间，获取始发地所在的始发城市与目的地所在的目的城市的城市间交通方案信息；
    根据所述城市间交通方案信息，获取始发城市内交通方案信息和目的城市内交通方案信息；
    将所述城市间交通方案信息、所述始发城市内交通方案信息和所述目的城市内交通方案信息进行聚合，得到所述始发地与所述目的地之间的交通方案信息。
  2. 根据权利要求1所述的方法，其特征在于，根据所述城市间交通方案信息，获取始发城市内交通方案信息和目的城市内交通方案信息，包括：
    根据所述城市间交通方案信息，确定所述始发城市内到达地和所述目的城市内出发地；
    根据所述始发地和所述始发城市内到达地，获取所述始发城市内交通方案信息；以及，根据所述目的地和所述目的城市内出发地，获取所述目的城市内交通方案信息。
  3. 根据权利要求2所述的方法，其特征在于，根据所述城市间交通方案信息，确定所述始发城市内到达地和所述目的城市内出发地，包括：
    获取所述城市间交通方案信息中的起点，以作为所述始发城市内到达地；
    获取所述城市间交通方案信息中的终点，以作为所述目的城市内出发地。
  4. 根据权利要求1所述的方法，其特征在于，根据所述出发时间，获取始发地所在的始发城市与目的地所在的目的城市的城市间交通方案信息，包括：
    获取所述始发城市与所述目的城市之间的可用交通方案信息；
    根据所述出发时间，对所述可用交通方案信息进行筛选，得到所述城市间交通方案信息。
  5. 根据权利要求4所述的方法，其特征在于，根据所述出发时间，对所述可用交通方案信息进行筛选，得到所述城市间交通方案信息，包括：
    根据所述出发时间，获取所述可用交通方案信息对应的剩余资源；
    选取剩余资源满足预定条件的可用交通方案信息，作为所述城市间交通方案信息。
  6. 根据权利要求1至5中任一项所述的方法，其特征在于，
    所述接收用户提供的始发地、目的地和出发时间还包括：接收用户提供的位于始发 地和目的地之间的中转地、所述中转地的停留时长；
    根据所述出发时间，获取始发地所在的始发城市与目的地所在的目的城市的城市间交通方案信息，包括：根据所述始发地、所述中转地和所述出发时间，获取始发地所在的始发城市与中转地所在的中转城市的城市间交通方案信息，以及，根据中转地的停留时长，获取中转地所在的中转城市与目的地所在的目的城市的城市间交通方案信息；
    根据所述城市间交通方案信息，获取始发城市内交通方案信息和目的城市内交通方案信息，包括：根据始发地所在的始发城市与中转地所在的中转城市的城市间交通方案信息、中转地所在的中转城市与目的地所在的目的城市的城市间交通方案信息，获取始发城市内交通方案信息、中转城市内交通方案信息和目的城市内交通方案信息；
    将所述城市间交通方案信息、所述始发城市内交通方案信息和所述目的城市内交通方案信息进行聚合，包括：将始发城市内交通方案信息、中转城市内交通方案信息、目的城市内交通方案信息、始发地所在的始发城市与中转地所在的中转城市的城市间交通方案信息、中转地所在的中转城市与目的地所在的目的城市的城市间交通方案信息进行聚合，得到所述始发地与所述目的地之间的交通方案信息。
  7. 根据权利要求1所述的方法，其特征在于，还包括：
    根据指定的排序方式，对所述始发地与所述目的地之间的交通方案信息进行排序，得到排序结果；
    输出部分或者全部的所述排序结果。
  8. 根据权利要求1至5中任一项所述的方法，其特征在于，当所述目的地为中转地时，还包括：
    获取用户提供的另一目的地和所述中转地的出发时间；
    根据所述中转地的出发时间，获得所述中转地到所述另一目的地之间的交通方案信息；
    将所述始发地与所述中转地之间的交通方案信息、所述中转地到所述另一目的地之间的交通方案信息进行聚合，得到所述始发地到所述另一目的地之间的交通方案信息。
  9. 如权利要求8所述的方法，其特征在于，还包括：
    根据指定的排序方式，对所述始发地到所述另一目的地之间的交通方案信息进行排序，得到排序结果；
    输出部分或者全部的所述排序结果。
  10. 根据权利要求7或9所述的方法，其特征在于，所述指定的排序方式包括按照时 间由短到长进行排序和/或按照价格由低到高进行排序。
  11. 根据权利要求1所述的方法，其特征在于，还包括：
    根据获得的交通方案信息，进行导航；和/或，
    根据获得的交通方案信息，生成电子地图；和/或，
    根据获得的交通方案信息，进行行程规划；和/或，
    根据获得的交通方案信息，显示与各目的地相关的兴趣点，以及显示该兴趣点的附加服务信息；和/或，
    将获得的交通方案信息进行共享。
  12. 一种交通信息的获取装置，其特征在于，包括：
    接收单元，用于接收用户提供的始发地、目的地和出发时间；
    预计算单元，用于根据所述出发时间，获取始发地所在的始发城市与目的地所在的目的城市的城市间交通方案信息；
    实时计算单元，用于根据所述城市间交通方案信息，获取始发城市内交通方案信息和目的城市内交通方案信息；以及，将所述城市间交通方案信息、所述始发城市内交通方案信息和所述目的城市内交通方案信息进行聚合，得到所述始发地与所述目的地之间的交通方案信息。
  13. 根据权利要求12所述的装置，其特征在于，所述实时计算单元具体用于：
    根据所述城市间交通方案信息，确定所述始发城市内到达地和所述目的城市内出发地；
    根据所述始发地和所述始发城市内到达地，获取所述始发城市内交通方案信息；以及，根据所述目的地和所述目的城市内出发地，获取所述目的城市内交通方案信息。
  14. 根据权利要求13所述的装置，其特征在于，所述实时计算单元具体用于：
    获取所述城市间交通方案信息中的起点，以作为所述始发城市内到达地；
    获取所述城市间交通方案信息中的终点，以作为所述目的城市内出发地。
  15. 根据权利要求12所述的装置，其特征在于，所述预计算单元具体用于：
    获取所述始发城市与所述目的城市之间的可用交通方案信息；
    根据所述出发时间，对所述可用交通方案信息进行筛选，得到所述城市间交通方案信息。
  16. 根据权利要求15所述的装置，其特征在于，所述预计算单元具体用于：
    根据所述出发时间，获取所述可用交通方案信息对应的剩余资源；
    选取剩余资源满足预定条件的可用交通方案信息，作为所述城市间交通方案信息。
  17. 根据权利要求12至16中任一项所述的装置，其特征在于，
    所述接收单元，还用于：接收用户提供的位于始发地和目的地之间的中转地、所述中转地的停留时长；
    所述预计算单元，具体用于：根据所述始发地、所述中转地和所述出发时间，获取始发地所在的始发城市与中转地所在的中转城市的城市间交通方案信息，以及，根据中转地的停留时长，获取中转地所在的中转城市与目的地所在的目的城市的城市间交通方案信息；
    所述实时计算单元，具体用于：根据始发地所在的始发城市与中转地所在的中转城市的城市间交通方案信息、中转地所在的中转城市与目的地所在的目的城市的城市间交通方案信息，获取始发城市内交通方案信息、中转城市内交通方案信息和目的城市内交通方案信息；以及，将始发城市内交通方案信息、中转城市内交通方案信息、目的城市内交通方案信息、始发地所在的始发城市与中转地所在的中转城市的城市间交通方案信息、中转地所在的中转城市与目的地所在的目的城市的城市间交通方案信息进行聚合，得到所述始发地与所述目的地之间的交通方案信息。
  18. 根据权利要求12所述的装置，其特征在于，
    所述实时计算单元，还用于根据指定的排序方式，对所述始发地与所述目的地之间的交通方案信息进行排序，得到排序结果；
    所述装置还包括：第一输出单元，用于输出部分或者全部的所述排序结果。
  19. 根据权利要求12至16中任一项所述的装置，其特征在于，当所述目的地为中转地时，
    所述接收单元，还用于获取用户提供的另一目的地和所述中转地的出发时间；
    所述实时计算单元，还用于根据所述中转地的出发时间，获得所述中转地到所述另一目的地之间的交通方案信息；以及，将所述始发地与所述中转地之间的交通方案信息、所述中转地到所述另一目的地之间的交通方案信息进行聚合，得到所述始发地到所述另一目的地之间的交通方案信息。
  20. 根据权利要求19所述的装置，其特征在于，
    所述实时计算单元，还用于：根据指定的排序方式，对所述始发地到所述另一目的地之间的交通方案信息进行排序，得到排序结果；
    还包括：第二输出单元，用于输出部分或者全部的所述排序结果。
  21. 根据权利要求18所述的装置，其特征在于，所述指定的排序方式包括按照时间由短到长进行排序和/或按照价格由低到高进行排序。
  22. 根据权利要求12所述的装置，其特征在于，还包括：
    信息应用单元，用于根据获得的交通方案信息，进行导航；和/或，用于根据获得的交通方案信息，生成电子地图；和/或，用于根据获得的交通方案信息，进行行程规划；和/或，用于根据获得的交通方案信息，显示与各目的地相关的兴趣点，以及显示该兴趣点的附加服务信息；和/或，用于将获得的交通方案信息进行共享。
  23. 一种非暂态计算机可读存储介质，其特征在于，所述非暂态计算机可读存储介质存储计算机指令，所述计算机指令用于使所述计算机执行以下流程：
    接收用户提供的始发地、目的地和出发时间；
    根据所述出发时间，获取始发地所在的始发城市与目的地所在的目的城市的城市间交通方案信息；
    根据所述城市间交通方案信息，获取始发城市内交通方案信息和目的城市内交通方案信息；
    将所述城市间交通方案信息、所述始发城市内交通方案信息和所述目的城市内交通方案信息进行聚合，得到所述始发地与所述目的地之间的交通方案信息。
PCT/CN2017/119673 2017-01-12 2017-12-29 交通信息的获取方法、装置及非暂态计算机可读存储介质 Ceased WO2018130084A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710023102.9A CN108304951A (zh) 2017-01-12 2017-01-12 交通信息的获取方法、装置及非暂态计算机可读存储介质
CN201710023102.9 2017-01-12

Publications (1)

Publication Number Publication Date
WO2018130084A1 true WO2018130084A1 (zh) 2018-07-19

Family

ID=62840257

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/119673 Ceased WO2018130084A1 (zh) 2017-01-12 2017-12-29 交通信息的获取方法、装置及非暂态计算机可读存储介质

Country Status (3)

Country Link
CN (1) CN108304951A (zh)
TW (1) TW201825870A (zh)
WO (1) WO2018130084A1 (zh)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110956315A (zh) * 2019-11-20 2020-04-03 深圳市活力天汇科技股份有限公司 一种空铁联运换乘方案确定方法
CN111415034A (zh) * 2020-03-11 2020-07-14 北京光速斑马数据科技有限公司 一种智能路线排划方法、系统、终端及存储介质
CN112288185A (zh) * 2020-11-13 2021-01-29 腾讯科技（深圳）有限公司 交通路线展示方法、装置、设备及计算机可读存储介质
CN115587112A (zh) * 2022-10-19 2023-01-10 携程商旅信息服务（上海）有限公司 差旅打车管控方法、系统、设备及存储介质

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP7201394B2 (ja) * 2018-10-30 2023-01-10 トヨタ自動車株式会社 情報提供装置、情報提供システム、情報提供方法、情報提供プログラム
CN109949093B (zh) * 2019-03-20 2021-08-24 携程旅游网络技术（上海）有限公司 优惠信息推送方法、系统、电子设备和存储介质
CN111985987A (zh) * 2019-05-22 2020-11-24 上海博泰悦臻网络技术服务有限公司 一种多行程出行服务实现方法、终端及系统
CN111915404B (zh) * 2020-08-04 2024-09-27 携程旅游网络技术（上海）有限公司 多组交通方案的展示方法、系统、设备及存储介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1588373A (zh) * 2004-10-22 2005-03-02 侯清富 一种自动搜索公共交通路径的通用方法及其程序
WO2013127417A1 (de) * 2012-03-01 2013-09-06 Audi Ag Verfahren zum planen einer intermodalen reise
CN103678489A (zh) * 2013-11-12 2014-03-26 中国联合网络通信有限公司广东省分公司 智慧城市出行信息推荐方法及装置
CN105115513A (zh) * 2015-09-08 2015-12-02 深圳中创未来科技有限公司 一种获取出行方案的方法、装置、服务器及客户端

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1871499B (zh) * 2003-09-30 2011-08-17 株式会社建伍 引导路线搜索装置和引导路线搜索方法
CN107024217B (zh) * 2016-02-01 2019-06-11 北京迈维出行科技有限公司 城际交通的路线规划的方法、装置及系统

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1588373A (zh) * 2004-10-22 2005-03-02 侯清富 一种自动搜索公共交通路径的通用方法及其程序
WO2013127417A1 (de) * 2012-03-01 2013-09-06 Audi Ag Verfahren zum planen einer intermodalen reise
CN103678489A (zh) * 2013-11-12 2014-03-26 中国联合网络通信有限公司广东省分公司 智慧城市出行信息推荐方法及装置
CN105115513A (zh) * 2015-09-08 2015-12-02 深圳中创未来科技有限公司 一种获取出行方案的方法、装置、服务器及客户端

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110956315A (zh) * 2019-11-20 2020-04-03 深圳市活力天汇科技股份有限公司 一种空铁联运换乘方案确定方法
CN111415034A (zh) * 2020-03-11 2020-07-14 北京光速斑马数据科技有限公司 一种智能路线排划方法、系统、终端及存储介质
CN112288185A (zh) * 2020-11-13 2021-01-29 腾讯科技（深圳）有限公司 交通路线展示方法、装置、设备及计算机可读存储介质
CN112288185B (zh) * 2020-11-13 2023-07-25 腾讯科技（深圳）有限公司 交通路线展示方法、装置、设备及计算机可读存储介质
CN115587112A (zh) * 2022-10-19 2023-01-10 携程商旅信息服务（上海）有限公司 差旅打车管控方法、系统、设备及存储介质

Also Published As

Publication number Publication date
TW201825870A (zh) 2018-07-16
CN108304951A (zh) 2018-07-20

Similar Documents

Publication Publication Date Title
WO2018130084A1 (zh) 交通信息的获取方法、装置及非暂态计算机可读存储介质
US9255809B2 (en) System and method for integrated trip planning based on fixed and flexible itinerary components
CN103364002B (zh) 结合实时路况及公共交通运营信息的路线规划系统和方法
CN103198647B (zh) 一种基于物联网的城市智能交通查询系统
CN111310077B (zh) 一种旅客智能行程推荐系统和方法
US10515549B1 (en) Method, apparatus, and computer program product for evaluating public transportation use
US10255807B1 (en) Method and apparatus for providing a map data update based on region-specific data turbulence
CN107702729A (zh) 一种考虑预期路况的车辆导航方法及系统
CN106203965A (zh) 一种公交乘车提醒方法、系统及移动终端
CN102645220A (zh) 智能出行方式实时规划推荐方法
CN105210119A (zh) 通过计算装置提供的位置数据点确定通行费的数额
CN108288321A (zh) 基于ic卡数据与车辆gps信息的公交站点上下客流量确定方法
JP6190627B2 (ja) 情報処理システム、情報処理サーバ、情報処理方法、および、情報処理プログラム
CN107085620A (zh) 一种出租车和地铁接驳出行线路的查询方法及系统
CN101814201A (zh) 一种出租车费用计算方法和导航设备
CN104658314A (zh) 基于城市停车位信息的导航系统
CN102538807A (zh) 导航路径规划方法和装置
CN104331824A (zh) 一种公交实时位置数据交易系统及方法
CN110954117B (zh) 车辆及其导航行程服务推送方法、云服务器
CN109241457A (zh) 一种向乘客推荐实时位置信息的方法、装置及终端
US20200278214A1 (en) Method, system, and computer program product for generating synthetic demand data of vehicle rides
CN106951520A (zh) 一种公交乘客出行数据采集系统及其应用
WO2016123867A1 (zh) 一种位置搜索认知的方法及装置
CN104990559A (zh) 一种基于出租车经验数据的路径推荐方法、系统及客户端
CN104867322B (zh) 一种确定公交车停靠站的方法和装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 17891547

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 17891547

Country of ref document: EP

Kind code of ref document: A1