JP2018010564A - Store search system and method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a counter and an ATM search system, a method, and a program that can reflect a searcher's orientation.SOLUTION: A store search system includes: means for receiving information on orientation toward cost and time, a preferred service, and a departure place from a searcher terminal; means for obtaining information on stores in the vicinity capable of handling the preferred service on the basis of the preferred service and departure place, the stores including at least one of a counter and an ATM; means for ranging the stores on the basis of the orientation toward cost and time; and means for transmitting information on the stores including a ranged order determined by the ranging means to the searcher terminal.SELECTED DRAWING: Figure 1

Description

  The present invention relates to a technique for searching a store window or ATM that reflects a searcher's intention.

  Currently, financial institutions such as banks are providing services that allow customers and users to search for a bank's main branch or ATM location using a website or smartphone app. For example, it guides a window or the like located in an area selected by a searcher such as a customer or a user, or guides a nearby window or the like such as an address or a station name input by the searcher. In addition, a service is provided that uses a GPS function of a smartphone to guide a window around a searcher's current location. In any search, it is assumed that the searcher is searching for a nearby window or ATM, and a window with a short distance to the place is presented as a search result.

JP 2002-236769 A

  However, the needs of searchers vary depending on the lifestyle of the person and the situation at that time. For example, some people would like to make effective use of time by giving priority to the processing being completed in the shortest time even if there is a fee or transportation fee, but they do not want to pay the fee or transportation fee even if it takes some time, or Some people think that it is better to make the time required as short as possible among the places where fees and transportation costs are minimized.

  Furthermore, in the case of a person who wants to make effective use of the above-mentioned time, if he / she is looking for a counter or ATM that not only has a short travel time to the counter or ATM, but also has a short waiting time until the service is processed at the counter etc. is assumed. On the other hand, it is assumed that a person who does not want to pay fees and transportation expenses as much as possible wants to know which window or ATM is the best deal. The waiting time of the bank varies depending on the time of day, day of the week, date, weather and the like. Bank fees are complex, for example, ATM usage fees vary depending on the time of day and day of the week on which transactions are made, and which bank account transactions (that is, which bank's cash card) are used for which bank It depends on whether you use ATMs. In addition, for example, the transfer fee differs depending on whether it is a bank or an ATM, as well as the bank or branch of the transfer destination, the transfer amount, the bank account of which transfer is in cash (that is, which bank's cash card) It depends on whether the transfer is made with In this way, the searcher has to investigate many things in order to find a window or ATM that meets his / her wishes, and it takes time and effort.

  The present invention has been made in view of such a problem, and the object of the present invention is to provide an in-store counter or ATM search system, method, and method that can reflect the needs and intentions of searchers. To provide a program.

  In order to achieve such an object, one aspect of the present invention provides means for receiving information on cost and time orientation, desired service, and departure place from a searcher terminal, the desired service, and the departure place. Based on the means for acquiring information on nearby stores that can handle the desired service, the store including at least one of a window and an ATM, and based on the cost and time orientation, Means for arranging stores, and means for transmitting to the searcher terminal information relating to stores including the order of arrangement determined by the means for arranging.

  According to the present invention, the cost (that is, the combined amount of the fee and the transportation fee) and the required time (that is, the combined time of the travel time and the waiting time) are taken into account according to the searcher's intention about the cost and time. Thus, it is possible to search for the window and ATM in the store.

1 is an overall schematic diagram according to an embodiment of the present invention. It is a functional block diagram of the store search system concerning one embodiment of the present invention. It is a functional block diagram of the store information system concerning one embodiment of the present invention. It is an example of the window and ATM database concerning one Embodiment of this invention. It is a figure for demonstrating the calculation method of the estimated waiting time concerning one Embodiment of this invention. It is an example of the fee database concerning one Embodiment of this invention. It is an example of the fee database concerning one Embodiment of this invention. It is a figure for demonstrating the determination method of the recommendation order concerning one Embodiment of this invention. It is a flowchart which shows an example of the processing flow in the shop search system concerning one Embodiment of this invention. It is an example of the screen concerning one Embodiment of this invention. It is an example of the screen concerning one Embodiment of this invention.

  Hereinafter, embodiments of the present invention will be described in detail with reference to the drawings. In this specification, “windows and ATMs” refers to exchanges faced with bank employees, etc., which are installed at any location such as a branch office or a convenience store such as a main branch or a branch office of a financial institution such as a bank. Includes manned counters, unattended counters that exchange videophones with employees, ATMs (automated teller machines) and other machines. That is, the “window and ATM” may be anything as long as it can receive services provided by financial institutions such as banks.

  FIG. 1 is an overall schematic diagram according to an embodiment of the present invention. The store search system 110 is a system for searching a store window and an ATM. The store search system 110 can receive data requesting a search from the searcher terminal 130 and transmit the search result data to the searcher terminal 130. Further, the store search system 110 can acquire data of information necessary for store search from the store information system 121 and the route search system 122. The store information system 121 and the route search system 122 may be included in the store search system 110.

  The searcher terminal 130 is a terminal used by a searcher searching for a window in a store or an ATM. Searcher terminal 130 is a communication terminal such as a smartphone having a GPS (global positioning system) function, for example. However, the searcher terminal 130 does not necessarily have a GPS function, and may be a personal computer or the like without a GPS function. The searcher terminal 130 can access the store search system 110 via a website or application software (for example, a smartphone application) installed on the searcher terminal 130.

  FIG. 2 is a functional block diagram of the store search system 110 according to the embodiment of the present invention.

  The receiving unit 201 can receive data for requesting a window and ATM search from the searcher terminal 130. The data requesting the search can include data indicating “cost and time orientation”. Further, the data requesting the search can include data indicating “service to be received at a window or ATM (hereinafter also referred to as desired service)” and data indicating “departure place”.

  “Cost and time orientation” is the ratio of how much searchers place importance on cost and time. For example, when the total is 100 and the ratio of “cost” to “time” is 0 to 100, only the short time is emphasized, and the cost is not emphasized at all. Further, when the ratio of “cost” to “time” is 100 to 0, only the low cost is emphasized, and the time is not emphasized at all. Further, when the ratio of “cost” to “time” is 50:50, it indicates that time and cost are equally emphasized. Further, when the ratio of “cost” to “time” is 20 to 80, it indicates that time is more important than cost, and time is more importantly four times the cost. For example, the searcher can operate the slide bar displayed on the screen of the searcher terminal 130 to designate “cost and time orientation” (see FIG. 10). Alternatively, the searcher can specify “cost and time orientation” by inputting a numerical value of the ratio into the searcher terminal 130. It should be noted that a neutral value (ie 50 to 50) can be the default value for “cost and time orientation”.

  The “desired service” is a transaction, procedure, consultation, etc. that the searcher wants to perform at a window or ATM, for example, opening a new account, transfer, consultation on asset management, etc., but is not limited thereto. The “desired service” data is used to extract ATMs and ATMs that can handle the service. The “desired service” data is used to calculate a fee. Therefore, the “desired service” data further includes information that may affect the fee (for example, the name of the bank and branch where the searcher's account is opened (that is, the name and bank name of the searcher's cash card). ), Bank name and branch name of the transfer destination, transfer amount, cash transfer or cash card transfer, etc.).

  “Departure location” is a departure location desired by the searcher. The “departure location” can be, for example, the current location of the searcher terminal 130 obtained by the GPS function of the searcher terminal 130. Alternatively, the searcher can designate the “departure place” by inputting or selecting an arbitrary place on the searcher terminal 130. Note that the current location of the searcher terminal 130 can be set as the default value of “departure location”.

  The receiving means 201 receives data from the searcher terminal 130 that requests to search only ATM, data that requests to search only the window, data that requests to search both ATM and window, etc. Data specifying a search target can be received. In this case, only the designated target is extracted as a search result.

  Before describing the window / ATM information acquisition means 202, first, the store information system 121 will be described with reference to FIG.

  FIG. 3 is a functional block diagram of the store information system 121 according to the embodiment of the present invention. The store information system 121 is a system in which one or a plurality of banks manage their own main branch office or other bank's counter, ATM information, waiting time information, and fee information (databases 302 to 305). It is. That is, in the present invention, not only one bank but also a plurality of bank windows and ATMs can be searched. The transmission / reception means 301 can transmit data in the databases 302 to 305 to the store search system 110 in response to a request received from the store search system 110. Note that one of the plurality of banks that manage the store information system 121 may operate the store search system 110. Alternatively, a person other than the bank managing the store information system 121 (that is, a third party who is not any bank) may operate the store search system 110.

  The counter of the store information system 121 and the ATM database 302 are databases that store information on the counters of ATMs and branches of financial institutions such as banks and ATMs. As shown in FIG. 4, the window and ATM database 302 includes information for identifying the window and ATM (for example, store name, financial institution code, store number, etc.), address (or longitude / Latitude), business hours by day of the week, and data indicating services handled at the window or ATM. In the case where the handling service varies depending on the day of the week or the time zone, data indicating the handling service may be stored for each day of the week or the time zone.

  Returning to FIG. The window / ATM information acquisition unit 202 can acquire information on nearby windows and ATMs (hereinafter also referred to as candidate stores) that provide services that the searcher wants to receive from the store information system 121. Specifically, the window / ATM information acquisition unit 202 extracts the window and ATM that can handle the “desired service at the window or ATM” received by the reception unit 201 from the store information system 121. Can be requested. Further, the window / ATM information acquisition unit 202 can request the store information system 121 to extract the window and ATM in the vicinity of the “departure place” received by the reception unit 201. Here, the nearby window and ATM are, for example, a window and ATM whose distance from the “departure place” is a predetermined distance or less, a window and ATM whose movement time from the “departure place” is less than a predetermined movement time, “ The “departure place” is a window or ATM that exists in an area such as a prefecture or a municipality where the “departure place” is located, and may be any window and ATM within a predetermined range from the “departure place”. Further, the window / ATM information acquisition unit 202 requests the store information system 121 to extract the window and ATM that are currently in business hours (or within the service hours of the service that the searcher wants to receive). be able to. In response to these requests, the store information system 121 refers to the window and ATM database 302 and extracts the window and ATM. The counter / ATM information acquisition unit 202 can receive data indicating the address, business hours, and handling service of the extracted counter and ATM (that is, candidate stores) from the store information system 121.

  The route search means 203 can acquire information on travel time and transportation costs to the candidate store from the route search system 122. Specifically, the route search unit 203 sends the route search system 122 to the travel time from the “departure place” received by the receiving unit 201 to the candidate store, and travel costs (such as bus and train fares). Such charges). The route search system 122 is a system for managing timetables such as buses and trains, information on fares, transfers, boarding times, etc., information on travel times of walking, bicycles and cars, etc., and traveling from the departure point to the destination. It is a system that can calculate time and transportation costs. In addition, in the “cost and time orientation” received by the receiving unit 201, when the cost is more important than the time at a predetermined ratio or more, the route search only by walking can be executed.

  The waiting time calculating means 204 can calculate the expected waiting time (expected waiting time) at the estimated arrival time at the candidate store. Specifically, the waiting time calculation unit 204 can calculate the estimated arrival time by adding the travel time acquired by the route search unit 203 to the current time. In addition, the waiting time calculating unit 204 can inquire the store information system 121 about a waiting time (hereinafter also referred to as an expected value) calculated based on the past waiting time tendency at the estimated arrival time. In addition, the waiting time calculation unit 204 can inquire the store information system 121 about the current waiting time (hereinafter also referred to as an actual measurement value). In response to these inquiries, the store information system 121 refers to the waiting time (predicted value) database 303 and the waiting time (actual value) database 304 to extract the predicted value and the actually measured value. In addition, the waiting time calculating unit 204 can calculate the expected waiting time by adding the actually measured value at the current time to the expected value at the estimated arrival time. Note that the waiting time calculating means 204 can also determine whether the estimated arrival time is within the handling time of the service that the searcher wants to receive.

  Here, the expected value uses machine learning technology to analyze the past waiting time data of the window and ATM, and capture the trend of waiting time that varies depending on the time zone, day of the week, date, weather, etc. It is the waiting time at each window and each ATM at each time predicted based on these trends. The actual measurement value is the waiting time at the current time measured at each window and each ATM. In addition, when there are multiple windows and ATMs (for example, windows for each handling service) in one branch or branch office, the service desired by the searcher is managed by managing the predicted value and actual measurement value for each window. You may make it calculate the expected waiting time of the window etc. according to. Hereinafter, a detailed calculation method will be described with reference to FIG.

Referring to FIG. 5, the expected values at the estimated arrival times are 10 minutes for branch D, 1 minute for branch E, 10 minutes for branch F, 1 minute for branch G, 10 minutes for branch H, and 1 minute for branch I. Minutes. The measured values at the current time (12:00) are 1 minute for branch D, 10 minutes for branch E, 1 minute for branch F, and 10 minutes for branch G. When the current waiting time can be measured such as D branch, E branch, F branch, and G branch, the expected waiting time is calculated by adding the actual measurement value to the predicted value. Specifically, if the difference between the predicted value and the actually measured value is large with respect to the travel time, there is a high possibility that an error will occur between the predicted value and the time that the searcher actually waits. Therefore, the expected waiting time is calculated by adjusting the expected value. That is, when the difference between the predicted value and the actual measurement value is 9 minutes as in the D branch and the E branch, there is a high possibility that an error will occur if the travel time is only 1 minute. However, even if the difference between the predicted value and the actual measurement value is 9 minutes as in the F branch and G branch, there is a low possibility that an error will occur if the travel time is 30 minutes. Therefore, if the ratio of “difference between expected value and actual value” to “travel time” (that is, “difference between expected value and actual value” ÷ “travel time”) is greater than or equal to a predetermined value, the actual value will Add value.
For example, “expected value” multiplied by “a coefficient corresponding to the ratio of“ difference between expected value and measured value ”to“ travel time ”” can be used as the expected waiting time. When the current waiting time cannot be measured as in branch I, the expected value becomes the expected waiting time (expected value = expected waiting time).

  Returning to FIG. The fee calculation means 205 can calculate the fee at the estimated service start time (the time at which the searcher is expected to start receiving the service). Specifically, the fee calculation means 205 can calculate the expected service start time by adding the expected waiting time calculated by the waiting time calculation means 204 to the estimated arrival time. Further, the fee calculation means 205 can inquire the store information system 121 about the fee at the service start expected time at the candidate store of the service that the searcher wants to receive. In response to this inquiry, the store information system 121 refers to the fee database 305 and extracts the fee. In this way, in the present invention, since the fee at the estimated service start time is calculated, it is possible to prevent a situation in which the fee that has been checked in advance is different from the fee that actually arrived at the window or ATM. .

  In the fee database 305, for example, ATM usage fee data is stored as shown in FIG. The ATM usage fee is determined according to the time zone and day of the week when the transaction is performed, and according to which bank's ATM is used for transactions with which bank account (that is, which bank's cash card is used). Therefore, the fee is extracted based on the relationship between the “bank name where the account of the searcher is opened (that is, the bank name of the searcher's cash card)” received by the receiving means 201 and the bank name of the candidate store. Can be done. In addition, a fee can be extracted based on the day of the week or the time zone.

  Further, for example, as shown in FIG. 7, transfer fee data is stored in the fee database 305. The transfer fee depends on whether it is a cashier or ATM, by the bank or branch of the transfer destination, the transfer amount, and in which bank account (that is, which bank's cash card) the transfer is in cash. It is determined by whether it is a transfer. For this reason, the receiving means 201 receives “the bank name and branch name where the account of the searcher is opened (that is, the bank name and branch name of the cash card of the searcher)” “the bank name and branch name of the transfer destination” “ The fee can be extracted based on “transfer amount” “whether it is transfer by cash or cash card”.

  Returning to FIG. The recommendation rank determination means 206 can arrange candidate stores in the recommended order (that is, the order reflecting the searcher's cost and time orientation) according to the searcher's cost and time orientation. Specifically, the recommended rank determining means 206 determines the required time (that is, the total of travel time and expected waiting time) and cost (that is, the sum of fees and transportation costs) of each window and each ATM that are candidate stores. The recommended ranking can be determined based on the total time of the time converted into time. Hereinafter, a detailed determination method will be described with reference to FIG.

  Referring to FIG. 8, the required time (travel time + expected waiting time) and cost of each window and candidate ATM (D branch, E branch, F branch, G branch, H branch, I branch) that are candidate stores. (Fee + transportation cost) is calculated. The travel time is the travel time acquired by the route search means 203. The expected waiting time is the expected waiting time calculated by the waiting time calculating means 204. The fee is a fee calculated by the fee calculation means 205. The transportation cost is the transportation cost acquired by the route search means 203. First, the recommendation order determination unit 206 can determine the conversion coefficient α determined according to the “cost and time orientation” received by the reception unit 201. The conversion factor α can be made closer to zero as the time-oriented (that is, it is desired that the required time is short) is stronger. The conversion coefficient α can be determined by a demonstration experiment or the like. Next, the recommendation rank determination unit 206 can convert the cost into time by multiplying the cost (fee + transportation cost) by the conversion coefficient α. Next, the recommended rank determining means 206 can add up the required time (travel time + waiting time) and the cost converted into time (that is, the value obtained by multiplying the cost by the conversion coefficient α) (hereinafter referred to as the cost). , The total is also referred to as the “time required to reflect the intention”). Next, the recommended rank determination means 206 can arrange candidate stores in order from a window or ATM with a short required reflected time. Note that the recommended rank determining unit 206 can also determine the recommended rank so that the bank of the searcher's account is ranked higher.

  In this way, different units of “time” and “cost” are managed as a single unit. In the example, the unit is “time”, but it may be unified to the unit of “cost”. Note that the conversion coefficient α may be uniformly set for all searchers (for example, α = 0 when only time is important, and α = 0. 05, α = 0.1 or the like when only the cost is emphasized), or may be determined for each searcher (for example, α = 0.1 and the searcher B when the searcher A focuses only on the cost) However, if only the cost is important, α = 0.2).

  Returning to FIG. The transmission unit 207 can transmit the search result to the searcher terminal 130. That is, the transmission unit 207 can display the candidate stores on the searcher terminal 130 in the order determined by the recommendation rank determination unit 206. Specifically, the transmission means 207 can transmit map data showing the searched window or ATM location. The transmission unit 207 can also transmit information on the route (direction) from the departure place to the window acquired from the route search system 122. Moreover, the transmission means 207 can also transmit information on required time (travel time and expected waiting time) and expected service start time. Moreover, the transmission means 207 can also transmit the information of expense (a commission and transportation expenses). The store search system 110 can also use map data of an arbitrary map database outside the store search system 110 without using the map data in the map database 208. Information transmitted by the transmission means 207 is displayed on the screen of the searcher terminal 130. (See FIG. 11). In addition, when the arrival is delayed, it may be displayed together with the search result that there is a possibility that the fee may change or that the window or ATM business hours may be over.

  Note that the transmission unit 207 sends only “information for identifying candidate stores (for example, store name, financial institution code, store number, etc.)” and “recommended rank determined by the recommended rank determination unit 206” to the searcher terminal 130. You may make it transmit. In this case, the searcher terminal 130 can acquire information necessary for the searcher (for example, the address of the candidate store, business hours, etc.) from the store search system 110 (or another system). Alternatively, the searcher terminal 130 can refer to information on candidate stores (ie, candidate store addresses, business hours, etc.) stored in advance in the searcher terminal 130.

  FIG. 9 is a flowchart illustrating an example of a processing flow in the store search system 110.

  In step 901, the store search system 110 receives data indicating “cost and time orientation” from the searcher terminal 130.

  In step 902, the store search system 110 receives data indicating “desired service” and “departure location” from the searcher terminal 130. Step 901 and step 902 may be reversed in order or performed simultaneously.

  In step 903, the store search system 110 receives data indicating information on nearby windows and ATMs (candidate stores) from the store information system 121. Specifically, the store search system 110 is a window and ATM that can handle the “desired service” received in step 902, and is a window and ATM in the vicinity of the “departure place” received in step 902. In addition, data indicating information on the window and ATM that are currently in business hours (or within the service handling time of the service that the searcher wants to receive) is received.

  In step 904, the store search system 110 acquires travel time and transportation cost information to the candidate store from the route search system 122. Specifically, the store search system 110 receives data indicating the travel time from the “departure place” received in step 902 to the candidate store, and the transportation cost.

  In step 905, the store search system 110 calculates the expected waiting time (expected waiting time) at the estimated arrival time at the candidate store. Specifically, the store search system 110 calculates the estimated arrival time by adding the travel time acquired in step 904 to the current time. Next, the store search system 110 receives from the store information system 121 data indicating the waiting time (predicted value) calculated based on the past waiting time tendency at the estimated arrival time. Further, the store search system 110 receives the current waiting time (actually measured value) from the store information system 121. Thereafter, the store search system 110 calculates the expected waiting time by adding the actual value at the current time to the expected value at the estimated arrival time.

  In step 906, the store search system 110 calculates a fee at an estimated service start time (a time at which the searcher is expected to start receiving the service). Specifically, the store search system 110 calculates the expected service start time by adding the expected waiting time calculated in step 905 to the estimated arrival time. Next, the store search system 110 receives, from the store information system 121, data indicating the fee at the service start expected time at the “candidate store” acquired at step 903 of the “desired service” received at step 902. .

  In step 907, the store search system 110 arranges the candidate stores in the recommended order according to the cost and time orientation of the searcher. Specifically, the store search system 110 calculates the required time (that is, the total of travel time and expected waiting time) and cost (that is, fee and traffic) for each window and each ATM that are candidate stores acquired in step 903. The recommended ranking is determined based on the total time with the total cost) converted into time. For the process of determining the recommended order, the data indicating “cost and time orientation” received in step 901 is used.

  In step 908, the store search system 110 displays the candidate stores acquired in step 903 on the searcher terminal 130 in the order determined in step 907. Specifically, the store search system 110 transmits map data indicating the searched window or ATM location. Further, the store search system 110 includes data indicating the route information from the departure place to the window acquired from the route search system 122, the required time (travel time and expected waiting time) acquired and calculated in steps 904 and 905, and services. It is also possible to transmit data indicating information on the estimated start time and data indicating information on the expenses (fees and transportation costs) acquired and calculated in steps 904 and 906. As described above, the window and ATM are searched.

  Further, the searcher can select a window (or ATM) from the search results displayed on the searcher terminal 130 and make a reservation for visiting the window (or ATM). Specifically, data indicating the service that the searcher wants to receive, data indicating the visit time (ie, estimated arrival time), etc. are transmitted from the searcher terminal 130 to a server (not shown) of the store reservation system of the financial institution. Then, reservation processing is performed.

<Other embodiments>
Hereinafter, as another embodiment, an embodiment in which the searcher terminal 130 performs the same operation as the recommended rank determination unit 206 of the store search system 110 will be described. The searcher terminal 130 can include a storage medium that stores a program (for example, a smartphone application) for performing the same operation as the recommended rank determination unit 206.
I do

  Searcher terminal 130 transmits data indicating “service to be received at a window or ATM” and data indicating “departure point” to store search system 110 (that is, searcher terminal 130 stores store search system 110. Do not send data indicating "cost and time orientation"). Thereafter, as described above, the store search system 110 obtains information on nearby windows and ATMs, performs route search, calculates expected waiting time, and calculates fees (that is, steps 903 to 906 in FIG. 9). . Thereafter, the store search system 110 informs the searcher terminal 130 of information on each window and each ATM that is a candidate store (store name, location, etc.) and the required time of each candidate store (that is, travel time and expected waiting time). And data indicating costs (that is, fees and transportation costs).

  As described in the description of the recommendation order determining means 206 of the store search system 110, the searcher terminal 130 recommends the order according to the searcher's cost and time orientation (that is, the searcher's cost and time orientation). Candidate stores can be arranged in an order that reflects Specifically, the searcher terminal 130 can determine the conversion coefficient α determined in accordance with the “cost and time orientation” input to the searcher terminal 130. Next, the searcher terminal 130 can convert the cost into time by multiplying the cost (fee + transportation cost) by the conversion coefficient α. Next, the searcher terminal 130 can add up the required time (travel time + waiting time) and the cost converted into time (that is, a value obtained by multiplying the cost by the conversion coefficient α) (hereinafter, referred to as “cost”). The total is also referred to as the “time required to reflect the intention”). Next, the searcher terminal 130 can arrange candidate stores in order from a window or ATM with a short required reflected time. Then, candidate stores are displayed on the screen of the searcher terminal 130 in the order reflecting the searcher's expense and time orientation. The searcher terminal 130 can also determine the recommended order so that the bank of the searcher's account is higher. In the example, the unit is “time”, but it may be unified to the unit of “cost”.

  Thus, in <another embodiment>, the searcher terminal 130 may arrange candidate stores according to the cost and time orientation based on the required time and cost of the candidate store received from the store search system 110. it can. For this reason, the searcher can easily rearrange the candidate stores in a new order by looking at the search results and changing the cost and time orientation.

  In this specification, the travel time, the estimated waiting time, the fee, and the transportation cost are calculated based on the search date and time (that is, the current time). Based on the input date and time, it may be possible to calculate the travel time, the expected waiting time, the fee, and the transportation cost.

  In this way, in the present invention, a window or ATM corresponding to the searcher's cost and time orientation is searched based on the service and departure place that the searcher wants to receive. Therefore, the searcher does not have to calculate a complicated fee by himself or check the transportation cost and travel time.

  The embodiment of the present invention has been described so far. However, the above embodiment is merely an example, and the present invention is not limited to the above-described embodiment, and may be implemented in various forms within the scope of the technical idea. Needless to say, it is good.

  In addition, the scope of the present invention is not limited to the illustrated and described exemplary embodiments, and includes all embodiments that provide the same effects as those intended by the present invention. Further, the scope of the invention is not limited to the combinations of features of the invention defined by the claims, but may be defined by any desired combination of particular features among all the disclosed features. .

110 Store Search System 121 Store Information System 122 Route Search System 130 Searcher Terminal 201 Receiving Unit 202 Window / ATM Information Acquisition Unit 203 Route Search Unit 204 Wait Time Calculation Unit 205 Fee Calculation Unit 206 Recommended Order Determination Unit 207 Transmission Unit 208 Map Database 301 Transmission / reception means 302 Counter and ATM database 303 Waiting time (expected value) database 304 Waiting time (actual value) database 305 Fee database

Claims (11)

A means of receiving cost and time preferences, desired services, and departure location information from the searcher terminal;
Means for obtaining information of nearby stores capable of handling the desired service based on the desired service and the departure place, wherein the store includes at least one of a window and an ATM;
Means for arranging at least one of the neighboring store information based on the cost and time orientation;
Means for transmitting to the searcher terminal information relating to a store including the arrangement order determined by the arrangement means. Means for receiving desired service and departure location information from the searcher terminal;
Means for obtaining information of nearby stores capable of handling the desired service based on the desired service and the departure place, wherein the store includes at least one of a window and an ATM;
Means for transmitting information on the nearby stores to the searcher terminal;
A store search system comprising: a means for causing the searcher terminal to arrange at least one piece of information on the nearby stores based on cost and time orientation. The store search system further includes:
Means for obtaining travel time and transportation costs from the departure place to the store;
Means for calculating an expected waiting time at the estimated arrival time based on the travel time;
Means for calculating a fee for the desired service at a predicted service start time based on the expected waiting time,
The means for arranging at least one of the information on the neighboring stores or the means for arranging at least one of the information on the neighboring stores,
The at least one of the neighboring store information is arranged based on the cost and time orientation, the travel time, the expected waiting time, the transportation cost, and the fee. The store search system according to 1 or 2.   The means for arranging at least one of the information on the neighboring stores or the means for arranging at least one of the information on the neighboring stores is a sum of the travel time and the expected waiting time in accordance with the cost and time orientation. The cost is converted into time by multiplying the cost by the factor, or the cost is converted into time by multiplying the sum of the transportation cost and the fee by a factor according to the cost and time orientation. The store search system according to claim 3, wherein at least one of the store information is arranged.   5. The store search system according to claim 3, wherein the means for calculating the expected waiting time adds a current measured value to an estimated value calculated by machine learning. The means for receiving further receives information of a searcher's account,
6. The store search system according to claim 3, wherein the fee is calculated based on a relationship between a financial institution of the searcher's account and a financial institution of the searched store. A method executed by a store search system,
Receiving cost and time preferences, desired services, and origin information from the searcher terminal;
Obtaining information on nearby stores that can handle the desired service based on the desired service and the departure location, the store including at least one of a window and an ATM; and
Arranging at least one of the neighboring store information based on the cost and time orientation;
Transmitting to the searcher terminal information relating to the store including the order of arrangement determined in the arranging step. The method further comprises:
Obtaining travel time and transportation costs from the departure location to the store;
Calculating an expected waiting time at the estimated arrival time based on the travel time;
Calculating a fee for the desired service at a predicted service start time based on the expected waiting time, and
The step of arranging at least one of the information of the neighboring stores is to convert time into cost by multiplying the sum of the travel time and the expected waiting time by a factor corresponding to the cost and time orientation, or Converting the cost into time by multiplying one of the sum of the transportation cost and the fee by a factor according to the cost and time orientation, and arranging at least one of the information of neighboring stores. The method according to claim 7.   9. The method according to claim 8, wherein the step of calculating the expected waiting time includes adding a current measured value to an estimated value calculated by machine learning. The method further comprises receiving information of the searcher's account;
The method according to claim 8 or 9, wherein the fee is calculated based on a relationship between a financial institution of the searcher's account and the searched window and an ATM financial institution. A program for causing a searcher terminal to execute a store search, wherein the store search is:
Specifying the desired service and departure location information and sending it to the store search system;
Receiving, from the store search system, information on stores near the departure place that can handle the desired service, the store including at least one of a window and an ATM;
Arranging at least one piece of information of the neighboring stores on the basis of cost and time orientation.

Images