JP4906834B2 - Property search system and property search method - Google Patents

Description

  The present invention relates to a property search system for searching for properties such as rental properties, real estate properties, entertainment facilities, etc., a property registration system for registering data used when searching for properties, and a property search method, in particular, the current position The present invention relates to a property search system, a property registration system, and a property search method for searching for a property that can be moved within a predetermined required time upper limit from a specific departure place such as a workplace, a school, or a school.

Conventionally, as a technique for searching for a real estate property that can be reached within a predetermined input time from a specific departure place such as the current position, work place, and school place, the following Patent Document 1 (Japanese Patent Laid-Open No. 2001-337963) The technique described in the above) is conventionally known.
(Technique described in Patent Document 1)
Patent Document 1 describes a technique for sequentially performing the following steps (1) to (3) in order to search for a real estate property commuting from a workplace.
(1) When a real estate agent registers property data, a step of registering the only nearest station (property nearest station) and the time required from the nearest station to the property for each property.
(2) The time required for work and the nearest station (the nearest station for work), the time required for transportation between the nearest station and the nearest station for work, and the distance from the nearest station to the property A step of searching, for each property, a route having the shortest total required time by integrating the required time.
(3) A step of displaying a property whose minimum accumulated required time is within a predetermined required time upper limit as a search result.

JP 2001-337963 A (abstract "Solution means" column) JP 2003-182578 A (“0018”) JP 2003-214876 A (“0036”)

However, as a result of the inventor's research, the technical problem of the technique described in Patent Document 1 has been found. Hereinafter, a specific example will be described.
FIG. 18 is an explanatory diagram of the position of the departure place and the position of the searched property in a specific example of the property search performed using the prior art described in Patent Document 1.
FIG. 19 is an explanatory diagram of a property search result list when a property search is performed using the related art described in Patent Literature 1 with the required time upper limit set to 15 minutes.
In FIG. 18, using the technique described in Patent Document 1, as a specific example, the departure place is “University Headquarters in Omori-Nishi 5-chome, Ota-ku, Tokyo”, and 10 minutes from the departure place (upper limit time required) When a property within the range was searched, the search result was “no applicable property”.

Next, when searching for a property whose upper limit of required time is within 15 minutes without changing the departure place, as shown in FIG. 19, one “Property 1” having “Umeyashiki Station” as the nearest station was searched.
However, in FIG. 18, it is possible to move from “University Headquarters”, which is the departure point, to “Umeyashiki Station” in about 10 minutes on foot, and to “Property 1” between “University Headquarters” and “Umeyashiki Station” It is unlikely that it will take 15 minutes on foot from the “University Headquarters”.

FIG. 20 is an explanatory diagram for explaining the route and required time when moving from the departure place to the property 1 using the conventional technique for measuring the required time between two points.
Therefore, conventional techniques for searching for the shortest travel route and the shortest required time between two points (for example, techniques described in Patent Document 2 (Japanese Patent Laid-Open No. 2003-182578) and Patent Document 3 (Japanese Patent Laid-Open No. 2003-214876)). When the required time between “University Headquarters” and “Property 1” is searched using, it is found that it can be reached in 5 minutes on foot as shown in FIG.

FIG. 21 is an explanatory diagram of a property search result list when a property search is performed using the conventional technology described in Patent Document 1 with the required time upper limit set to 25 minutes.
Furthermore, when the property described in Patent Document 1 is used to search for a property whose required time upper limit value is within 25 minutes from “University Headquarters”, the search result shown in FIG. 21 is obtained. In FIG. 18 and FIG. 21, the location of “Property 2” with “Omorimachi Station” as the nearest station shown in FIG. 21 is in the vicinity of “University Headquarters” as the departure place as shown in FIG. The time is 23 minutes.

FIG. 22 is an explanatory diagram for explaining the route and required time when moving from the departure place to the property 2 using the conventional technique for measuring the required time between two points.
As in the case of “Property 1”, if the time required between “University Headquarters” and “Property 2” is measured by the conventional technique (refer to Patent Document 2, etc.) for measuring the time required between the two points. The time required was 1 minute on foot.
That is, in the technology described in Patent Document 1, there is a problem that the property 1 that is a 5-minute walk from the departure location and the property 2 that is a 1-minute walk are not searched in the first property search within a required time of 10 minutes. .

Based on the above-described specific example, the present inventor did not search for the property 1 and the property 2 when performing the search within the required time upper limit value of 10 minutes using the technique described in Patent Document 1. The cause was analyzed and a conclusion was drawn.
FIG. 23 is an explanatory diagram of a method of calculating the required time from the departure place to the property 1 with the technique described in Patent Document 1.
In the technique described in Patent Document 1, each registered property is associated with only a required time from the nearest station. That is, “Property 1” is only associated with “5 minutes” from “Umeyashiki Station”. Therefore, in the technique described in Patent Document 1, as shown in FIG. 23, the time required from “University Headquarters” to “Umeyashiki Station” “10 minutes” (calculated by the technique described in Patent Document 2) is “Umeyashiki Station”. “15 minutes” obtained by integrating the required time “5 minutes” from “” to “Property 1” is calculated as the required time. As a result, in the technique described in Patent Document 1, in reality, “Property 1”, which is a 5-minute walk from “University Headquarters”, was not searched when searching within 10 minutes of the required time upper limit. I understood that.

FIG. 24 is an explanatory diagram of a method of calculating the required time from the departure place to the property 2 by the technique described in Patent Document 1.
Further, in FIG. 24, in the technique described in Patent Document 1, “Property 2” is only associated with the required time “9 minutes” from “Omorimachi Station” which is the nearest station. Therefore, in the technique described in Patent Document 1, the time required from “University Headquarters” to “Property 2” as the departure place is “10 minutes” on foot from “University Headquarters” to “Umeyashiki Station”. , Transportation time from “Umeyashiki Station” to “Omorimachi Station” is “1 minute”, travel time within “Umeyashiki Station” and “Omorimachi Station” and train waiting time “3 minutes” “23 minutes” obtained by integrating the required time “9 minutes” on foot from “Omorimachi Station” to “Property 2” is calculated as the required time. As a result, the technology described in Patent Document 1 reveals the reason why “Property 2”, which is a 1-minute walk from “University Headquarters”, was not searched when the search was performed within the upper limit of 10 minutes. It was.

  As a result of the above examinations, the technology described in Cited Document 1 has a problem that the time required from the departure place to the property cannot be searched accurately when performing a property search. There is a problem that. Therefore, there is a problem that customers can not search for properties with good conditions that the time required from the departure place such as work or school is short, and there is also a problem that property owners miss customers such as borrowers and buyers .

In addition, when using the techniques described in Patent Documents 2 and 3 that search for the shortest route and the shortest required time between the two points by walking and transportation, it is possible to measure the exact required time between the property and the departure place. It is. However, if the shortest route search is performed for all of a considerable number of properties (approximately 200,000), the efficiency is poor and all search results are obtained within a practical time (several seconds to several minutes). Is impossible.
In view of the above-described circumstances, the present invention has a first technical problem of accurately searching for the shortest required time from a departure place to a property.
Moreover, this invention makes it the 2nd technical subject to raise the precision of the property search based on required time (to reduce a search omission).
Furthermore, this invention makes it the 3rd technical subject to improve the efficiency of a property search.

  Next, the present invention that has solved the above problems will be described. In order to facilitate the correspondence between the elements of the present invention and elements of specific examples (examples) of the embodiments described later, Add the code enclosed in parentheses. The reason why the present invention is described in correspondence with the reference numerals of the embodiments described later is to facilitate understanding of the present invention, and not to limit the scope of the present invention to the embodiments.

(Invention)
(First invention)
In order to solve the technical problem, the property search system (S) of the first invention
The shortest time required for moving from the departure location to the location of the property using transportation based on the property location data that identifies the location of the property and the departure location data that identifies the location of the departure location A transportation use property search means (SC7) for searching for a property whose travel time (ta) is within a predetermined required time upper limit;
Based on the property position data and the departure location data, the required time on foot (tb), which is the shortest required time when moving from the departure location to the location of the property on foot, is a predetermined required time upper limit. On-site property search means (SC8) to search for properties that are within the value,
For the specific property searched by both the property search means when using transportation (SC7) and the property search means when walking (SC8), the time required for walking (tb) and the time required for using the transportation ( ta), and a required time discriminating means (SC9a) for discriminating which time is shorter between the time required for walking and the time required for using the transportation facility;
It is provided with.

(Operation of the first invention)
In the property search system (S) of the first invention having the above-described structural requirements, the property search means (SC7) when using the transportation means property location data for specifying the location of the property and the departure location for specifying the location of the departure location Based on the position data, the time required for transportation (ta), which is the shortest required time when moving from the departure place to the position of the property using transportation, is within a predetermined required time upper limit. Search for a property. The on-walk property search means (SC8) is based on the property position data and the departure location data, and is the shortest required time when walking from the departure location to the location of the property. Search for a property whose time (tb) is within a predetermined required time upper limit. The required time discriminating means (SC9a) is the time required for walking (tb) for the specific property searched by both the property searching means when using the transportation means (SC7) and the property searching means when walking (SC8). And the required time (ta) when using the transportation system is determined.

  Therefore, in the property search system (S) of the first invention, the time required on foot for the property searched redundantly by the property search means (SC7) when using transportation and the property search means (SC8) when walking. Since it is possible to determine which of the required time using the transportation is shorter, it is possible to search for the property based on the determination result. Therefore, the accuracy of the shortest required time from the departure place to the property can be improved by using the shorter required time based on the determination result. And since the precision of the shortest required time increases, it is possible to reduce omissions in searching for a property within a predetermined required time upper limit value from the departure place (the search accuracy can be increased). Moreover, since the property search system (S) of the first invention searches only properties whose walking time (tb) is within the predetermined upper limit of required time, the shortest route and the shortest time for all properties are searched. The efficiency of property search can be increased compared with the case of performing a search.

(Second invention)
In order to solve the technical problem, the property search method of the second invention is:
Transportation-related data having station location data that identifies the location of a transportation station and time-to-station time data that indicates the time required between stations when moving from one station to the other using transportation Transportation-related data storage means (SC1) for storing
Property location data for specifying the location of the property, and the time required for each property available station when moving to the property from a plurality of specific property available stations that can be used when moving to the property Property data storage means (SC5b) for storing property data having property time data between the station to be indicated;
Property search condition data storage means (SC6a) for storing property search condition data having departure point position data for specifying the position of the departure point;
A departure point available station search means (SC7a) for searching for a departure point available station that can be moved from the departure point based on the departure point position data and the station position data;
Departure point available station required time calculating means (SC7b) for calculating a required time of departure point available station that is a required time when moving from the departure point to the available station of departure point;
Based on the transportation related data, the property data, the property search condition data, and the time required for the departure point available station, a plurality of routes traveling from the departure point to the property using the transportation unit Among these, the shortest travel route search for searching for the route with the shortest time required for using the transportation, which is an accumulated time of the time required for the departure station, the time required for the station, and the time required for the property station Means (SC7c);
A property search means (SC7) when using a transportation facility for searching for a property whose time required when using the shortest transportation is within a predetermined upper limit of the required time;
The departure place available station search means searches for a departure place available station that can be moved from the departure place,
Departure station available station time calculation means (SC7b) calculates the departure station available station time which is the required time when moving from the departure place to the departure station available station. A calculation step;
The shortest travel route search means (SC7c) is used when traveling to the property and the time required for the departure location available station among a plurality of routes traveling from the departure location to the property using transportation. The required time between any of the property stations of the property-to-station time for each property-usable station when moving from a plurality of possible specific property-available stations to the property, and any from the departure-site available station The shortest route for searching for the route having the shortest travel time (ta) when using the transportation, which is the accumulated time of the travel time between stations, which is the travel time when traveling to the above-mentioned station where the property can be used. A travel route search step;
The transportation use property search means (SC7) for searching for a property having a shortest transportation use time (ta) within a predetermined required time upper limit,
It is characterized by performing.

(Operation of the second invention)
In the property search method according to the fifth aspect of the present invention having the above-described structural requirements, in the departure place available station search step, a departure place available station that can move from the departure place is searched. In the departure place available station time calculation step, the departure place available station time, which is the required time when moving from the departure place to the departure place available station, is calculated. In the shortest travel route search step, among a plurality of routes that travel from the departure place to the property using the transportation facility, the time required for the departure point available station and a specific time that can be used when moving to the property When traveling from a plurality of property-usable stations to the property, the property-to-station time of any property-to-station time for each property-usable station, and any of the properties from the departure-site-usable station A route having the shortest travel time required for transportation (ta), which is an accumulated time of the travel time between stations, which is the travel time required to move to an available station using the transport, is searched. In the property search step when using a transportation facility, a property whose required time (ta) when using the shortest transportation facility is within a predetermined required time upper limit is searched.

  In the prior art, only the nearest station is stored in each property, and the time required from the nearest station to the property is added to the shortest time required to the nearest station. In the property search method of the fifth invention, based on the stations that can be used from the property (property available station) and the time required for the property (the time required between the property stations), it is possible to use multiple property-available stations and departure places The shortest travel time via the station is searched. Therefore, in the property search method of the fifth invention, the time required when moving from the station in front of the nearest station to the property is accurate, including when the time required for moving from the nearest station to the property is shorter. The shortest required time can be calculated. That is, in the property search method according to the fifth aspect of the invention, it is possible to increase the search accuracy of the required time from the departure place to the property. Moreover, since the accuracy of the shortest required time is increased, the accuracy of property search based on the required time can be improved (search omission can be reduced).

The above-mentioned present invention can search the shortest required time from the departure place to the property with high accuracy.
Further, the present invention can improve the accuracy of property search based on the required time (reduce search omissions).
Furthermore, the present invention can increase the efficiency of property search.

  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 is an explanatory diagram of Example 1 of the property search system of the present invention.
In FIG. 1, the property search system S according to the first embodiment includes a plurality of user terminals 1 that allow a user who performs property search to input property search conditions or to confirm a search result. In addition, the property search system S is connected to the user terminal 1 via the Internet 2 and performs a property search based on the property search condition transmitted from the user terminal 1 and returns the search result to the user terminal 1 again. The property search server 3 to be transmitted and the other database server 4 are provided.

Each user terminal 1 includes a terminal main body 1a, an input device such as a keyboard 1b and a mouse 1c for a user to input property search conditions, and a display on which a search result transmitted from the property search server 3 is displayed. 1d (output device).
The property search server 3 includes a server body 3a, an input device such as a keyboard 3b and a mouse 3c for a server administrator such as a real estate agent to newly register / update / delete property information, and property information It has a display 3d (output device) on which property information and the like are displayed when registration or the like is performed.
In the property search system S of the first embodiment, the user terminal 1 and the property search server 3 are connected via the Internet 2, but they can be connected using a dedicated network line.

(Description of control unit of user terminal 1)
FIG. 2 is a block diagram (function block diagram) showing the function of the user terminal of the property search system shown in FIG.
In FIG. 2, the controller TC of the user terminal 1 includes an I / O (input / output interface) that performs input / output of signals with the outside and adjustment of input / output signal levels, programs and data for performing necessary processing, and the like. Is stored in a ROM (read-only memory, recording medium such as a hard disk), RAM (random access memory, recording medium) for temporarily storing necessary data, processing according to a program stored in the ROM, etc. It is composed of a CPU (Central Processing Unit) to be executed and a computer having a clock oscillator and the like, and various functions can be realized by executing a program stored in the ROM or the like.

(Signal input element connected to the controller TC of the user terminal 1)
The controller TC of the user terminal 1 receives signals from input devices such as a keyboard 1b and a mouse 1c and other signal input elements.
The input device detects that they are input by the user and inputs the detection signal to the controller TC.

(Control element connected to the controller TC of the user terminal 1)
The controller TC of the user terminal 1 is connected to the display 1d, a power supply circuit (not shown), and other control elements, and outputs their operation control signals.
A display image corresponding to the operation of the user of the terminal 1 is displayed on the display 1d.

(Function of controller TC of user terminal 1)
The controller TC of the user terminal 1 has a program for transmitting the property search condition data input by the keyboard 1b or the like and displaying the received property search result on the display 1d, other programs, etc. It has a function (control means) for executing a process according to an output signal from each signal output element and outputting a control signal to each control element. Next, the function (control means) of the controller TC will be described.

FIG. 3 is an explanatory diagram of a property search condition input image according to the first embodiment.
TC1: Search condition input image display means The search condition input image display means TC1 displays the property search condition input image 6 for inputting property search conditions on the display 1d. In FIG. 3, the property search condition input image 6 of Example 1 includes a departure point input field 6 a for inputting a departure point (property search condition), and an upper limit value (property search condition) of a required time from the departure point. It has a required time upper limit value input field 6b for inputting, a condition input field 6c for inputting other property search conditions, and a transmission icon 6d for transmitting the input property search conditions to the property search server 3. ing. The departure place input field 6a has a "work / destination" field for inputting a company name, a school name, and the like, and a field for inputting an address of the departure place. The condition input field 6c includes a field for inputting an upper limit value of rent, a field for designating a floor plan (1K, 2DK, etc.), a field for inputting the exclusive area of the property, and a property type. It has a column to specify (apartment, detached house, etc.). The property search conditions that can be input to the property search condition input image 6 are not limited to the items described in FIG. 3, and other conditions can be added or the conditions can be omitted.

TC2: Search condition transmitting means The search condition transmitting means TC2 transmits the property search condition data input in the property search condition input image 6 to the property search server 3. In the property search system S of the first embodiment, property search condition data including property search condition data such as departure location data, required time upper limit value data, and rent upper limit value is transmitted to the property search server 3.
TC3: Search Result Receiving Unit The search result receiving unit TC3 receives data (property search result data) as a result of performing a property search on the property search server 3 according to the property search condition data.
TC4: Search result image display means The search result image display means TC4 displays a property search result image (for example, see FIG. 19, FIG. 21, etc.) on the display 1d based on the received property search result data.

(Description of the control unit of the property search server 3)
FIG. 4 is a block diagram (function block diagram) showing the function of the property search server of the property search system shown in FIG.
In FIG. 4, the controller SC of the property search server 3 includes an I / O (input / output interface) that performs input / output of signals with the outside and adjustment of input / output signal levels, programs and data for performing necessary processing, and the like. Is stored in a ROM (read-only memory, recording medium such as a hard disk), RAM (random access memory, recording medium) for temporarily storing necessary data, processing according to a program stored in the ROM, etc. It is composed of a CPU (Central Processing Unit) to be executed and a computer having a clock oscillator and the like, and various functions can be realized by executing a program stored in the ROM or the like.

(Signal input element connected to controller SC of property search server 3)
The controller SC of the property search server 3 receives signals from input devices such as a keyboard 3b and a mouse 3c and other signal input elements.
The input device detects that they are input by the user and inputs the detection signal to the controller SC.

(Control elements connected to the controller SC of the property search server 3)
The controller SC of the property search server 3 is connected to the display 3d, a power supply circuit (not shown), and other control elements, and outputs their operation control signals.
A display image corresponding to the operation of the server administrator is displayed on the display 3d.

(Function of controller SC of property search server)
The controller SC of the property search server 3 has a property registration program P1, a property search program P2, and other programs, and executes processing according to output signals from the signal output elements, It has a function (control means) for outputting a control signal to the control element. Next, each function (control means) of the controller SC will be described.

SC1: Transportation related data storage means (train route database, etc.)
The transportation related data storage means SC1 is the station position data for identifying the position of the transportation station and the inter-station required time indicating the time required for moving from one station to the other station using the transportation facility. Transportation related data having time data is stored. The transportation related data storage means SC1 of the first embodiment stores station coordinates (for example, (35 ° north latitude, 135 ° east longitude)) as the station name and the station position data, and is adjacent as the required time data between stations. The time (for example, “2 minutes”, etc.) between stop stations (including the case of passing through an intermediate station such as an express train) is stored.
SC2: Map data storage means (map database, etc.)
The map data storage means SC2 stores map data used when searching for the position of a property or searching for the shortest required time and the shortest route. The map data storage means SC2 of the first embodiment stores a plurality of unit maps (mesh) having a predetermined range (for example, 200 m square or 500 m square) as one unit, as in the technique described in Patent Document 3. ing.

P1: Property Registration Program The property registration program P1 has property registration image display means SC3, input property data storage means SC4, and property search data creation means SC5, and responds to input from a server administrator such as a real estate agent. Create and register property data.

FIG. 5 is an explanatory diagram of a property registration image for performing new property registration, property content change, and property deletion.
SC3: Property Registration Image Display Unit The property registration image display unit SC3 displays on the display 3d a property registration image 11 (see FIG. 5) for the server administrator to newly register, change contents, and delete a property. In the property registration image 11 of the first embodiment, a registration / change switching radio button 11a for selecting whether it is new registration or content change, a property name input field 11b for inputting a property name, and a property address are input. A property address input field 11c for inputting property related information input fields 11d for inputting property related information such as rent and management expenses. Further, the property registration image 11 of the first embodiment automatically searches for the position of the property based on the map data stored in the map data storage means SC2 and the address input in the property address input field 11c. And an automatic position registration selection field 11e to be registered, and a manual position input field 11f for directly inputting the position of the property. Further, the property registration image 11 of the first embodiment includes a delete icon 11g for deleting the selected property, a registration icon 11h for registering / updating with the input contents, and property registration, change, and deletion. A cancel icon 11i for ending the work is provided.

SC4: Input property data storage means (property database)
The input property data storage means SC4 stores the property data input by the property registration image display means SC3.
SC5: Property search data creation means Property search data creation means SC5 includes property available station search means SC5a comprising property walk area station search means SC5a1 and property walk area station required time calculation means SC5a2, and property search data. It has storage means (property data storage means) SC5b, and creates property search data used when searching for properties corresponding to the property search conditions transmitted from the user terminal 1. In the property search system S of the first embodiment, the shortest distance from the starting point to the property using the Dijkstra method (for example, see Japanese Patent Application Laid-Open No. 2000-187653) in the property search means (SC7) when using the transportation system described later. Search for the required time. Therefore, the property search data creation means SC5 of the first embodiment creates property search data used in the Dijkstra method.

  FIG. 6 is an explanatory diagram of the property search network. The property search data of the first embodiment includes data of a node 12 (see FIG. 6) indicating a station and the position of the property, data of a link 13 that connects an adjacent station or a property-available station, and the property. It has link length data indicating the required time between stations and the required time between the property and the station where the property can be used. The data for the property search network is created by the property search data creation means. Is done. In the property search data of the first embodiment, a bidirectional link (mutually movable data) 13a indicating that the adjacent stations can move to each other is set. A one-way link (one-way) is available between the property-usable station and the property, starting from the property-usable station node and moving only from the property-usable station, which ends at the property node, to the property. (Movable data) 13b is set. Therefore, although neither a station nor a property is distinguished as the node 12, at the time of property search, if no two-way link 13a is connected, it will be recognized as a property, and if at least one two-way link 13a is connected, the station It turns out that it is.

SC5a: Property available station search means Property available station search means SC5a has property walking area station searching means SC5a1 and property walking area station required time calculation means SC5a2, and can be used when moving from the property. Search for multiple available stations in. The property usable station search means SC5a of the first embodiment searches for two or more and five or less stations from the shorter required time from the property (the required time between property stations). In addition, since the technique which searches a some station from a specific point is described in the said patent document 2, 3 etc., detailed description is abbreviate | omitted.

SC5a1: Property walk area station search means Property walk area station search means SC5a1 is the property location data stored in the property input property data storage means SC4 and the station location data stored in the transportation related data storage means SC1. Based on the map data stored in the map data storage means SC2, a plurality of property-usable stations that can be moved on foot from the property are searched.
SC5a2: Property walking area station required time calculation means Property walking area station required time calculation means SC5a2 calculates the shortest required time (required time between property stations) between the property and each available station for each station.

SC5b: Property search data storage means (property data storage means)
The property search data storage means SC5b includes the property position data (node data) and property search data (link length data) indicating property time required between the property stations (link length data). (Property data) is stored. The property search data storage means SC5b according to the first embodiment includes, in addition to the above-described data, node data that identifies the position of the station, data that identifies nodes connected by links, and a station that indicates the link length. The data of the required time and the link type data specifying whether the link is a one-way link or a two-way link are stored. That is, the position data of a node indicating an object (property position data), the position data of a node indicating a station (station position data), the data of a set of nodes connected by a link, the type of link (one-way link or both Direction link) data (one-way movable data or mutual movable data) and the link length data (inter-station travel time data and inter-station travel time data), 6) (network data for property search) is stored.

P2: Property search program The property search program P2 includes a search condition receiving means SC6, a property search means SC7 when using transportation, a property search means SC8 when walking, a property search result creating means SC9, and a search result transmitting means SC10. The property is searched according to the property search condition transmitted from the user terminal 1 and transmitted to the user terminal 1.
SC6: Search Condition Receiving Unit The search condition receiving unit SC6 has a property search condition data storage unit SC6a, and receives the property search condition data transmitted from the user terminal 1.
SC6a: Property search condition data storage means The property search condition data storage means SC6a stores the received property search condition data having departure place position data and the like.

SC7: Property search means when using transportation means Property search means SC7 when using transportation means station search means for walking distance from departure station (means for searching available station for departure place) SC7a and station time calculation means for departure station within walking distance (starting place) (Usable station required time calculation means) SC7b and shortest travel route search means SC7c. Then, the property search means SC7 when using the transportation is based on the property position data and the departure point position data, so that the shortest time when moving from the position of the departure point to the position of the property using the transportation means A property whose required time ta when using the transportation means is within a predetermined required time upper limit is searched. The transportation facility use property search means SC7 of the first embodiment uses each data included in the received property search condition data for the departure location position data and the required time upper limit value.

FIG. 7 is an explanatory diagram of a property search network in which a node indicating a departure place and a one-way link from a departure node to a walking station in the departure place are added.
The property search means SC7 at the time of transportation use in Example 1 searches for a plurality of departure stations within walking distance from the departure location on foot, and displays the departure location on the property search network shown in FIG. The registered node 14 (see FIG. 7) is registered, and the one-way link (one-way movable data) 13b from the departure node 14 to the walking station 12 in the departure place is registered. Then, on the property search network, a property node that can move within the required time upper limit value from the departure node is searched, and the search result is listed. The search for the property that can be moved within the upper limit of the required time from the departure place can be performed by, for example, the Dijkstra method, and thus detailed description is omitted.

SC7a: Departure walking distance station search means (departure place available station search means)
Based on the departure location data and the station location data, the departure location walking range station searching means SC7a is capable of walking a plurality of specific departure location walking stations (departure location usable stations) that can be moved on foot from the departure location. ) Note that the departure point walking area station searching means SC7a of the first embodiment searches all stations within a predetermined range centering on the departure point.
SC7b: Departure walking distance station required time calculation means (Departure point available station required time calculation means)
Departure walking area station time calculation means SC7b is the shortest required time when moving from the departure area to each departure area walking area station. Departure walking area station time (departure station available station time) Is calculated for each station. The search for the shortest route and the shortest required time to the walking area station can be performed by the techniques described in Patent Documents 2 and 3, for example, and detailed description thereof is omitted. Note that the departure time walking area station time calculated by the departure area walking area station time calculation means SC7b is registered as the length of the one-way link 13b in the property search network.

SC7c: Shortest travel route search means The shortest travel route search means SC7c is based on the transportation related data, the property data, the property search condition data, and the departure station walking area travel time. The transportation which is the accumulated time of the time required for the departure area walking station, the time required for the station, and the time required for the property station among a plurality of routes traveling from the station to the property. A route having the shortest time required for use ta is searched.

SC8: Property search means when walking The property search means SC8 when walking includes the same mesh property search means SC8a and the adjacent mesh property search means SC8b. Then, the on-walk property search means SC8 is based on the property position data and the departure location data, and is the shortest required time when walking from the departure location to the location of the property. Search for a property whose time tb is within a predetermined required time upper limit. In addition, the property search means on foot SC8 of the first embodiment searches for a property registered in a mesh (unit map) having a departure place and a property registered in a mesh adjacent to the mesh of the departure place, and each property. Until the walking time tb is measured, and a property whose walking time tb is within the upper limit of the required time is searched. Note that the search method for the shortest walking time tb and the shortest route to the property registered in the same mesh and the adjacent mesh as the starting point mesh is described in, for example, the technique described in Patent Document 3 above. Detailed description will be omitted.

FIG. 8 is an explanatory diagram in the case of searching for a property registered in a unit map (mesh) of the position of the departure place and its adjacent mesh.
SC8a: Same mesh property search means The same mesh property search means SC8a searches for properties registered in the same mesh as the mesh where the departure point is located. In FIG. 8, when the departure place is in the mesh M1, the same mesh property search means SC8a of the first embodiment searches for all properties registered in the mesh M1.
SC8b: Adjacent mesh property search means The adjacent mesh property search means SC8b searches for properties registered in the mesh adjacent to the mesh where the departure place is located. In FIG. 8, when the position of the departure place is in the mesh M1, the adjacent mesh property search means SC8b of the first embodiment searches for all properties registered in the meshes M2 to M9 adjacent to the mesh M1.

SC9: Property search result creating means The property search result creating means SC9 has a required time discriminating means SC9a, and the search result by the property search means SC7 when using the transportation means and the search result and reception by the property search means SC8 when walking. Create property search results according to the property search conditions. The property search result creation means SC9 of the first embodiment uses the shortest required time ta, tb as the required time for the property searched by the property search means SC7 when using the transportation means and the property search means SC8 when walking. Create a list of property search results.

SC9a: Required time discriminating means The required time discriminating means SC9a is used for a specific property searched by both the transportation use property searching means SC7 and the walking property searching means SC8. It is determined which of the required time ta when using the transportation is shorter.
SC10: Search result transmission means The search result transmission means SC10 transmits the property search result data (property search result data) created by the property search result creation means SC9 to the user terminal 1.

(Explanation of flowchart)
Next, a flowchart of the property search system according to the first embodiment will be described. In the user terminal 1, the property search condition input image 6 (FIG. 3) is displayed, and the processing for transmitting the inputted property search condition data to the property search server 3 and the property search result transmitted from the property search server 3 Description of the process of displaying is omitted.
(Explanation of flow chart of property registration process of property search server 3)
FIG. 9 is a flowchart of the property registration process of the property search server 3 of the property search system according to the first embodiment.
The processing of each ST (step) in the flowchart of FIG. 9 is performed according to a program or the like stored in the ROM or the like of the controller SC of the property search server 3. In addition, this process is executed in parallel with other various processes of the property search server 3.

The flowchart shown in FIG. 9 is started when the property search server 3 is turned on.
In ST1 of FIG. 9, it is determined whether or not an input for starting property registration has been made. If yes (Y), the process proceeds to ST2, and if no (N), ST1 is repeated.
In ST2, the property registration image 11 (see FIG. 5) is displayed on the display 3d. Then, the process proceeds to ST3.
In ST3, it is determined whether or not input has been made to the input fields 11a to 11f of the property registration image 11. If yes (Y), the process proceeds to ST4, and, if no (N), the process proceeds to ST5.
In ST4, the display of the property registration image 11 is updated according to the input to the input fields 11a to 11f. Then, the process returns to ST3.

In ST5, it is determined whether or not an input for selecting the delete icon 11g has been made. If yes (Y), the process proceeds to ST6, and, if no (N), the process proceeds to ST7.
In ST6, the data of the property to be deleted is deleted from the input property data storage means SC4. Then, the process proceeds to ST3.
In ST7, it is determined whether or not an input for selecting the cancel icon 11i has been made. If no (N), the process moves to ST8, and if yes (Y), the process returns to ST1.
In ST8, it is determined whether or not an input for selecting the registration icon 11h has been made. If yes (Y), the process proceeds to ST9, and, if no (N), the process returns to ST3.

In ST9, it is determined whether or not all items in the input fields 11a to 11f of the property registration image 11 have been input. If no (N), the process moves to ST10, and if yes (Y), the process moves to ST11.
In ST10, since not all items have been input, an error message that prompts the server administrator to input all items is displayed on the display 3d. Then, the process proceeds to ST3.
In ST11, the following processes (1) and (2) are executed, and the process proceeds to ST12.
(1) Set the position of the property to the current position. At this time, when the automatic position registration selection field 11e is specified in the property registration image 11, the property address data is converted into position coordinates, and then the position is set as the current position.
(2) Search for all stations within a straight line distance of 2 km (within a range that can be easily moved on foot) from the current position (the position of the property).

In ST12, it is determined whether or not two or more stations have been searched. If no (N), the process moves to ST13, and if yes (Y), the process moves to ST15.
In ST13, all stations having a straight distance from the property within 4 km (within a range that can be moved on foot or by bicycle) are searched. Then, the process proceeds to ST14.
In ST14, it is determined whether or not two or more stations (property available stations) have been searched. If yes (Y), the process proceeds to ST15, and, if no (N), the process proceeds to ST20.
In ST15, the shortest route on foot to the searched stations and the shortest required time (the required time between property stations) are calculated. Then, the process proceeds to ST16.
In ST16, a search result list is created for the two or more searched stations in ascending order of time required between the property stations. Then, the process proceeds to ST17.

In ST17, it is determined whether or not the number of stations registered in the search result list is 6 or more. If yes (Y), the process proceeds to ST18, and, if no (N), the process proceeds to ST19.
In ST18, five stations are set as usable stations in order from the shortest required time between the station from the station to each station. Then, the process proceeds to ST22.
In ST19, all stations in the list are set as available stations. Then, the process proceeds to ST22.

In ST20, the search range of the linear distance from the property is expanded, and two stations are searched in order of increasing linear distance. Then, the process proceeds to ST21.
In ST21, the time required between the property stations to the two stations searched in ST20 is measured, and the two stations are set as usable stations. Then, the process proceeds to ST22.
In ST22, the following processes (1) to (3) are executed, and the process returns to ST2.
(1) A property identification number ID is assigned to the target property.
(2) In the property search network, a node indicating the property position and a one-way link starting from each available station are set (see FIG. 6).
(3) Register other information such as property identification number ID, property name, property position and rent as input property data, and property identification number ID, property position data, link data and link data as property search data Register length (time required between property stations).

(Description of the flow chart of the property search process of the property search server 3)
FIG. 10 is a main flowchart of the property search process of the property search server 3 of the property search system according to the first embodiment.
Each ST (step) process in the flowchart of FIG. 10 is performed according to a program or the like stored in the ROM or the like of the controller SC of the property search server 3. In addition, this process is executed in parallel with other various processes of the property search server 3.

The flowchart shown in FIG. 10 is started when the property search server 3 is turned on.
In ST31 of FIG. 10, it is determined whether or not property search is started, that is, whether or not property search condition data is received. If yes (Y), the process transfers to ST32, and, if no (N), ST31 is repeated.
In ST32, use of transportation to search for a property whose required time ta when using transportation, which is the shortest required time when moving from the departure place to the location of the property, is within a predetermined required time upper limit. Time property search processing (property property search step when using a transportation facility, refer to a subroutine of FIG. 11 described later) is executed. Then, the process proceeds to ST33.

In ST33, a property search process on foot that searches for a property whose required time tb, which is the shortest required time when walking from the departure point to the location of the property, is within the predetermined upper limit of the required time (property on foot) A search step, see the subroutine of FIG. Then, the process proceeds to ST34.
In ST34, a property search result is created based on the search results in the property search process when using the transportation facility (ST32) and the property search process when walking (ST33), and transmitted to the user terminal 1. Processing (property search result creation step, refer to a subroutine of FIG. 14 described later) is executed. Then, the process returns to ST31.

(Explanation of Flowchart of Property Search Process when Using Transportation (Subroutine of ST32))
FIG. 11 is a flowchart of the property search process when using the transportation system of the first embodiment, and is a flowchart of the subroutine of ST32 in FIG.
In ST41 (departure location available station search step) in FIG. 11, the straight line distance from the location of the departure location is within 4 km (movable on foot or the like) based on the departure location data included in the received property search condition data. Search all stations (within the range) (stations that can use the departure point). Then, the process proceeds to ST42.
In ST42, it is determined whether or not two or more stations have been searched. If no (N), the process proceeds to ST43, and if yes (Y), the process proceeds to ST44.
In ST43, two stations having the closest linear distance are searched. Then, the process proceeds to ST44.

In ST44 (departure station useable station time calculation step), the departure place usable station required time, which is the required time when moving from the departure place to each searched departure place useable station, is calculated for each station. Then, the process proceeds to ST45.
In ST45, a one-way link starting from the departure point and ending at each station is set (see FIG. 7). Then, the process proceeds to ST46.
In ST46 (shortest travel route search step and transportation use property search step), all properties whose required transportation time ta is within the required time upper limit value are searched by the Dijkstra method. Then, the process proceeds to ST47.

FIG. 12 is an explanatory diagram of a search result list, FIG. 12A is an explanatory diagram of a transportation use result list, FIG. 12B is an explanatory diagram of a walking result list, and FIG. 12C is an explanatory diagram of a final result list.
In ST47, the following processes (1) and (2) are executed, and the process proceeds to ST33 in the property search process flowchart of FIG.
(1) A transport system use list number na (see FIG. 12A) is assigned in ascending order of time required for transport system use ta.
(2) The transportation use result list 21 (see FIG. 12A) is created based on the transportation use list number na.

(Explanation of flowchart of property search process on foot (ST33 subroutine))
FIG. 13 is a flowchart of the on-walk property search process of the first embodiment, and is a flowchart of the subroutine of ST33 in FIG.
In ST51 of FIG. 13, the following processes (1) and (2) are executed, and the process proceeds to ST52.
(1) Search all properties registered in the mesh (unit map) where the departure point is located.
(2) Search for all properties registered in a mesh (vertical / horizontal / diagonal mesh) adjacent to the mesh where the departure point is located.

In ST52, the shortest route and the shortest required time on foot from the departure place to each property searched in ST51 are searched and calculated for each property. Then, the process proceeds to ST53.
In ST53, the following processes (1) and (2) are executed, and the process proceeds to ST34 in FIG.
(1) The walking list number nb (see FIG. 12B) is assigned in the order of shorter walking time tb.
(2) The walking result list 22 (see FIG. 12B) is created based on the walking list number nb.

(Explanation of flowchart of property search result creation process (subroutine of ST34))
FIG. 14 is a flowchart of the property search result creation process of the first embodiment, and is a flowchart of the subroutine of ST34 in FIG.
In ST61 of FIG. 14, all the properties registered in the transportation use result list 21 created in ST47 of FIG. 11 are registered in the final result list in a state where nothing is registered. Then, the process proceeds to ST62.
In ST62, the walking list number nb = 1 is set (initialized). Then, the process proceeds to ST63.
In ST63, it is determined whether or not the property data of the walking list number nb is in the walking result list 22. If yes (Y), the process proceeds to ST64, and, if no (N), the process proceeds to ST72.

In ST64, the transport system use list number na = 1 is set (initialized). Then, the process proceeds to ST65.
In ST65, it is determined whether or not the property data of the transportation use list number na is in the transportation use result list 21. If yes (Y), the process proceeds to ST66, and, if no (N), the process proceeds to ST70.
In ST66, it is determined whether or not the property identification number ID of the walking list number nb is the same as the property identification number ID of the transportation use list number na. If no (N), the process proceeds to ST67, and if yes (Y), the process proceeds to ST68.
In ST67, it is assumed that the list number na = na + 1 when using the transportation facility. That is, 1 is added to the value of na. Then, the process returns to ST65.

In ST68 (required time determining step), it is determined whether or not the walking required time tb of the walking list number nb is equal to or shorter than the required transportation time ta of the transportation use list number na. That is, for the property searched in both the property search process at the time of transportation use (ST32) and the property search process at the time of walking (ST33), the time required for walking tb and the time required for transportation use ta Determine which duration is shorter. If yes (Y), the process proceeds to ST69, and, if no (N), the process proceeds to ST71.
In ST69, the data on the transportation use list number na in the final result list 23 is updated to the data on the walking list number nb. That is, since the property overlaps and the required time tb when walking is short, the required time is updated from the required time ta when using transportation to the shorter required time tb when walking (see FIGS. 12A, 12B, and 12C). (Refer to properties with property identification number IDs “000301” and “000201”). Then, the process proceeds to ST71.

In ST70, since the property that overlaps with the property of the list number nb at the time of walking has not been registered in the transportation result list 21, the property data of the list number nb at the time of walking is additionally registered in the final result list. Then, the process proceeds to ST71.
In ST71, the walking list number is set to nb = nb + 1. That is, 1 is added to the value of nb. Then, the process returns to ST63.
In ST72, since the discrimination of property duplication and registration of non-overlapping properties have been completed, the following processes (1) and (2) are executed, and the process returns to ST31 in FIG.
(1) Narrow down properties according to other property search conditions (rent, floor plan, etc.), and create a final result list (property search result).
(2) The created final result list is transmitted to the user terminal 1 as a property search result.

(Operation of Example 1)
In the property search system S according to the first embodiment having the above-described configuration, when the server administrator performs property registration / change in the property search server 3, a plurality of available stations (property available stations) are automatically selected. Search for. Then, it automatically calculates the shortest required time (time required between property stations) between the property-usable station and the property, and sets the property and property-usable station as a node, and a one-way link from the property-usable station to the property Set.
When the property search server 3 receives the property search condition input by the user at the user terminal 1, the property search server 3 can move from the departure place such as the place of work or school to the station (departure walking area station, departure place). Search for available stations automatically. Next, the shortest required time (departure time ta between departure stations) to the departure walking station is automatically calculated, the departure point is set as node 14, and the one-way link from the departure point to the departure walking station is performed. Set. Then, the node 12 of the property that can be reached within the required time upper limit value from the departure node 14 is searched, and a transportation use result list 21 (see FIG. 12A) is created.

Next, the property which can be moved on foot from the departure place is searched using the meshes M1 to M9, and the shortest required time to the property (the time required for walking tb) is automatically calculated. Then, a walking result list 22 (FIG. 12B) in which the respective properties are listed is created.
Then, based on the transportation use result list 21 and the walking result list 22, a final result list (property search result) is created. At this time, when the property registered in the transportation use result list and the property registered in the walking result list 22 overlap, the shorter required time is adopted (FIG. 12A, FIG. 12B, FIG. 12C property identification number IDs are “000301”, “000201”, “000101”).

FIG. 15 is an operation explanatory diagram of a search result obtained by the property search system according to the first embodiment, and corresponds to FIG.
In FIG. 15, the property search system S of the first embodiment is used to search for properties under the same conditions as in FIG. 18. As a result, for property 1, the time required for transportation use ta = 15 Minute, walking time tb = 5 minutes is calculated, and the walking time tb (= 5 minutes) is adopted as the required time from “University Headquarters” to “Property 1” in the final result list. Accordingly, when the property search system S of the first embodiment performs property search under the property search condition in which the departure place is “university headquarters” and the required time upper limit value is “10 minutes”, the property 1 is the user as a search result. It is displayed on the terminal 1.

FIG. 16 is an operation explanatory diagram of a search result obtained by the property search system according to the first embodiment, and corresponds to FIG. 24 described above.
In FIG. 16, similarly to the case of FIG. 15, in the property search system S of the first embodiment, for the property 2, the time required for transportation using ta = 23 minutes and the time required for walking tb = 1 minutes are calculated. In the final result list, the time required for walking tb (= 1 minute) is adopted as the time required from “University Headquarters” to “Property 2”. Therefore, when the property search system S of Example 1 performs a property search under the property search condition where the departure place is “University Headquarters” and the upper limit of the required time is “10 minutes”, “Property 2” is also obtained as a search result. It is displayed on the user terminal 1.

FIG. 17 is an explanatory diagram of a property search network for explaining the shortest required time from the departure place to the property by the property search system according to the first embodiment.
Further, in the property search system S of the first embodiment, unlike the conventional technology in which a property is associated with only one nearest station, each property is associated with a plurality of property usable stations. The departure point is also associated with a plurality of departure point walking stations (departure point usable stations). Therefore, in FIG. 17, in the property search system S of the first embodiment, the travel time ta required for transportation 3 to the property 3 (12a) closest to the departure point 14 is 15 minutes (= 8 minutes required for the departure point available station). + 7 minutes required between station stations). However, the nearest station of the property 3 is not the station 12b that takes 7 minutes between the property stations but a station 12c that takes 6 minutes between the property stations. Therefore, in the prior art in which the only nearest station is associated, the required time ta for transportation is 20 minutes (= 8 minutes required for departure station + 6 minutes required between stations + 6 minutes required between property stations) )Met. Therefore, in the property search system S of the first embodiment in which a plurality of usable stations are set for each property, the accuracy of the shortest required time can be improved, and the property can be reliably searched without omission.

  As a result, in the property search system S of the first embodiment, the shortest time required from the departure place 14 to the property 12 is obtained by using the shorter required time ta when using transportation and the required time tb when walking. Can improve the accuracy. And since the precision of the shortest required time ta, tb increases, it is possible to reduce omission of search when searching for the property 12 within the predetermined required time upper limit from the departure place 14 (the search accuracy can be improved). . In addition, the property search system S according to the first embodiment uses the mesh to search for properties whose walking time tb is within a predetermined required time upper limit value. Compared to the time search, the property search efficiency can be increased.

  Further, in the property search system S of the first embodiment, a plurality of property-usable stations are stored and a plurality of departure-point walking area stations are searched. The shortest required travel time is searched. Therefore, the property search system S of the first embodiment can calculate the exact shortest required time, and can accurately search the time required from the departure place 14 to the property. Moreover, since the accuracy of the shortest required time is increased, the accuracy of property search based on the required time can be improved (search omission can be reduced).

As mentioned above, although the Example of this invention was explained in full detail, this invention is not limited to the said Example, A various change is performed within the range of the summary of this invention described in the claim. It is possible.
For example, in Example 1, the time required for walking is used as the time required between the property stations and the time required for the departure point, but it is not limited to walking, and the time required for bicycles, buses, taxis, etc. may be used. Is possible. For example, it is also possible to calculate the required time using the average speed of a bicycle or the like without using the route length of the shortest route and the average walking speed (80 m / s).

For example, in Example 1, when searching for a property on foot, a property that is the same as or adjacent to the departure location is searched, but the search method using the mesh is not limited, and the departure location is the center. It is possible to search for a property within a predetermined walking distance (for example, a radius of 5 km or 4 km square).
Furthermore, in the first embodiment, the Dijkstra method is used when searching for properties when using a transportation facility, but a known route search method other than the Dijkstra method can be used.

In the first embodiment, the property search server 3 includes the transportation related data storage means SC1, the map data storage means SC2, the input property data storage means SC4, the property search data creation means SC5, etc. It is also possible to provide the means in another device connected to the network. For example, a database server for transportation related data, a database server for map data, a database server for input property data, etc. are configured as separate devices, and if necessary, the property search server 3 and data It can also be configured to transmit and receive.
Further, in the first embodiment, the user terminal 1 and the property search server 3 are configured as separate devices, but may be configured as a single device.

Further, in the first embodiment, a plurality of departure point walking area stations (stations where the departure point can be used) are searched, but the number of departure point walking area stations may be one.
Further, in the first embodiment, a real estate property that can be moved to a work place in a predetermined time is searched. For example, a theme park, an event venue, a movie theater, a complex that can be moved from a home in a predetermined time. It can be configured to search for properties such as type commercial facilities, or search for properties such as inns and hot springs that can be moved from a specific station in a predetermined time, and resorts. .
In the first embodiment, the user terminal 1 is connected to the Internet 2, but it may be configured to perform a search using a mobile terminal such as a mobile phone connected via a mobile phone network.

It is explanatory drawing of Example 1 of the property search system of this invention. It is the figure which showed the function of the user terminal of the property search system shown in FIG. 1 with the block diagram (functional block diagram). It is explanatory drawing of the property search condition input image of Example 1. FIG. It is the figure which showed the function of the property search server of the property search system shown in FIG. 1 with the block diagram (functional block diagram). It is explanatory drawing of the property registration image for performing the new registration of a property, the content change of a property, and the deletion of a property. It is explanatory drawing of the network for property searches. It is explanatory drawing of the network for a property search to which the node which shows a departure place, and the one-way link which goes from the node of a departure place to the departure walk area station were added. It is explanatory drawing in the case of searching the property registered in the unit map (mesh) of the position of a departure place, and its adjacent mesh. It is a flowchart of the property registration process of the property search server 3 of the property search system of Example 1. It is a main flowchart of the property search process of the property search server 3 of the property search system of Example 1. 11 is a flowchart of a property search process when using a transportation facility according to the first embodiment, and is a flowchart of a subroutine of ST32 in FIG. 12A is an explanatory diagram of a search result list, FIG. 12A is an explanatory diagram of a transportation use result list, FIG. 12B is an explanatory diagram of a walking result list, and FIG. 12C is an explanatory diagram of a final result list. It is a flowchart of the property search process at the time of a walk of Example 1, and is a flowchart of the subroutine of ST33 of FIG. It is a flowchart of the property search result creation process of Example 1, and is a flowchart of the subroutine of ST34 of FIG. FIG. 24 is an operation explanatory diagram of a search result by the property search system of Example 1 and corresponds to FIG. 23. FIG. 25 is an operation explanatory diagram of a search result obtained by the property search system according to the first embodiment and corresponds to FIG. 24. It is explanatory drawing of the property search network explaining the shortest required time from a departure place to the property by the property search system of Example 1. It is explanatory drawing of the position of the departure place of the specific example of the property search performed using the prior art of patent document 1, and the position of the searched property. It is explanatory drawing of the property search result list | wrist when a required time upper limit is set to 10 minutes and property search is performed using the prior art of patent document 1. FIG. It is explanatory drawing explaining the path | route and required time when moving from the departure place to the property 1 using the prior art which measures the required time between two points. It is explanatory drawing of the property search result list | wrist when a required time upper limit is set to 25 minutes and property search is performed using the prior art of patent document 1. FIG. It is explanatory drawing explaining the path | route and required time at the time of moving from the departure place to the property 2 using the prior art which measures the required time between two points. It is explanatory drawing of the calculation method of the required time from the departure place to the property 1 with the technique of patent document 1. FIG. It is explanatory drawing of the calculation method of the required time from the departure place to the property 2 with the technique of patent document 1. FIG.

Explanation of symbols

S ... Property search system,
SC1: Transportation related data storage means,
SC5b ... property search data storage means (property data storage means),
SC6a ... Property search condition data storage means,
SC7 ... Property search when using transportation,
SC7a ... Departure walk area station search means (departure place available station search means),
SC7b ... Departure walking area station travel time calculation means (departure station available station travel time calculation means),
SC7c: shortest travel route search means,
SC8 ... Property search means when walking,
SC9a ... required time discriminating means,
ta ... Time required for transportation,
tb: Time required on foot.

Claims (2)

The shortest time required for moving from the departure location to the location of the property using transportation based on the property location data that identifies the location of the property and the departure location data that identifies the location of the departure location A property search means when using a transportation facility that searches for a property whose travel time is within a predetermined upper limit of the required travel time,
Based on the property position data and the departure location data, the minimum time required for walking when moving from the departure location to the location of the property on foot is within a predetermined required time limit. On-walk property search means to search for a property,
Compare the time required for walking and the time required for using the transportation for the specific property searched by both the property searching means when using the transportation and the property searching means when walking, and the time required for walking A required time determining means for determining which required time is shorter than the required time when using the transportation facility;
A property search system characterized by The shortest time required for moving from the departure location to the location of the property using transportation based on the property location data that identifies the location of the property and the departure location data that identifies the location of the departure location A property search means when using a transportation facility that searches for a property whose travel time is within a predetermined upper limit of the required travel time,
Based on the property position data and the departure location data, the minimum time required for walking when moving from the departure location to the location of the property on foot is within a predetermined required time limit. On-walk property search means to search for a property,
Compare the time required for walking with the time required for using the transportation for the specific property searched by both the property searching means for transportation and the property searching means for walking, and the time required for walking A required time discriminating means for discriminating which of the required times when using the transportation is short,
If the transportation use property search means uses a transportation facility to move from the departure location to the location of the property, the transportation use time required for the transportation use time is within a predetermined required time upper limit. The property search step when using transportation to search,
The property search step for walking searches for the property whose walking time is within the predetermined upper limit of the required time when the walking property search means moves from the departure place to the property on foot. When,
The required time discriminating means compares the time required for walking and the time required for using the transportation with respect to the specific property searched in both the property searching step when using the transportation facility and the property searching step when walking. And a required time determining step for determining which of the required time for walking and the required time for using the transportation is shorter;
The property search method characterized by performing.

Images