JP2009211672A - Parking lot exchange and combination finding system, method, and program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To find a combination of parking lots enabling each person to borrow a parking lot closer to desired conditions if the parking lots are exchanged between those who rent the monthly parking lots. <P>SOLUTION: This parking lot exchange and combination finding system includes: an input means for inputting condition data such as a desired address, a desired amount of money, the address of the present parking lot, the amount of money of the present parking lot, and a desired distance to a parking lot; a storage means for storing the input condition data; a computing means for finding such a combination that respective present parking lot conditions meet the other desired parking lot conditions, out of the stored condition data; and an output means for outputting the found combination. <P>COPYRIGHT: (C)2009,JPO&INPIT

Description

The present invention inputs conditions such as the address and amount of a parking lot currently used by a plurality of parking lot users, and inputs the address, amount and desired distance of the desired parking lot, The present invention relates to a parking lot exchange combination discovery system, method, and program for realizing a service for exchanging parking lots by finding a combination of parking lots that satisfies a condition and transmitting the combination to a user.

Considering the convenience of the parking lot, for example, the closer the distance from the parking lot usage base such as home or office, the better. However, in reality, there are many cases where a parking lot far from the use base is unavoidably used. The reason is that when you want to rent a parking lot, there are few cases where there is a vacancy in a property close to the base of use, however, it is necessary to rent as soon as possible, so you rent with a compromise. On the other hand, since it is generally not apparent from the outside which parking lot is empty, there are many situations in which parking lots far away are used. As a result, there are scattered situations in which parking lots close to each other's usage bases are rented and the parking lots closer to each other can be used if these parking lots are exchanged with each other. In order to solve this, it is necessary to collect information, discover a combination, and provide it, but there is no system, method and program capable of realizing it.

The parking lot exchange combination discovery system according to the first aspect of the present invention is based on the desired conditions, such as the desired address, desired amount, allowable distance from the desired address, and the address, amount, etc. of the currently used parking lot. Input means for inputting the current condition, storage means for storing the desired condition and the current condition, and one of the current conditions is a combination of the plurality of stored desired conditions and the current condition. An exchange combination finding means for finding a pair of combinations that satisfy a desired condition and one of the desired conditions is satisfied by the other current condition, and a result for each user of the combination found by the finding means A transmission means for transmitting

The parking lot exchange combination discovery system of the invention according to claim 2 is a parking lot exchange combination discovery system, such as a desired address, a desired amount of money, a permissible distance from the desired address, a parking lot address currently used, an amount, etc. Input means for inputting the current condition, storage means for storing the desired condition and the current condition, and any one of the current conditions from among a plurality of stored combinations of the desired condition and the current condition. An exchange combination finding means for finding a set of two or more combinations satisfying a desired condition and satisfying all the desired conditions according to any of the current conditions, and use of each of the combinations found by the finding means A transmission means for transmitting the result to a person

The parking lot exchange combination discovery system of the invention described in claim 3 is a parking lot exchange desired discovery system such as a desired address, a desired amount of money, a permissible distance from the desired address, a parking lot address currently used, an amount, etc. Input means for inputting empty parking conditions such as the current conditions and addresses and amounts of empty parking, storage means for storing the desired conditions, the current conditions and the empty parking conditions, and a plurality of the stored A combination of a desired condition and the current condition or all the desired conditions out of a plurality of the empty parking conditions are all satisfied by the current condition or the empty parking condition and satisfying the desired conditions. The current condition is an exchange combination finding means for finding a set of two or more combinations that do not satisfy two or more of the desired conditions, and that of the combination found by the finding means And having a transmitting means for transmitting the result to the record of the user

The parking lot exchange combination discovery system according to claim 4 is the parking lot exchange combination discovery system according to any one of claims 1 to 3, further comprising an application means for a user to apply for a parking lot exchange, It has a means to communicate the application to the system operator.

The parking lot exchange combination discovery system according to claim 5 is the parking lot exchange combination discovery system according to any one of claims 1 to 4, wherein the input means can be operated from a personal computer or a portable communication terminal via the Internet. The transmission means can transmit the result to a personal computer or portable communication terminal via the Internet.

The parking lot exchange combination discovery program of the invention described in claim 6 is a parking lot exchange candidate discovery program, such as a desired address, a desired amount of money, a permissible distance from the desired address, a parking lot address currently used, an amount, etc. A step of inputting the present condition, a step of storing the desired condition and the current condition, and one of the desired conditions and the combination of the present conditions stored in the current condition is the other desired condition And a pair of combinations in which one desired condition is satisfied by the other current condition, and the result is transmitted to each user of the combination discovered by the discovery step. Characterized by having steps

The parking lot replacement combination discovery program according to the invention of claim 7 is a parking lot exchange combination discovery program, such as a desired address, a desired amount of money, a permissible distance from the desired address, and a parking lot address currently being used, the amount, etc. A step of inputting a present condition, a step of storing the desired condition and the current condition, and the desired condition which is any one of a plurality of stored combinations of the desired condition and the current condition. And finding a set of two or more combinations that satisfy all of the desired conditions according to any of the current conditions, and providing the results to each user of the combination discovered by the discovery step. Characterized by having a step for communicating

The parking lot exchange combination discovery program of the invention according to claim 8 is a parking lot exchange combination discovery program, such as a desired address, a desired amount, an allowable distance from the desired address, a parking lot address, an amount, etc. A step of inputting an empty parking condition such as an address and an amount of an empty parking lot, a step of storing the desired condition, the current condition and the empty parking condition, and a plurality of the desired conditions stored. All of the current conditions that are satisfied by the present condition or the empty parking condition and satisfy the desired condition among any combination of the current conditions or a plurality of the empty parking conditions Finds a set of two or more combinations that do not satisfy two or more of the desired conditions by overlapping, and uses each of the combinations found by the discovery step. Characterized by having a step for transmitting the result to the user

The parking lot exchange combination discovery program of the invention described in claim 9 is the parking lot exchange combination discovery program according to any one of claims 6 to 8, further comprising a step for a user to apply for a parking lot exchange, and the application Characterized in that it has the step of communicating to the method operator

The parking lot exchange combination discovery program according to claim 10 is the parking lot exchange combination discovery program according to any one of claims 6 to 9, wherein the input step can be operated from a personal computer or a portable communication terminal via the Internet. The transmission step can transmit the result to a personal computer or a mobile communication terminal via the Internet.

According to the eleventh aspect of the present invention, there is provided a parking lot exchange combination discovery method, which includes a desired address, a desired amount of money, a permissible distance from the desired address, a parking lot address, an amount, etc. A step of inputting the current condition, a step of storing the desired condition and the current condition, and one of the desired conditions and a combination of the current conditions stored in the current condition is the other desired condition And a pair of combinations in which one desired condition is satisfied by the other current condition, and the result is transmitted to each user of the combination discovered by the discovery process. Characterized by having a process

The parking lot exchange combination discovery method of the invention described in claim 12 is a parking lot exchange applicant's desired address, desired amount, desired conditions such as an allowable distance from the desired address, and the address, amount, etc. of the parking lot currently in use. A step of inputting the present condition, a step of storing the desired condition and the current condition, and the desired condition of any one of the current conditions among a plurality of combinations of the desired condition and the current condition stored. And finding a set of two or more combinations that satisfy all of the desired conditions according to any one of the current conditions, and the results for each user of the combinations found by the discovery process. Characterized by having a process for communicating

The parking lot exchange combination discovery method of the invention described in claim 13 is a parking lot replacement use candidate desired address, desired amount, desired conditions such as an allowable distance from the desired address, and the address, amount, etc. of the parking lot currently in use. A step of inputting an empty parking lot condition such as an address and an amount of an empty parking lot, a step of storing the desired condition, the current condition and the empty parking lot condition, and a plurality of the desired conditions stored. All of the current conditions that are satisfied by the present condition or the empty parking condition and satisfy the desired condition among any combination of the current conditions or a plurality of the empty parking conditions Finds a set of two or more combinations that do not satisfy two or more of the desired conditions by overlapping, and transmits the result to each user of the combination found by the discovery step Characterized in that it has a order of steps

The parking lot exchange combination discovery method according to claim 14 is the parking lot exchange combination discovery method according to any one of claims 11 to 13, further comprising a step for a user to apply for a parking lot exchange, and the application Characterized in that it has a step of communicating to the method operator

The parking lot exchange combination discovery method according to claim 15 is the parking lot exchange combination discovery method according to any one of claims 11 to 14, wherein the input step can be operated from a personal computer or a portable communication terminal via the Internet. The transmission step can transmit the result to a personal computer or a portable communication terminal via the Internet.

Next, specific examples (examples) of the embodiments of the present invention will be described with reference to the drawings, but the present invention is not limited to the following examples.

FIG. 1 shows a schematic configuration when a parking lot exchange combination discovery system is implemented on the Internet. Reference numeral 10 denotes a parking lot exchange combination discovery server that can be accessed from the user terminal 50 or the operator terminal 51 via the Internet 70. The WWW server 40 operates on the parking lot exchange combination discovery server 10 to supply an HTML screen to the user terminal 50 and the operator terminal 51 and receive data input on the HTML screen. The user activates the web browser 80 on the user terminal 50 and displays the condition input HTML screen 60 and the result output application HTML screen 61 on the web browser 80. The operator activates the Web browser 80 on the operator terminal 51 and displays an exchange application status confirmation HTML screen 62 on the Web browser 80. Here, the user terminal 50 and the operator terminal 51 can use a general personal computer including a CPU, a memory, a hard disk, a keyboard, and a display, and need not be dedicated terminals. Further, it is assumed that the parking lot exchange combination discovery server 10 operates on a general server computer including a CPU, a memory, and a hard disk.

The parking lot exchange combination discovery server 10 has a condition database 30, map data 31, and an application database 32. The condition database 30 stores data input by the user from the condition input HTML screen 60, and calculates a parking lot exchange combination. It is used as a condition for The map database 31 stores map data necessary for calculating the distance between parking lots. The application database stores the application information when the user makes an application for replacement, and the operator confirms the application information and uses it for carrying out a parking lot replacement service.

The parking lot exchange combination discovery server 10 includes a condition registration processing unit 20, a combination discovery calculation unit 21, a result mail transmission unit 22, and an application processing unit 23, and the condition registration processing unit 20 allows the user to enter the condition input HTML screen 60. Registration processing of the input condition data in the condition database 30 is performed. The combination discovery calculation unit 21 performs calculation processing for discovering a replaceable parking lot when the user has registered the condition data, and if a replaceable parking lot is found, the HTML for result output application The exchange combination calculation result is displayed on the screen 61, and the result mail transmission unit 22 transmits an email notifying that the exchange combination is found to the registered mail address of the exchange target parking lot registered user. The application processing unit 23 stores the application information in the application database 32 when the user makes an exchange application from the result output application HTML screen 61 and, at the same time, in response to an inquiry from the operator, an exchange application status confirmation HTML screen. The application status is displayed at 62.

FIG. 2 shows a screen configuration of the condition input HTML screen 60. This is the first screen that opens when the user uses the parking lot exchange combination discovery system, and the user is allowed to exchange his name, address, desired amount for exchanging the parking lot, and acceptable from the address for exchanging the parking lot. Enter the distance, the address of the parking lot currently in use, the monthly amount of the parking lot currently in use, and the contact e-mail address, and press the registration button. Here, it is assumed that the walking time can be input as the distance. The condition data input by pressing the registration button is transmitted to the condition registration processing unit 20 of the parking lot exchange combination discovery server 10 and stored in the condition database 30.

An exchange combination discovery process is executed by the combination discovery calculation unit 21 when the condition data is stored in the condition database 30. FIG. 5 shows the area configuration of the temporary storage area of the condition data used when the exchange combination discovery process is executed, and FIG. 6 shows a flowchart when the exchange combination discovery process performs the calculation. The temporary holding area may be a volatile storage medium such as the memory of the parking lot exchange combination discovery server 10 or a permanent storage medium such as a hard disk. However, the processing performance is better when the memory is used. It is considered good.

First, as shown in S1 of FIG. 6, the combination finding calculation unit 21 extracts information on the address, desired amount, desired distance, current parking lot address, and current parking amount from the condition data of the new condition registrant. Stores data corresponding to the address (A), desired amount (B), desired distance (C), current parking lot address (D), and current parking lot amount (E) in the registrant condition data temporary holding area (M1). To do.

Next, as shown in S2 of FIG. 6, information on the address, desired amount, desired distance, current parking lot address, current parking amount is extracted from the condition data of the new condition registrant, and the condition data temporary holding area 1 ( The addresses corresponding to the address (F), the desired amount (G), the desired distance (H), the current parking lot address (I), and the current parking lot amount (J) of M2) are stored. Processing from this processing to S5 described later is repeatedly executed according to the determination result in S5. Further, the processing from this processing to S10 described later is also repeatedly executed according to the determination result in S10.

Next, as shown in S3 of FIG. 6, one condition data of the existing condition registrant is read out, information on address, desired amount, desired distance, current parking lot address, current parking lot amount is extracted, and the condition data temporarily Stored in the address (K), desired amount (L), desired distance (M), current parking lot address (N), and current parking amount (O) of the holding area 2 (M3), respectively. The process from this process to S7 described later is repeatedly executed according to the determination result in S7.

Next, as shown in S4 of FIG. 6, the distance (P) between the address (F) of the condition data temporary holding area 1 (M2) and the current parking lot address (N) of the condition data temporary holding area 2 (M3) ) Using the information in the map database 31. Here, the distance (P) is the walking time from the address (F) to the current parking lot address (N) calculated using 80 m / min, which is a general average walking speed standard. To do.

Next, as shown in S5 of FIG. 6, the distance (P) calculated in S4 is compared with the desired distance (H) of the condition data temporary holding area 1 (M2), and the distance (P) is the desired distance (H). The desired amount (G) of the condition data temporary holding area 1 (M2) and the current parking amount (O) of the condition data temporary holding area 2 (M3), and the error is within 1000 yen If so, the process proceeds to S6. If the above condition is not satisfied, loop back to S2. In this process, one of the desired parking conditions is calculated whether or not the other current parking conditions are satisfied, and if the conditions are not satisfied, the next existing registrant's condition data is processed. Loop back to S2 to move. The amount of 1000 yen is variable depending on the setting in the system.

Next, as shown in S6 of FIG. 6, the distance between the address (K) in the condition data temporary holding area 2 (M3) and the current parking lot address D in the new condition registrant condition data temporary holding area (M1) ( Q) is calculated. Here, the distance (Q) is the walking time from the address (K) to the current parking lot address (D) calculated using 80 m / min, which is a standard of average walking speed generally used. To do.

Next, as shown in S7 of FIG. 6, the distance (Q) calculated in S6 is compared with the desired distance (M) of the condition data temporary storage area 2 (M3), and the distance (Q) is the desired distance (M). The desired amount (L) of the condition data temporary holding area 2 (M3) and the current parking lot amount (E) of the new condition registrant condition data temporary holding area (M1) are compared, and the error is 1000 yen. If within, the process proceeds to S9. If the above condition is not satisfied, the process loops back to S3. At this time, the process shown in S8 is executed. In this process, in a situation where one desired parking lot condition is satisfied by the other current parking lot condition, the calculation of whether or not the current parking lot of the new condition registrant satisfies the other desired condition is calculated. If the condition is satisfied and the condition is satisfied, the parking lot exchange combination is found at this point. If the above conditions are not met, at least the other current parking lot condition satisfies one desired parking lot condition, so that the process loops back to S3 in order to move to the processing of the condition data of another existing registrant. To do. The amount of 1000 yen is variable depending on the setting in the system.
As shown in S8 of FIG. 6, in the process of looping back to S3, the address (K), the desired amount (L), the desired distance (M), the current parking lot address ( N), information on current parking lot amount (O) is extracted, address (F), desired amount (G), desired distance (H), current parking lot address (I) in condition data temporary storage area 1 (M2) , Stores the one corresponding to the current parking amount (J). As a result of the processing in S8, for certain registered condition data whose current parking condition already satisfies the desired parking condition of another registered condition data, in the processing after S3, Arithmetic processing for finding another registered condition data satisfying the desired condition can be performed.

As shown in S9 of FIG. 6, when the condition is satisfied in S7, the parking lot exchange combination has been found, so in the processes so far, the condition is satisfied in the process of S5. The combination of the condition data of all the condition data temporary holding area 1 (M2) at the time and the condition data of the condition data temporary holding area 2 (M3) when the condition is satisfied in the process of S7 is used as the parking lot exchangeable combination data Hold temporarily.

As shown in S10 of FIG. 6, if the search for all existing condition registrants has been completed at this point, the process proceeds to S11, and if all the cases have not been completed, the process loops back to S2. Then, the process proceeds to a process for finding another exchange combination from an uncalculated existing condition registrant.
In the process of S11 of FIG. 6, the combination discovery calculation unit 21 reflects the discovered parking lot exchangeable combination information on the result output / application HTML screen 61 and displays it on the user terminal 50. FIG. 3 shows a screen configuration of the result output / application HTML screen 61. In the result output and application HTML screen 61, the parking lot address of the exchange destination and the amount of the parking lot where the exchange combination is established and the parking lot of the user displaying the screen are displayed, and each row can be exclusively selected. Radio buttons are arranged. The user can apply for parking lot replacement by selecting a radio button and pressing the application button.

When a combination that can be exchanged for a parking lot is found by the combination finding calculation unit 21, the new condition registrant can check the result on the HTML screen 61 for result output and application. On the other hand, to the existing condition registrants other than the new condition registrant, the result mail transmission unit 22 transmits an e-mail to the e-mail address designated at the time of condition registration. FIG. 7 shows the contents of the electronic mail. The URL of the result output / application HTML screen 61 is described in the text of the e-mail, and the Web browser displays the result output / application HTML screen 61 by clicking the URL.

When the application button is pressed on the result output / application HTML screen 61, the condition data selected by the radio button and the user information such as the name are transmitted to the parking lot exchange combination discovery server 10, and the application processing unit 23 The condition data and user information such as name are stored in the application database 32.

FIG. 4 shows a screen configuration diagram of the replacement application status confirmation HTML screen 62. The operator can confirm the name of the user who has applied for parking lot replacement, the condition data of the user, and the name of the other party of exchange from the HTML screen 62 for confirming the status of replacement application.

The operator confirms whether or not all the users who have been exchanged have applied on the exchange application status confirmation HTML screen 62, and if all users have applied, the parking lot is actually replaced. Services that provide information and exchange procedures can be realized.

In the present embodiment, the description has been made assuming that the users who have already rented the parking lot are exchanged. However, the condition input HTML screen 60 is also prepared with the screen shown in FIG. By making it possible to register the parking lot, when the combination discovery calculating unit 21 discovers the parking lot exchange combination, the current empty parking lot can also be a candidate. At this time, the condition of step S7 in the flowchart of the combination finding calculation unit 21 can be realized by adding a condition that the desired amount and the desired distance are not stored as a logical sum with the condition. .

Further, in this embodiment, the case of using via the Internet has been described. In addition, the user terminal 50 and the operator terminal 51 are implemented as client software that does not require a Web browser, and implemented as a client server system that communicates with the parking lot exchange combination discovery server 10 to execute processing. Implementation as a stand-alone system in which the functions of the user terminal 50, the operator terminal 51, and the parking lot exchange combination discovery server 10 are implemented as the same software is also possible.

In this embodiment, the user terminal 50 and the operator terminal 51 have been described on the assumption that a personal computer is used. However, a mobile communication terminal such as a mobile phone may be used.

In the present embodiment, the combination finding calculation unit 21 has been described as operating when the condition data is stored in the condition database 30. However, in order to avoid deterioration in processing performance when the number of simultaneous uses is large. A system that operates periodically may be used.

It is a schematic block diagram which shows the outline | summary of one Example system formed by applying this invention. It is a schematic diagram for demonstrating the display form in the user terminal of a present Example system. It is a schematic diagram for demonstrating the display form in the user terminal of a present Example system. It is a schematic diagram for demonstrating the display form in the user terminal of a present Example system. It is a schematic diagram for demonstrating the data temporary holding area | region of a present Example system. It is a flowchart for demonstrating operation | movement of a present Example system. It is a schematic diagram for demonstrating the display form in the user terminal of a present Example system. It is a schematic diagram for demonstrating the display form in the user terminal of a present Example system.

Explanation of symbols

DESCRIPTION OF SYMBOLS 10 Parking lot exchange combination discovery server 20 Condition registration process part 21 Combination discovery calculation part 22 Result mail transmission part 23 Application process part 30 Condition database 31 Map database 32 Application database 40 WWW server 50 User terminal 51 Operator terminal 60 For condition input HTML screen 61 Result output and application HTML screen 62 Exchange application status confirmation HTML screen 70 Internet 80 Web browser

Claims (15)

Input means for inputting desired conditions such as desired address, desired amount, allowable distance from the desired address, and current conditions such as the address and amount of the parking lot currently in use, and the desired conditions Storage means for storing current conditions, one of the desired conditions and a combination of the current conditions stored in one of the current conditions satisfies the other desired condition, and one desired condition is in the other An exchange combination discovery unit that discovers a pair of combinations that can be satisfied by the current condition, and a transmission unit that transmits the result to each user of the combination discovered by the discovery unit. Parking lot exchange combination discovery system Input means for inputting desired conditions such as desired address, desired amount, allowable distance from the desired address, and current conditions such as the address and amount of the parking lot currently in use, and the desired conditions Storage means for storing current conditions; all of the current conditions satisfy any desired condition from among a plurality of combinations of the desired conditions and the current conditions stored; and all of the desired conditions are An exchange combination discovery unit that discovers a set of two or more combinations that can be satisfied by the current condition; and a transmission unit that transmits the result to each user of the combination discovered by the discovery unit. Parking lot exchange combination discovery system characterized by Desired address such as desired address, desired price, allowable distance from desired address, current address of parking lot, current conditions such as price, and empty parking address, price, etc. Input means for inputting a parking lot condition, storage means for storing the desired condition, the current condition, and the empty parking lot condition, a combination of the plurality of stored desired conditions and the current condition, or a plurality of the empty parking lots All the present conditions satisfying the desired condition and satisfying the desired condition are satisfied by overlapping two or more desired conditions. An exchange combination discovery means for discovering a set of two or more combinations that do not perform, and a transmission means for transmitting the result to each user of the combination discovered by the discovery means Parking exchange combination discovery system, wherein the door The parking lot exchange combination discovery system according to any one of claims 1 to 3, further comprising: application means for a user to apply for parking lot exchange; and means for transmitting the application to a system operator. Parking combination exchange discovery system 5. The parking lot exchange combination discovery system according to claim 1, wherein the input means can be operated from a personal computer or a portable communication terminal via the Internet, and the transmission means is a personal computer or a portable communication terminal via the Internet. Parking lot exchange combination discovery system capable of transmitting the result to A step of inputting a desired condition such as a desired address, a desired amount, an allowable distance from the desired address, and a current condition such as an address of a parking lot currently being used, an amount, etc., and the desired condition and the current A step of storing conditions; one of the current conditions among the plurality of combinations of the desired condition and the current condition stored satisfies the other desired condition; and one desired condition is the other current condition A parking lot exchange combination discovery program characterized by comprising a step of discovering a pair of combinations that can be satisfied by conditions, and a step of transmitting the result to each user of the combination discovered by the discovery step A step of inputting a desired condition such as a desired address, a desired amount, an allowable distance from the desired address, and a current condition such as an address of a parking lot currently being used, an amount, etc., and the desired condition and the current A step of storing a condition, and all of the current conditions satisfy any desired condition from among a plurality of combinations of the desired condition and the current condition stored, and the current of all the desired conditions A parking lot exchange comprising: a step of discovering a set of two or more combinations that can be satisfied by conditions; and a step of transmitting the result to each user of the combination discovered by the discovery step Combination discovery program Desired address such as desired address, desired price, allowable distance from desired address, current address of parking lot, current conditions such as price, and empty parking address, price, etc. A step of inputting a parking lot condition, a step of storing the desired condition, the current condition, and the empty parking lot condition, a combination of the plurality of stored desired conditions and the current condition, or a plurality of the empty parking lot conditions. All the present conditions satisfying the desired condition and satisfying the desired condition are not satisfied by overlapping two or more desired conditions. A step of discovering a set of two or more combinations, and a step of communicating the result to each user of the combinations discovered by the discovery step, That parking exchange combination discovery program The parking lot exchange combination discovery program according to any one of claims 6 to 8, further comprising a step for a user to apply for a parking lot exchange and a step of transmitting the application to a method operator. Parking lot exchange combination program The parking lot exchange combination discovery program according to any one of claims 6 to 9, wherein the input step can be operated from a personal computer or a mobile communication terminal via the Internet, and the transmission step can be performed on the personal computer or the mobile terminal via the Internet. Parking lot exchange combination discovery program capable of transmitting the result Entering desired conditions such as the desired address, desired amount, allowable distance from the desired address and current conditions such as the address and amount of the parking lot currently in use, and the desired condition and the current A step of storing conditions; one of the current conditions among the plurality of combinations of the desired condition and the current condition stored satisfies the other desired condition; and one desired condition is the other current condition A parking lot exchange combination discovery method comprising: a step of discovering a pair of combinations that can be satisfied by conditions; and a step of transmitting the result to each user of the combination discovered by the discovery step Entering desired conditions such as the desired address, desired amount, allowable distance from the desired address and current conditions such as the address and amount of the parking lot currently in use, and the desired condition and the current A step of storing a condition, and all of the current conditions satisfy any desired condition from among a plurality of combinations of the desired condition and the current condition stored, and the current of all the desired conditions Parking lot exchange characterized by having a step of finding a set of two or more combinations that can be satisfied by conditions, and a step for transmitting the result to each user of the combination found by the discovery step How to find a combination Desired address such as desired address, desired price, allowable distance from desired address, current address of parking lot, current conditions such as price, and empty parking address, price, etc. A step of inputting a parking lot condition, a step of storing the desired condition, the current condition, and the empty parking lot condition, a combination of a plurality of the desired conditions and the current conditions stored, or a plurality of the empty parking lot conditions. All the present conditions satisfying the desired condition and satisfying the desired condition are not satisfied by overlapping two or more desired conditions. A parking lot exchange combination characterized by having a step of discovering a set of two or more combinations and a step of transmitting the result to each user of the combination discovered by the discovery step Discovery methods to 14. The parking lot exchange combination discovery method according to claim 11, further comprising a step for a user to apply for a parking lot exchange and a step of transmitting the application to a method operator. Parking lot exchange combination method 15. The parking lot exchange combination discovery method according to claim 11, wherein the input step can be operated from a personal computer or a portable communication terminal via the Internet, and the transmission step is a personal computer or a portable communication terminal via the Internet. Parking spot exchange combination discovery method capable of communicating the result to

Images