CN104182836A - Route and time planning method of long-distance travel - Google Patents
Route and time planning method of long-distance travel Download PDFInfo
- Publication number
- CN104182836A CN104182836A CN201410421543.0A CN201410421543A CN104182836A CN 104182836 A CN104182836 A CN 104182836A CN 201410421543 A CN201410421543 A CN 201410421543A CN 104182836 A CN104182836 A CN 104182836A
- Authority
- CN
- China
- Prior art keywords
- destination
- information
- region
- flight
- time
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention relates to a route and time planning method of long-distance travel. The route and time planning method comprises a data processing center, a database and a plurality of access sides, wherein the access sides are connected with a processing center through a network, and the data processing center is connected with the database. The method comprises the following steps: inputting a place of departure and a first destination through any access side; obtaining the information of the access side by the data processing center, and calling all pieces of corresponding flight information in a time sequence from the database, wherein the flight information is round-trip flight information; automatically sorting all pieces of flight information according to price; and feeding back the flight information with the lowest price to the corresponding access side. The most economical travel time and routes can be provided for users, multi-point playing routes can be automatically recommended, more abundant route selection can be provided for users, and the search time of the users for multi-point playing is saved.
Description
Technical field
The course line and the time programming method that the present invention relates to a kind of suitable for long-distance tour, belong to tour field.
Background technology
The vertical class search engine of existing tourism divides two large classes.One class is that searching for specific is core, as traffic, hotel, visa etc.For example air ticket search is that user inputs departure place and destination, and Search Results provides air ticket and the subscription information of fitting completely with destination, departure place to user.This search needs user to have clear and definite search target just can carry out.Another kind of is that existing packaged products is searched for, as team travel, admission ticket etc.For example, in certain travelling products site search destination, website can offer the relevant tourism packaged products of user search.This search is to search in the existing product library in website, and its essence is exactly that Ba Xianxia travel agency product is placed on website, and the richness of Search Results depends on resource under the line of website.For tourism destination completely specified travelling user not necessarily, first kind search engine need to repeatedly be changed search word and search a plurality of websites, be difficult to make a policy fast, and Equations of The Second Kind search engine degree of freedom and be quantitatively difficult to meet the demands.
Summary of the invention
The problem existing in order to solve prior art, the invention provides a kind of course line and time programming method of suitable for long-distance tour, can provide most economical travel time and course line for user, and can automatically recommend the multiple spot course line of playing, for user provides abundanter route selection, save the search time that user's multiple spot is played.
The technical solution adopted in the present invention:
A kind of course line of suitable for long-distance tour and time programming method, comprise data processing centre (DPC), database and several access ends, described in several, access end is connected by network with described processing enter, and described data processing centre (DPC) is connected with described database, and the method comprises:
1) by any one access end input departure place and the first destination;
2) data processing centre (DPC) obtains the information of access end and from database, transfers in chronological order all corresponding Flight Informations, and described Flight Information is turnaround information;
3) all Flight Informations are carried out to auto-sequencing according to the height of price, and cheapest Flight Information is fed back on corresponding access end;
4) data processing centre (DPC) is according in the first region, destination, automatically from database, transfer all Flight Informations of going to other cities in region from this first destination, described other cities are the second destination, now return Flight Information is the Flight Information returning to one's starting point from the second destination, according to the different summations of price of calculating turnaround information and going to the Flight Information of this second destination in the city of going to the second destination, and sort from low to high according to the height of price, and this information is fed back on access end.
In step 1, also can input departure time or departure time region by access end, corresponding, the outbound Flight Information that data processing centre (DPC) transfers in step 2 is the Flight Information of the corresponding lowest price in this departure time or this departure time region.
Further, in step 1, can also input return trip time or return trip time region by access end, described return trip time is later than the last day in described departure time or described departure time region, the first day in described return trip time region is later than the last day of described departure time or described departure time, the Flight Information of the corresponding lowest price in return Flight Information Wei Gai Huo Gai return trip time of the return trip time region that accordingly, data processing centre (DPC) transfers in step 2.
Certainly the in the situation that of not inputting return trip time or return trip time region in step 1, data processing centre (DPC) calculates return trip time region automatically, and described reckoning return trip time region is for after outbound flight arrives described the first destination between 3-7 days.
Preferably, the world is divided into Japan and Korea S region, region, Hong Kong, Macao and Taiwan, region, Southeast Asia, region, South Asia, region, West Asia, region, the Central Asia, region, North America, Sino-U.S. region, region, South America, European region, region, Oceania and African region, in step 4, the time of going to the second destination is for after outbound flight arrives described the first destination between 3-5 days.
Preferably, in step 4, data processing centre (DPC) can also recall the 3rd destination from database, described the 3rd destination and described the second destination are in same region, transfer all Flight Informations of going to the 3rd destination from the second destination simultaneously, now return Flight Information is the Flight Information returning to one's starting point from the 3rd destination, according to the city different calculating turnaround information of going to the second destination and the 3rd destination, go to the Flight Information of this second destination and from the second destination, go to the summation of price of the Flight Information of the 3rd destination, and sort from low to high according to the height of price, and this information is fed back on access end.
The time of further, going to described the 3rd destination is for certainly arriving the 3-5 days behind the second destination.
Conventionally, the distance between described the 3rd destination and described the first destination can be greater than the distance between described the second destination and described the first destination.
Conventionally, the angle that the line between the line between described the first destination and described the second destination and described the second destination and described the 3rd destination forms can be right angle or obtuse angle.
Preferably, data processing centre (DPC) can also transfer corresponding tourist attractions and hotel information and feed back in client from database.
Urban information in preferred described database also comprises the label information relevant to this city.
Common described label information can be geographical labels information, emotion label information, active tags information and or brand label information.
Preferably, in step 1, in the first object, be located in the corresponding label information of input; In step 2, data processing centre (DPC) obtains corresponding label information, and captures the one or more cities corresponding with this label information from database, transfers in chronological order all corresponding Flight Informations simultaneously from database.
Beneficial effect of the present invention:
This method is by calculating the total price of all turnarounds, by contrast, obtain the minimum turnaround price on the same day, and by all same day of the whole year minimum turnaround price contrast, thereby obtain annual minimum turnaround price, and user is recommended in this course line, thereby provide most economical hourage and course line for user.
By recommending the second destination of the first destination periphery, for user provides more itinerary circuit, provide the first destination and most economical hourage and the course line of second destination whole year, for user extends user's itinerary cost-saving time simultaneously.
By setting departure time or departure time region, return trip time or return trip time region, data processing centre (DPC) is by searching cheapest Flight Information and offer user in this time zone, and the user who relatively limits for the time provides most economical hourage and course line.
The return trip time region that data processing centre (DPC) calculates is automatically for arriving the 3-7 days behind described the first destination, by the return trip time region of reasonable setting, for user can provide relatively loose playing the time, at the 3rd day, between the 7th day, filter out most economical Flight Information simultaneously.
The setting of the 3rd destination, can further extend user's itinerary, and Automatic Combined is selected for user a most economical hourage.
The setting of tourist attractions and hotel information, can be user provides the details of destination for reference, facilitates its trip.
The setting of label information, user can search for the mode of label by actual demand, determine which city meets the actual demand of oneself, thereby saves a large amount of time of searching urban information of user.
Embodiment
The present invention relates to a kind of course line and time programming method of suitable for long-distance tour, comprise data processing centre (DPC), database and several access ends, described in several, access end is connected by network with described processing enter, and described data processing centre (DPC) is connected with described database, and the method comprises:
1) by any one access end input departure place and the first destination;
2) data processing centre (DPC) obtains the information of access end and from database, transfers in chronological order all corresponding Flight Informations, and described Flight Information is turnaround information;
Corresponding Flight Information described here is all flights (flying nonstop to) of the first destination that fly to that take off from departure place every day, and from departure place, takes off and after transfer, fly to all flights (transfer) of the first destination air ticket price, the departure time and the time of arrival of all corresponding flights of automatic acquisition.
Here it is emphasized that the departure time in corresponding Flight Information is all later than the same day of input departure place and destination.
3) all Flight Informations are carried out to auto-sequencing according to the height of price, and cheapest Flight Information is fed back on corresponding access end;
All Flight Informations are carried out to auto-sequencing according to the height of price, and this process is divided into two steps specifically:
The first step: Flight Information price comparison every day, transfer all Flight Informations of all first destinations of flying to from departure place on the same day, and carry out price comparison, filter out the most cheap Flight Information (outbound Flight Information) of price every day; Since the same day toward pusher from the 3rd day to the 7th day only, transfer all Flight Informations of all departure places of flying to from the first destination in the past few days, and carry out price comparison, filter out the Flight Information that price is the most cheap (return Flight Information), thereby obtain the most cheap roundtrip Flight Information on the same day, according to this kind of way, extrapolate respectively the most cheap roundtrip Flight Information on the annual same day;
Second step: carried out to price contrast between the most cheap turnaround information the annual same day, filtered out the most cheap annual roundtrip Flight Information, and by this whole year the most cheap roundtrip Flight Information feed back on access end, for reference.
4) data processing centre (DPC) is according in the first region, destination, automatically from database, transfer all Flight Informations of going to other cities in region from this first destination, described other cities are the second destination, now return Flight Information is the Flight Information returning to one's starting point from the second destination, according to the different summations of price of calculating turnaround information and going to the Flight Information of this second destination in the city of going to the second destination, and sort from low to high according to the height of price, and this information is fed back on access end.
Here it should be explained that the second destination and the first destination are in same region, and between the two, have direct route flight, course line route is now divided into 3 sections, and first paragraph, from departure place to the first destination; Second segment, from the first destination to the second destination; The 3rd section returns to one's starting point from the second destination.
Most economical Flight Information screening process with the second destination is divided into three steps:
The first step: Flight Information price comparison every day, transfer all Flight Informations of all first destinations of flying to from departure place on the same day, and carry out price comparison, filter out the most cheap Flight Information (outbound Flight Information) of price every day, since the same day toward pusher from the 3rd day to the 5th day only, transfer all Flight Informations of this all second destination of flying to from the first destination of 3 days, and filter out cheapest Flight Information every day (the first destination is to the second destination), now should obtain 3 cheapest Flight Informations (corresponding a day respectively), again according to the time of arriving at the second destination of these 3 cheapest Flight Informations, respectively toward pusher since the 3rd day to the 5th day only, transfer these all Flight Informations that return to one's starting point from the second destination for 3 days and carry out price comparison, filter out the Flight Information that price is the most cheap (return Flight Information), so the scheme of 3 second destinations of flying to from the first destination is a corresponding scheme of flying to departure place from the second destination respectively, calculate respectively the price of these 3 schemes, contrast filters out a cheapest scheme and the complete Flight Information of one of the most cheap Flight Information of first destination of flying to from departure place same day composition, according to this kind of way, extrapolate respectively the most cheap roundtrip Flight Information on the annual same day,
Second step: carried out to price contrast between the most cheap turnaround information the annual same day, filtered out the most cheap annual roundtrip Flight Information, and by this whole year the most cheap roundtrip Flight Information feed back on access end, for reference;
The 3rd step: be several owing to having the quantity in the city of direct route flight with the first destination in same region, these several cities are obtained respectively to annual minimum round trip information separately by the first step and second step respectively, by several minimum years minimum round trip information according to its price, sort from low to high and feed back on access end.
At this, also it should be noted that: about the division in region, the world is divided into Japan and Korea S region, region, Hong Kong, Macao and Taiwan, region, Southeast Asia, region, South Asia, region, West Asia, region, the Central Asia, region, North America, Sino-U.S. region, region, South America, European region, region, Oceania and African region.
Wherein, Japan and Korea S region Ben He Korea S in a few days.
Region, Hong Kong, Macao and Taiwan refers to Hong Kong, Macao and Taiwan.
Region, Southeast Asia comprises Vietnam, Laos, Cambodia, Thailand, Burma, Malaysia, Indonesia, Brunei, Philippine, East Timor, Singapore.
Region, South Asia comprises India, Pakistan, Bangladesh, Sri Lanka, Nepal, Bhutan and the ground such as Maldivian.
Region, West Asia comprises the countries such as Saudi Arabia, Yemen, Oman, the United Arab Emirates, Qatar, Bahrain, Kuwait, Israel, Palestine, Lebanon, Jordan, Syria, Cyprus, Turkey, Azerbaijan, Georgia, Iraq, Iran, Afghanistan, Armenia.
Region, the Central Asia is included as Kazakhstan, Turkmenistan, Kirghizstan, Uzbekistan, Tajikistan five states.
Region, North America comprises Bahamas, the U.S., Canada, Costa Rica, Cuba, Grenada, Jamaica, St. Lucia, Mexico.
Sino-U.S. region comprises Panama, Costa Rica, Nicaragua, Honduras, Salvador, Guatemala, Belize.
Region, South America comprises Colombia, Venezuela, Guyana, Surinam, Ecuador, Peru, Brazil, Bolivia, Chile, Paraguay, Uruguay, Argentina.
Region, Europe comprises Britain, Ireland, Holland, Belgium, Luxembourg, France, Monaco, Poland, Czech, Slovakia, Hungary, Germany, Austria, Switzerland, Iceland, Denmark, Norway, Sweden, Finland, Estonia, Latvia, Lithuania, Byelorussia, Ukraine, Moldova.
Region, Oceania comprises Australia, New Zealand, New Guinea, Melanesia, Micronesia and Polynesia.
Region, Africa comprises Egypt, the Sudan, Tunisia, Algeria, Morocco, the Azores, Madeira, Djibouti, Kenya, Tanzania, Uganda, Rwanda, Burundi and Seychelles, Senegal, Gambia, Guinea, Cape Verde, Sierra Leone, Liberia, Cote d'lvoire, Ghana, Togo, Benin, in non-, Cameroon, Zimbabwe, Malawi, Mozambique, South Africa, Swaziland, Reunion, St.Helena and Ascension.
At this, also it should be noted that; the present invention is mainly used in the situation of overseas trip; its departure place is city (as: Shanghai, Beijing, Guangzhou, Nanjing etc.) within Chinese territory, certainly of the present invention do certain conversion as departure place in European city too within protection scope of the present invention.
Concrete example explanation once:
Embodiment 1:
Suppose that departure place is set to Shanghai, user wants to play to the Bangkok in Southeast Asia, and user did not limit the time.
User by access end set out be located in input Shanghai, the first object be located in input Bangkok;
Data processing centre (DPC) receives the information of this access end, and processes, automatically the flight in all Bangkok of flying to from Shanghai and the return flight being flown in Shanghai in Bangkok from database.
Suppose, the flight in Bangkok of flying to from Shanghai every day is 10 sorties (comprising direct route and transfer), 1 year 365 days, take wherein one day be example, transfer the Flight Information of these days 10 sortie, and the Flight Information of this 10 sortie carried out to price contrast, filter out cheapest Flight Information, the like, can obtain 365 the same day cheapest Flight Information, and by this 365 the same day cheapest Flight Information store.
Infer the pricing information that makes a return voyage: because return flight is later than outbound Flight Information certainly, the time of automatically inferring return flight is after outbound flight moral 3 days before 7 days, certainly return trip time can be by user's free setting, if the flight in the Bangkok of flying to from Shanghai is on July 1st, 2014, can infer that return trip time is between on July 7th, 1 2014 on July 3rd, 2014, data processing centre (DPC) transfers all Flight Informations in all Shanghai of flying to from Bangkok in these 4 days on July 7, of-2014 on the 3rd July in 2014, the row filter of going forward side by side goes out cheapest Flight Information, and combine and calculate the price summation of turnaround information with the Flight Information in the Bangkok of flying to from Shanghai on July 1st, 2014, calculate by that analogy the cheapest turnaround information of 365 day every day.
These 365 cheapest turnaround information are carried out, and contrast and obtain annual cheapest roundtrip Flight Information, and feed back to client.
The information that now feeds back to client comprises taking off of turnaround and arrives ETA estimated time of arrival and price.
Recommendation about the second destination:
Data processing centre (DPC) transfers the city (as: Wu Long, Peng Shiluo, Kuala Lumpur etc.) that there is direct route flight in all and Bangkok in region, Southeast Asia automatically, and the Wu Long of once take describes as example:
Transfer all Flight Informations in Bangkok that fly to from Shanghai every day, and filter out respectively the lowest price of every day, and store (365 lowest price outbound Flight Informations);
Calculate the fly to lowest price of Wu Long of Bangkok, data processing centre (DPC) infers fly to behind Bangkok in Shanghai the 3rd day to the 5th day automatically, Wu Long flies to from Bangkok, if the flight in the Bangkok of flying to from Shanghai is on July 1st, 2014, can infer the Wu Long that flies to from Bangkok on July 5,3 days to 2014 July in 2014, obtain respectively July 3, the Flight Information in July 4 and July 5, and filter out respectively, the lowest price on July 3 (Bangkok fly to Wu Long), the lowest price in the lowest price on July 4 and July 5 days, calculate again the time of returning to Shanghai from Wu Long, this time-division 3 situations:
First situation, the Wu Long that flew to from Bangkok July 3, to pusher 3-5 day, can calculate 5-July 7 July, from this, within 3 days, filter out cheapestly from the Wu Long Flight Information in Shanghai that flies to, and obtain the minimum flight prices of Bangkok to crow grand (July 3), Wu Long to Shanghai;
Second situation, the Wu Long that flew to from Bangkok July 4, to pusher 3-5 day, can calculate 6-July 8 July, from this, within 3 days, filter out cheapestly from the Wu Long Flight Information in Shanghai that flies to, and obtain the minimum flight prices of Bangkok to crow grand (July 4), Wu Long to Shanghai;
The 3rd situation, the Wu Long that flew to from Bangkok July 5, to pusher 3-5 day, can calculate 7-July 9 July, from this, within 3 days, filter out cheapestly from the Wu Long Flight Information in Shanghai that flies to, and obtain the minimum flight prices of Bangkok to crow grand (July 5), Wu Long to Shanghai.
Contrast these 3 situations obtain the minimum Wu Long that flies to from Bangkok of price, from the fly to flight prices in Shanghai add up and obtain going from Shanghai July 1 Bangkok grand again to the minimum flight combination in Bangkok to crow again with the corresponding flight prices of Flight Information of the Wu Long that flew to from Shanghai July 1 of Wu Long.
---the lowest price flight in Shanghai, Bangkok---Wu Long---combines from Shanghai to extrapolate by that analogy annual every day.
To between these 365 lowest price flight combinations, carry out price contrast again, and filter out cheapest one day (annual lowest price flight combination).
By above mode, extrapolate respectively from Shanghai that---the annual lowest price flight combination in Shanghai, Bangkok---Peng Shiluo---,---the annual lowest price flight combination in all cities is extrapolated in the annual lowest price flight combination in Shanghai, Bangkok---Kuala Lumpur---in Shanghai.
Annual lowest price flight combination between these different cities (the second destination) is sorted from low to high according to the height of price, and a front 1-50 information is fed back on access end, for reference.
Certainly, inputted in the situation of the second destination for user, the process of its processing procedure and embodiment 1 is basic identical just carries out price comparison without carrying out between each different cities (the second destination), at this, does not just illustrate.
User also can input departure time or departure time region, return trip time or return trip time region by access end, for departure time and the relatively-stationary user of return trip time, in data processing centre's processing procedure and embodiment 1, said processing procedure is basic identical, just without annual 365 days all Flight Informations are transferred, only need transfer the Flight Information of correlation time, thereby and compare the most economical flight combination obtaining in the relative set time.
At this, it is emphasized that the second destination can be recommended by data processing centre (DPC), as is less than 6 days in the situation that departure time and return trip time are greater than 6 days, data processing centre (DPC) will not carry out the recommendation of the second destination.
Most economical Flight Information screening process about the 3rd destination is divided into three steps:
The first step: Flight Information price comparison every day, transfer all Flight Informations of all first destinations of flying to from departure place on the same day, and carry out price comparison, filter out the most cheap Flight Information (outbound Flight Information) of price every day, since the same day toward pusher from the 3rd day to the 5th day only, transfer all Flight Informations of this all second destination of flying to from the first destination of 3 days, and filter out cheapest Flight Information every day (the first destination is to the second destination), now should obtain 3 cheapest Flight Informations (corresponding a day respectively), again according to the time of arriving at the second destination of these 3 cheapest Flight Informations, respectively toward pusher since the 3rd day to the 5th day only, transfer all Flight Informations that fly to the 3rd destination from the second destination in these 3 days, the Flight Information combination of the second destination and the 3rd destination of flying to from the second destination of flying to from the first destination so always has 9 kinds, according to this in 9 combined situation after arriving the second destination to pusher since the 3rd day to the 5th day only, transfer these 3 days all flights that return to one's starting point from the 3rd destination, the row filter of going forward side by side obtains cheapest Flight Information (return Flight Information), so the scheme of 9 fly to from the first destination the second destination the 3rd destinations of flying to from the second destination is a corresponding scheme of flying to departure place from the 3rd destination respectively, calculate respectively the price of these 9 schemes, contrast filters out a cheapest scheme and the complete Flight Information of one of the most cheap Flight Information of first destination of flying to from departure place same day composition, according to this kind of way, extrapolate respectively the most cheap roundtrip Flight Information on the annual same day,
Second step: carried out to price contrast between the most cheap turnaround information the annual same day, filtered out the most cheap annual roundtrip Flight Information, and by this whole year the most cheap roundtrip Flight Information feed back on access end, for reference;
The 3rd step: be several owing to having the quantity in the city of direct route flight with the first destination and the second destination in same region, these several cities are obtained respectively to annual minimum round trip information separately by the first step and second step respectively, by several minimum years minimum round trip information according to its price, sort from low to high and feed back on access end.
At this, it is emphasized that all schemes with 3 destinations and all schemes with two destinations, all enumerate and carry out price contrast according to price order sequence from low to high, and feeding back on access end.
The embodiment with 3 destinations is substantially identical with embodiment 1, at this, no longer illustrates.
Generally, distance between described the 3rd destination and described the first destination is greater than the distance between described the second destination and described the first destination, and the angle that the line between the line between described the first destination and described the second destination and described the second destination and described the 3rd destination forms is right angle or obtuse angle.By such restriction, the distance that the first destination is passed through to the 3rd destination to the second destination is again the shortest, and short inevitable corresponding the air ticket price spending of distance is lower, further saves journey time and cost.
Providing of tourist attractions and hotel information, further facilitates user's trip.
Database of the present invention can select to take journey database (its inside has all Flight Informations) in actual applications.
About label information:
Urban information in described database also comprises the label information relevant to this city.
Described label information be geographical labels information, emotion label information, active tags information and or brand label information.
Described geographical labels information comprises the labels such as city, rural area, island, scenery with hills and waters, desert, volcano, historic site;
Described emotion label information comprises the labels such as parent-offspring, honeymoon;
The labels such as described active tags comprises hot spring, mountain-climbing, skiing, does shopping, hunts for novelty, wild animal, theme park;
Described brand label comprises the labels such as world cultural heritage, national wind.
Win urban label, refer to following table:
| City | Label | City | Label |
| Kuala Lumpur | City, shopping | Okinawa | World cultural heritage, parent-offspring, island |
| Tawau | Island, diving | Nagoya | World cultural heritage, city, historic site |
| In U.S. | Island, world cultural heritage | Fukuoka | Island, cuisines, theme park |
| Ya Luoshi beats | Rural area, hunt for novelty | Kagoshima | Island, hot spring, volcano |
| Bangkok | City, parent-offspring, freak's show | Hiroshima | World cultural heritage, scenery with hills and waters |
| Pu Ji | Island, honeymoon | Kobe | Hot spring, mountain-climbing, beef |
| Chiang Mai | Rural area, wild animal | Blue or green gloomy | Scenery with hills and waters |
| Su Mei island | Island, honeymoon | Nagasaki | Mountain-climbing, theme park, island |
| Element can be safe | Historic site, world cultural heritage | Soul | World cultural heritage, historic site, shopping |
| Peng Shiluo | Historic site | Pusan | Island, city, seafood |
| Multitude | Scenery with hills and waters | Jizhou Island | Island, volcano, mountain-climbing, shopping |
| Wu Long | Historic site | Lishui | Historic site |
| Husky public affairs are received sky | Hunt for novelty | Hong Kong | City, shopping, parent-offspring, cuisines, honeymoon |
| Li Yifu | Historic site | Macao | City, shopping, cuisines |
| Ha Noi | Historic site | The Taibei | City, cuisines, night market |
| Ho Chi Minh City | City | Kaohsiung | Scenery with hills and waters, cuisines, the most U.S. rapid transit station |
| Hue | Historic site, world cultural heritage | In platform | Scenery with hills and waters, historic site |
| Coast defence | Historic site, world natural heritage, French landscape | Colombo | Island, city, shopping |
| Singapore | City, shopping, parent-offspring | Saipan | Island, honeymoon, diving |
| Si Libajia gulf | Rural area | Dubai | City, historic site, theme park |
| Jingdone district | City, shopping, parent-offspring | Male | Island, honeymoon, spend a holiday |
| Osaka | City, historic site, parent-offspring, Northwest culture | Khatmandu | Historic site |
In step 1, in the first object, be located in the corresponding label information of input; In step 2, data processing centre (DPC) obtains corresponding label information, and captures the one or more cities corresponding with this label information from database, transfers in chronological order all corresponding Flight Informations simultaneously from database.
At this, it should be noted that, in step 1, the label information of input can be a label information, can be also a plurality of label informations.
As input " island ", in step 2, data processing centre (DPC) captures all urban informations with " island " label from database, and list (Tawau, pounce on, Su Meidao, Kagoshima etc.), then user can select its city of wanting, data processing centre (DPC) carries out the processing of follow-up Flight Information, and as user does not select concrete city, data processing centre (DPC) will carry out respectively the processing of Flight Information according to each city.
As input " island "+" city ", in step 2, data processing centre (DPC) captures the while with all urban informations of " island " and " city " label from database, and list (Pusan, Colombo etc.), then user can select its city of wanting, data processing centre (DPC) carries out the processing of follow-up Flight Information, and as user does not select concrete city, data processing centre (DPC) will carry out respectively the processing of Flight Information according to each city.
The present invention is not limited to above-mentioned preferred forms; anyone can draw other various forms of products under enlightenment of the present invention; no matter but do any variation in its shape or structure; every have identical with a application or akin technical scheme, within all dropping on protection scope of the present invention.
Claims (13)
1. the course line of a suitable for long-distance tour and time programming method, it is characterized in that: comprise data processing centre (DPC), database and several access ends, described in several, access end is connected by network with described processing enter, and described data processing centre (DPC) is connected with described database, and the method comprises:
1) by any one access end input departure place and the first destination;
2) data processing centre (DPC) obtains the information of access end and from database, transfers in chronological order all corresponding Flight Informations, and described Flight Information is turnaround information;
3) all Flight Informations are carried out to auto-sequencing according to the height of price, and cheapest Flight Information is fed back on corresponding access end;
4) data processing centre (DPC) is according in the first region, destination, automatically from database, transfer all Flight Informations of going to other cities in region from this first destination, described other cities are the second destination, now return Flight Information is the Flight Information returning to one's starting point from the second destination, according to the different summations of price of calculating turnaround information and going to the Flight Information of this second destination in the city of going to the second destination, and sort from low to high according to the height of price, and this information is fed back on access end.
2. the course line of suitable for long-distance tour according to claim 1 and time programming method, it is characterized in that: in step 1, also can input departure time or departure time region by access end, accordingly, the outbound Flight Information that data processing centre (DPC) transfers in step 2 is the Flight Information of the corresponding lowest price in this departure time or this departure time region.
3. the course line of suitable for long-distance tour according to claim 2 and time programming method, it is characterized in that: in step 1, can also input return trip time or return trip time region by access end, described return trip time is later than the last day in described departure time or described departure time region, the first day in described return trip time region is later than the last day of described departure time or described departure time, the Flight Information of the corresponding lowest price in return Flight Information Wei Gai Huo Gai return trip time of the return trip time region that accordingly, data processing centre (DPC) transfers in step 2.
4. the course line of suitable for long-distance tour according to claim 3 and time programming method, it is characterized in that: the in the situation that of not inputting return trip time or return trip time region in step 1, data processing centre (DPC) calculates return trip time region automatically, and described reckoning return trip time region is for after outbound flight arrives described the first destination between 3-7 days.
5. the course line of suitable for long-distance tour according to claim 1 and time programming method, it is characterized in that: the world is divided into Japan and Korea S region, region, Hong Kong, Macao and Taiwan, region, Southeast Asia, region, South Asia, region, West Asia, region, the Central Asia, region, North America, Sino-U.S. region, region, South America, European region, region, Oceania and African region, in step 4, the time of going to the second destination is for after outbound flight arrives described the first destination between 3-5 days.
6. the course line of suitable for long-distance tour according to claim 5 and time programming method, it is characterized in that: in step 4, data processing centre (DPC) can also recall the 3rd destination from database, described the 3rd destination and described the second destination are in same region, transfer all Flight Informations of going to the 3rd destination from the second destination simultaneously, now return Flight Information is the Flight Information returning to one's starting point from the 3rd destination, according to the city different calculating turnaround information of going to the second destination and the 3rd destination, go to the Flight Information of this second destination and from the second destination, go to the summation of price of the Flight Information of the 3rd destination, and sort from low to high according to the height of price, and this information is fed back on access end.
7. the course line of suitable for long-distance tour according to claim 6 and time programming method, is characterized in that: go to the time of described the 3rd destination for certainly arriving the 3-5 days behind the second destination.
8. the course line of suitable for long-distance tour according to claim 7 and time programming method, is characterized in that: the distance between described the 3rd destination and described the first destination is greater than the distance between described the second destination and described the first destination.
9. the course line of suitable for long-distance tour according to claim 8 and time programming method, is characterized in that: the angle that the line between the line between described the first destination and described the second destination and described the second destination and described the 3rd destination forms is right angle or obtuse angle.
10. the course line of suitable for long-distance tour according to claim 1 and time programming method, is characterized in that: data processing centre (DPC) can also transfer corresponding tourist attractions and hotel information and feed back in client from database.
The course line of 11. suitable for long-distance tour according to claim 1 and time programming method, is characterized in that: the urban information in described database also comprises the label information relevant to this city.
The course line of 12. suitable for long-distance tour according to claim 11 and time programming method, is characterized in that: described label information be geographical labels information, emotion label information, active tags information and or brand label information.
The course line of 13. suitable for long-distance tour according to claim 12 and time programming method, is characterized in that: in step 1, in the first object, be located in the corresponding label information of input; In step 2, data processing centre (DPC) obtains corresponding label information, and captures the one or more cities corresponding with this label information from database, transfers in chronological order all corresponding Flight Informations simultaneously from database.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410421543.0A CN104182836B (en) | 2014-08-26 | 2014-08-26 | The course line of suitable for long-distance tour and time programming method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410421543.0A CN104182836B (en) | 2014-08-26 | 2014-08-26 | The course line of suitable for long-distance tour and time programming method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104182836A true CN104182836A (en) | 2014-12-03 |
| CN104182836B CN104182836B (en) | 2018-04-10 |
Family
ID=51963858
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410421543.0A Active CN104182836B (en) | 2014-08-26 | 2014-08-26 | The course line of suitable for long-distance tour and time programming method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104182836B (en) |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104850903A (en) * | 2015-05-11 | 2015-08-19 | 中国旅游研究院 | Construction and budget method of local tourism popularity index |
| CN105574708A (en) * | 2015-12-10 | 2016-05-11 | 北京创鑫旅程网络技术有限公司 | Travel route planning method and apparatus |
| CN106251208A (en) * | 2016-08-09 | 2016-12-21 | 上海携程商务有限公司 | The interactive display method and device of machine profile |
| CN107015731A (en) * | 2017-04-26 | 2017-08-04 | 携程旅游网络技术（上海）有限公司 | Come and go the rendering method and system of combination ticket price |
| CN107291901A (en) * | 2017-06-23 | 2017-10-24 | 携程旅游网络技术（上海）有限公司 | Main passive combination obtains method, system, equipment and the storage medium of air ticket data |
| CN107392660A (en) * | 2017-07-14 | 2017-11-24 | 深圳市活力天汇科技股份有限公司 | A kind of budget fare lookup method |
| CN107767116A (en) * | 2017-10-12 | 2018-03-06 | 携程旅游网络技术（上海）有限公司 | Trip product automation method for pushing, system, storage medium and electronic equipment |
| CN107844611A (en) * | 2017-12-15 | 2018-03-27 | 携程旅游网络技术（上海）有限公司 | Multiple spot to multiple spot flight search method, system, equipment and storage medium |
| CN107945063A (en) * | 2017-12-11 | 2018-04-20 | 孙二林 | A kind of system and method for providing travel information using the intelligent assistant that travels |
| CN107992576A (en) * | 2017-12-03 | 2018-05-04 | 飞友科技有限公司 | A kind of connecting flight optimizes recommendation method |
| CN108038749A (en) * | 2017-12-04 | 2018-05-15 | 海南私航会信息科技有限公司 | A kind of business airplane intelligent scheduling real-time price quotations method and its system |
| CN108563745A (en) * | 2018-04-13 | 2018-09-21 | 中国民航信息网络股份有限公司 | It has inquired enclave and has determined method, apparatus, equipment and medium |
| CN108696545A (en) * | 2017-02-14 | 2018-10-23 | 北京嘀嘀无限科技发展有限公司 | Message method and device |
| CN110309440A (en) * | 2019-07-10 | 2019-10-08 | 中国民航信息网络股份有限公司 | Ticket price searching method and relevant device |
| CN110728399A (en) * | 2019-09-27 | 2020-01-24 | 广州市骑鹅游信息技术咨询服务有限公司 | Air ticket intelligent splicing method and system based on big data |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1372216A (en) * | 2001-02-27 | 2002-10-02 | 硕网资讯股份有限公司 | Multi-range tiket ordering system and method thereof for internation airline |
| CN101027683A (en) * | 2004-05-21 | 2007-08-29 | 赛博有限公司 | Systems, methods, and computer program products for searching and displaying low cost productavailability information for a given departure-return date combination or range of departure-return data co |
| US20100293012A1 (en) * | 2009-05-18 | 2010-11-18 | Marc Patoureaux | Method and system for determining an optimal low fare for a trip |
| CN103366316A (en) * | 2012-04-05 | 2013-10-23 | 创炎资讯科技有限公司 | Itinerary planning system and itinerary matching, integrating and outputting method |
| CN103995840A (en) * | 2014-04-30 | 2014-08-20 | 洛阳众意信息技术服务有限公司 | Intelligent domestic traveling route generating method oriented to customization |
-
2014
- 2014-08-26 CN CN201410421543.0A patent/CN104182836B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1372216A (en) * | 2001-02-27 | 2002-10-02 | 硕网资讯股份有限公司 | Multi-range tiket ordering system and method thereof for internation airline |
| CN101027683A (en) * | 2004-05-21 | 2007-08-29 | 赛博有限公司 | Systems, methods, and computer program products for searching and displaying low cost productavailability information for a given departure-return date combination or range of departure-return data co |
| US20100293012A1 (en) * | 2009-05-18 | 2010-11-18 | Marc Patoureaux | Method and system for determining an optimal low fare for a trip |
| CN103366316A (en) * | 2012-04-05 | 2013-10-23 | 创炎资讯科技有限公司 | Itinerary planning system and itinerary matching, integrating and outputting method |
| CN103995840A (en) * | 2014-04-30 | 2014-08-20 | 洛阳众意信息技术服务有限公司 | Intelligent domestic traveling route generating method oriented to customization |
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104850903A (en) * | 2015-05-11 | 2015-08-19 | 中国旅游研究院 | Construction and budget method of local tourism popularity index |
| CN105574708A (en) * | 2015-12-10 | 2016-05-11 | 北京创鑫旅程网络技术有限公司 | Travel route planning method and apparatus |
| CN106251208A (en) * | 2016-08-09 | 2016-12-21 | 上海携程商务有限公司 | The interactive display method and device of machine profile |
| CN108696545A (en) * | 2017-02-14 | 2018-10-23 | 北京嘀嘀无限科技发展有限公司 | Message method and device |
| CN107015731A (en) * | 2017-04-26 | 2017-08-04 | 携程旅游网络技术（上海）有限公司 | Come and go the rendering method and system of combination ticket price |
| CN107291901A (en) * | 2017-06-23 | 2017-10-24 | 携程旅游网络技术（上海）有限公司 | Main passive combination obtains method, system, equipment and the storage medium of air ticket data |
| CN107392660A (en) * | 2017-07-14 | 2017-11-24 | 深圳市活力天汇科技股份有限公司 | A kind of budget fare lookup method |
| CN107767116A (en) * | 2017-10-12 | 2018-03-06 | 携程旅游网络技术（上海）有限公司 | Trip product automation method for pushing, system, storage medium and electronic equipment |
| CN107767116B (en) * | 2017-10-12 | 2021-03-02 | 携程旅游网络技术（上海）有限公司 | Automatic pushing method and system for travel products, storage medium and electronic equipment |
| CN107992576A (en) * | 2017-12-03 | 2018-05-04 | 飞友科技有限公司 | A kind of connecting flight optimizes recommendation method |
| CN108038749A (en) * | 2017-12-04 | 2018-05-15 | 海南私航会信息科技有限公司 | A kind of business airplane intelligent scheduling real-time price quotations method and its system |
| CN107945063A (en) * | 2017-12-11 | 2018-04-20 | 孙二林 | A kind of system and method for providing travel information using the intelligent assistant that travels |
| CN107844611A (en) * | 2017-12-15 | 2018-03-27 | 携程旅游网络技术（上海）有限公司 | Multiple spot to multiple spot flight search method, system, equipment and storage medium |
| CN107844611B (en) * | 2017-12-15 | 2019-12-31 | 携程旅游网络技术（上海）有限公司 | Multipoint-to-multipoint flight searching method, system, equipment and storage medium |
| CN108563745A (en) * | 2018-04-13 | 2018-09-21 | 中国民航信息网络股份有限公司 | It has inquired enclave and has determined method, apparatus, equipment and medium |
| CN110309440A (en) * | 2019-07-10 | 2019-10-08 | 中国民航信息网络股份有限公司 | Ticket price searching method and relevant device |
| CN110728399A (en) * | 2019-09-27 | 2020-01-24 | 广州市骑鹅游信息技术咨询服务有限公司 | Air ticket intelligent splicing method and system based on big data |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104182836B (en) | 2018-04-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104182836A (en) | Route and time planning method of long-distance travel | |
| US8176034B2 (en) | Method for integrating road names and points of interest in source data | |
| CN104298777B (en) | The method and device that a kind of travelling route search is recommended | |
| CN103885983B (en) | Determination method, optimization method and the device of a kind of travelling route | |
| CN109657163B (en) | Destination address determining method and device, electronic equipment and storage medium | |
| US7349799B2 (en) | Apparatus and method for processing traffic information | |
| WO2017107800A1 (en) | Method of acquiring route hotspot of traffic road and device | |
| CN105760408B (en) | Picture sharing method and device and terminal equipment | |
| US20120036229A1 (en) | Route guiding system, route search server, route guiding mediation server and route guiding method | |
| CN101782904A (en) | Personal navigation device and method for automatic adding label to photo | |
| CN100504953C (en) | Apparatus and method for processing traffic information | |
| CN106899644A (en) | Processing method of taking pictures and server | |
| CN107861992A (en) | A kind of running route processing method and apparatus | |
| CN103185581A (en) | Information prompting device and prompting method for POI search results | |
| WO2016123867A1 (en) | Method and device for position search cognition | |
| CN115907423A (en) | Intelligent tourism service system | |
| CN104954063B (en) | A kind of ADS-B data merge method and system | |
| CN107133339A (en) | Circuit query method and apparatus and storage medium, processor | |
| CN110426052B (en) | Path acquisition method, system, equipment and computer readable storage medium | |
| CN104268281B (en) | Optimize the search system and method for place keyword when subscribing ticketing service | |
| CN105426387A (en) | K-means algorithm based map aggregation method | |
| CN106202454A (en) | The digitalized city method for designing of four dimensions based on information space | |
| CN105043405B (en) | Navigation method and device | |
| CN103533503A (en) | Method and system for recording and acquiring bus time table through photographing | |
| CN104636384B (en) | A kind of method and device handling document |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| ASS | Succession or assignment of patent right |
Owner name: SHANGHAI LIXIN NETWORK TECHNOLOGY CO., LTD. Free format text: FORMER OWNER: WEILV NETWORK TECHNOLOGY (SHANGHAI) CO., LTD. Effective date: 20150408 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20150408 Address after: 200333 Shanghai City 689 Yunling West Road No. 230, room B09 Applicant after: Shanghai today Network Technology Co. Ltd. Address before: 200333 Shanghai City 689 Yunling West Road No. 230, room B09 Applicant before: WEILV NETWORK TECHNOLOGY (SHANGHAI) CO., LTD. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210922 Address after: 210018 floors 3-5, building 6, Dongda science and Technology Park, No. 6, Changjiang back street, Xuanwu District, Nanjing, Jiangsu Province Patentee after: NANJING TUNIU TECHNOLOGY Co.,Ltd. Address before: Room B09, No. 230, Lane 689, Yunling West Road, Shanghai 200333 Patentee before: Shanghai today Network Technology Co.,Ltd. |