KR101852186B1 - System for making travel plan by grouping - Google Patents

Abstract

The present invention relates to a system for providing travel plans by grouping travel schedules and locations, and more particularly, to a system for providing travel plans by grouping travel schedules and locations, comprising a plurality of user terminals and a server connected to the terminals through a network, A traffic information DB including users' movement time, movement time and time constraint between a spot DB including information of a spot indicating a visitable area and adjacent spots stored in the spot DB, A tour DB including a grouping DB including information on pre-made grouped spots and tour information provided by a travel agency, and a user connecting through a terminal to connect spots and tours grouped with the spot to create a travel plan for the user And a scrap DB for storing the scrap DB.

Description

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a system and method for providing travel plans,

The present invention relates to a system for grouping trip schedules and locations to provide for creating a travel plan.

The present invention relates to a service that allows a user to conveniently create a travel plan and easily make a payment when planning a free trip. In the past, package trips were designed to travel according to pre-arranged travel plans. However, package trips did not have to worry about trip contents if the entire cost was paid at once, but schedule changes were difficult, . Many of the travel products currently on the market are packaged products, and these types of tourist products are not often used for travel information in cities where they are intended to travel. The advantage of such a package trip is that it is convenient to take the trouble of finding information about travel plans and travel destinations that need to be prepared before traveling, and to enjoy it on a scheduled date even if it goes to a travel destination. However,

As package-type travel has become mainstream, tourists and tour guides have been provided locally, and tour operators or guides have been scheduled to proceed in practice. As a result, over-provisioning of travel goods has led to fierce competition for product prices. The quality of the package tour has been deteriorating as it has led to the purchase of shopping options and additional options for the tourists while providing the goods without the necessity of touring.

In recent years, free travel has become a popular way to plan trips and travel on their own when preparing for the summer vacation. The advantage of free travel is that there are many free travel plans for self - organized trips to places that I have always wanted to visit. As a result, a site that professionally sells the necessary airline and accommodation is activated, and many sites that sell daily tour or individual option products that are enjoyed during traveling are becoming active and becoming active.

However, these free trips are difficult to plan, especially to obtain travel information, and it is also difficult to find travel-related tours and to pay a relatively high cost.

Recently, there have been sites that specialize in selling hotels, comparing airplane prices professionally, or selling only tour products professionally, but reconstructing each of them together has become a free traveler's part.

In this regard, Korean Patent Application No. 10-2013-0133812 entitled " Travel Schedule Production and Management Method, Server and Computer Readable Recording Medium ", when a server receives condition information on a tourist spot from a terminal device of a user, Related template to be used for registering a specific tourist spot as a travel schedule among the tourist spots provided to the terminal device of the user as the search result as information of the at least one tourist spot related to the user's terminal device And registering with a travel schedule defined as a specific time, receiving the spatial arrangement information, and recording the specific tourist spot with reference to the spatial arrangement information.

However, in the patent, the spot is registered in the sightseeing spot, so that the travel time and route between the sightseeing spots are calculated in advance, the travel schedule of the other person can be taken and used, and the advertisement can be made according to the spot arrangement.

However, because the tour schedule is centered on tourist sites, factors such as accommodation and tours are not taken into consideration, and if these factors are not taken into account, the plan does not include many parts in the plan of free travel. .

In addition, in the conventional case, when a coupon is collected in advance for a tour or a discount or a specific tour is included, only the relevant portion has to be paid separately. Even if the user makes the travel plan, the partial payment must be made directly and the total cost can not be paid. In the conventional case, it is difficult to settle the entire cost in advance because the time required for starting the schedule and the number of persons (especially time) are definite only when the schedule is started and the order of the schedule is conventionally planned. .

In addition, when the application of the discount rate or the like is changed depending on the change of the schedule (the start time of the schedule, etc.), the user has to apply the discount rate conventionally.

Disclosure of the Invention The present invention has been made in order to overcome the disadvantages described above, and provides a system for providing a travel plan capable of freely traveling with the transportation means, visiting time, and actual plan, do.

According to an aspect of the present invention, there is provided a system for providing a method of creating a travel plan in a scrapping manner, including a plurality of user terminals and a server connected to the terminal through a network

The server may be configured to determine whether a spot DB including information of a user DB including information of a user and a spot that can be visited and SPOT, a moving means, a moving time, a time constraint between adjacent spots stored in the spot DB A tour DB including a tour information provided by a travel agency and a grouping DB including information on grouped spots created by users and made by users, And a scrap DB for connecting the tours with the tours to create and save the user's own travel plans.

 The spot includes a store including a sightseeing spot, a lodging shop, a shopping mall, a transportation means, and includes a city information including a spot, location information of a latitude and a latitude, category information for determining a classification of a spot, Information.

The server includes a travel time calculation module to calculate the travel time between the arranged spots, calculates the travel time for each travel means in consideration of possible travel information between spots stored in the traffic information DB, Can be displayed.

The present invention has the effect of enabling a user to independently create a free travel plan considering various time factors and transportation means.

In the past, there were various constraints such as admission, travel, and restriction of places to visit even if someone tried to refer to a travel plan of another person. However, by creating a travel plan considering such factors, So that it is possible to make a full travel without falling behind the package product.

1 to 8 show an embodiment according to the present invention.

Hereinafter, the present invention will be described in detail with reference to the accompanying drawings. It is to be understood that both the foregoing general description and the following detailed description of the present invention are exemplary and explanatory and are intended to be illustrative of the present invention, . ≪ / RTI >

It is also to be understood that the embodiments set forth in the description are not intended to limit the invention, but the scope of the invention is limited only by the appended claims, along with the full scope of equivalents to which the claims are entitled. In the drawings, like reference numerals refer to the same or similar functions throughout the several views.

1 is a diagram showing an embodiment according to the present invention, and shows a schematic configuration of an entire system.

1, a system according to the present invention includes a user terminal 11, a server 12 and a network 13. The server 12 receives a travel plan And a request for the composition of a group or scrap formed by linking spots and spots related to the travel plan.

A spot is a basic unit of a travel plan, and refers to a place that a user visits, such as a tourist spot, a lodging facility, a restaurant, a shopping center, or a massage shop. Spots can be provided through maps or users can create and use spots. In other words, it is possible to create a spot by providing a photograph or a description with a place that the user has visited but was not provided with the conventional travel product. This has the effect of allowing other users to visit places where users like to travel through free travel, and to discover new destinations, which can be a big difference from existing package travel.

For example, in the case of Rome in Italy, the spot can be one of the most famous tourist attractions, including the Vatican, the Colosseum, the Colosseum, the Basilica, St. Peter's Basilica, the Borghese Gallery, the Navona Square, the Trevi Fountain and the Antiqua Stadium. Conventionally, only these tourist attractions were treated as spots. In the present invention, restaurants including ice cream specialty stores such as hotel, lodging, lodging business, and zelly zelatoto, shopping centers including duty-free shops and department stores are also treated as spots.

The spot basically has city information, position information of longitude and latitude, category information for determining the classification of the spot, and additionally information such as the average time taken in the spot. Also, it is possible to store, as an admission fee necessary for the spot, whether prepayment is required or a separate fee is required, and such information is stored in the spot information DB.

A spot includes a general spot unrelated to the purchase, a cost spot, a grouped spot in which a plurality of spots are clustered, and a tour in which a plurality of spots are gathered but are recognized as a spot by making a single settlement. All of these spots are treated as a single spot, which may include several different spots.

Grouping is a step that goes from setting a spot to connecting multiple spots. It connects a spot and a spot, and determines a travel route and a travel route between a spot and a spot, and a travel course can be completed. The movement between the spot and the spot is sufficient if it is possible to travel on foot or if a public transportation such as a taxi is provided sufficiently. However, if there is not enough public transportation, There is no need to provide detailed transportation because you can refer to transportation and grouping does not provide tours.

When grouping is performed, traffic information is provided considering the distance between the spot and the spot, and a moving unit considering the moving time before the grouping may be selected. The moving unit may be different from the grouping because the moving time varies depending on the selection. And movement information are provided through the transportation DB.

However, for the grouping, it is possible to refer to a user who has performed grouping or a user who has performed similar grouping so as to be helpful when another user uses the grouping of a specific user. In addition, when a user refers to grouped spots or travel schedules of other users, it is possible to fetch and use them in such a manner that only a part thereof is scrapped. The scrapped information is stored in the scrap DB by a predetermined date. When the user scraps a spot or grouped spot in the scrap DB, some of the grouped spots can be scrapped. When the scrap is stored in the scrap DB, the spot is divided and stored The grouped spots are separated into individual spots, which are linked to the spots in the preceding path or in the back path to form a new schedule.

When the grouping is performed, the time required for each spot from the one spot to the last spot is determined. Therefore, if the start time of the spot is determined, the travel plan is arranged according to the time sequence.

When a user links a spot and creates a travel plan, it is stored in the scrap DB. In the case of scrapping another user's spot, the spot is stored separately in the scrap DB even in the scrap DB. In order to prevent the load on the server when scrapping, it is necessary to divide the scrap DB into two parts, that is, do.

In addition, a spot ID is allocated to a corresponding schedule every time a grouping is performed, and in the case of a grouping spot including a plurality of spots, information indicating that the spot is a grouping spot is included. For example, Quot; indicates a non-grouped spot, and " 1 " indicates a grouped spot.

In the case of a tour, it can be recognized as a separate mark, and as a whole, it can be recognized as a general spot in that payment is made as a whole.

If a schedule is created after the spot in the scrap DB, it can be stored in the grouping DB, and a part or all of the schedule of another person can be scrapped. In this case, the spot ID can be allocated and stored in the grouping scrap DB. It can be included in the grouping DB.

If a spot ID is given every time a grouping DB is created and stored separately, even if the schedule of others is complicated, it is made as a new spot so that it can be used by anybody. By displaying the grouped spot, a part of the spot can be scrapped, Is also treated identically as a spot, so it is theoretically possible to have infinitely grouped spots as long as the storage space allows, even if there are several common spots. There can be a variety of travel routes. Therefore, it is possible to create individualized schedules for each individual.

Also, even if the schedules of others are scraped and taken in the grouping DB as a whole, a new spot ID is given if the user makes any modifications, and the group ID is stored in the grouping DB if it is confirmed. Even if a new schedule is created, it can be entered as part of another travel route, so that it can be recognized as a single spot, so that a large number of schedules can be generated.

Conventionally, there have been cases in which specific points of sightseeing spots are connected, distance information is provided between them, or a visiting order is provided, but this is a type of connecting spots (mainly sightseeing spots) of similar kinds and information about traffic information and transportation means is separately provided Therefore, it was not possible to plan a visit along the timeline.

In other words, according to the present invention, when making a travel plan, rather than simply providing distance information for each spot, it is preferable to place the spot on the timeline in consideration of the time between the spots, Do not make a plan that can not be achieved.

In addition, we can offer tours with one kind of spot. Tour is a product that can connect certain spots and provide necessary expenses such as transportation, admission fee, etc. at a time and is provided by local travel agencies. These tour products were often sold as part of package products, and it was often difficult to use package items without purchasing them. However, there were many cases where there was a demand for some tour products as free tourists increased. However, conventional free travel planning sites have difficulty in planning trips including these tours, and the tours have to be purchased separately and at least the time for the tours in the free travel plan has to be set as empty.

The spot and the grouped spot considering the visit, and the tour information are stored in the scrap DB which can be modified by the user as a whole and stored.

Since spots in the scrap DB include city information, travel routes including the same city information among scrapped travel information in the scrap DB can be displayed together when another user searches a specific city. You can bring the travel route, modify the travel route in your area, and upload it back to the scrap DB. In this way, various travel routes can be placed in the scrap DB, and each route can be ranked according to the travel time, number of places visited, favorability, user's rating, and can be searched by user's desired characteristics .

Further, in the payment of the fee, conventionally, the fee is often changed according to the change of the schedule. Therefore, only the definite part has to be settled in advance. In the present invention, when the schedule is determined, It is possible to make a settlement in advance for these parts because it is confirmed with regard to the participants and the like.

In particular, in the case of a prepayment for cost, a discount rate is often increased. In the present invention, a user specifies a spot and a spot is determined in a process of connecting a spot, and the fare for the route is displayed in advance referring to the fare DB . In the case of traffic charges, it may be necessary to pay directly at the site. However, when the user rents a car, the time for use is determined, so it is possible to rent the car in a shorter period.

Also, referring to the fare DB, the user can refer to the spot or travel route where the discount rate is applied so that the user can refer to the travel plan.

Particularly, if it is necessary to make a payment in advance, if the user completes the trip planning and the entire cost is paid, the partial payment module connects directly to the server of the spot when the user needs to make a payment in advance .

At this time, partial payment is made in accordance with the visiting conditions of the use area in consideration of the visit time of the spot determined on the travel plan by using the information of the user of the user DB and the accompanying persons, and the result of the payment is reported to the user.

If the payment is not made, the user needs to reconfigure the travel plan, so the partial payment module prompts the user to report the payment immediately.

In addition, the partial settlement module is affiliated with the server side, so if it is necessary to simply notify the spot server, the spot server will notify the spot server about the contents and send the fee.

In addition, in the case of a schedule in which the user is most important in the travel and which is the center of the trip, the user may be made to settle the schedule in advance, and the schedule may be determined and then another schedule may be prepared in accordance with the schedule The partial payment module makes partial settlement on the spot server side on behalf of the user and makes the result immediately inform the user.

FIG. 2 shows another embodiment according to the present invention. In order to search for a spot, a user can click on a city list or click in the entire view, or click on a map or search for a city name. do.

Because the spot belongs to a specific city, it clicks on the spot, displays the city that contains the spot, and the list of the spots included in the city. You can filter by clicking on tours, accommodations, restaurants, tourist attractions, shopping, You can see the detailed information when you click on it. Affiliated spots can be indicated by a separate mark to indicate that a discount can be reserved or a coupon is available. In FIG. 3, when the discount coupon is applied and the spot is included in the travel route, the discount coupon applied price is displayed and the coupon is displayed.

FIG. 4 shows a travel plan page. A spot list is displayed on the left side, and the spots are displayed according to their locations on the map, and detailed information can be confirmed when they are clicked. Fig. 5 shows a screen for displaying such detailed information.

FIG. 6 shows a screen for directing the travel plan. The travel plan is created by simply dragging and dropping the spot list displayed on the left side to the entire schedule on the right side. At this time, the information about the spot in the spot DB is applied according to the user. For example, the calculation of admission fees may vary depending on whether they are adults, infants, or a few people. If two or more spots are stored, The moving means, and the moving time are displayed.

Information on the movement time and the movement time can be displayed according to the movement means stored in the traffic information DB, and the movement time of the user is considered at this time. In other words, if you take a certain amount of time from the first spot and try to visit the next spot, considering the travel time from the host to the first spot and the visit time of the first spot, the departure time to the second spot comes out. The user has to determine the route in consideration of these factors. However, the present invention regards both the accommodation and the sightseeing spot as spots and compares with the local traffic situation in consideration of the staying time and the time taken to travel in each spot It takes time similar to the actual time required, so that more practical travel plans can be created. For example, if the bus departing from the second spot is only in a certain time zone, the server displays the possible departure time and travel time of the possible transportation from the first spot to the second spot from the traffic information DB, Let the time be confirmed.

 Spots can also be edited by ungrouping, but they are removed or moved collectively before releasing.

This route is optimized to move spots close to each other in the city and the like. The server refers to the traffic information database every time the paste is performed, and displays the route together with the route if there are restrictions on the travel time or transportation means.

Conventionally, there is no standardized way of exchanging travel information between free tourists. Therefore, it was necessary to formulate a travel plan for themselves in consideration of the longevity of the person in charge. Information such as transportation time and travel time, Often it was missed, so people who looked at the latter were often unable to carry out the same trip. However, according to the present invention, the travel plan considering the accommodation, the moving means, the moving time, the departure time, etc. is left as it is so that the other person can use it or edit it little by little. By allowing a better route to be selected, even the first free trip can be made without mistake.

FIG. 7 shows a form of scrapping in a site actually implemented according to the present invention. When a spot, a travel plan, a product, and a coupon are all dragged to a pre-stored space to recognize what is dragged, So that the moving path is selected and stored.

FIG. 8 shows a form in which a travel route of a previously created and stored other person is scrapped and stored.

FIG. 9 shows a case where a moving path is selected when moving between spots is required when arranging spots and spots. In FIG. 9, a moving path by walking is selected. When moving paths are provided between spots and spots The time calculation module and the constraint calculation module operate to provide a possible travel path.

 Spots can also be edited by ungrouping, but they are removed or moved collectively before releasing. This route is optimized to move spots close to each other in the city and the like. The server refers to the traffic information database every time the paste is performed, and displays the route together with the route if there are restrictions on the travel time or transportation means.

Conventionally, there is no standardized way of exchanging travel information between free tourists. Therefore, it was necessary to formulate a travel plan for themselves in consideration of the longevity of the person in charge. Information such as transportation time and travel time, Often it was missed, so people who looked at the latter were often unable to carry out the same trip. However, according to the present invention, the travel plan considering the accommodation, the moving means, the moving time, the departure time, etc. is left as it is so that the other person can use it or edit it little by little. By allowing a better route to be selected, even the first free trip can be made without mistake.

In the present invention, the grouped spots are handled like individual spots, and the user can separate the grouped spots or add or delete the spots. When the spot is generated, the spot ID and information for specifying the spot The name of the spot, the name of the spot, the category of the spot, etc.) are stored together. The grouped spots are stored by sequentially arranging the spot IDs {Spot ID-Spot ID-Spot ID ...} You can have a separate ID. For example, a single spot ID and a grouped spot ID are numbered and can be distinguished by attaching other alphabetic characters to the front of the spot ID. When editing, grouped spots stored in the grouping DB can be referenced, and the grouped spot IDs can be imported and edited in the scrap DB.

As a spot, there may be a tour provided by a grouped spot and a travel agency in addition to a simple spot including information of one sightseeing spot, accommodation, etc. The grouped spot has a plurality of spot information as described above, It can be imported from the user's travel plan. When importing from another user's travel plan, not only the order of the spot but also the information of the moving means and the moving route are brought together. To determine whether to change the selected options in the grouping DB at this time. In addition, payment methods are added separately for each spot and transportation means so that payment is made.

However, in the case of tours, this is treated as a single item that can not be edited, and route information can not be edited but can not be settled as a whole. In the spot DB, such a tour is handled as one spot, so that the user can set a route in the spot DB by presetting in the spot DB information about whether partial payment is possible, editable, whether to make a full payment, I will refer you to

In addition, the scrap DB can store spots by the date of travel, as opposed to spots being grouped and stored. For example, it can be stored by date in the same manner as '1 day {Spot ID - Spot ID - ...} 2 days {...............}', And path selection information between spots can be separately stored in the grouping DB.

For example, as shown in FIG. 10, the Eiffel Tower is stored as a spot ID 1 in the spot DB, the grouped spot is stored in the number 2, and the shopping point is stored in the spot ID 3. to be.

In the scrap DB, these spots are taken from the screen and divided by the date each time they are put, and the order in which the spots are arranged is the spot visiting order. Spot 2, which is a grouped spot, is inserted into the spots constituting Spot 2 when inserted into the scrap DB. That is, when the grouped spot 2 is composed of spots 5-6-7, it is decomposed into spots 1-5-6-7, and when the user scraps only a part of the grouped spots, it is decomposed into 1-6-7 And only a part is put.

In this case, the scrap module connects only the spot selected by the user in the grouped spot to the spot located before and after the selected spot, and newly connected spot (when the spot located at the front and the back of the selected spot are connected with another spot) The travel time calculation module provides the information on the travel time and the traveling means between the spots with reference to the traffic information DB.

In addition, the scrap module newly establishes the movement means and movement path between the scrapped spots, and the information on the movement means and the movement path thus established is stored separately for each date.

In other words, it is difficult to go beyond the 2-digit number per day, even if the travel route is complex, by arranging the spots in order and storing the means of moving between spots, , Movement information between the second spot and the third spot, and so on. Since the movement information varies according to the travel route depending on the time, it is not necessary to store the movement information separately in the grouping DB. However, it can be stored together with the last selected movement information so that the travel schedule can be referred to.

In the past, even if the travel information of another person was referred to, even when the travel route was completely brought, there were many cases in which the traffic condition and the restriction condition (the day when it was impossible to enter the room) were different.

However, according to the present invention, the scrap module can smoothly connect the spots even if the travel route of the other person is entirely or partially obtained, and the moving information is also provided with reference to the traffic information DB. Or the spot and spot movement can be paid in advance, so that the number of settlements for the cost can be reduced as much as possible.

FIGS. 11 and 12 illustrate the case of a tour. In the case of a tour, a plurality of spots are visited in a pre-woven form. The spot is not made by a user but is made in advance by a travel agency or a guide. In case of such a tour, the tour is rather optimized by the trial and error rather than the weaving by the individual, and many tourists can use the tour as it is often advantageous in terms of cost. At this time, the tour is recognized as a kind of spot. FIG. 11 shows one tour composed of several spots. Fig. 12 shows that the tour is composed of the Arc de Triomphe, the Champs Elysees, the Louvre Museum, the Notre Dame Cathedral, the Pompidou Center, the Shiogu and the Eiffel Tower. These tours can also be used to create a schedule for each user. This is possible because the present invention enables partial settlement on a spot-by-spot basis.

Claims (4)

A system for providing travel plans by grouping trip schedules and locations,
A plurality of user terminals and a server connected to the terminals through a network
The server includes a user DB including user information,
A spot DB including information on a spot (SPOT) indicating a visitable area,
A traffic information DB including movement means, movement time, and time constraints between spots stored in the spot DB and adjacent spots,
A grouping DB including information on grouped spots produced by users and made in advance
Tour DB with tour information provided by travel agency
And a scrap DB for connecting the user through the terminal and connecting scots, grouped spots, tours, and coupons scrapped by the user, and storing the sched-
A fee DB including information on spot rate and discount rate, discount coupon information and traffic fare
When the spots, all of the grouped spots and a part of the grouped spots are scraped and stored in the scrap DB, all or some of the grouped spots are decomposed into individual spots and stored
The scrap DB allows the spots to be arranged in the order of visiting in the space divided by the date, and the movement information between the spots and the spots is stored in order of the spots. Each spot is managed by a separate ID and arranged in order, Is stored as a method of arranging individual spot IDs in order,
The spot has a unique spot ID for each spot, and grouped spots stored in the grouping database can be divided and edited by the spots constituting the group, so that the spot can be added, deleted and separated. Or whenever a user brings up another person's schedule, it is stored in the scrap DB, and a new spot ID is given to make a myriad of schedules
And a partial payment module for notifying a user when a travel plan is prepared for a fee generated between spots and a spot fee between the spot and the spot, and for partially paying a fee for each spot after the travel plan is established , A system that provides grouping of travel itineraries and places to create travel plans delete The method of claim 1, wherein the spot includes a store including a tourist spot, a lodging shop, a shopping mall, a transportation means, and includes city information including a spot and location information of latitude and longitude, category information for determining a classification of a spot, A system that provides travel planning by grouping travel itineraries and places, including average travel time and charge information 4. The method according to claim 3, wherein the server includes a travel time calculation module to calculate a travel time between the arranged spots, calculates a travel time for each travel means in consideration of possible travel information between spots stored in the traffic information DB, A system for providing travel plan creation by grouping travel schedules and places so as to display information on the movable time stored in the DB

Images