WO2004079618A1 - Reservation processing method and distributed reservation system - Google Patents
Reservation processing method and distributed reservation system Download PDFInfo
- Publication number
- WO2004079618A1 WO2004079618A1 PCT/JP2004/002943 JP2004002943W WO2004079618A1 WO 2004079618 A1 WO2004079618 A1 WO 2004079618A1 JP 2004002943 W JP2004002943 W JP 2004002943W WO 2004079618 A1 WO2004079618 A1 WO 2004079618A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- reservation
- facility
- information
- resource request
- profile
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Ceased
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/02—Reservations, e.g. for tickets, services or events
Definitions
- the present invention relates to a reservation processing method and a decentralized reservation system for alleviating “congestion / waiting” in society. For example, for a visitor at an amusement park, etc., the congestion of facilities is reduced and visitors Can be applied to a system for presenting the appropriate visit time to each facility that the user plans to visit in order to promote the effective use of the time for
- the present invention relates to a reservation processing method and a distributed reservation system that can be guided to each facility. Background art
- a system that is currently proposed as a typical example of “information service based on location information” is used in a museum or the like to automatically comment on paintings, etc., existing on the spot based on the current location of the viewer. It is transmitted to the information terminal of each individual viewer. If information such as the viewer's hobbies and nationality is recorded on the information terminal on the viewer's side, the viewer will be directed to a nearby exhibition site of the favorite work of the reader, and commentary will be given in his native language, etc. Personalized information provision service can also be realized.
- FIG. 1 is a block diagram illustrating an example of a conventional distributed reservation system.
- the system shown in Fig. 1 is a reservation system that enables visitors to each facility in a theme park with multiple facilities to efficiently visit each facility.For example, this system is introduced in Non-Patent Document 1. That is the system.
- visitors to a theme park visit a facility of interest 10 and make a reservation for a visit via a reservation system 40.
- the reservation system 40 calculates the reservation time from the current load status of the facility, and presents the calculated reservation time to the visitor. At that time, if they do not agree with the proposed appointment time, the visitor may visit the facility in line at the facility's non-reservation entrance 30 or abandon the facility visit at this time. Then move to other facilities 1 1.
- a visitor who agrees with the presented reservation time makes a reservation to the facility's reservation system 40, visits another facility 11 and, if the facility 11 is empty, does not reserve the facility If the facility 11 is used in a line at the entrance 3 1 for those who are not available at that time, a reservation is made to the reservation system 41 of the facility 11 similarly. Then, when the reservation time comes, the facility 10 which has been reserved earlier is revisited and the entrance is made through the entrance 20 for the reservation person. Until the reservation time, visitors can freely visit other facilities.
- the reservation management server 1 manages the reservation information of each attraction, and each user communicates with the management server using his / her mobile communication terminal and sets the reservation time on a first-come, first-served basis.
- the reservation server detects if there is a reservation registration from the same portable information terminal to different facilities at the same time, and notifies the user.
- the proposal of “reservation method using network” described in Patent Document 2 can be referred to.
- a reservation request and permission information are exchanged between a reservation applicant computer and a reservation data base computer connected to a network to make a reservation.
- Reservation applicants can prioritize and register multiple reservation requests, and the reservation request with the highest priority that is available first-come-first-served is reserved.
- the “online reservation system” described in Patent Document 3 uses a reservation status database that manages the reservation status of a plurality of facilities and waits for the cancellation when the reservation server receives the reservation cancellation from the user. Canceled reservations are assigned preferentially to users who have set high priorities.
- Patent Document 1 Japanese Patent Application Laid-Open No. 2001-344449
- Patent Document 3 Japanese Patent Application Laid-Open No. 2003-2422.6-Disclosure of the Invention
- a reservation system such as the one described above allows visitors to a theme park to visit more facilities to some extent more efficiently in time than in the absence of such a system.
- the conventional technology requires no Approximate systems 40 and 41 operate independently, and information is not shared between facilities 10 and 11; It is possible to make reservations with overlapping time zones, and the problem of overlapping reservation times cannot be avoided.
- the facility visitor has to make a reservation with the reservation system 40 installed at the place for each facility to visit.
- an object of the present invention is to arrange a reservation system for each facility, receive a reservation individually by the reservation system, adjust the facility so that the facility is not crowded as much as possible, and accept the reservation. It is an object of the present invention to provide a reservation processing method and a decentralized reservation system in which a visitor can make a reservation for a plurality of facilities at a time while avoiding duplicate reservations in the same time zone on the visitor's side.
- Another object of the present invention is that when a user makes a reservation for a plurality of facilities, a server for managing and processing the reservations for those facilities is not required, and each user has his / her desired time. It is an object of the present invention to provide a reservation processing method and a decentralized reservation system that can make reservations appropriately even when each facility can be reserved independently and each facility is operated independently.
- the reservation processing method is characterized in that a plurality of portable terminals and a plurality of facility reservation systems are connected by a wireless or wired network, and a plurality of portable terminals and A reservation processing method in a distributed reservation system for executing a reservation process with a reservation system of a plurality of facilities, wherein the portable terminal inputs a facility name and reservation information of a use time zone, and Generating a resource request profile expressed as a distribution of the degree of facility request for each unit time corresponding to the use time of the facility to be reserved from the reservation information input by the portable terminal; Transmitting the resource request port file for each facility to the reservation system of the corresponding facility; Receiving the resource request profiles of the reservation information, respectively; and summing up the plurality of resource request profiles received by the reservation system to determine the distribution of the facility request degree for each unit time of the facility.
- a portable terminal used in the reservation processing method according to the present invention is configured such that a plurality of portable terminals and a reservation system of a plurality of facilities are connected by a wireless or wired network,
- Input means for inputting and corresponding to the use time of the facility to be reserved based on the input reservation information
- Reservation information generating means for generating a resource request profile expressed as a distribution of the facility request degree for each unit time, and transmitting means for transmitting the generated resource request profile for each facility to a reservation system of the corresponding facility.
- a program for executing a reservation process of a portable terminal used in the reservation processing method according to the present invention is configured such that a plurality of portable terminals and a reservation system of a plurality of facilities are wirelessly or wiredly connected.
- the present invention provides, as a fourth aspect, a reservation system used in the reservation processing method according to the present invention, wherein a plurality of portable terminals and a plurality of facility reservation systems are connected by a wireless or wired network, Schedule multiple mobile devices and multiple facilities
- a facility request degree generating means for summing up the received plurality of resource request profiles to generate a self-requirement request profile of a distribution of the degree of facility request for each unit time of the facility, based on the generated self-installation request profile It is characterized by comprising: allocation means for making reservation of reservation information by an individual resource request file as an allocation reservation; and transmitting means for returning the allocation reservation to the portable terminal which transmitted the reservation information. is there.
- a program for executing a reservation process of a reservation system used in a reservation processing method according to the present invention is configured such that a plurality of portable terminals and a plurality of facilities have a wireless or wired reservation system.
- a program that is connected by a network and executes a reservation process in a reservation system used in a reservation processing method in a distributed reservation system that executes a reservation process between a plurality of portable terminals and a reservation system of a plurality of facilities, Receiving a resource request profile of each reservation information transmitted from the portable terminal; and summing up the plurality of received resource request profiles, and a self-site request profile of a distribution of a degree of facility request for each unit time of the facility. Generating an individual resource request profile based on the generated own facility request profile. Allocating a reservation of reservation information by file as an allocation reservation; and returning the allocation reservation to the portable terminal that transmitted the reservation information. is there.
- a distributed reservation system used in the reservation processing method according to the present invention is characterized in that a plurality of portable terminals and a plurality of facility reservation systems are wireless or wired. What is claimed is: 1. A distributed reservation system which is connected by a network and executes a reservation process between a plurality of portable terminals and a reservation system of a plurality of facilities, comprising: a facility name provided in said portable terminal; Input means for inputting reservation information of the mobile terminal; and a reservation from the input reservation information provided on the portable terminal.
- Reservation information generating means for generating a resource request profile expressed as a distribution of the degree of facility request for each unit time corresponding to the usage time of the facility to be used, and a resource request for each facility generated in the portable terminal.
- Transmitting means for transmitting the profile to the reservation system of the corresponding facility; receiving means provided in the reservation system for receiving the resource request profiles of the reservation information transmitted from the transmission means; and
- a facility request degree generating means for summing a plurality of received resource request port files provided in the system and generating a self-requirement request profile of a distribution of the facility request degree for each unit time of the facility; and The reservation of the reservation information by the individual resource request profile based on the generated own facility request profile.
- Allocation means for making a reservation; transmitting means provided in the reservation system for returning the allocation reservation to a portable terminal which has transmitted the reservation information; and allocation reservation for the reservation information from the reservation system provided in the portable terminal.
- Reservation information updating means for updating the reservation information, and retransmission means for updating the resource request profile for each facility from the updated reservation information provided in the portable terminal and retransmitting the profile to the reservation system of each corresponding facility
- the reservation processing method and the distributed reservation system of the present invention as described above, the reservation of the user is adjusted based on the resource request profile, so that the capacity and processing capacity of the facility that the user can use is limited. Even in an environment where demand for fluctuates greatly (for example, large-scale attraction facilities), it is possible to accurately grasp the state of demand, and based on information on the degree of congestion of facilities, each user can respond to that demand.
- the time for using the facility can be set appropriately, and the demand for the facility can be efficiently handled.
- the portable terminal prevents overlapping of the time slots for reservation applications, a reservation system can be provided independently for each facility. As a result, even for facilities dispersed in each region, It is possible to adjust the time of visiting facilities considering the degree of congestion for the facility
- FIG. 1 is a block diagram illustrating an example of a conventional distributed reservation system.
- FIG. 2 is a diagram showing an overall configuration of a distributed reservation system according to one embodiment of the present invention.
- FIG. 3 is a flowchart showing a processing procedure of a reservation process for allocating a visit time to a facility to a visitor.
- FIG. 4 is an explanatory diagram illustrating a process of creating a resource request profile.
- FIG. 5 is a diagram for explaining an outline of a process of allocating facility use time to visitors.
- FIG. 6 is an explanatory diagram for explaining a reservation adjustment process.
- Fig. 7 is a flow chart showing the content of the duplication check process at the visitor agent.
- FIG. 2 is a diagram showing an overall configuration of a distributed reservation system according to an embodiment of the present invention.
- the distributed reservation system consists of a portable communication terminal 100, such as a PDA or a mobile phone, owned by each user and an information processing system 200 installed at each facility.
- the system is connected by a wireless or wired communication network (not shown).
- a subsystem (processing module) for performing a part of the reservation process performed by the portable communication terminal 100 is called a visitor agent, and the information processing system 200
- a subsystem (processing module) for performing the remaining processing of the reservation processing performed by 0 is called a facility agent.
- Distributed reservation processing is performed by the processing related to the inactivity between these visitor agents and the facility agent.
- a reservation process in the system is executed.
- Part of the reservation process by the visitor agent uses the hardware devices of the input device 110, the display device 120, the control device 130, the storage device 140, and the communication device 150 of the portable communication terminal 100. It is executed by the processing of the program that controls them.
- a user inputs various information (reservation time zone information, reservation facility name information) for making a reservation from an input device 110 using a keyboard or a pen.
- a liquid crystal display device can be used as the display device 120.
- the display device 120 displays information input from the input device 110 and information sent from the information processing system 200 that executes a reservation process of the facility agent. I do.
- the visitor agent processing module
- the portable terminal are referred to by the same reference numeral 100
- the facility agent processing module
- the information processing system are referred to by the same reference numeral 200. It will be described with reference to FIG.
- the control device 130 has a CPU and a memory, and the control device 130 controls a device in the visitor agent 100. It is the main part that performs the reservation process in the visitor agent by program processing. It also performs information processing for guiding visitors.
- the storage device 140 for example, an IC memory can be used, and various types of information are stored. Stores the reservation processing program in the visitor agent.
- the communication device 150 of the visitor agent communicates wirelessly with the communication device 230 controlled by the facility agent 20.0.
- the communication between the communication device 150 of the visitor agent and the communication device 230 of the facility agent can use a communication device such as a wireless LAN (IEEE 802.11b or the like) or Bluetooth.
- the information processing system 200 that executes the reservation processing of the facility age component includes: 43
- a sales combination system can be used.
- the facility agent 200 is provided with a control device 210, a storage device 220, and a communication device 230.
- the control device 210 has a CPU and a memory, and controls the entire device.
- the control device 210 executes a reservation process in the distributed reservation system according to the present invention by a program process by a computer, and the visitor agent 100
- the reservations requested by the visitors are adjusted based on the resource request profile, and the reservation process is performed to guide the visitors so that the visitors do not concentrate on the facility during a specific time zone. This processing will be described later in detail.
- the storage device 220 a large-capacity storage device such as a hard disk can be used.
- the storage device 220 stores information such as the reservation time adjusted by the visitor, the adjusted reservation time, and the identification information of the visitor agent 100. Also, it stores a program for reservation processing in facility agents.
- the communication device 230 of the facility agent wirelessly communicates with the communication device 150 of the visitor agent 100.
- FIG. 3 is a flowchart showing a processing procedure of a reservation process for allocating a visit time to a facility to a visitor. The operation of the reservation process will be described with reference to FIG.
- the visitor first activates the visitor agent on the portable terminal 100 owned by the visitor to start the process.
- facility information indicating a facility that the user wants to visit using the input device 110
- time zone information indicating a time zone during which the user wants to visit the facility (early use start time and latest use completion time)
- Enter a preference value (a value between 0 and 1) indicating the importance to the facility.
- the controller 130 sets a predetermined default value (the time zone is the closing time from the present time, and the preference value is 1.0). Is set (step S100).
- the visitor agent (control device 130) normalizes the preference value for the facility that the visitor wants to visit based on the input information (step 130). S110)). This is intended to reduce unfairness between visitors who want to visit many facilities and those who do not plan to visit too many facilities o
- P ij is the preference value of visitor i for facility j
- ⁇ P i is the sum of the preference values of visitor i for all facilities
- P ′ ij is the normalized value of visitor i for facility j. Is the preferred value. That is, in the normalization process, as shown in the above equation, the preference value of each facility is divided by the sum of the preference values of all facilities to be visited. This will ensure that bookings are fair for visitors who visit many facilities and visitors who visit few facilities.
- the visitor agent creates a resource request profile for each facility indicated by the facility information from the input information (step S120), and sends the profile to the facility agent in response to each (step S120). S130).
- FIG. 4 is a diagram for explaining a process of creating a resource request profile.
- the accuracy of the time presented to the visitors is 10-minute intervals, and the visitor has a preference value of 0 for a certain facility from 9:00 to 9:50. Suppose you have the desire to visit at 6. It is further assumed that the time required for attractions at this facility is 30 minutes.
- the time during which visitors participate in the attractions at the facility is determined by the three patterns of tiles in Fig. 4 (from 9:00 to 9:30), (9:10 (9:40 to 9:40) and. (9:20 to 9:50). Furthermore, as can be seen from Fig. 4, since the time zone from 9:20 to 9:30 is included in all three patterns, the time zone as desired by the visitors When visiting this facility, visitors must be at this facility from 9:20 to 9:30.
- Visitors have a preference of 0.6 for this facility, so during the above hours, It is assumed that the probability that a visitor is in this facility is 0.6, and the probability in other time zones is also calculated according to a predetermined formula.
- the contents desired to be used can be expressed as a probability graph as shown in the lower part of Fig. 4. From this, it is assumed that the data shown in this graph is a data request for making a reservation request as a resource request profile for the facility of the visitor. A reservation process is executed based on the resource request profile.
- Such a resource requirement profile is created for each facility entered by the visitor as a visitor based on the input information, and transmitted to each facility agent.
- the visitor agent 100 based on the input information, provides the facility agent 200 of each facility that the visitor has entered as he / she wants to visit to the resource created by the visitor for that facility.
- the request profile information is transmitted from the communication device 150 to it (step S130) o
- the information input from the input device 110 and the created resource request profile are temporarily stored in the storage device 140.
- the control device 210 periodically (eg, at 10 minute intervals) via the communication device 230 from each visitor agent 100 from the resource request profile. Is received (step S140). Then, a process of totalizing the received resource request profile information in the storage device 220 is performed. In this case, in the processing of the facility agent 200, the aggregated resource demand profile is used to total the demand of all the visitors who want to make a reservation for the facility (step SI 5.0). Subsequently, based on the total information, an allocation process for allocating the time for visiting each facility to each visitor is performed (step S160).
- FIG. 5 is a diagram for explaining a process of allocating facility use time to each visitor.
- the process of allocating facility use time to each visitor is a resource allocation process.
- the facility agent 200 receives the resource request of each visitor from three visitor agents, visitor 1 3 visitor 2 and visitor 3. Receive the profiles and aggregate their resource requirement profiles to create a comprehensive resource requirement profile for the facility.
- the comprehensive resource demand profile represents the time fluctuation of the total demand of the facility, and the time zone corresponding to the peak (here, it is called the competitive peak) (shown by a shaded pattern in Fig. 5). Is the time zone in which the facility is expected to be the most crowded.
- the facility agent 200 calculates the competitive peak in the processing of the total demand (step S150), it determines the time zone and refers to the resource request profile of each visitor. Find the visitor with the highest demand during the peak competition time period (ie, the visitor with the highest probability value for that time period in the resource demand profile). In the example of FIG. 5, since the resource request profile of the visitor 3 corresponds to that, the probability (preference value) of the visitor 3 included in the resource request profile of the visitor 3 Of the comprehensive resource requirements profile, the time zone with the smallest value. That is, a process is performed in which a time zone in which competition with other visitors is as small as possible is assigned as a candidate value of the visit time of the visitor. For the resource request profiles of the other visitors, allocatable times are allocated in the same manner except for the time zone already allocated (step S160).
- the facility agent 2000 indicates the time period during which the visitor is guided through the communication device 230 to the visitor agent 100 of the visitor who has assigned the candidate value of the visit time, and the facility of its own.
- the facility information is transmitted (step S170).
- the time information of the candidate value of the visiting time is transmitted from each facility agent 200 to the previously transmitted resource request profile (step S 170). , Step S 1 8 0) so there is one Or, the visitor agent 1000 that has received the time zone information of the candidate value of the visit time assigned from the plurality of facility agents 200, the time zone overlaps from the received time zone information and the facility information.
- a process for discovering information is performed, and if there is a time slot for overlapping use, the content is displayed (step S190). In other words, in this process, for example, the display device 120 displays how the visit time affects the visit plan of the visitor to another facility which the visitor is planning, and displays the information in the time period.
- step S200 to step S220 In order to confirm whether or not to visit the facility, accept the acceptance or rejection input, adjust the preference value according to the input, and update the contents of the changed resource request profile (step S200 to step S220), transmit again to each facility agent (step S230), and wait for reception of allocation information according to the content of the updated resource request profile thereafter .
- FIG. 6 is an explanatory diagram for explaining a reservation adjustment process.
- the visitor is planning to visit three facilities (first facility, second facility, and third facility), and the resource demand profiles for those facilities are shown in the left part of Fig. 6. It is shown.
- the facility agent of the third facility assigns the visitor time to the hatched time zone as the visit time
- the result is The right part of Fig. 6 shows how the effect is transmitted to the facility visit plan.
- the resource requirement profile of the third facility was changed as shown on the right side of Fig. 6 and hatched with diagonal lines. Only the part. Furthermore, since the visitor cannot visit other facilities during the time period, the resource requirement profile (the resource requirement profile for the second facility) for the time period is changed. As a result, in this case, the resource requirement profile of the second facility is modified as shown in the right side of FIG.
- the visitors will form a resource demand profile with a peak value (1.0) for the first facility and the second facility at the same time zone. That is, the visit to either the first facility or the second facility must be abandoned (it is not possible to visit more than one facility at the same time).
- the control device 130 finds duplicate reservations (in this example, the scheduled visit times of the first facility and the second facility overlap).
- the visitor agent 100 displays the result calculated by the control unit 130 of the visitor agent 100 on the display device 120 so that the influence of the allocation of the visit time on the scheduled visit to another facility is displayed. indicate. Thereafter, a determination as to whether the assignment of the visit time is acceptable is input from the input device 110 of the visitor agent 100.
- the visitor agent 100 Based on the results, adjust visitor preferences to prevent excessive inequity among visitors in allocating visiting facilities.
- the facilities of the first facility and the second facility will have their priority reduced (figure 6). Now lower the visitor's preference for the second facility (for example, -10%). If you refuse to assign to the third facility, lower your preference for the third facility and increase the visitor's preference for the first and second facilities (for example, + 10%).
- preference values are adjusted by the controller 130 by normalizing the values (step S210).
- the visitor agent 100 updates the resource request profile of the visitor based on the new preference value, and transmits the result to each facility agent 200 The transmission is performed via 150 (steps S220 to S230). If the visitor's reservation to visit all facilities is confirmed, an empty (ie, no newly assigned visit) resource request profile is transmitted.
- the control device 220 of the facility agent 200 Upon receiving the updated resource request profile via the communication device 230, the control device 220 of the facility agent 200 receives the updated resource request profile when the content of the resource request profile is not empty (that is, there is no newly assigned visit). Assigns a visit time to a visitor based on the updated resource request profile, and repeatedly executes the above-described processing (step S240 S250 S150). On the other hand, if the resource request profile is empty, the control device 220 determines that the reservation application has been completed, and disconnects the communication of the visitor agent who has applied for the reservation (step S240S). 25 0 end).
- the individual facility agent (reservation system) 200 adjusts the visit hours, and as a result, even if the visit hours to multiple facilities overlap, the visitor agent 100 Encourage visitors to adjust the priority of visiting facilities so that 0 is not duplicated. This makes it impossible for visitors to apply for reservations for multiple facilities at the same time as in the past. Visitors to the facility can visit the facility efficiently according to the visitor's preference value and the degree of congestion of the facility, and the facility does not create an unfair feeling among the visitors. The time is allocated for visiting. (Other embodiments)
- the visitor agent is set for each visitor, but a visitor who has arrived in a group can be reserved by one visitor age component. May be set to perform processing.
- the visit time from the facility agent is assigned to all the facilities that the visitor has planned to visit, but as in the conventional example (Fig. 1), By providing entrances and entrances for non-reserved persons, the system will be used to allocate visit hours only to facilities that are expected to be congested. May be mixed.
- the duplication is eliminated by prompting the visitors to adjust the priority.
- the visitor agent 10 The control device of 0 may automatically delete reservations for facilities with low preference values. Which reservation is to be deleted may be determined as appropriate by the system designer.
- FIG. 7 shows a processing procedure executed by the control device 130 for this purpose.
- Fig. 7 is a flow chart showing the processing contents of the duplication check in the visitor agent. .. ⁇
- control device 130 receives facility information and time zone information from one or more facility agents 200, the number of data sets (time zone information) is plural (2). Is determined (step S1000). If the facility information and the time zone information are one set, there is no duplication.Therefore, the process jumps to step S 1 050 and the received facility information and time zone information are set as the accepted reservation. Set in storage device 140.
- step S1010 the procedure proceeds from step S1000 to step S1010.
- the controller 130 extracts the first and second time zone information from the received time zone information (step S1010), and the time zones indicated by the two time zone information overlap. It is determined whether or not this is the case (step S1020). When the start time or end time of the other time zone exists between the start time and end time of one time zone, and both the probabilities in the resource request profile in the overlapping time zone are 1.0. It is determined that the two time periods overlap.
- the facility information and the time zone information whose reception time is later are deleted from the comparison target (step S1030).
- step S 1400 S 1500 the procedure proceeds to step S 1400 S 1500, and the facility information and time zone information remaining after the deduplication processing is performed are set in the storage device 140 as a reservation for acceptance. .
- the set facility information and time zone information are displayed on the display device 120, and the processing procedure of FIG. 7 ends.
- the facility information may use the communication address of the facility agent, and the display device 12
- the facility information in the form of characters for display at 0 and input from the input device 110. It is recommended to use a conversion table from the facility information in character form to the facility information of the communication address portable. The correspondence table between the facility information in character form and the communication address is described in the conversion table.
- the reservation processing method and the distributed reservation system according to the present invention are suitably used in an environment (for example, a large-scale attraction facility) in which the resource capacity and the processing capacity are limited and the demand for the resource fluctuates greatly. Based on information on the degree of congestion of resources, it is possible to appropriately set the time to use resources in response to a reservation request (demand), and it is possible to efficiently and fairly handle resource demand. .
- a reservation system is provided for each facility to perform the reservation process, and the portable terminal side can prevent the overlapping of the time zones for the reservation application, thus simplifying the system configuration. In addition, it is possible to adjust the time of visiting the facility in consideration of the degree of visitors' preference for the facility.
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Tourism & Hospitality (AREA)
- Operations Research (AREA)
- Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Human Resources & Organizations (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- Quality & Reliability (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
Description
明細書 予約処理方法および分散型予約システム 技術分野 Description Reservation processing method and distributed reservation system
この発明は、 社会における 「混雑 ·待ち」 を緩和するための予約処理方 法および分散型予約システムに関するものであり、 例えば、 遊園地などの来場 者に対して、 施設の混雑を緩和し来場者の時間の有効利用を促進するために、 利用者が訪問を予定している各施設に対して適切な訪問時刻を提示するための システムに適用でき、 また、 多数の利用者に対して効率的に各施設に誘導する ことのできる予約処理方法および分散型予約システムに関するものである。 背景技術 The present invention relates to a reservation processing method and a decentralized reservation system for alleviating “congestion / waiting” in society. For example, for a visitor at an amusement park, etc., the congestion of facilities is reduced and visitors Can be applied to a system for presenting the appropriate visit time to each facility that the user plans to visit in order to promote the effective use of the time for The present invention relates to a reservation processing method and a distributed reservation system that can be guided to each facility. Background art
計算機や各種センサーおよび無線通信機器の性能向上 ·低価格化の急激 な進展により、 社会の至る所に情報の受発信機能を持つ情報機器が備わったュ ビキタス情報社会の訪れが目の前に迫りつつある。 しかしながら、 前記のよう なハードウエア技術の急速な進歩とは対照的に、 それを活用したソフトウエア、 新たなサービスの在り方に関しては、 未だ 「キラ一アプリケーション」 と呼べ るような提案はなされていないのが現状である。 Improve the performance of computers, various sensors, and wireless communication devices. ・ With the rapid progress in price reduction, the ubiquitous information society, which is equipped with information devices that can send and receive information everywhere in society, is approaching. It is getting. However, in contrast to the rapid progress in hardware technology as described above, no proposal has yet been made to call it a `` Kira-Ichi application '' for software utilizing it and new services. is the current situation.
例えば、 現在 「位置情報に基づく情報サービス」 の典型例として提案さ れているシステムは、 美術館などにおいて、 閲覧者の現在位置 ©情 #に基づい て、 その場に存在する絵画などの解説を自動的に個々の閲覧者の情報端末に発 信するというものである。 閲覧者側の情報端末に閲覧者の趣味や国籍などの情 報が記録されていれば、 近くにある閲^者の好きな作品の展示場所に案内し、 また、解説を母国語で行うなどの個人適合的な情報提供サ一ビスも実現できる。 For example, a system that is currently proposed as a typical example of “information service based on location information” is used in a museum or the like to automatically comment on paintings, etc., existing on the spot based on the current location of the viewer. It is transmitted to the information terminal of each individual viewer. If information such as the viewer's hobbies and nationality is recorded on the information terminal on the viewer's side, the viewer will be directed to a nearby exhibition site of the favorite work of the reader, and commentary will be given in his native language, etc. Personalized information provision service can also be realized.
このようなサービスはュビキ夕ス情報環境にいる個人に対する有用なサ 一ビスではあるが、 その場に、 居合わせた他の人々との関係に関しては何も考 慮されていない。 例えば、 上の例では同じ嗜好を持つ大勢の人々を一度に同じ 作品のあるブースに案内することにより、 大混雑を発生させてしまう可能性も める。 While such services are useful services for individuals in the ubiquitous information environment, they do not consider anything about their relationships with other people present. Not considered. For example, in the above example, guiding a large number of people with the same taste to a booth with the same work at one time could increase the likelihood of congestion.
したがって、 ュビキタス情報環境においては、 現在提案されている上記 のような個人指向のサービスに加えて、 その場で発生する 「混雑,待ち」 を解 消するように人々の行動を誘導する社会的調整機能の実現が、 集団としての利 便性を指向した新たなサービスとして期待される。 Therefore, in the ubiquitous information environment, in addition to the personalized services proposed above, social coordination that induces people to take action to eliminate the “congestion and waiting” that occurs on the spot. The realization of functions is expected as a new service oriented to convenience as a group.
このような「混雑 ·待ち」を解消する一例について説明する。第 1図は、 従来の分散型予約システムの一例を説明するプロック図である。 第 1図のシス テムは、 複数の施設を有するテーマパークの各施設を訪問する訪問者が効率よ くそれそれの施設を訪問するための予約システムであり、 たとえば、 非特許文 献 1で紹介されているシステムである。 An example of eliminating such “congestion / waiting” will be described. FIG. 1 is a block diagram illustrating an example of a conventional distributed reservation system. The system shown in Fig. 1 is a reservation system that enables visitors to each facility in a theme park with multiple facilities to efficiently visit each facility.For example, this system is introduced in Non-Patent Document 1. That is the system.
第 1図を参照して説明すると、 まず、 テーマパークの来場者は、 興味の ある施設 1 0を訪れ、 予約システム 4 0を介して訪問の予約を行う。 予約シス テム 4 0は現在の施設の負荷状況から予約時刻を算出し、 算出した予約時刻を 訪問者に提示する。 その際、 提示された予約時間に同意できないのであれば、 訪問者は施設の非予約者用入り口 3 0で列に並んで施設を訪問するか、 あるい はこの時点での施設の訪問を断念して、 他の施設 1 1に移動する。 Referring to FIG. 1, visitors to a theme park visit a facility of interest 10 and make a reservation for a visit via a reservation system 40. The reservation system 40 calculates the reservation time from the current load status of the facility, and presents the calculated reservation time to the visitor. At that time, if they do not agree with the proposed appointment time, the visitor may visit the facility in line at the facility's non-reservation entrance 30 or abandon the facility visit at this time. Then move to other facilities 1 1.
提示された予約時刻に同意する訪問者は、 その施設の予約システム 4 0 に対して予約を行った上で、 他の施設 1 1を訪れ、 施設 1 1が空き状態であれ ば施設の非予約者用入り口 3 1で列に並んで施設 1 1を利用し、 その時に利用 できなければ、.同様にその施設 1 1の予約システム 4 1に対して予約を行う。 そして、 予約時刻になれば、 先に予約しておいた施設 1 0を再訪して、 予約者 用入り口 2 0から入場する。 予約時刻までの間は、 訪問者は自由に他の施設を 訪れることができる。 A visitor who agrees with the presented reservation time makes a reservation to the facility's reservation system 40, visits another facility 11 and, if the facility 11 is empty, does not reserve the facility If the facility 11 is used in a line at the entrance 3 1 for those who are not available at that time, a reservation is made to the reservation system 41 of the facility 11 similarly. Then, when the reservation time comes, the facility 10 which has been reserved earlier is revisited and the entrance is made through the entrance 20 for the reservation person. Until the reservation time, visitors can freely visit other facilities.
また、 この種の施設の予約システムに関係する公知文献としては、 特許 文献 1に記載されているアトラクション施設のための 「会場内施設予約システ ム」 の提案がある。 このシステムにおいては、 予約管理サーバ一が各アトラク シヨンの予約情報を管理し、 各利用者は自ら携帯通信端末を用いて、 管理サー バーと通信を行い先着優先で予約時間の設定を行う。 予約サーバーは、 同一の 携帯情報端末から異なる施設に対して同時間に予約登録がある場合は、 それを 検出し利用者に通知するものとなっている。 As well-known literature relating to this kind of facility reservation system, there is a “facility reservation system in a venue” for an attraction facility described in Patent Document 1. There is a proposal. In this system, the reservation management server 1 manages the reservation information of each attraction, and each user communicates with the management server using his / her mobile communication terminal and sets the reservation time on a first-come, first-served basis. The reservation server detects if there is a reservation registration from the same portable information terminal to different facilities at the same time, and notifies the user.
宿泊施設の予約については、 特許文献 2に記載の 「ネットワークを用い た予約方法」 の提案が参照できる。 この提案の予約方法においては、 ネッ トヮ ークに接続された予約希望者コンピュータと予約デ一夕ベースコンピュータと の間で、 予約の要求と許可の情報をやりとりして予約を行う。 予約希望者は優 先順位を付けて、 複数の予約希望を登録することができ、 先着優先で空いてい る優先順位の最も高い予約希望が予約されるものとなっている。 Regarding the reservation of accommodation facilities, the proposal of “reservation method using network” described in Patent Document 2 can be referred to. In the proposed reservation method, a reservation request and permission information are exchanged between a reservation applicant computer and a reservation data base computer connected to a network to make a reservation. Reservation applicants can prioritize and register multiple reservation requests, and the reservation request with the highest priority that is available first-come-first-served is reserved.
また、 特許文献 3に記載の 「オンライン予約システム」 は、 複数の施設 の予約状況を管理する予約状況データベースを用いて予約サーバーが利用者か らの予約キャンセルを受信すると、 キャンセル待ちをしている利用者で高い優 先順位を設定している利用者に優先的にキャンセルされた予約を割り当てるも のである。 In addition, the “online reservation system” described in Patent Document 3 uses a reservation status database that manages the reservation status of a plurality of facilities and waits for the cancellation when the reservation server receives the reservation cancellation from the user. Canceled reservations are assigned preferentially to users who have set high priorities.
[非特許文献 1 ] [Non-Patent Document 1]
h t t p : //www . t o kyo d i s ne yr e s o r t . c o . j p/ t d l/j ap ane s e/j― t o p i c s/ i nd ex一 f p a s s h t t p: // www .t kyo d i s ne yr e s o r t .c o .j p / t d l / j ap ane s e / j-t o p i c s / in d ex i
[特許文献 1] 特開 200 1— 34449 1号公報 [Patent Document 1] Japanese Patent Application Laid-Open No. 2001-344449
[特許文献 2] 特開 2002— 334252号公報 [Patent Document 2] JP-A-2002-334252
[特許文献 3] 特開 2003— 2422.6 号公報 - 発明の開示 [Patent Document 3] Japanese Patent Application Laid-Open No. 2003-2422.6-Disclosure of the Invention
上記のような予約システムを用いることで、 そのようなシステムが存在 しない場合よりも、 テーマパークの来場者はある程度は時間的に効率的に多く の施設を訪問することができる。 しかしながら、 従来の技術では、 各施設の予 約システム 4 0, 4 1が独立して動作しており、 施設 1 0 , 1 1間で情報の共 有がなされていないため、 訪問者が複数の予約システム 4 0, 4 1に対して時 間帯が重複した予約を行うことが可能となっており、 予約時刻の重複の問題を 避けることができない。 また、 施設の訪問者は、 訪問したい施設ごとに、 その 場所に設置された予約システム 4 0に対して予約を行わなければならないとい う煩雑さも生じる。 The use of a reservation system such as the one described above allows visitors to a theme park to visit more facilities to some extent more efficiently in time than in the absence of such a system. However, the conventional technology requires no Approximate systems 40 and 41 operate independently, and information is not shared between facilities 10 and 11; It is possible to make reservations with overlapping time zones, and the problem of overlapping reservation times cannot be avoided. In addition, the facility visitor has to make a reservation with the reservation system 40 installed at the place for each facility to visit.
例えば、 特許文献 1〜3に記載されているように、 各施設についての予 約情報の管理を予約管理サーバーまたは予約データベースサーバーにより行う ことにより、 施設の間の情報を共有できるように複数の施設の予約システムを 統合して、 1つの予約システムとして構築することが考えられるが、 このよう なシステムでは、 利用者の予約時間の設定が利用者の選好にかかわらず、 先に 予約登録した利用者優先で予約が行われることになり、 予約の集中する時間帯 が生じることを防ぐことは不可能である。 このため、 施設の稼働率改善には限 界がある。 また、 来場者 (利用者) は複数の施設の予約を行うので、 各施設に 対して来場者が増えるほど、 複数の施設を統合して予約するシステムは、 予約 システムの負荷が增大して効率が悪化してしまい、 最悪の場合には、 システム がダウン (停止) してしまう危険性があるという問題がある。 For example, as described in Patent Documents 1-3, by managing reservation information for each facility by a reservation management server or a reservation database server, multiple facilities can be shared so that information between facilities can be shared. It is conceivable that the reservation system is integrated into a single reservation system, but in such a system, the user who made the reservation beforehand was registered regardless of the user's reservation time setting. Since reservations are made on a priority basis, it is impossible to prevent a time slot in which reservations are concentrated. For this reason, there are limits to improving the occupancy rate of facilities. Also, since visitors (users) make reservations for multiple facilities, as the number of visitors to each facility increases, a system that integrates multiple facilities and makes reservations places a greater burden on the reservation system, resulting in higher efficiency. The problem is that there is a risk that it will worsen and, in the worst case, bring down the system.
そこで、 本発明の目的は、 施設ごとに予約システムを配置し、 予約シス テムが個別の予約を受け、 施設が可能な限り混雑しないように調整して予約を 受け付け、 さらに施設の同一訪問者による同一時間帯の重複予約を訪問者の側 で回避しつつ、 訪問者が複数の施設に対する予約を一括して行うことが可能な 予約処理方法および分散型予約システムを提供することにある。 Therefore, an object of the present invention is to arrange a reservation system for each facility, receive a reservation individually by the reservation system, adjust the facility so that the facility is not crowded as much as possible, and accept the reservation. It is an object of the present invention to provide a reservation processing method and a decentralized reservation system in which a visitor can make a reservation for a plurality of facilities at a time while avoiding duplicate reservations in the same time zone on the visitor's side.
本発明の他の目的は、 複数の施設に対して利用者が予約を行う際に、 それ らの施設に対する予約を統括して処理するサーバ一を必要とせず、 各利用者が 自らの望ましい時間を各施設に予約することができ、 各施設が独立して運営さ れる場合についても、 利用者は適切に予約を行うことができる予約処理方法お よび分散型予約システムを提供することにある。 本発明は、 第 1の態様として、 本発明による予約処理方法が、 複数の携 帯用端末と複数の施設の予約システムとが無線または有線のネットワークによ り結合され、 複数の携帯用端末と複数の施設の予約システムとの間で予約処理 を実行する分散型予約システムにおける予約処理方法であって、 前記携帯用端 末により施設名およびその利用時間帯の予約情報を入力するステップと、 前記 携帯用端末により入力された前記予約情報から予約する施設の利用時間に対応 して各単位時間の施設要求度合の分布として表現した資源要求プロファイルを 生成するステップと、 前記携帯用端末により前記生成した施設毎の資源要求プ 口ファイルをそれそれの対応の施設の予約システムに送信するステップと、 前 記予約システムにより前記送信されたそれぞれ予約情報の資源要求プロフアイ ルを受信するステップと、 前記予約システムにより前記受信した複数の資源要 求プロファイルを総計して当該施設の各単位時間の施設要求度合の分布の自施 設要求プロファイルを生成するステップと、 前記予約システムにより前記生成 された自施設要求プロファイルに基づいて個別の資源要求プロファイルによる 予約情報の予約を割り付け割付予約とするステップと、 前記予約システムによ り前記割付予約を予約情報を発信した携帯用端末に返信するステップと、 前記 携帯用端末により前記受信した割付予約に利用時間の重複がある場合に、 重複 のある割付予約を表示し、 重複解消のために入力を受け付けて前記予約情報を 更新するステツプと、 前記携帯用端末により前記更新された予約情報から各施 設に対する資源要求プロファイルを更新して、 各対応の施設の予約システムに 再送するステップとの処理を実行することを特徴とするものである。 Another object of the present invention is that when a user makes a reservation for a plurality of facilities, a server for managing and processing the reservations for those facilities is not required, and each user has his / her desired time. It is an object of the present invention to provide a reservation processing method and a decentralized reservation system that can make reservations appropriately even when each facility can be reserved independently and each facility is operated independently. According to a first aspect of the present invention, as a first aspect, the reservation processing method according to the present invention is characterized in that a plurality of portable terminals and a plurality of facility reservation systems are connected by a wireless or wired network, and a plurality of portable terminals and A reservation processing method in a distributed reservation system for executing a reservation process with a reservation system of a plurality of facilities, wherein the portable terminal inputs a facility name and reservation information of a use time zone, and Generating a resource request profile expressed as a distribution of the degree of facility request for each unit time corresponding to the use time of the facility to be reserved from the reservation information input by the portable terminal; Transmitting the resource request port file for each facility to the reservation system of the corresponding facility; Receiving the resource request profiles of the reservation information, respectively; and summing up the plurality of resource request profiles received by the reservation system to determine the distribution of the facility request degree for each unit time of the facility. Generating a reservation of reservation information by an individual resource request profile based on the own facility request profile generated by the reservation system as an allocation reservation; and Returning the reservation information to the portable terminal that transmitted the reservation information; and, when the allocation reservation received by the portable terminal has an overlapping use time, displaying the overlapped allocation reservation, and inputting to eliminate the overlap. Receiving and updating the reservation information; and the updated reservation by the portable terminal. It is characterized in that a resource request profile for each facility is updated from the information and a process of retransmitting the resource request profile to the reservation system of the corresponding facility is executed.
また、 本発明は、 第 2の態様と て、 .本発明による予約処理方法で用い る携帯端末が、 複数の携帯用端末と複数の施設の予約システムとが無線または 有線のネットワークにより結合され、 複数の携帯用端末と複数の施設の予約シ ステムとの間で予約処理を実行する分散型予約システムにおける予約処理方法 で用いる携帯用端末であって、 施設名およびその利用時間帯の予約情報を入力 する入力手段と、 入力された前記予約情報から予約する施設の利用時間に対応 して各単位時間の施設要求度合の分布として表現した資源要求プロファイルを 生成する予約情報生成手段と、 生成した施設毎の資源要求プロファイルをそれ それの対応の施設の予約システムに送信する送信手段と、 予約システムから予 約情報に対する割付予約を受信する受信手段と、 受信した割付予約に利用時間 の重複がある場合に、 重複のある割付予約を表示し、 重複解消のために入力を 受け付けて前記予約情報を更新する予約情報更新手段と、 更新された予約情報 から各施設に対する資源要求プロファイルを更新して、 各対応の施設の予約シ ステムに再送する再送信手段とを備えることを特徴とするものとなっている。 According to a second aspect of the present invention, a portable terminal used in the reservation processing method according to the present invention is configured such that a plurality of portable terminals and a reservation system of a plurality of facilities are connected by a wireless or wired network, A portable terminal used in a reservation processing method in a distributed reservation system for executing a reservation process between a plurality of portable terminals and a reservation system of a plurality of facilities. Input means for inputting and corresponding to the use time of the facility to be reserved based on the input reservation information Reservation information generating means for generating a resource request profile expressed as a distribution of the facility request degree for each unit time, and transmitting means for transmitting the generated resource request profile for each facility to a reservation system of the corresponding facility. Receiving means for receiving the allocation reservation for the reservation information from the reservation system; and, when the received allocation reservations have overlapping usage times, displaying the overlapping allocation reservations, and accepting an input to eliminate the duplication. A reservation information updating means for updating the reservation information; and a retransmission means for updating a resource request profile for each facility from the updated reservation information and retransmitting the resource request profile to the reservation system of each corresponding facility. It has become something.
また、 本発明は、 第 3の態様として、 本発明による予約処理方法で用い る携帯端末の予約処理を実行するプログラムが、 複数の携帯用端末と複数の施 設の予約システムとが無線または有線のネットワークにより結合され、 複数の 携帯用端末と複数の施設の予約システムとの間で予約処理を実行する分散型予 約システムにおける予約処理方法で用いる携帯用端末において予約処理を実行 するプログラムであって、 施設名およびその利用時間帯の予約情報を入力する ステップと、 入力された前記予約情報から予約する施設の利用時間に対応して 各単位時間の施設要求度合の分布として表現した資源要求プロファイルを生成 するステップと、 '生成した施設毎の資源要求プ口ファイルをそれぞれの対応の 施設の予約システムに送信するステップと、 予約システムから予約情報に対す る割付予約を受信するステップと、 受信した割付予約に利用時間の重複がある 場合に、 重複のある割付予約を表示し、 重複解消のために入力を受け付けて前 記予約情報を更新するステップと、 更新された予約情報から各施設に対する資 源要求プロファイルを更新して、 各対応の施設の予約システムに再送するステ ヅプと、 の処理をコンピュータにより実行するプログラムであることを特徴と するものである。 Further, according to a third aspect of the present invention, as a third aspect, a program for executing a reservation process of a portable terminal used in the reservation processing method according to the present invention is configured such that a plurality of portable terminals and a reservation system of a plurality of facilities are wirelessly or wiredly connected. A program for executing a reservation process in a portable terminal used in a reservation processing method in a distributed reservation system in which a reservation process is performed between a plurality of portable terminals and a reservation system of a plurality of facilities, which are connected by a network. Inputting the facility name and the reservation information of the use time zone, and a resource request profile expressed as a distribution of the facility request degree of each unit time corresponding to the use time of the facility to be reserved from the inputted reservation information. And transmitting the generated resource request port file to each facility's reservation system. Receiving the allocation reservation corresponding to the reservation information from the reservation system, and, when the received allocation reservations have overlapping usage times, displaying the overlapping allocation reservations and inputting the information to eliminate the duplication. Receiving and updating the reservation information, updating the resource request profile for each facility from the updated reservation information, and retransmitting the profile to the reservation system of each corresponding facility; and It is characterized by being a program to be executed.
また、 本発明は、 第 4の態様として、 本発明による予約処理方法で用い る予約システムが、 複数の携帯用端末と複数の施設の予約システムとが無線ま たは有線のネットワークにより結合され、 複数の携帯用端末と複数の施設の予 約システムとの間で予約処理を実行する分散型予約システムにおける予約処理 方法で用いる予約システムであって、 前記携帯用端末から送信されたそれそれ 予約情報の資源要求プロファイルを受信する受信手段と、 受信した複数の資源 要求プロファイルを総計して当該施設の各単位時間の施設要求度合の分布の自 施設要求プロファイルを生成する施設要求度生成手段と、 前記生成された自施 設要求プロファイルに基づいて個別の資源要求プ口ファイルによる予約情報の 予約を割り付け割付予約とする割付手段と、 前記割付予約を予約情報を発信し た携帯用端末に返信する送信手段とを備えることを特徴とするものである。 In a fourth aspect, the present invention provides, as a fourth aspect, a reservation system used in the reservation processing method according to the present invention, wherein a plurality of portable terminals and a plurality of facility reservation systems are connected by a wireless or wired network, Schedule multiple mobile devices and multiple facilities A reservation system used in a reservation processing method in a distributed reservation system that executes a reservation process with an about system, comprising: a receiving unit that receives a resource request profile of reservation information transmitted from the portable terminal. A facility request degree generating means for summing up the received plurality of resource request profiles to generate a self-requirement request profile of a distribution of the degree of facility request for each unit time of the facility, based on the generated self-installation request profile It is characterized by comprising: allocation means for making reservation of reservation information by an individual resource request file as an allocation reservation; and transmitting means for returning the allocation reservation to the portable terminal which transmitted the reservation information. is there.
また、 本発明は、 第 5の態様として、 本発明による予約処理方法で用い る予約システムの予約処理を実行するプログラムが、 複数の携帯用端末と複数 の施設の予約システムとが無線または有線のネットワークにより結合され、 複 数の携帯用端末と複数の施設の予約システムとの間で予約処理を実行する分散 型予約システムにおける予約処理方法で用いる予約システムにおいて予約処理 を実行するプログラムであって、 前記携帯用端末から送信されたそれぞれ予約 情報の資源要求プロファイルを受信するステップと、 受信した複数の資源要求 プロファイルを総計して当該施設の各単位時間の施設要求度合の分布の自施設 要求プロフアイルを生成するステップと、 前記生成された自施設要求プロファ ィルに基づいて個別の資源要求プロファイルによる予約情報の予約を割り付け 割付予約とするステップと、 前記割付予約を予約情報を発信した携帯用端末に 返信するステップと、 の処理をコンピュータにより実行するプログラムである ことを特徴とするものである。 According to a fifth aspect of the present invention, as a fifth aspect, a program for executing a reservation process of a reservation system used in a reservation processing method according to the present invention is configured such that a plurality of portable terminals and a plurality of facilities have a wireless or wired reservation system. A program that is connected by a network and executes a reservation process in a reservation system used in a reservation processing method in a distributed reservation system that executes a reservation process between a plurality of portable terminals and a reservation system of a plurality of facilities, Receiving a resource request profile of each reservation information transmitted from the portable terminal; and summing up the plurality of received resource request profiles, and a self-site request profile of a distribution of a degree of facility request for each unit time of the facility. Generating an individual resource request profile based on the generated own facility request profile. Allocating a reservation of reservation information by file as an allocation reservation; and returning the allocation reservation to the portable terminal that transmitted the reservation information. is there.
…一 また、 本発明は、 第 6の態様として、 本発明によ.る予約処理方法で用い る分散型予約システムが、 複数の携帯用端末と複数の施設の予約システムとが 無線または有線のネットワークにより結合され、 複数の携帯用端末と複数の施 設の予約システムとの間で予約処理を実行する分散型予約システムであって、 前記携帯用端末に設けられて施設名およびその利用時間帯の予約情報を入力す る入力手段と、 前記携帯用端末に設けられて入力された前記予約情報から予約 する施設の利用時間に対応して各単位時間の施設要求度合の分布として表現し た資源要求プロファイルを生成する予約情報生成手段と、 前記携帯用端末に設 けられて生成した施設毎の資源要求プロファイルをそれぞれの対応の施設の予 約システムに送信する送信手段と、 前記予約システムに設けられて前記送信手 段から送信されたそれぞれ予約情報の資源要求プロファイルを受信する受信手 段と、 前記予約システムに設けられて受信した複数の資源要求プ口ファイルを 総計して当該施設の各単位時間の施設要求度合の分布の自施設要求プロフアイ ルを生成する施設要求度生成手段と、 前記予約システムに設けられて前記生成 された自施設要求プロファイルに基づいて個別の資源要求プロファイルによる 予約情報の予約を割り付け割付予約とする割付手段と、 前記予約システムに設 けられて前記割付予約を予約情報を発信した携帯用端末に返信する送信手段と、 前記携帯用端末に設けられて予約システムから予約情報に対する割付予約を受 信する受信手段と、 前記携帯用端末に設けられて前記受信した割付予約に利用 時間の重複がある場合に、 重複のある割付予約を表示し、 重複解消のために入 力を受け付けて前記予約情報を更新する予約情報更新手段と、 前記携帯用端末 に設けられて更新された予約情報から各施設に対する資源要求プロファイルを 更新して、 各対応の施設の予約システムに再送する再送信手段と ... Also, as a sixth aspect of the present invention, a distributed reservation system used in the reservation processing method according to the present invention is characterized in that a plurality of portable terminals and a plurality of facility reservation systems are wireless or wired. What is claimed is: 1. A distributed reservation system which is connected by a network and executes a reservation process between a plurality of portable terminals and a reservation system of a plurality of facilities, comprising: a facility name provided in said portable terminal; Input means for inputting reservation information of the mobile terminal; and a reservation from the input reservation information provided on the portable terminal. Reservation information generating means for generating a resource request profile expressed as a distribution of the degree of facility request for each unit time corresponding to the usage time of the facility to be used, and a resource request for each facility generated in the portable terminal. Transmitting means for transmitting the profile to the reservation system of the corresponding facility; receiving means provided in the reservation system for receiving the resource request profiles of the reservation information transmitted from the transmission means; and A facility request degree generating means for summing a plurality of received resource request port files provided in the system and generating a self-requirement request profile of a distribution of the facility request degree for each unit time of the facility; and The reservation of the reservation information by the individual resource request profile based on the generated own facility request profile. Allocation means for making a reservation; transmitting means provided in the reservation system for returning the allocation reservation to a portable terminal which has transmitted the reservation information; and allocation reservation for the reservation information from the reservation system provided in the portable terminal. Receiving means for receiving a reservation, and when there is an overlap in use time in the received allocation reservation provided in the portable terminal, displays the overlapped allocation reservation and accepts an input to eliminate the duplication. Reservation information updating means for updating the reservation information, and retransmission means for updating the resource request profile for each facility from the updated reservation information provided in the portable terminal and retransmitting the profile to the reservation system of each corresponding facility When
を備えることを特徴とするものとなっている。 It is characterized by having.
このような本発明の予約処理方法および分散型予約システムによれば、 利用者の予約を資源要求プロファイルに基づいて調整するので、 利用者が利用 できる施設の容量や処理能力に限界があり、 施設に対する需要が大きく変動す る環境 (たとえば、 大規模アトラクション施設) であっても、 需要の状態の的 確に把握でき、 施設の混雑程度の情報に基づき、 その需要に対して、 各利用者 が施設を利用する時間を適切に設定することができ、 効率的に施設に対する需 要を処理することが可能となる。 また、 携帯用端末側で予約の申し込みについ ての時間帯の重複を阻止するので、 施設ごとに予約システムを独立して設ける ことができる。 これにより、 各地域に分散している施設に対しても、 利用者の 施設に対する混雑度を考慮した施設を訪問する時間帯の調節が可能となる 図面の簡単な説明 According to the reservation processing method and the distributed reservation system of the present invention as described above, the reservation of the user is adjusted based on the resource request profile, so that the capacity and processing capacity of the facility that the user can use is limited. Even in an environment where demand for fluctuates greatly (for example, large-scale attraction facilities), it is possible to accurately grasp the state of demand, and based on information on the degree of congestion of facilities, each user can respond to that demand. The time for using the facility can be set appropriately, and the demand for the facility can be efficiently handled. In addition, since the portable terminal prevents overlapping of the time slots for reservation applications, a reservation system can be provided independently for each facility. As a result, even for facilities dispersed in each region, It is possible to adjust the time of visiting facilities considering the degree of congestion for the facility
第 1図は、従来の分散型予約システムの一例を説明するブ口ック図である。 第 2図は、 本発明の一実施形態による分散型予約システムの全体構成を示 す図である。 FIG. 1 is a block diagram illustrating an example of a conventional distributed reservation system. FIG. 2 is a diagram showing an overall configuration of a distributed reservation system according to one embodiment of the present invention.
第 3図は、 来場者に対して施設へ訪問する時間の割り付けを行う予約処理 の処理手順を示すフローチャートである。 FIG. 3 is a flowchart showing a processing procedure of a reservation process for allocating a visit time to a facility to a visitor.
第 4図は、 資源要求プロファイルの作成処理を説明する説明図である。 第 5図は、 訪問者に施設の利用時間を割り付ける処理の概要を説明する図 である。 FIG. 4 is an explanatory diagram illustrating a process of creating a resource request profile. FIG. 5 is a diagram for explaining an outline of a process of allocating facility use time to visitors.
第 6図は、 予約の調整処理を説明するための説明図である。 FIG. 6 is an explanatory diagram for explaining a reservation adjustment process.
第 7図は、 来場者エージェントにおける重複チェックの処理内容を示すフ ローチャートである。 Fig. 7 is a flow chart showing the content of the duplication check process at the visitor agent.
発明を実施するための最良の形態 BEST MODE FOR CARRYING OUT THE INVENTION
以下、本発明の好適な実施の形態を図面に基づいて説明する。第 2図は、 本発明の一実施形態による分散型予約システムの全体構成を示す図である。 Hereinafter, preferred embodiments of the present invention will be described with reference to the drawings. FIG. 2 is a diagram showing an overall configuration of a distributed reservation system according to an embodiment of the present invention.
分散型予約システムは、 第 2図に示すように、 それぞれの利用者が保有 する P D Aや携帯電話などの携帯用通信端末 1 0 0と各施設に設置された情報 処理システム 2 0 0とが、 無線または有線の通信ネットワーク (図示せず) で 結合されて、 システムを構成している。 - 以不の説明において、 本実施形態では 携帯用通信端末 1 0 0により行われる予約処理の一部の処理を行うためのサブ システム (処理モジュール) を来場者エージェントとよび、 情報処理システム 2 0 0により行われる予約処理の残りの処理を行うためのサブシステム (処理 モジユール) を施設エージヱン卜と呼ぶ。 これら来場者エージェントおよぴ施 設エージヱントとの間でのィン夕ラクシヨンにかかる処理により、 分散型予約 システムにおける予約処理が実行される。 As shown in Fig. 2, the distributed reservation system consists of a portable communication terminal 100, such as a PDA or a mobile phone, owned by each user and an information processing system 200 installed at each facility. The system is connected by a wireless or wired communication network (not shown). -In the following description, in this embodiment, a subsystem (processing module) for performing a part of the reservation process performed by the portable communication terminal 100 is called a visitor agent, and the information processing system 200 A subsystem (processing module) for performing the remaining processing of the reservation processing performed by 0 is called a facility agent. Distributed reservation processing is performed by the processing related to the inactivity between these visitor agents and the facility agent. A reservation process in the system is executed.
来場者エージェントによる予約処理の一部の処理は、 携帯用通信端末 1 00が有する入力装置 1 10、 表示装置 120、 制御装置 130、 記憶装置 1 40および通信装置 150の各ハードウェア装置を利用して、 これらを制 す るプログラムの処理により実行される。 Part of the reservation process by the visitor agent uses the hardware devices of the input device 110, the display device 120, the control device 130, the storage device 140, and the communication device 150 of the portable communication terminal 100. It is executed by the processing of the program that controls them.
たとえば、 利用者 (各施設の訪問者) は、 キーボードやペンを使用した 入力装置 1 10から、 予約を行うための種々の情報 (予約時間帯情報、 予約施 設名情報) を入力する。 For example, a user (a visitor of each facility) inputs various information (reservation time zone information, reservation facility name information) for making a reservation from an input device 110 using a keyboard or a pen.
表示装置 120には、 たとえば、 液晶表示装置を使用することができ、 入力装置 1 10から入力された情報や、 施設エージェントの予約処理を実行す る情報処理システム 200から送られてきた情報を表示する。 なお、 以下では 混同が生じない場合において、 来場者エージヱント (処理モジュール) と携帯 用端末を共に同じ参照番号 100で参照し、 施設エージェント (処理モジュ一 ル) と情報処理システムとを同じ参照番号 200で参照して説明する。 For example, a liquid crystal display device can be used as the display device 120. The display device 120 displays information input from the input device 110 and information sent from the information processing system 200 that executes a reservation process of the facility agent. I do. In the following, when confusion does not occur, both the visitor agent (processing module) and the portable terminal are referred to by the same reference numeral 100, and the facility agent (processing module) and the information processing system are referred to by the same reference numeral 200. It will be described with reference to FIG.
制御装置 130は、 CPUおよびメモリを有し、 制御装置 130は来場 者エージヱント 100内の装置を制御する。 来訪者エージヱントにおける予約 処理をプログラム処理により行う主要部である。 また、 来場者の誘導に係わる 情報処理をも行う。 The control device 130 has a CPU and a memory, and the control device 130 controls a device in the visitor agent 100. It is the main part that performs the reservation process in the visitor agent by program processing. It also performs information processing for guiding visitors.
記憶装置 140には、 たとえば I Cメモリを使用することができ、 種々 の情報を記憶する。 来訪者エージェントにおける予約処理のプログラムを格納 している。 As the storage device 140, for example, an IC memory can be used, and various types of information are stored. Stores the reservation processing program in the visitor agent.
来場者エージェント..の通信装.置 150は、 施設エージェント 20.0が制 御する通信装置 230との間で無線による通信を行う。 来場者エージェントの 通信装置 150および施設エージヱントの通信装置 230の間の通信には、 無 線 L A N (I EEE 802. 1 l bなど) や B l ue t o o t hなどの通信 装置を使用することができる。 The communication device 150 of the visitor agent communicates wirelessly with the communication device 230 controlled by the facility agent 20.0. The communication between the communication device 150 of the visitor agent and the communication device 230 of the facility agent can use a communication device such as a wireless LAN (IEEE 802.11b or the like) or Bluetooth.
施設エージ工ントの予約処理を実行する情報処理システム 200には巿 43 The information processing system 200 that executes the reservation processing of the facility age component includes: 43
11 11
販のコンビユー夕システムを使用することができる。 施設ェ一ジェント 2 0 0 には、 制御装置 2 1 0、 記憶装置 2 2 0および通信装置 2 3 0が設けられる。 制御装置 2 1 0は C P Uおよびメモリを有し、 装置全体を制御する他、 本発明 に係わる分散型予約システムにおける予約処理をコンピュー夕によるプログラ ム処理により実行して、 来場者エージヱント 1 0 0により来場者から申し込ま れた予約の調整を資源要求プロファイルに基づいて行って、 特定時間帯に施設 に来場者が集中しないように来場者が誘導される予約処理を実行する。 この処 理については後で詳しく説明する。 A sales combination system can be used. The facility agent 200 is provided with a control device 210, a storage device 220, and a communication device 230. The control device 210 has a CPU and a memory, and controls the entire device. In addition, the control device 210 executes a reservation process in the distributed reservation system according to the present invention by a program process by a computer, and the visitor agent 100 The reservations requested by the visitors are adjusted based on the resource request profile, and the reservation process is performed to guide the visitors so that the visitors do not concentrate on the facility during a specific time zone. This processing will be described later in detail.
記憶装置 2 2 0にはハードディスクなどのような大容量記憶装置を使用 することができる。 記憶装置 2 2 0は来場者から申し込まれ、 かつ調整した予 約時刻、 その来場者エージェント 1 0 0の識別情報等の情報を保存記憶する。 また、 施設エージェントにおける予約処理のプログラムを格納している。 For the storage device 220, a large-capacity storage device such as a hard disk can be used. The storage device 220 stores information such as the reservation time adjusted by the visitor, the adjusted reservation time, and the identification information of the visitor agent 100. Also, it stores a program for reservation processing in facility agents.
施設エージェントの通信装置 2 3 0は、 来場者ェ一ジェント 1 0 0の通 信装置 1 5 0と無線で通信を行う。 The communication device 230 of the facility agent wirelessly communicates with the communication device 150 of the visitor agent 100.
第 3図は、 来場者に対して施設へ訪問する時間の割り付けを行う予約処 理の処理手順を示すフローチャートである。 第 3図を参照しながら、 予約処理 の動作を説明する。 FIG. 3 is a flowchart showing a processing procedure of a reservation process for allocating a visit time to a facility to a visitor. The operation of the reservation process will be described with reference to FIG.
来場者は、 まず、 自らが保有する携帯用端末 1 0 0において、 来場者ェ —ジ工ントを起動して処理を開始させる。 この処理では、 まず、 入力装置 1 1 0により自らが訪問したい施設を示す施設情報と、 その施設を訪問したい時間 帯を示す時間帯情報 (最早使用開始時刻と最遅使用完了時刻) と、 その施設に 対する重要度を示す選好値 (0から 1までの値) を入力する.。'もし、 時間帯、 選好値などの情報の入力が省略された場合は、 制御装置 1 3 0は予め定めたデ フォルト値 (時間帯としては現時点から閉園時間、 選好値としては 1 . 0 ) を 設定する (ステップ S 1 0 0 ) 。 The visitor first activates the visitor agent on the portable terminal 100 owned by the visitor to start the process. In this processing, first, facility information indicating a facility that the user wants to visit using the input device 110, time zone information indicating a time zone during which the user wants to visit the facility (early use start time and latest use completion time), and Enter a preference value (a value between 0 and 1) indicating the importance to the facility. 'If the input of information such as the time zone and the preference value is omitted, the controller 130 sets a predetermined default value (the time zone is the closing time from the present time, and the preference value is 1.0). Is set (step S100).
来場者エージヱント (制御装置 1 3 0 ) においては、 それらの入力され た情報から、 来場者の訪問したい施設に対する選好値を正規化する (ステップ S 1 1 0 ) 。 これは、 多くの施設を訪問したい来場者と、 あまり多くの施設を 訪問する予定の無い来場者との間に生じる不公平感を是正することが目的であ る o The visitor agent (control device 130) normalizes the preference value for the facility that the visitor wants to visit based on the input information (step 130). S110)). This is intended to reduce unfairness between visitors who want to visit many facilities and those who do not plan to visit too many facilities o
P 3 i j = P i j ∑P i P 3 ij = P ij ∑P i
但し、 P i jは、 来場者 iの施設 jに対する選好値であり、 ∑P iは来場者 iの全施設に対する選好値の和であり、 P ' i jは来場者 iの施設 jに対する 正規化された選好値である。 すなわち、 正規化処理では、 上式に示すように各 施設の選好値を、 訪問したい全施設の選好値の和で割る。 これにより、 多くの 施設を訪問する来場者と少ない施設を訪問する来場者との間の予約の公平化を 図る。 Where P ij is the preference value of visitor i for facility j, ∑P i is the sum of the preference values of visitor i for all facilities, and P ′ ij is the normalized value of visitor i for facility j. Is the preferred value. That is, in the normalization process, as shown in the above equation, the preference value of each facility is divided by the sum of the preference values of all facilities to be visited. This will ensure that bookings are fair for visitors who visit many facilities and visitors who visit few facilities.
次に、 来場者エージェントは、 入力された情報から、 その施設情報の示 す施設ごとに資源要求プロファイルを作成し (ステップ S 1 2 0 ) 、 それそれ の対応に施設エージェントに送準する (ステップ S 1 3 0 ) 。 Next, the visitor agent creates a resource request profile for each facility indicated by the facility information from the input information (step S120), and sends the profile to the facility agent in response to each (step S120). S130).
次に、 資源要求プロファイルの作成処理について具体的に説明する。 第 4図は資源要求プロファイルの作成処理を説明する図である。 まず、 この例と しては、 来場者に提示する時間の精度は 1 0分間隔であるし、 ある施設に対し 来場者が 9時から 9時 5 0分までの時間帯に、 選好値 0 . 6で訪問したいとい う希望を持っているとする。 更に、 この施設でのアトラクションの所要時間は 3 0分であると仮定する。 Next, the process of creating a resource request profile will be specifically described. FIG. 4 is a diagram for explaining a process of creating a resource request profile. First, in this example, the accuracy of the time presented to the visitors is 10-minute intervals, and the visitor has a preference value of 0 for a certain facility from 9:00 to 9:50. Suppose you have the desire to visit at 6. It is further assumed that the time required for attractions at this facility is 30 minutes.
そのような条件のもとでは、 来場者が施設でアトラクションに参加する 時間帯は、第 4図の 3パターンのタイルで示すように(9時から 9時 3 0分)、 ( 9時 1 0分から 9時 4 0分) 、. ( 9時 2 0分から 9時 5 0分) の 3通りであ る。 更に、 第 4図からわかるように、 9時 2 0分から 9時 3 0分の時間帯に関 しては、 3パターンの全てに含まれているため、 来場者が希望どおりの時間帯 に、 この施設を訪問する場合には、 この 9時 2 0分から 9時 3 0分の時間帯に は来場者は必ずこの施設にいなければならない。 Under such conditions, the time during which visitors participate in the attractions at the facility is determined by the three patterns of tiles in Fig. 4 (from 9:00 to 9:30), (9:10 (9:40 to 9:40) and. (9:20 to 9:50). Furthermore, as can be seen from Fig. 4, since the time zone from 9:20 to 9:30 is included in all three patterns, the time zone as desired by the visitors When visiting this facility, visitors must be at this facility from 9:20 to 9:30.
来場者のこの施設に対する選好値は 0 . 6なので、 上記の時間帯に、 来 場者がこの施設にいる確率は 0 . 6であるとし、 他の時間帯における確率もそ れに準じて、 予め定めてある数式にしたがって計算すると、 上記仮定された条 件による来訪者が当該施設の利用を希望する内容は、 第 4図の下部分に示すよ うに確率のグラフとして表現できる。 このことから、 このグラフを示すデ一夕 を、 来場者の施設に対する資源要求プロファイルとして予約要求するデ一夕と する。 この資源要求プロファイルに基づいて予約処理を実行する。 Visitors have a preference of 0.6 for this facility, so during the above hours, It is assumed that the probability that a visitor is in this facility is 0.6, and the probability in other time zones is also calculated according to a predetermined formula. The contents desired to be used can be expressed as a probability graph as shown in the lower part of Fig. 4. From this, it is assumed that the data shown in this graph is a data request for making a reservation request as a resource request profile for the facility of the visitor. A reservation process is executed based on the resource request profile.
このような資源要求プロファイルは、 入力された情報に基づいて、 来場 者が訪問したいとして入力したそれぞれの施設ごとに作成されて、 それぞれの 施設エージェントに対して送信される。つまり、来場者エージェント 1 0 0は、 入力された情報に基づいて、 来場者が訪問したいとして入力した各施設の施設 ェ一ジヱント 2 0 0に対して、 その施設に対する来場者の作成された資源要求 プロファイルの情報を通信装置 1 5 0からそれそれに送信する (ステップ S 1 3 0 ) o Such a resource requirement profile is created for each facility entered by the visitor as a visitor based on the input information, and transmitted to each facility agent. In other words, the visitor agent 100, based on the input information, provides the facility agent 200 of each facility that the visitor has entered as he / she wants to visit to the resource created by the visitor for that facility. The request profile information is transmitted from the communication device 150 to it (step S130) o
また、 入力装置 1 1 0から入力された情報や作成された資源要求プロフ アイルは記憶装置 1 4 0に一時記憶される。 The information input from the input device 110 and the created resource request profile are temporarily stored in the storage device 140.
それそれの施設エージェント 2 0 0においては、 制御装置 2 1 0が通信 装置 2 3 0を介して定期的に (例えば、 1 0分間隔) 、 それぞれの来場者エー ジヱント 1 0 0から資源要求プロファイルを受信する (ステップ S 1 4 0 ) 。 そして、 受信した資源要求プロファイルの情報を記憶装置 2 2 0において集計 する処理を行う。 また、 この場合において、 施設エージヱント 2 0 0の処理に おいては、 集計した資源要求プロファイルを使用して、 その施設に対して予約 を希望する全来場者の需要量の総計を行う (ステップ S I 5. 0 ) 。 続いて、 そ の総計情報に基づいて、 個々の来場者に対して、 その施設を訪問する時間の割 り付けを行う割り付け処理を (ステップ S 1 6 0 ) 。 In each facility agent 2000, the control device 210 periodically (eg, at 10 minute intervals) via the communication device 230 from each visitor agent 100 from the resource request profile. Is received (step S140). Then, a process of totalizing the received resource request profile information in the storage device 220 is performed. In this case, in the processing of the facility agent 200, the aggregated resource demand profile is used to total the demand of all the visitors who want to make a reservation for the facility (step SI 5.0). Subsequently, based on the total information, an allocation process for allocating the time for visiting each facility to each visitor is performed (step S160).
この割り付け処理について具体的に説明する。 第 5図は、 それぞれの訪 問者に施設の利用時間を割り付ける処理を説明する図である。なお、以下では、 この施設およびその利用時間を含めて、 これを資源と総称するものとすると、 各訪問者に施設の利用時間を割り付ける処理は、 資源の割り付け処理となる。 資源割り付け処理では、 第 5図に示すように、 たとえば、 施設エージェ ント 2 0 0は、 来場者 1 3 来場者 2 , 来場者 3の 3つの来場者エージヱントか ら、 それぞれの来場者の資源要求プロファイルを受信し、 その資源要求プロフ アイルを集計して、 施設に対する包括的な資源要求プロファイルを作成する。 その包括的な資源要求プロファイルは、 当該施設の総需要の時間変動を表して おり、 そのピーク (ここではそれを競合ピークと呼ぶ) に当たる時間帯 (第 5 図では、 網掛けさけたパターンで示されている時間帯がそれに当たる) が、 そ の施設が最も込み合うと予想される時間帯である。 This allocation processing will be specifically described. FIG. 5 is a diagram for explaining a process of allocating facility use time to each visitor. In the following, including this facility and its use time, this is referred to as a resource, The process of allocating facility use time to each visitor is a resource allocation process. In the resource allocation process, as shown in FIG. 5, for example, the facility agent 200 receives the resource request of each visitor from three visitor agents, visitor 1 3 visitor 2 and visitor 3. Receive the profiles and aggregate their resource requirement profiles to create a comprehensive resource requirement profile for the facility. The comprehensive resource demand profile represents the time fluctuation of the total demand of the facility, and the time zone corresponding to the peak (here, it is called the competitive peak) (shown by a shaded pattern in Fig. 5). Is the time zone in which the facility is expected to be the most crowded.
そこで、 施設エージェント 2 0 0においては、 需要量総計の処理 (ステ ヅプ S 1 5 0 ) において競合ピークを算出すると、 その時間帯を判定し、 それ それの来場者の資源要求プロファイルを参照し、 競合ピークの時間帯における 需要量が最も大きい来場者 (すなわち、 資源要求プロファイルのその時間帯に おける確率の値が最も大きい来場者) を探す。 第 5図の例では、 来場者 3の資 源要求プロファイルがそれに当たるので、 そして、 当該来場者 3に対して、 来 場者 3の資源要求プロファイルに含まれている確率 (選好値) のそれぞれの時 間帯の中で、 包括的な資源要求プロファイルにおける値が最も小さくなる時間 帯に割り付ける。 すなわち、 他の訪問者との競合がなるべく少ない時間帯を、 当該来場者の訪問時間の候補値として割り付ける処理を行う。 他の来場者の資 源要求プロファイルについても、 同様にして既に割り付けた時間帯を除いて、 割り付け可能な時間を割り付ける (ステップ S 1 6 0 ) 。 Therefore, when the facility agent 200 calculates the competitive peak in the processing of the total demand (step S150), it determines the time zone and refers to the resource request profile of each visitor. Find the visitor with the highest demand during the peak competition time period (ie, the visitor with the highest probability value for that time period in the resource demand profile). In the example of FIG. 5, since the resource request profile of the visitor 3 corresponds to that, the probability (preference value) of the visitor 3 included in the resource request profile of the visitor 3 Of the comprehensive resource requirements profile, the time zone with the smallest value. That is, a process is performed in which a time zone in which competition with other visitors is as small as possible is assigned as a candidate value of the visit time of the visitor. For the resource request profiles of the other visitors, allocatable times are allocated in the same manner except for the time zone already allocated (step S160).
施設エージェント 2 0 0は、 訪問時間の候補値の割り付けを行った来場 者の来場者エージヱント 1 0 0に対して、 通信装置 2 3 0を介して訪問を誘導 する時間帯および自己の施設を示す施設情報を送信する(ステップ S 1 7 0 )。 The facility agent 2000 indicates the time period during which the visitor is guided through the communication device 230 to the visitor agent 100 of the visitor who has assigned the candidate value of the visit time, and the facility of its own. The facility information is transmitted (step S170).
再び第 3図を参照すると、 それぞれの施設エージヱント 2 0 0から、 先 に送信した資源要求プロファイルに対して、 その訪問時間の候補値の時間帯情 報が送信されてくる (ステップ S 1 7 0 , ステップ S 1 8 0 ) ので、 1つある いは複数の施設エージェント 2 0 0から割り付けられた訪問時間の候補値の時 間帯情報を受信した来場者エージェント 1 0 0は、 受信した時間帯情報および 施設情報の中から時間帯が重複する情報を発見するための処理を行い、 重複利 用の時間帯がある場合にはその内容を表示する (ステップ S 1 9 0 ) 。 すなわ ち、 この処理では、 たとえば、 その訪問時間が来場者の予定している他の施設 への訪問計画にどのように影響するかを表示装置 1 2 0に表示して、 その時間 帯に当該施設を訪問するか否かの確認を行うため、 その受諾または拒否の入力 の受付を行い、 その入力に応じて、 選好値を調整し、 変化した資源要求プロフ アイルの内容を更新し (ステップ S 2 0 0〜ステップ S 2 2 0 ) 、 再度、 各施 設エージェントに対して送信する (ステップ S 2 3 0 ) 、 その後の更新された 資源要求プロファイルの内容に応じた割り付け情報の受信を待つ。 Referring again to FIG. 3, the time information of the candidate value of the visiting time is transmitted from each facility agent 200 to the previously transmitted resource request profile (step S 170). , Step S 1 8 0) so there is one Or, the visitor agent 1000 that has received the time zone information of the candidate value of the visit time assigned from the plurality of facility agents 200, the time zone overlaps from the received time zone information and the facility information. A process for discovering information is performed, and if there is a time slot for overlapping use, the content is displayed (step S190). In other words, in this process, for example, the display device 120 displays how the visit time affects the visit plan of the visitor to another facility which the visitor is planning, and displays the information in the time period. In order to confirm whether or not to visit the facility, accept the acceptance or rejection input, adjust the preference value according to the input, and update the contents of the changed resource request profile (step S200 to step S220), transmit again to each facility agent (step S230), and wait for reception of allocation information according to the content of the updated resource request profile thereafter .
その具体的な処理内容については、 第 6図を用いて説明する。 第 6図は 予約の調整処理を説明するための説明図である。 第 6図では、 来場者は 3つの 施設 (第 1の施設, 第 2の施設, 第 3の施設) の訪問を予定しており、 それら の施設に対する資源要求プロファイルは第 6図の左部分に示されている。いま、 第 3の施設の施設エージェントが第 6図の左部分に示すように、 斜線のハッチ ングされた時間帯を訪問時間として、 来場者に対して割り付けた際に、 その結 果が他の施設の訪問計画に対して、 どのように影響が伝播するかを第 6図の右 部分に示している。 The specific processing contents will be described with reference to FIG. FIG. 6 is an explanatory diagram for explaining a reservation adjustment process. In Fig. 6, the visitor is planning to visit three facilities (first facility, second facility, and third facility), and the resource demand profiles for those facilities are shown in the left part of Fig. 6. It is shown. Now, as shown in the left part of Fig. 6, when the facility agent of the third facility assigns the visitor time to the hatched time zone as the visit time, the result is The right part of Fig. 6 shows how the effect is transmitted to the facility visit plan.
まず、 第 3の施設に関しては、 割り付けられた時間帯に訪問することが 確定するため、 第 3の施設の資源要求プロファイルは、 第 6図の右側に示した ように変更され、 斜線によりハヅチングした部分だけとなる。. 更に、 .その時間 帯には来場者は他の施設を訪問することはできないので、 その時間帯にかかる 資源要求プロファイル (第 2の施設に対する資源要求プロファイル) は変更さ れる。 その結果、 この場合に、 第 2の施設の資源要求プロファイルは、 第 6図 右側に示すように変形される。 First, for the third facility, it is decided to visit during the allotted time, so the resource requirement profile of the third facility was changed as shown on the right side of Fig. 6 and hatched with diagonal lines. Only the part. Furthermore, since the visitor cannot visit other facilities during the time period, the resource requirement profile (the resource requirement profile for the second facility) for the time period is changed. As a result, in this case, the resource requirement profile of the second facility is modified as shown in the right side of FIG.
その結果、 第 6図に示す事例において、 第 3の施設の割り付け結果によ る影響伝播の結果、 来場者は第 1の施設と第 2の施設に対して同一の時間帯に ピーク値 ( 1 . 0 ) を持つ資源要求プロファイルを形成することになり、 注意 すべき点は、 第 1の施設と第 2の施設のいずれかに対する訪問を断念せざるを 得ない (同時に複数の施設を訪問することはできない) ことである。 このよう にして、 制御装置 1 3 0は、 重複する予約 (この例では、 第 1の施設、 第 2の 施設の訪問予定時間帯が重複する) を発見する。 As a result, in the case shown in Fig. 6, As a result of the influence propagation, the visitors will form a resource demand profile with a peak value (1.0) for the first facility and the second facility at the same time zone. That is, the visit to either the first facility or the second facility must be abandoned (it is not possible to visit more than one facility at the same time). In this way, the control device 130 finds duplicate reservations (in this example, the scheduled visit times of the first facility and the second facility overlap).
来場者エージェント 1 0 0は、 訪問時間の割り付け結果による他の施設 への訪問予定に対する影響を来場者エージヱント 1 0 0の制御装置 1 3 0によ つて算出された結果を表示装置 1 2 0に表示する。 その後、 その訪問時間の割 り付けを受諾可能か否かの判断が、 来場者エージェント 1 0 0の入力装置 1 1 0から入力される。 The visitor agent 100 displays the result calculated by the control unit 130 of the visitor agent 100 on the display device 120 so that the influence of the allocation of the visit time on the scheduled visit to another facility is displayed. indicate. Thereafter, a determination as to whether the assignment of the visit time is acceptable is input from the input device 110 of the visitor agent 100.
第 6図の例では、 第 3の施設への時間割り付けの結果、 第 1の施設また は第 2の施設のいずれかの訪問を断念せざるを得なくなるので、 これを来場者 が承諾できる場合は、 割り付けられた施設への時間割り付けを受け入れ、 第 3 の施設よりも第 1の施設と第 2の施設への訪問を優先したい場合には、 受け入 れを拒絶することになる。 その場合には、 各施設に対する選好値を変更する。 In the example shown in Fig. 6, when the time is allocated to the third facility, the visitor to either the first facility or the second facility must be abandoned, and the visitor can accept this. Would refuse to accept a time allotment to the assigned facility if they would prefer a visit to the first and second facility over a third. In that case, change the preference value for each facility.
来場者による割り付け時間の受諾または拒否 (変更すべき時間帯情報を 含む) の判断結果が、 来場者エージヱント 1 0 0の入力装置 1 1 0から入力さ れると、 来場者エージヱント 1 0 0はその結果に基づき、 訪問施設の割り付け に関して来場者間に過度の不公平が発生するのを防く、ために、 来場者の選好値 の調整を行う。 すなわち、 第 6図の例では、 第 3の施設への割り付けを受諾し た場合には、 第 1の施設および第 2'の施設の 'う.ち、 優先順位が下げられた施設 (この例では第 2の施設)に対する来場者の選好値を下げる(例えば、— 1 0 % )。 第 3の施設への割り付けを拒否した場合には、 第 3の施設への選好値を下げ、 第 1の施設と第 2の施設に対する来場者の選好値を上げる (例えば + 1 0 % ) そうした調整を行うことにより、 全ての来場者間で選好値を公平な値に保つこ とができる。 更に、 そのような調整を行った後、 来場者エージェントは再び、 来場者の全ての施設に対する選好値に関して、 値の正規化による選好値の調整 を制御装置 1 3 0により行う (ステップ S 2 1 0 ) 。 When the result of the visitor's acceptance or rejection of the allocation time (including the time zone information to be changed) is input from the input device 110 of the visitor agent 100, the visitor agent 100 Based on the results, adjust visitor preferences to prevent excessive inequity among visitors in allocating visiting facilities. In other words, in the example of Fig. 6, if the assignment to the third facility is accepted, the facilities of the first facility and the second facility will have their priority reduced (figure 6). Now lower the visitor's preference for the second facility (for example, -10%). If you refuse to assign to the third facility, lower your preference for the third facility and increase the visitor's preference for the first and second facilities (for example, + 10%). By making adjustments, preference can be maintained at a fair value among all visitors. Further, after making such adjustments, the visitor agent again With respect to the preference values for all facilities of the visitor, the preference values are adjusted by the controller 130 by normalizing the values (step S210).
その後、 来場者ェ一ジヱント 1 0 0 (制御装置 1 3 0 ) は新たな選好値 に基づいて、 来場者の資源要求プロファィルを更新し、 その結果を各施設エー ジェント 2 0 0に通信装置 1 5 0を介して送信する (ステップ S 2 2 0 ~ S 2 3 0 ) 。 なお、 来場者の全施設への訪問予約が確定された場合は、 空 (すなわ ち新たに割り付ける訪問が無い) の資源要求プロファイルを送信する。 Thereafter, the visitor agent 100 (control device 130) updates the resource request profile of the visitor based on the new preference value, and transmits the result to each facility agent 200 The transmission is performed via 150 (steps S220 to S230). If the visitor's reservation to visit all facilities is confirmed, an empty (ie, no newly assigned visit) resource request profile is transmitted.
施設エージェント 2 0 0の制御装置 2 2 0は更新された資源要求プロフ アイルを通信装置 2 3 0を介して受信すると、 資源要求プロファイルの内容が 空 (すなわち新たに割り付ける訪問が無い) でない際には、 更新された資源要 求プロファイルに基づいて、 来場者への訪問時間の割り付けを行い、 上述の処 理を繰り返し実行する (ステヅプ S 2 4 0 S 2 5 0 S 1 5 0 ) 。 一方、 資 源要求プロファイルが空の場合には制御装置 2 2 0は予約の申し込みは終了と 判断し、 予約の申し込みのあった来場者エージェントの通信を切断する (ステ ップ S 2 4 0 S 2 5 0 終了) 。 Upon receiving the updated resource request profile via the communication device 230, the control device 220 of the facility agent 200 receives the updated resource request profile when the content of the resource request profile is not empty (that is, there is no newly assigned visit). Assigns a visit time to a visitor based on the updated resource request profile, and repeatedly executes the above-described processing (step S240 S250 S150). On the other hand, if the resource request profile is empty, the control device 220 determines that the reservation application has been completed, and disconnects the communication of the visitor agent who has applied for the reservation (step S240S). 25 0 end).
以上、 説明したように、 個別の施設エージェント (予約システム) 2 0 0が訪問時間帯の調整を行って、 その結果、 複数の施設への訪問時間帯が重複 しても、 来場者エージヱント 1 0 0が重複のないように、 来場者に訪問施設に 対する優先順位の調整を促す。 これにより従来のように、 来場者が複数の施設 に対する予約を、 時間帯が重複して申し込むことができなくなる。 来場者の施 設への訪問は、 来場者の選好値や施設の混雑程度に応じて、 来場者が効率的に 施設を訪問でき、.かつ来場者間に不公平感が生まれないように施設を訪問する 時間の割り付けがなされる。 (他の実施形態) As described above, the individual facility agent (reservation system) 200 adjusts the visit hours, and as a result, even if the visit hours to multiple facilities overlap, the visitor agent 100 Encourage visitors to adjust the priority of visiting facilities so that 0 is not duplicated. This makes it impossible for visitors to apply for reservations for multiple facilities at the same time as in the past. Visitors to the facility can visit the facility efficiently according to the visitor's preference value and the degree of congestion of the facility, and the facility does not create an unfair feeling among the visitors. The time is allocated for visiting. (Other embodiments)
1 )実施形態では、来場者エージヱントを来場者一人一人に設定しているが、 グループで来場した来場者に対して、 1つの来場者エージ工ン卜により予約処 理を行うように設定するようにしても良い。 1) In the embodiment, the visitor agent is set for each visitor, but a visitor who has arrived in a group can be reserved by one visitor age component. May be set to perform processing.
2 ) 上記実施形態では、 来場者が訪問を予定した全ての施設に対して、 施設 エージェントからの訪問時間の割り付けがなされるが、 従来の実施例 (第 1図) のように、 予約者用入り口と非予約者用入り口を設けるなどすることにより、 混雑の予想される施設にのみ本システムを用いて訪問時間の割り付けを行い、 そうでない施設に関しては本システムによる訪問時間の割り付けなしに、 自由 に訪問する形態を混在するようにしても良い。 2) In the above embodiment, the visit time from the facility agent is assigned to all the facilities that the visitor has planned to visit, but as in the conventional example (Fig. 1), By providing entrances and entrances for non-reserved persons, the system will be used to allocate visit hours only to facilities that are expected to be congested. May be mixed.
3 ) 上述の実施形態では、 テーマパーク遊園地における来場者のァトラクシ ョン施設への誘導の場合について説明したが、 見本市会場での展示ブースへの 案内、 一定区画内の交通流入制御等、 閉じられた環境にある複数の資源 (展示 ブース、 アトラクション、 道路など) に対して、 大量の需要 (来場者など) を リアルタイムで効率的に割り付ける場合について同様に本発明を適用すること ができる。 3) In the above-mentioned embodiment, the case where the visitors were guided to the attraction facility in the theme park amusement park was explained, but the guide to the exhibition booth at the trade fair venue, the control of traffic inflow in a certain section, etc. The present invention can be similarly applied to a case where a large amount of demand (such as visitors) is efficiently allocated in real time to a plurality of resources (exhibition booths, attractions, roads, etc.) in a given environment.
4 ) 上述の実施形態では、 2つの、 時間帯が重複した時間帯情報が存在する 場合、 来場者に優先順位の調整を促すことで、 重複の解消を行ったが、 例えば 来場者エージェント 1 0 0の制御装置が選好値の低い施設に対する予約を自動 的に削除してもよい。 また、 いずれの予約を削除するかは、 システム設計者が 適宜定めればよい。 4) In the above-described embodiment, when two pieces of time zone information having overlapping time zones exist, the duplication is eliminated by prompting the visitors to adjust the priority. For example, the visitor agent 10 The control device of 0 may automatically delete reservations for facilities with low preference values. Which reservation is to be deleted may be determined as appropriate by the system designer.
来場者エージェントが実行する重複排除処理は本発明に関連するので、 一例を紹介しておく。 このための制御装置 1 3 0が実行する処理手順を第 7図 に示しておく。 第 7図は、 来場者エージェントにおける重複チェックの処理内 容を示すフロ一'チ 'ャ―卜である .。 . ... · 第 7図において、 制御装置 1 3 0は 1つ以上の施設エージヱント 2 0 0 から施設情報および時間帯情報を受信すると、 そのデータの組数 (時間帯情報) が複数 ( 2以上) であるか否かを判定する (ステップ S 1 0 0 0 ) 。 施設情報 および時間帯情報が 1組の場合には、 重複が生じないので、 ステップ S 1 0 5 0へジャンプして、 受信した施設情報および時間帯情報を受付けた予約として 記憶装置 1 4 0内に設定する。 Since the deduplication processing performed by the visitor agent is related to the present invention, an example will be described. FIG. 7 shows a processing procedure executed by the control device 130 for this purpose. Fig. 7 is a flow chart showing the processing contents of the duplication check in the visitor agent. .. · In FIG. 7, when control device 130 receives facility information and time zone information from one or more facility agents 200, the number of data sets (time zone information) is plural (2). Is determined (step S1000). If the facility information and the time zone information are one set, there is no duplication.Therefore, the process jumps to step S 1 050 and the received facility information and time zone information are set as the accepted reservation. Set in storage device 140.
一方、 受信したデ一夕の組数が複数の場合、 重複の可能性があるので、 手順をステップ S 1 0 0 0からステップ S 1 0 1 0へ進める。 制御装置 1 3 0 は受信した時間帯情報の中から第 1番目および第 2番目の時間帯情報を取り出 し (ステップ S 1 0 1 0 ) 、 2つの時間帯情報の示す時間帯が重複するか否か を判定する (ステップ S 1 0 2 0 ) 。 一方の時間帯の開始時刻と終了時刻の間 に、 他方の時間帯の開始時刻あるいは終了時刻が存在し、 その重複する時間帯 での資源要求プロファイルにおける確率が双方とも 1 . 0であるときに、 2つ の時間帯が重複すると判定される。 On the other hand, if the number of received data sets is plural, there is a possibility of duplication, so the procedure proceeds from step S1000 to step S1010. The controller 130 extracts the first and second time zone information from the received time zone information (step S1010), and the time zones indicated by the two time zone information overlap. It is determined whether or not this is the case (step S1020). When the start time or end time of the other time zone exists between the start time and end time of one time zone, and both the probabilities in the resource request profile in the overlapping time zone are 1.0. It is determined that the two time periods overlap.
重複の判定がなされた場合、 この形態では受信時点が後の施設情報と時 間帯情報が比較対象から削除される (ステップ S 1 0 3 0 ) 。 In the case where the overlap is determined, in this embodiment, the facility information and the time zone information whose reception time is later are deleted from the comparison target (step S1030).
このようにして、 受信した時間帯情報の全ての中から 2つを選択して、 上述の処理を繰り返し、 比較された 2組の時間帯で、 重複しているものについ ては 1組が削除されていくので、 全ての比較が終わった時点で残った施設情報 および時間帯情報は重複がないものとなる。 In this way, two of the received time zone information are selected, and the above processing is repeated. One set is deleted for the two sets of time zones that have been compared. Therefore, the facility information and time zone information remaining after all comparisons are completed will not be duplicated.
これにより手順はステップ S 1 0 4 0 S 1 0 5 0へと進み、 重複排除 処理が施された後に残った施設情報および時間帯情報が受付けの予約として記 憶装置 1 4 0に設定される。 設定された施設情報および時間帯情報が表示装置 1 2 0に表示されて第 7図の処理手順が終了する As a result, the procedure proceeds to step S 1400 S 1500, and the facility information and time zone information remaining after the deduplication processing is performed are set in the storage device 140 as a reservation for acceptance. . The set facility information and time zone information are displayed on the display device 120, and the processing procedure of FIG. 7 ends.
5 ) 施設ェ一ジヱント 2 0 0と来場者エージェント 1 0 0の間の通信では施 設情報は施設エージェントの通信アドレスを使用すればよいし、 ·表示装置 1 25) In the communication between the facility agent 200 and the visitor agent 100, the facility information may use the communication address of the facility agent, and the display device 12
0での表示や入力装置 1 1 0からの入力には文字形態の施設情報を使用すると よい。 文字形態の施設情報から通信ァドレス携帯の施設情報には変換テーブル を使用するとよい。 変換テープルには文字形態の施設情報と通信ァドレスの対- 応表を記載しておく。 It is preferable to use the facility information in the form of characters for display at 0 and input from the input device 110. It is recommended to use a conversion table from the facility information in character form to the facility information of the communication address portable. The correspondence table between the facility information in character form and the communication address is described in the conversion table.
6 ) 上述の実施形態では来場者エージェント 1 0 0で時間帯が重複する施設 情報と時間帯情報を排除した後、 施設エージヱント 2 0 0には何も連絡してい ないが、 排除された (削除された) 施設情報に対応する施設エージヨント 2 0 0に対して予約のキャンセルを施設エージェン 2 0 0に連絡するようにしても よい。 この連絡に応じて施設ェ一ジェント 2 0 0はこれまでの予約の申し込み の中から該当する来場者エージェント 1 0 0に関する情報を削除する。 産業上の利用分野 6) In the above embodiment, facilities where the visitor agent 100 has overlapping time zones After removing the information and time zone information, nothing was notified to the facility agent 200, but the reservation was canceled for the facility agent 200 corresponding to the removed (deleted) facility information. You may want to contact the facility agency 200. In response to this notification, the facility agent 200 deletes the information on the corresponding visitor agent 100 from the previous reservation application. Industrial applications
本発明による予約処理方法および分散型予約システムは、 資源の容量や 処理能力に限界があり、 資源に対する需要が大きく変動する環境 (たとえば、 大規模アトラクション施設) において好適に利用される。 資源の混雑程度の倩 報に基づいて、 予約要求 (需要) に対して、 資源を利用する時間を適切に設定 することができ、 効率的かつ公平に資源に対する需要を処理することが可能と なる。 施設ごとに予約システムを設けて予約処理を行い、 携帯用端末の側で、 予約の申し込みについての時間帯の重複を阻止するシステムとすることができ るので、 システム構成が簡易なものとなる。 また、 来場者の施設に対する選好 の度合いを考慮して施設を訪問する時間帯の調節が可能となる。 INDUSTRIAL APPLICABILITY The reservation processing method and the distributed reservation system according to the present invention are suitably used in an environment (for example, a large-scale attraction facility) in which the resource capacity and the processing capacity are limited and the demand for the resource fluctuates greatly. Based on information on the degree of congestion of resources, it is possible to appropriately set the time to use resources in response to a reservation request (demand), and it is possible to efficiently and fairly handle resource demand. . A reservation system is provided for each facility to perform the reservation process, and the portable terminal side can prevent the overlapping of the time zones for the reservation application, thus simplifying the system configuration. In addition, it is possible to adjust the time of visiting the facility in consideration of the degree of visitors' preference for the facility.
Claims
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP2005503159A JP3978501B2 (en) | 2003-03-07 | 2004-03-08 | Reservation processing method and distributed reservation system |
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP2003061151 | 2003-03-07 | ||
| JP2003-061151 | 2003-03-07 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| WO2004079618A1 true WO2004079618A1 (en) | 2004-09-16 |
Family
ID=32958953
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| PCT/JP2004/002943 Ceased WO2004079618A1 (en) | 2003-03-07 | 2004-03-08 | Reservation processing method and distributed reservation system |
| PCT/JP2004/002959 Ceased WO2004079619A1 (en) | 2003-03-07 | 2004-03-08 | Distributed reservation system |
Family Applications After (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| PCT/JP2004/002959 Ceased WO2004079619A1 (en) | 2003-03-07 | 2004-03-08 | Distributed reservation system |
Country Status (2)
| Country | Link |
|---|---|
| JP (2) | JP3978501B2 (en) |
| WO (2) | WO2004079618A1 (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2009277034A (en) * | 2008-05-15 | 2009-11-26 | Mitsubishi Electric Corp | Particle beam treatment reservation system, particle beam treatment reservation program and recording medium thereof |
| WO2017170166A1 (en) * | 2016-03-29 | 2017-10-05 | 株式会社リクルートホールディングス | Queue management system, queue management device, and program |
| CN112750521A (en) * | 2020-12-31 | 2021-05-04 | 复旦大学附属华山医院 | Intelligent scheduling feedback system for dialysis patient |
| CN112849856A (en) * | 2021-04-09 | 2021-05-28 | 广州市美丽小镇发展研究院 | Garbage recovery method |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP7360222B1 (en) * | 2023-02-24 | 2023-10-12 | Payn株式会社 | Program, information processing device, manufacturing method, information processing method |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH10162064A (en) * | 1996-11-27 | 1998-06-19 | Toshiba Corp | Hospital medical treatment reservation system |
| US6173209B1 (en) * | 1999-08-10 | 2001-01-09 | Disney Enterprises, Inc. | Method and system for managing attraction admission |
| JP2001265913A (en) * | 2000-03-15 | 2001-09-28 | Nec Corp | System and method for reserving integrated conference room and recording medium with program for integrated conference room reservation recorded thereon |
| JP2002312653A (en) * | 2001-04-18 | 2002-10-25 | Hitachi Software Eng Co Ltd | Method and device for reservation |
-
2004
- 2004-03-08 WO PCT/JP2004/002943 patent/WO2004079618A1/en not_active Ceased
- 2004-03-08 JP JP2005503159A patent/JP3978501B2/en not_active Expired - Lifetime
- 2004-03-08 JP JP2005503160A patent/JPWO2004079619A1/en active Pending
- 2004-03-08 WO PCT/JP2004/002959 patent/WO2004079619A1/en not_active Ceased
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH10162064A (en) * | 1996-11-27 | 1998-06-19 | Toshiba Corp | Hospital medical treatment reservation system |
| US6173209B1 (en) * | 1999-08-10 | 2001-01-09 | Disney Enterprises, Inc. | Method and system for managing attraction admission |
| JP2001265913A (en) * | 2000-03-15 | 2001-09-28 | Nec Corp | System and method for reserving integrated conference room and recording medium with program for integrated conference room reservation recorded thereon |
| JP2002312653A (en) * | 2001-04-18 | 2002-10-25 | Hitachi Software Eng Co Ltd | Method and device for reservation |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2009277034A (en) * | 2008-05-15 | 2009-11-26 | Mitsubishi Electric Corp | Particle beam treatment reservation system, particle beam treatment reservation program and recording medium thereof |
| WO2017170166A1 (en) * | 2016-03-29 | 2017-10-05 | 株式会社リクルートホールディングス | Queue management system, queue management device, and program |
| CN112750521A (en) * | 2020-12-31 | 2021-05-04 | 复旦大学附属华山医院 | Intelligent scheduling feedback system for dialysis patient |
| CN112750521B (en) * | 2020-12-31 | 2024-04-05 | 复旦大学附属华山医院 | Intelligent scheduling feedback system for dialysis patients |
| CN112849856A (en) * | 2021-04-09 | 2021-05-28 | 广州市美丽小镇发展研究院 | Garbage recovery method |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2004079619A1 (en) | 2004-09-16 |
| JPWO2004079618A1 (en) | 2006-06-08 |
| JP3978501B2 (en) | 2007-09-19 |
| JPWO2004079619A1 (en) | 2006-06-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP7541061B2 (en) | Queue management system and method | |
| US12090883B2 (en) | Methods and systems for facilitating charging sessions for electric vehicles | |
| JP5016125B1 (en) | Information providing apparatus, information providing method, information providing program, and recording medium | |
| JP2020013596A (en) | Information processing device, and control method and program thereof | |
| JPH0991341A (en) | Conference holding and schedule management support device | |
| US20160364732A1 (en) | Electronic provisioning of automated customer service | |
| JP7367627B2 (en) | Information processing device, information processing method, and program | |
| JP2011039865A (en) | Reservation system | |
| JP6251840B1 (en) | Information provision system | |
| JP2017162504A (en) | Information processing apparatus control method, information processing apparatus, and control program | |
| JPWO2016092687A1 (en) | Seat designation system, seat designation method | |
| KR20180009478A (en) | System and method for reserving medical treatment | |
| US20200226550A1 (en) | Method to determine optimal meeting location and time | |
| CN111578461A (en) | Operation planning method, operation control device, and operation planning system | |
| Zayas-Caban et al. | Optimal control of an emergency room triage and treatment process | |
| Ton et al. | Real-time management of intra-hospital patient transport requests | |
| WO2004079618A1 (en) | Reservation processing method and distributed reservation system | |
| JPWO2005041088A1 (en) | Room allocation device, room allocation program | |
| Zayas-Cabán et al. | Emergency medical service allocation in response to large-scale events | |
| JP7241439B1 (en) | Information processing device, information processing program, and information processing method | |
| JP4516341B2 (en) | Seat reservation method and seat reservation system | |
| JP2018165853A (en) | Locker management device and locker management method | |
| JP2022123534A (en) | Information processing equipment | |
| WO2022219811A1 (en) | Visit schedule creation method | |
| JP2021047733A (en) | Information processing system and program |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW |
|
| AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): BW GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG |
|
| 121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
| WWE | Wipo information: entry into national phase |
Ref document number: 2005503159 Country of ref document: JP |
|
| 122 | Ep: pct application non-entry in european phase |