JP2003216700A - Tour content determination system, method for realizing the system, and computer program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To prepare and provide a tour with a full cosmetic service. <P>SOLUTION: A preceding schedule, a succeeding schedule, and an intermediate schedule group are stored in a server 1. The server 1 performs the processing (1) that the intermediate time is calculated based on the preceding schedule and the succeeding schedule, the processing (2) that the server 1 extracts a candidate intermediate schedule usable in the intermediate time from the intermediate schedule group, and transmits the candidate intermediate schedule to a PC 2 to apply for the tour, the processing (3) that the schedule selected from the candidate intermediate schedule is received from the PC 2, and the processing (4) that the content of the tour is determined based on the received selected schedule, the preceding schedule, and the succeeding schedule. <P>COPYRIGHT: (C)2003,JPO

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a system and a computer program for determining the contents of a trip.

[0002]

2. Description of the Related Art In recent years, an increasing number of people are enjoying sightseeing at tourist destinations such as Hawaii and receiving beauty services such as beauty treatment and makeup. In this way, in order to receive beauty services in addition to sightseeing, tour participants first apply for a tour to Hawaii, and then add esthetic services or the like as an option.

[0003]

As described above, the beauty service is merely added as a secondary (as an optional tour) to the sightseeing tour, which is the main purpose. However, as people become more aware of beauty, some tour participants are beginning to want to enhance beauty services rather than sightseeing. Therefore, there is a need for a system and computer program for providing tours that enhance beauty services.

[0004]

The present invention is, for example, the following system, method, and computer program. (1) Comprising a storage means for storing a preceding schedule, a trailing schedule, and an intermediate schedule group consisting of a plurality of intermediate schedules, and a tour content determining means having the storage means. Then, the intermediate time is calculated based on the following schedule, the intermediate schedule candidates available at the intermediate time are extracted from the intermediate schedule group, and the intermediate schedule candidates are presented to the tour application means for applying for a tour. Then, the selected schedule selected from the intermediate schedule candidates is accepted from the tour application means,
The tour content is determined based on the selection schedule, the preceding schedule, and the following schedule. (2) The advance schedule group including a plurality of advance schedules is stored in the storage means, and the tour content determination means presents the advance schedule group to the tour application means, and the tour application means Accept the advance schedule selected by the applicant. (3) A trailing schedule group including a plurality of trailing schedules is stored in the storage means, and the tour content determining means presents the trailing schedule group to the tour applying means to perform the tour. Accept the trailing schedule selected by the applicant from the application means. (4) The storage means stores order data for determining the order of the intermediate schedule, and the tour content determination means determines the tour content based on the order data. (5) The subsequent schedule is a schedule to be incorporated after the intermediate schedule. (6) The intermediate schedule is a schedule regarding a beauty transformation service, and the intermediate time is a time for receiving the beauty transformation service. (7) The order data is data for determining the order of the beauty transformation service. (8) The tour includes a storage unit that stores a preceding schedule group including an intermediate schedule, a plurality of preceding schedules, and a trailing schedule group including a plurality of trailing schedules, and a tour content determining unit including the storing unit. The content determining means calculates an intermediate time based on the intermediate schedule, extracts a preceding schedule candidate and a succeeding schedule candidate that can secure the intermediate time from the preceding schedule group and the following schedule group, The preceding schedule candidate and the following schedule candidate are presented to the tour application means, and the selected preceding schedule and the selected following schedule selected from the preceding schedule candidates are accepted from the tour application means, and the intermediate schedule and the selected preceding schedule are selected. After the selection line schedule The basis for determining the tour contents. (9) An intermediate schedule group composed of a plurality of the intermediate schedules is stored in the storage means, the tour content determination means presents the intermediate schedule group to the tour application means, and the intermediate schedule includes:
The applicant selects from the intermediate schedule group presented by the tour application unit and is accepted from the tour application unit. (10) The storage means stores order data for determining the order of the intermediate schedule, and the tour content determination means determines the tour content based on the order data. (11) The subsequent schedule is a schedule to be incorporated after the intermediate schedule. (12) The intermediate schedule is a schedule relating to a beauty transformation service, and the intermediate time is a time for receiving the beauty transformation service. (13) The order data is data for determining the order of the beauty transformation service.

[0005]

First Embodiment of the Invention A first embodiment of the present invention will be described with reference to the drawings. FIG. 1 is a schematic diagram showing the hardware necessary for implementing the present invention and the connection between the hardware. These hardware are a server (server used by travel agency) 1 for determining tour contents, and a PC
(Computer used by tour participants) 2. The server 1 and PC 2 are the Internet 3 respectively
It is connected so that data can be transmitted and received through (communication means). The server 1 and the PC 2 respectively include a storage device for storing data, a data transmitting unit for transmitting and receiving data, and a data receiving unit, and use them to transmit and receive data.

A computer program for implementing the present invention and predetermined data are stored in each storage device, and each device receives the instruction of this computer program and processes each data to implement the present invention. . The PC 2 is provided with a display monitor 11 for displaying data, a keyboard 12 for data input, and a mouse 13. Here, the server 1 serves as a tour content determining means, the PC 2 serves as a tour application means, and the storage device built in the server 1 serves as a storage means.

Next, an outline of the tour used in this embodiment will be described. In the tour used in this embodiment, for example, when a woman living in Nagoya views a dinner show held at a hotel in Tokyo, she first goes to Tokyo on the Shinkansen and then receives beauty services such as beauty treatment, makeup, and hair set. It transforms beautifully and attends a dinner show in its transformed appearance.

Next, the processing procedure of the present invention will be described. In the present invention, <application information transmission: STEP 1> → <tour selection:
STEP2> → <Beauty service selection: STEP3> → <
Intermediate time calculation: STEP4> → <Search order determination: STE
P5> → <Esthetician search: STEP6> → <Make technician search: STEP7> → <Engineer decision: STEP8
> → <Confirmation of tour contents: STEP 9> Hereinafter, these processes will be described.

<Sending application information: STEP1> Ms. Haruko Mita, who lives in Nagoya, wants to see the dinner show held at a hotel in Tokyo on December 10th. Ms. Mita accessed a homepage operated by a travel agency in order to apply for a tour for viewing a dinner show using PC2. As a result, the display monitor 1 of the PC 2
The contents shown in FIG. 2 are displayed in 1. Mr. Mita entered his address and name here and clicked "Send" at the bottom right of the screen. As a result, the PC 2 displays the applicant information “Applicant name: Haruko Mita / Applicant phone number: ○○○-×××××
/ Applicant's address: Nagoya, Aichi Prefecture ○○○ ”is created and sent to the server 1. The server 1 receiving the applicant information stores this in the storage device.

<Tour selection: STEP2> The server 1 stores a tour file (FIG. 3). This tour file consists of multiple tour records,
This tour record is "Tour Code: T123 / Tour Name: XX Dinner Show & Beauty Makeover Tour / Target Area: Aichi Prefecture / Departure Schedule: December 10 Nozomi 1
No. 5 Nagoya 13: 00-Tokyo 15:00 / Arrival schedule: December 11 Nozomi No. 23 Tokyo 11: 30-Nagoya 13:30 / Event schedule: December 10 1
It is related (corresponding) with data such as "9:00, △△ hotel, ○○ dinner show viewing".

Since Mr. Mita's address included in the application information is "Aichi Prefecture", the server 1 searches the tour file for records in which the target area is Aichi Prefecture, and based on the plurality of searched records, the candidate tour (see FIG. 4). "Data to express as follows:" Tour code: T123 / Tour name: XX Dinner show & Beauty makeover tour / Departure schedule: December 15 Nozomi No. 15 Nagoya 13: 00-Tokyo 15:00
/ Arrival schedule: Tokyo No. 23 Nozomi 1 on December 11
1: 30-Nagoya 13: 30 / Event schedule:
December 10, 19:00, △△ Hotel, ○○ Dinner Show Viewing / Tour Code: T124 / Tour Name: ○○ Dinner Show Viewing Tour / Departure Schedule: December 10
Nozomi No. 18 Nagoya 16: 00-Tokyo 18:00 / Arrival Schedule: Nozomi No. 23 Tokyo 11: 11 December:
30-Nagoya 13: 30 / Event Schedule: 12
19:00 on the 10th of the month, △△ hotel, XX dinner show viewing / ... "is created. The server 1 transmits the created candidate tour to the PC 2, and the PC 2 receiving the tour stores it in the storage device. In the present embodiment, the contents of the plurality of data items “departure schedule” included in the candidate tour serve as a preceding schedule group, and the contents of the plurality of data items “event schedule” included in the candidate tour. Plays a role as a trailing schedule group.

Next, the PC 2 displays the received candidate tours as shown in FIG.
Is displayed on the display monitor 11 as described above (note that the check for tour selection is not checked at this point). next,
Mr. Mita refers to the contents of the display monitor 11 and selects a tour to participate in. Mr. Mita is interested in a makeover tour, so check the box next to "Tour code: T123"
Click "Send" at the bottom right of the screen. This allows PC2
Is a selected tour "Tour code: T123 / Tour name: ○
○ Dinner Show & Beauty Makeover Tour / Departure Schedule: Nozomi No.15 on Dec. 10 Nagoya 13: 00-Tokyo 15: 00 / Arrival Schedule: Nozomi 2 on Dec. 11
No. 3 Tokyo 11: 30-Nagoya 13: 30 / Event Schedule: December 10th 19:00, △△ Hotel, ○○
Create a dinner show viewing "and send it to the server 1. The server 1 receiving this selected tour stores it in the storage device. In the present embodiment, the content of the data item "departure schedule" included in the selected tour serves as the preceding schedule, and the content of the data item "event schedule" included in the selected tour serves as the trailing schedule. Play the role of.

<Beauty service selection: STEP3> Next,
The server 1 uses the candidate services “esthetic, makeup, hair set, photo shoot, nail” pre-stored in the storage device as a PC to select which beauty service to receive.
2, the PC 2 having received the information stores it in the storage device and displays the contents as shown in FIG. 5 on the display monitor 11. Mita checks the beauty services she wants to receive and clicks "Send" at the bottom right of the screen.
As a result, the PC 2 selects the selection service “esthetic = yes, makeup = yes, hair set = no, photo shoot = no,
Nail = no ”is created and sent to the server 1. The server 1 that has received the selection service stores it in the storage device.

<Calculation of Intermediate Time: STEP 4> Next, the server 1 calculates "intermediate time". Specifically, the server 1 performs the following processing. (1) The tour code of the selected tour is "T123". Therefore, the server 1 searches the tour file using this as a search key, and searches for the record in FIG. (2) The event schedule included in this record is certified as a trailing schedule. (3) The schedule immediately before the trailing schedule (departure schedule) is recognized as the leading schedule. As a result, the dinner show viewing (subsequent schedule) will be incorporated after the beauty service (intermediate schedule). (4) Advance schedule (Tokyo station arrival time) "15: 0
30 minutes of moving time is added to "0", and the start time of the intermediate time is "1".
5:30 ". (5) Subsequent schedule (holding time for dinner show)
The travel time of 30 minutes is subtracted from "19:00" to set the intermediate time end time of "18:30". (6) As a result, the intermediate time “15:30 to 18: 3
0 ”is calculated. In this embodiment, the travel time is 30
However, the moving time is not limited to 30 minutes, and may be set freely. Further, in the present embodiment, it is assumed that the service providing time for both the esthetic and makeup is approximately “30 to 40 minutes”.

<Determination of Search Order: STEP 5> Next, the server 1 searches for an esthetician and a makeup technician who can provide the service within the above-mentioned intermediate time. Decide whether to search first. In the server 1, the sequence data as shown in FIG. 6 "Esthetic: 1, makeup: 2, hair set: 3, nail:
4, photography: 5 ”is stored. This is to predetermine in what order the services will be performed when a plurality of beauty services are selected. In the present embodiment, the beauty treatment salon and the makeup treatment are selected, but the order is “esthetic treatment” → “makeup” according to the sequence data. The reason for deciding the order of beauty services is to avoid the following inconveniences. For example, if a beauty treatment salon is applied after makeup has been applied, the makeup applied will fall off, and makeup must be applied again. The sequence data is for avoiding such inconvenience.

<Esthetician Search: STEP 6> Next, the server 1 performs an esthetician search process (extracts intermediate schedule candidates that can be used at intermediate times). The esthetician schedule file is stored in the server 1 (FIG. 7). This consists of a plurality of esthetician schedule records, and this record associates and stores the daily schedule of each esthetician. That is, this file contains the daily schedules of several estheticians. Server 1 is an intermediate time "December 10/15: 30 to 18: 3
The first half of "0""December 10/15: 30 to 17:00
Search (extract) the esthetician whose schedule is 0 for the esthetician schedule file. That is, the search key is “15:30 to 17:00” and the esthetician (esthetician schedule record) whose time is “no reservation” is searched. As a result,
"Esthetician name: Kazuo Taguchi / Store name: ○○ Esthetic Omotesando store / Features: ○○ Good at technology / Target date: 200
December 10, 1/11 pm-: Reserved / 12:00
0-: No reservation / 13: 00-: Reservation / 14: 00
-: No reservation / 15: 00-: No reservation / 16: 00
-: No reservation / 17: 00-: No reservation / 18: 00
-: Reserved / 19:00-: No reservation / 20:00
Records such as ": reserved" are searched.

Next, the server 1 is based on the retrieved record, and the esthetician candidate data “name: Taro Yamaguchi / store name: beauty salon XX Akasaka store / characteristic: ΔΔ is reputation / time: 16: 00- / name : Akira Sasaki / Store name: Beauty salon △ △ Harajuku store / Features: Many famous celebrity customers / Time: 16: 00- / Name: Kazuo Taguchi / Store name: ○○ Esthetic Omotesando store / Characteristics: ○○ is good at / Time: 16: 00- "
Create (not shown).

<Make technician search: STEP 7> Next, the server 1 performs a search process for a make technician (extracts intermediate schedule candidates that can be used at intermediate times). A make engineer schedule file is stored in the server 1 (FIG. 8). This consists of a plurality of makeup technician schedule records, and this record stores the daily schedule of each makeup technician in association with each other. That is, this file contains the daily schedules of a plurality of makeup engineers. Server 1 is an intermediate time "December 10/15: 30 to 18: 3
The second half of "0""December 10, 17:00 to 18: 3
The make engineer whose schedule is 0 is searched (extracted) from the make engineer schedule file. That is, "Makeup technician name: Hiroguchi Hiroguchi / Store name: ○○ beauty salon Aoyama store / Characteristics: Popular with OL / Target date: 2001 January
February 10th 11: 00-: Reserved / 12: 00-:
With reservation / 13: 00-: With reservation / 14: 00-: With reservation / 15: 00-: Without reservation / 16: 00-: Without reservation / 17: 00-: Without reservation / 18: 00-: Without reservation Records such as “/ 19: 00-: reserved” / 20: 00-: reserved ”are searched. In the present embodiment, the schedule file of the makeup technician and the schedule file of the above-mentioned esthetician serve as an intermediate schedule group. Further, in the present embodiment, the moving time between the beauty treatment salon and the makeup is not taken into consideration for facilitating the explanation, but it is desirable to take this into consideration in the original case.

Next, based on the retrieved records, the server 1 uses the make engineer candidate data “Name: Daisuke Kawamura / Store name: Este ●● Yoyogi store / Features: Training in Paris for 3 years / Time: 17: 00- / Name: Hiroshi Hiroguchi / Store name: ○○ Beauty salon Aoyama store / Characteristics: Very popular with OL / Time: 17: 00- /
Name: Koji Takagi / Store name: ○○ Esthetic Omotesando store / Feature: Chatting is fun / Time: 17: 00- "(not shown) is created. In this embodiment, the makeup engineer candidate data and the above-mentioned esthetician candidate data serve as intermediate schedule candidates.

<Engineer determination: STEP 8> Next, the server 1 transmits the created esthetician candidate data and the makeup engineer candidate data to the PC 2, and the received P
C2 is stored in the storage device and the data is displayed on the display monitor 11 (FIG. 9). Looking at the contents as shown in FIG. 9, Mr. Mita selects the desired esthetician and makeup technician.
Mita-san selected Kashio Taguchi's esthetician and Koji Takagi's makeup technician as shown in Fig. 9, and clicked "Send" at the bottom right of the screen. As a result, the PC 2 selects the esthetician data "Name: Kazuo Taguchi / Store name: ○○ Esthetic Omotesando store / time: 16: 00-" ・ Make technician selection data "Name: Koji Takagi / Store name: ○○ Esthetic Omotesando store / Time: 17: 00- "is created and sent to the server 1. In this embodiment, the makeup technician selection data and the above-mentioned esthetician selection data serve as a selection schedule. The server 1 that receives these data stores the received data in the storage device.

<Confirmation of Tour Content: STEP 9> Next, the server 1 stores the applicant information, the selected tour, the selection service, the esthetician selection data, the makeup technician selection data stored in the storage device and other storage devices. The content of the tour is decided based on the data. That is, the server 1 uses the confirmation data for confirming the tour content "schedule number: 1 / date and time: 13:00 on December 10, 13: 00 / schedule content: Nozomi No. 15 from Nagoya / schedule number: 2 / date and time: December 10 15: 00 / Schedule content: Arrival in Tokyo / Schedule number: 3 / Date / time: December 10th 16: 00 / Schedule content: ○○ Esthetics at Omotesando store / Schedule number: 4 / Date / time: December 10th 17: 00 / Schedule content: ○○ Makeup at Esthetic Omotesando store / Schedule number: 5 / Date / time: December 10th 19: 00 / Schedule content: △△ Dinner show at hotel, △△ Hotel night / Schedule number: 6 / Date and time: 8:00 on December 11th / Schedule content: △△ After breakfast at the hotel, shopping / schedule number : 7 / Date: December 11, 10:30 / schedule Contents: Tokyo Nozomi No. 22 / schedule number:
8 / Date: 12:30 on December 11, 12: 30 / Schedule content: Arriving in Nagoya ”and send it to the PC 2. The PC 2 receiving this stores it in the storage device and displays the contents of the confirmation data on the display monitor 11 as shown in FIG. With this, Mita confirms the contents of the tour. In this way, a tour with enhanced beauty services can be created.

[0022]

Second Embodiment of the Invention Next, a second embodiment of the present invention will be described. In the first embodiment, a round-trip train schedule and a dinner show schedule are first determined, and then an esthetician or the like is determined. However, in the present embodiment, the esthetician or the like is first determined, and then the round-trip A case of deciding a train or the like will be described. First, the processing procedure of this embodiment will be described. This embodiment is
Hairdresser selection: STEP1><Time zone candidate presentation: STE
P2> → <Time zone selection: STEP3> → <Up train search: STEP4> → <Down train search: STEP5> → <
Train selection: STEP6><Check tour contents: STEP
The procedure is 7>. Hereinafter, these processes will be described.

<Selection of Hairdresser: STEP 1> Recently, there are some popular hairdressers called charisma hairdressers in urban areas such as Tokyo. Some people visit Tokyo for hours from rural areas to have such charismatic hairdressers cut their hair. Mita, who lives in Nagoya, wants a charismatic hairdresser in Tokyo to cut her hair. A travel agency is planning a tour to get a charisma hairdresser to do a haircut, and Ms. Mita visited the travel agency's website. As a result, the contents shown in FIG. 11 are displayed on the display monitor 11. The name of the hairdresser displayed in FIG. 11 is extracted from the hairdresser schedule file (FIG. 12: this file will be described later) stored in the server 1 and transmitted to the PC 2 by extracting only the name of the hairdresser. It is a thing. Mr. Mita enters the necessary items such as the day (desired period) you want the haircut and your name, and selects the hairdresser you want. That is,
Mita selected a hairdresser named Toshio Taniguchi, checked it, and clicked "Send" at the bottom right of the screen. As a result, the application data “desired period: December 10, 2001 to December 11, 2001 / Applicant name: Haruko Mita / Applicant phone number: ○○○-×××× / Applicant address: Nagoya, Aichi ○○○ / Hairdresser of choice: Ichiro Mitani = n
o, Toshio Taniguchi = yes, Moto Okubo = no, Shinji Muraguchi = n
o, Uetani Toru = no, Ken Kada = no ”, and sends it to the server 1. Server 1 that received this
Stores this application data in the storage device.

<Presentation of time zone candidate: STEP2> The server 1 stores a hairdresser schedule file as shown in FIG. This consists of a plurality of hairdresser schedule records, and this record stores the daily schedule of each hairdresser in association with each other. That is, this file contains the daily schedules of a plurality of hairdressers. In this file, for example, "Hairdresser name: Toshio Taniguchi / Store name: Taniguchi Beauty Salon (Harajuku) /
Feature: In charge of haircut for actress XX / Target date: 2001
December 10, 11: 00-: Reserved / 12:00
-: Reserved / 13:00-: Reserved / 14:00
-: No reservation / 15: 00-: Reservation / 16: 00
-: Reserved / 17:00-: Reserved / 18:00
-: Reserved / 19:00-: Reserved / 20:00
-: There is data such as "reserved".

The server 1 includes the “desired period: December 10, 2001 to December 11, 2001 included in the application data.
Using "day", "desired hairdresser: Toshio Taniguchi", and "no reservation" as search keys, the hairdresser schedule file is searched to identify (extract) the empty schedule for Mr. Toshio Taniguchi. As a result of the search, three time zones are searched for as an open schedule for Mr. Taniguchi, and the server 1 uses the time zone candidate data “first candidate: 2001” based on this.
December 10th, 14: 00-15: 00 / Second candidate:
December 11, 2001 17: 00-18: 00 / Third candidate: December 11, 2001 19: 00-20: 0
0 ”and send it to PC2. In the present embodiment, this time zone candidate data plays a role as an intermediate schedule group.

<Selection of time zone: STEP3> The PC2 having received the time zone candidate data stores it in the storage device and then displays the content on the display monitor 11 as shown in FIG. Mr. Mita who saw this selected the first candidate, checked it and clicked "Send" at the bottom right of the screen. This causes the PC 2 to select the time zone selection data “first candidate: 200
"12: 00-15: 00 on December 10, 1st year",
Send to server 1. In this embodiment, this time zone selection data serves as an intermediate schedule selected by the applicant.

The server 1 receiving the time zone selection data stores it in the storage device and then calculates the intermediate time based on the time zone selection data. That is, a moving time of 30 minutes is added before and after the time zone selection data “December 10, 2001 14: 00-15: 00”, and the intermediate time is defined as “December 10, 2001 13: 30-15: 30”. To do.

<Upward Train Search: STEP 4> Next, the server 1 searches (extracts) for candidates for an up train on which Mr. Mita is riding (candidates for which an intermediate time can be secured). Since Mr. Mita's address is Nagoya and all the hairdressers work in Tokyo, the timetable between Nagoya and Tokyo is searched here. The server 1 has an up train timetable (upstream timetable) as shown in FIG. 14 "Nozomi No. 11: Nagoya 09:00,
Tokyo 11: 00 / Nozomi 12: Nagoya 10:00, Tokyo 12: 00 / Nozomi 13: Nagoya 11:00, Tokyo 13: 00 / Nozomi 14: Nagoya 12:00, Tokyo 1
4: 00 / Nozomi No.15: Nagoya 13:00, Tokyo 1
5: 00 / Nozomi 16: Nagoya 14:00, Tokyo 1
6: 00 / Nozomi No.17: Nagoya 15:00, Tokyo 1
"7:00 / ........." is stored. It should be noted that, in the present embodiment, this upstream schedule plays a role as a preceding schedule group. Server 1 starts the middle time "13: 3
Search for trains arriving in Tokyo by 0 "from the up timetable (here, the three trains closest to" 13:30 "are searched). As a result, the server 1 causes the upstream candidate data “Nozomi 11: Nagoya 09: 00-Tokyo 11: 00 / Nozomi 12: Nagoya 10: 00-Tokyo 1”.
2: 00 / Nozomi No.13: Nagoya 11: 00-Tokyo 1
3:00 ”is created. It should be noted that in the present embodiment, the upstream schedule candidate data serves as a preceding schedule candidate.

<Down train search: STEP 5> Next, the server 1 searches (extracts) for candidates for a down train on which Mr. Mita is riding (candidates that can secure an intermediate time). The server 1 has a timetable (downtime schedule) "Nozomi No. 21: Tokyo 09:30, Nagoya 11: 30 / Nozomi 2" as shown in FIG.
No. 2: Tokyo 10:30, Nagoya 12:30 / Nozomi 23
Issue: Tokyo 11:30, Nagoya 13:30 / Nozomi 24
Issue: Tokyo 12:30, Nagoya 14:30 / Nozomi 25
Issue: Tokyo 13:30, Nagoya 15:30 / Nozomi 26
Issue: Tokyo 14:30, Nagoya 16:30 / Nozomi 27
"No. Tokyo 15:30, Nagoya 17:30 / ..." is stored. It should be noted that, in the present embodiment, this downlink schedule plays a role as a subsequent schedule group. Server 1
Searches for trains departing Tokyo after "15:30" at the end of the middle time from the down timetable (here, "1"
Search for the three trains closest to 5:30 "). As a result, the server 1 causes the downlink candidate data "Nozomi 27: Tokyo 15: 30-Nagoya 17: 30 / Nozomi 2".
No. 8: Tokyo 16: 30-Nagoya 18:30 / Nozomi 29
No .: Tokyo 17: 30-Nagoya 19:30 ".
It should be noted that in the present embodiment, this downlink schedule candidate data serves as a subsequent schedule candidate.

<Train selection: STEP6> Next, the server 1 sends the created candidate uplink data and candidate downlink data to the PC2.
The PC 2 which has transmitted the received data to the storage device stores the data in the storage device and displays the data on the display monitor 11 (FIG. 1).
6). Looking at the contents as shown in FIG. 16, Mr. Mita selects the desired up train and down train. Mr. Mita checked Nozomi No. 13 and Nozomi No. 28 as shown in FIG. 16, and clicked "Send" at the bottom right of the screen. This causes the PC 2 to select the upstream selection data "Nozomi 13: Nagoya 1".
1: 00-Tokyo 13:00 "and downlink selection data" Nozomi No. 28: Tokyo 16: 30-Nagoya 18:30 "are created and transmitted to the server 1. It should be noted that in the present embodiment, this upstream selection data serves as the selection preceding schedule, and the downstream selection data serves as the selection subsequent row schedule. The server 1 that receives these data stores the received data in the storage device.

<Confirmation of Tour Content: STEP 7> Next, the server 1 determines the content of the tour based on the application data, time zone selection data, upstream selection data, downstream selection data and other data stored in the storage device. . That is, the confirmation data for confirming the contents of the tour “schedule number: 1 / date and time: 11:00 on December 10 / schedule content: Nozomi No. 13 from Nagoya / schedule number: 2
/ Date and time: 13:00 on December 10th / Schedule content:
Arrival in Tokyo / Schedule number: 3 / Date: December 10 1
4:00 / Schedule content: Cut by Toshio Taniguchi / Schedule number: 4 / Date: December 10 16: 3
0 / Schedule content: Nozomi 28 from Tokyo / Schedule number: 5 / Date / time: December 10th 18: 30 / Schedule content: Arriving in Nagoya ”and send to PC2.
The PC 2 receiving this stores it in the storage device and displays the contents of the confirmation data on the display monitor 11 as shown in FIG. With this, Mita confirms the contents of the tour. In this way, a tour with a full range of beauty services can be created by a method different from that of the first embodiment.

Although specific cases have been described in the above embodiments, the present invention is not limited to these specific cases. For example, the following cases may be possible. (1) In the above embodiment, the intermediate schedule is the beauty service, but the intermediate schedule is not limited to the beauty service and can be applied to various services and the like. For example, a reservation for a private bath at an inn may be used as the intermediate schedule. Further, the preceding schedule and the following schedule may be other than those described in the above embodiment. Furthermore, it can be applied to the case of going to a hotel on a certain island by boat, watching a dinner show there, or attending a party (in this case, the schedule of the boat for arriving at the island is the preceding schedule). Next, dinner shows and parties will be scheduled later). (2) The beauty service is not limited to the service described in the above embodiment. Beauty services also include (but are not limited to) photography services (services that take commemorative photos after beautiful transformation). (3) The content of the data is not limited to the data described in the embodiment. That is, any other data may be used as long as it can play a similar role. (4) The hardware is not limited to that described in the embodiment. That is, any other hardware may be used as long as it can play a similar role. (5) The content and procedure of processing are not limited to those described in the embodiment. That is, any other processing content / processing procedure may be used as long as it can play a similar role. (6) “Accept information (data)” means “receive information (data)”. However, "accept information (data)" means "receive information (data)"
It is not limited to this. “Presenting information (data)” means “transmitting information (data)”. However, “presenting information (data)” is not limited to “transmitting information (data)”. (7) It is assumed that the data (data items) of the data (data record, data file) appearing in the above-described embodiment are, in principle, associated (correlated) and stored in the storage device. (8) In the second embodiment, only the cut by the hairdresser is used as the intermediate schedule, but a plurality of services may be selected as in the first embodiment. In this case, as in the first embodiment, it is desirable to determine the order of services based on the order data.

[0033]

The present invention has the following effects. (1) By using the present invention, it is possible to construct a tour with enhanced beauty services, rather than simply making the beauty services an optional tour accompanying tourism. Therefore, the travel agency can provide a full-scale transformation tour. (2) By using the present invention, tour participants can select an intermediate schedule (esthetician, etc.) themselves. (3) In the present invention, since the order of beauty services etc. is determined,
You can efficiently receive beauty services. For example, the inconvenience of having an esthetic treatment after applying makeup
(Inconvenience that the makeup is removed by the beauty treatment salon even if the makeup is actually applied) can be avoided. (4) In the present invention, the trailing schedule (viewing the dinner show) should be incorporated after the beauty service. This allows tour participants to transform themselves beautifully before attending a dinner show (avoiding the inconvenience of a meaningless tour of receiving beauty services after viewing a dinner show). (5) First, the leading schedule and the trailing schedule are determined first, and if the tour contents are determined by a procedure of later determining the intermediate schedule, the leading schedule and the trailing schedule can be freely and immediately selected. (6) First, an intermediate schedule can be freely and promptly selected by first determining an intermediate schedule and then determining a tour content by a procedure of later determining a leading schedule and a trailing schedule.

[Brief description of drawings]

FIG. 1 is a schematic diagram of an apparatus for implementing the present invention.

FIG. 2 is a diagram showing a screen for inputting applicant information.

FIG. 3 is a diagram showing a tour file.

FIG. 4 is a diagram showing a tour selection screen.

FIG. 5 is a diagram showing a beauty service selection screen.

FIG. 6 is a diagram showing order data.

FIG. 7 is a diagram showing an beauty treatment salon 8 schedule file.

FIG. 8 is a diagram showing a make engineer schedule file.

FIG. 9 is a diagram showing an engineer determination screen.

FIG. 10 is a diagram showing a tour content confirmation screen.

FIG. 11 is a diagram showing a hairdresser selection screen.

FIG. 12 is a diagram showing a hairdresser schedule file.

FIG. 13 is a diagram showing a list of schedule candidates for hairdressers.

FIG. 14 is a diagram showing an uplink timetable.

FIG. 15 is a diagram showing a downlink timetable.

FIG. 16 is a diagram showing a Shinkansen determination screen.

FIG. 17 is a diagram showing a tour content confirmation screen.

[Explanation of symbols] 1 server 2 PC 3 Internet 11 Display monitor 12 keyboard 13 mice

   ─────────────────────────────────────────────────── ─── Continued front page    (72) Inventor Shigeru Kuboji             2-3-11 Higashishinagawa, Shinagawa-ku, Tokyo             Inside JTB (72) Inventor Arihiro Sugisaki             2-16 Nitta-cho, Chuo-ku, Chiba-City, Inc.             In and sea

Claims (39)

[Claims] 1. A storage means for storing a preceding schedule, a trailing schedule, and an intermediate schedule group consisting of a plurality of intermediate schedules, and a tour content determining means including the storing means, wherein the tour content determining means includes the tour content determining means. A tour application means for calculating an intermediate time based on the preceding schedule and the subsequent schedule, extracting an intermediate schedule candidate that can be used at the intermediate time from the intermediate schedule group, and applying the intermediate schedule candidate for a tour. Presented to
A tour content determination system, which receives a selected schedule selected from the intermediate schedule candidates from the tour application means and determines tour content based on the selected schedule, a preceding schedule, and a following schedule. 2. The advance schedule group composed of a plurality of advance schedules is stored in the storage means, and the tour content determination means presents the advance schedule group to the tour application means to perform the tour. The tour content determination system according to claim 1, wherein the preceding schedule selected by the applicant from the application means is accepted. 3. The trailing schedule group consisting of a plurality of trailing schedules is stored in the storage means, and the tour content determining means presents the trailing schedule group to the tour applying means. 3. The tour content determination system according to claim 1 or 2, characterized in that the trailing schedule selected by the applicant from the tour application means is accepted. 4. The storage means stores order data for determining the order of the intermediate schedule, and the tour content determination means determines the tour content based on the order data. The tour content determination system according to claim 1 to 3. 5. The tour content determination system according to claim 1, wherein the trailing schedule is a schedule to be incorporated after the intermediate schedule. 6. The tour content determination system according to claim 1, wherein the intermediate schedule is a schedule relating to a beauty transformation service, and the intermediate time is a time for receiving the beauty transformation service. 7. The tour content determination system according to claim 1, wherein the order data is data for determining the order of the beauty transformation service. 8. A storage means for storing a preceding schedule group consisting of an intermediate schedule, a plurality of preceding schedules, and a trailing schedule group consisting of a plurality of trailing schedules, and a tour content determining means provided with the storing means. The tour content determination means calculates an intermediate time based on the intermediate schedule, and extracts a preceding schedule candidate and a succeeding schedule candidate that can secure the intermediate time from the preceding schedule group and the following schedule group. Presenting the preceding schedule candidate and the following schedule candidate to the tour application means, and selecting the selected preceding schedule selected from the preceding schedule candidate and the selected following schedule selected from the following schedule candidate by the tour application means Accepted from the above intermediate schedule and before Tour content determination system and determining the tour contents based and selected prior schedule and the selected trailing schedule. 9. The storage means stores an intermediate schedule group composed of a plurality of the intermediate schedules, and the tour content determination means presents the intermediate schedule group to the tour application means, thereby applying the tour application. 9. The tour content determination system according to claim 8, wherein the intermediate schedule selected by the applicant from the means is accepted. 10. The storage means stores order data for determining the order of the intermediate schedule, and the tour content determination means determines the tour content based on the order data. The tour content determination system according to claim 8 or 9. 11. The tour content determination system according to claim 8, wherein the trailing schedule is a schedule to be incorporated after the intermediate schedule. 12. The tour content determination system according to claim 8, wherein the intermediate schedule is a schedule relating to a beauty transformation service, and the intermediate time is a time for receiving the beauty transformation service. 13. The tour content determination system according to claim 8, wherein the order data is data for determining the order of the beauty transformation service. 14. A tour content determination means comprising a storage means for storing a preceding schedule, a trailing schedule, and an intermediate schedule group consisting of a plurality of intermediate schedules. A tour application means for calculating an intermediate time based on the preceding schedule and the subsequent schedule, extracting an intermediate schedule candidate that can be used at the intermediate time from the intermediate schedule group, and applying for a tour of the intermediate schedule candidate. And selecting the tour schedule from the tour schedule means, and determining the tour content based on the selected schedule, the preceding schedule, and the trailing schedule. Computer program for Beam. 15. A group of preceding schedules comprising a plurality of the preceding schedules is stored in the storage means, and the tour content determining means is caused to present the preceding schedule group to the tour application means, and the tour is provided. 15. The computer program for determining tour content according to claim 14, wherein the applicant accepts the preceding schedule selected by the applicant. 16. The storage means stores a trailing schedule group including a plurality of trailing schedules, and causes the tour content determining means to present the trailing schedule group to the tour application means. 16. The computer program for determining the tour content according to claim 14, wherein the applicant applies a trailing schedule selected by the tour applying means. 17. The storage means stores order data for determining the order of the intermediate schedule, and the tour content determination means is configured to determine the tour content based on the order data. Claim 14
A computer program for determining the tour content according to any one of 16 to 16. 18. The computer program for determining tour contents according to claim 14, wherein the trailing schedule is a schedule to be incorporated after the intermediate schedule. 19. The tour content determination according to claim 14, wherein the intermediate schedule is a schedule regarding a beauty transformation service, and the intermediate time is a time for receiving the beauty transformation service. Computer program. 20. The computer program for determining tour contents according to claim 14, wherein the order data is data for determining the order of the beauty transformation service. 21. A tour content determining means having a storage means for storing a preceding schedule group consisting of an intermediate schedule, a plurality of preceding schedules and a following schedule group consisting of a plurality of succeeding schedules, to perform processing. The tour content determination means is caused to calculate an intermediate time based on the intermediate schedule, and to extract a preceding schedule candidate and a succeeding schedule candidate capable of securing the intermediate time from the preceding schedule group and the following schedule group. , The tour application unit is presented with the preceding schedule candidate and the subsequent schedule candidate, and the tour application unit selects the selected preceding schedule selected from the preceding schedule candidate and the selected succeeding schedule selected from the following schedule candidate. Accept from the middle scale Computer programs for tour content determination, characterized in that to determine the tour content based on Yuru and said selected preceding schedule and the selected trailing schedule. 22. The storage means stores an intermediate schedule group consisting of a plurality of the intermediate schedules, and the tour content determining means is caused to present the intermediate schedule group to the tour applying means, and the tour application is performed. 22. The computer program for determining the tour content according to claim 21, wherein the applicant accepts the selected intermediate schedule from the means. 23. The storage means stores order data for determining the order of the intermediate schedule, and the tour content determination means causes the tour content to be determined based on the order data. 21.
22. A computer program for determining tour contents according to 22. 24. The computer program for determining tour contents according to claim 21, wherein the subsequent schedule is a schedule to be incorporated after the intermediate schedule. 25. The tour content determination according to claim 21, wherein the intermediate schedule is a schedule relating to a beauty transformation service, and the intermediate time is a time for receiving the beauty transformation service. Computer program. 26. The computer program for determining tour contents according to claim 21, wherein the order data is data for determining the order of the beauty transformation service. 27. The tour content determining means is provided with a storage means for storing a preceding schedule, a following schedule, and an intermediate schedule group consisting of a plurality of intermediate schedules. A tour application means for calculating an intermediate time based on the preceding schedule and the subsequent schedule, extracting an intermediate schedule candidate that can be used at the intermediate time from the intermediate schedule group, and applying for a tour of the intermediate schedule candidate. And selecting the tour schedule from the tour schedule means, and determining the tour content based on the selected schedule, the preceding schedule, and the trailing schedule. Method. 28. The advance schedule group composed of a plurality of advance schedules is stored in the storage means, and the tour content determination means is caused to present the advance schedule group to the tour application means, and the tour is provided. The tour content determination method according to claim 27, characterized in that the applicant accepts the preceding schedule selected by the applicant. 29. The storage means stores a trailing schedule group including a plurality of trailing schedules, and causes the tour content determining means to present the trailing schedule group to the tour application means. 29. The tour content determination method according to claim 27, wherein the tour application means allows the applicant to accept the trailing schedule selected by the applicant. 30. The storage means stores order data for determining the order of the intermediate schedule, and the tour content determination means is configured to determine the content of the tour based on the order data. Claim 27
29 to 29, the tour content determination method. 31. The tour content determination method according to claim 27, wherein the trailing schedule is a schedule to be incorporated after the intermediate schedule. 32. The tour content determining method according to claim 27, wherein the intermediate schedule is a schedule relating to a beauty transformation service, and the intermediate time is a time for receiving the beauty transformation service. 33. The tour content determination method according to claim 27, wherein the order data is data for determining the order of the beauty transformation service. 34. The tour content determining means having a storage means for storing a preceding schedule group consisting of an intermediate schedule, a plurality of preceding schedules, and a following schedule group consisting of a plurality of succeeding schedules is caused to perform processing. The tour content determination means is caused to calculate an intermediate time based on the intermediate schedule, and to extract a preceding schedule candidate and a succeeding schedule candidate capable of securing the intermediate time from the preceding schedule group and the following schedule group. , The tour application unit is presented with the preceding schedule candidate and the subsequent schedule candidate, and the tour application unit selects the selected preceding schedule selected from the preceding schedule candidate and the selected succeeding schedule selected from the following schedule candidate. Accept from the middle scale Tour content determination method characterized by to determine the tour content based on the Yuru with the selected previous schedule and the selected trailing schedule. 35. The storage means stores an intermediate schedule group consisting of a plurality of the intermediate schedules, and the tour content determination means is caused to present the intermediate schedule group to the tour application means, and the tour application is performed. The tour content determination method according to claim 34, characterized in that the applicant accepts the selected intermediate schedule from the means. 36. The storage means stores order data for determining the order of the intermediate schedule, and the tour content determination means causes the tour content determination means to determine the content of the tour based on the order data. Claim 34
The tour content determination method described in Nos. 35 to 35. 37. The tour content determining method according to claim 34, wherein the trailing schedule is a schedule to be incorporated after the intermediate schedule. 38. The tour content determining method according to claim 34, wherein the intermediate schedule is a schedule relating to a beauty transformation service, and the intermediate time is a time for receiving the beauty transformation service. 39. The tour content determining method according to claim 34, wherein the order data is data for determining the order of the beauty transformation service.