Commuting route simulation system

The system optimizes commuting route simulations by remembering nearest station information and reducing server requests, ensuring efficient calculation of transportation costs and adherence to corporate payment rules.

JP7623663B1Active Publication Date: 2025-01-29BAIT AL HIKMA
View PDF 4 Cites 0 Cited by

Patent Information

Application Number
JP2024100129
Authority / Receiving Office
JP · JP
Patent Type
Patents
Current Assignee / Owner
Filing Date
2024-06-21
Publication Date
2025-01-29
Estimated Expiration
2044-06-21

AI Technical Summary

Technical Problem

Existing commuting route simulation systems fail to efficiently calculate transportation costs when multiple stations are near the home or workplace, leading to increased search costs and requests due to the need to consider various routes and corporate payment rules.

Method used

A system that remembers nearest station information for employees, reduces the number of requests by sending a single request to a search server for multiple stations, and generates simulation results based on route information and payment regulations.

Benefits of technology

Reduces the number of requests to search servers and provides accurate simulation results considering the routes and payment rules, thereby optimizing commuting route simulations.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 0007623663000001_ABST
    Figure 0007623663000001_ABST
Patent Text Reader

Abstract

To provide a commuting route simulation system suitable for obtaining desired simulation results by suppressing the number of requests when there are a plurality of stations closest to a home or workplace. SOLUTION: Commuting travel expense calculation server 100 acquires the nearest station information to the home and nearest station information to the target workplace for each of multiple target employees, and if there are multiple nearest stations to the home and nearest stations to the target workplace for one target employee based on the acquired nearest station information, sends a request to route search server 130 in which the multiple nearest stations to the target employee's home are set as departure stations and the multiple nearest stations to the target workplace are set as arrival stations, and acquires route information and fare information for each target employee from route search server 130. Then, it generates a simulation result for the commuting route based on the acquired route information and fare information.
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

[0001] The present invention relates to a system for simulating a commute route, and more particularly to a commute route simulation system that is suitable for reducing the number of requests and obtaining desired simulation results when there are multiple stations closest to a home or workplace. [Background technology]

[0002] Conventionally, as a technique for simulating commuting expenses, for example, the technique described in Patent Document 1 is known.

[0003] The technology described in Patent Document 1 includes a destination information acquisition unit that acquires destination information including location information of a first and second destination; a mover information acquisition unit that acquires mover information including location information of departure points of multiple movers; a travel cost information acquisition unit that acquires, based on the destination information and the mover information, first travel cost information including the travel cost of each mover when the multiple movers travel between their respective departure points and the first destination, and second travel cost information including the travel cost of each mover when the multiple movers travel between their respective departure points and the second destination; and a destination-specific travel cost information generation unit that statistically processes the first and second travel cost information, respectively, to generate first destination-specific travel cost information and second destination-specific travel cost information. [Prior art documents] [Patent documents]

[0004] [Patent Document 1] Patent Publication No. 2022-20799 Summary of the Invention [Problem to be solved by the invention]

[0005] However, in the technology described in Patent Document 1, when there are multiple stations nearest to the home or workplace of a traveler, it is not possible to calculate the desired travel cost. For example, it is not possible to calculate the travel cost taking into account the route of each nearest station, or the travel cost according to the company's commuting transportation allowance regulations. In addition, when searching for a route using a search server, requests are sent for each user, the number of nearest stations to the home x the number of nearest stations to the workplace. For example, if there are two nearest stations to the home and two nearest stations to the workplace, 2 x 2 = 4 requests are sent. This increases the search load, and if a usage fee is set according to the number of requests, the search cost increases.

[0006] Therefore, the present invention has been made by focusing on the unresolved problems associated with such conventional technology, and aims to provide a commuter route simulation system that is suitable for reducing the number of requests and obtaining the desired simulation results when there are multiple stations closest to one's home or workplace. [Means for solving the problem]

[0007] [Invention 1] In order to achieve the above object, the commuting route simulation system of invention 1 includes a first nearest station information acquisition means for acquiring nearest station information for the home of each of a plurality of target employees from a storage means for storing nearest station information for the home of each of a plurality of employees belonging to a company, a second nearest station information acquisition means for acquiring nearest station information for the target workplace from a storage means for storing nearest station information for the nearest station to the workplace of the company, and a nearest station information acquisition means for acquiring nearest station information for the target workplace of the company based on the nearest station information acquired by the first nearest station information acquisition means and the second nearest station information acquisition means. and a simulation result generation means for generating a simulation result of a commuting route based on the route information acquired by the route information acquisition means, wherein when there are multiple nearest stations to the home of a target employee and the target workplace of a target employee, the route information acquisition means sends a request to the search server in which the multiple nearest stations to the home of the target employee are set as one of the departure station and arrival station, and the multiple nearest stations to the target workplace are set as the other of the departure station and arrival station.

[0008] In this configuration, the first nearest station information acquisition means acquires nearest station information to the home of each of the multiple target employees, and the second nearest station information acquisition means acquires nearest station information to the target workplace. Next, the route information acquisition means causes the search server to search for a route between the nearest station to the home of the target employee and the nearest station to the target workplace for each target employee based on the acquired nearest station information, and route information regarding the route is acquired from the search server. At this time, if there are multiple nearest stations to the home of a target employee and the nearest station to the target workplace, a request is sent to the search server in which multiple nearest stations to the home of the target employee are set as one of the departure station and the arrival station, and multiple nearest stations to the target workplace are set as the other of the departure station and the arrival station. Then, the simulation result generation means generates a simulation result based on the acquired route information.

[0009] Here, the route information includes, for example, route information regarding a route when using public transportation.

[0010] In addition, the "station" in the term "nearest station" refers to a place used for passengers to board and disembark or for loading and unloading cargo, and includes, for example, railway stations and bus stops.

[0011] The storage means stores the nearest station information by any means and at any time, and may store the nearest station information in advance, or may store the nearest station information by input from outside during operation of the system without storing the nearest station information in advance. The same applies to other storage means below.

[0012] The system may be realized as a single device, terminal, or other equipment, or as a network system in which multiple devices, terminals, or other equipment are communicatively connected. In the latter case, each component may belong to any one of the multiple devices, etc., as long as they are communicatively connected to each other.

[0013] [Invention 2] Furthermore, the commuter route simulation system of Invention 2 is the commuter route simulation system of Invention 1, where, when there is one nearest station to the home of one of the target employee and multiple nearest stations to the target workplace, the route information acquisition means sends to the search server a request in which the one nearest station to the target employee's home is set as one of the departure station and arrival station, and multiple nearest stations to the target workplace are set as the other of the departure station and arrival station.

[0014] With this configuration, if there is one nearest station to the home of a target employee and multiple nearest stations to the target workplace, the route information acquisition means sends a request to the search server in which the nearest station to the target employee's home is set as one of the departure station and arrival station, and multiple nearest stations to the target workplace are set as the other of the departure station and arrival station.

[0015] [Invention 3] Furthermore, the commuter route simulation system of Invention 3 is the commuter route simulation system of Invention 1, wherein when there are multiple nearest stations to the home of one of the target employee and one nearest station to the target workplace, the route information acquisition means sends to the search server a request in which the multiple nearest stations to the home of the target employee are set as one of the departure station and arrival station, and the one nearest station to the target workplace is set as the other of the departure station and arrival station.

[0016] With this configuration, if there are multiple nearest stations to the home of a target employee and one nearest station to the target workplace, the route information acquisition means sends a request to the search server in which the multiple nearest stations to the target employee's home are set as one of the departure station and arrival station, and the one nearest station to the target workplace is set as the other of the departure station and arrival station.

[0017] [Invention 4] Furthermore, the commuter route simulation system of Invention 4, in the commuter route simulation system of any one of Inventions 1 to 3, further comprises a payment regulations information acquisition means for acquiring payment regulations information related to the company's commuter transportation expense payment from a storage means which stores the payment regulations information, and the route information acquisition means sets route search conditions based on the payment regulations information acquired by the payment regulations information acquisition means, and transmits the request including the set route search conditions to the search server.

[0018] With this configuration, payment regulation information is acquired by the payment regulation information acquisition means, route search conditions are set based on the acquired payment regulation information by the route information acquisition means, and a request including the set route search conditions is sent to the search server.

[0019] [Invention 5] Furthermore, the commuter route simulation system of Invention 5, in the commuter route simulation system of any one of Inventions 1 to 3, further comprises: payment regulations information acquisition means for acquiring payment regulations information from a storage means which stores payment regulations information regarding the company's commuter expense payment, and when the route information acquisition means acquires the route information regarding multiple routes for one of the target employee, route determination means for determining from the multiple routes one that satisfies standards regarding commuter expense payment based on the payment regulations information acquired by the payment regulations information acquisition means, and the simulation result generation means generates a simulation result of the commuter route based on the route information regarding the route determined by the route determination means.

[0020] In this configuration, when the payment regulation information acquisition means acquires payment regulation information and the route determination means acquires route information related to multiple routes for one target employee, a route that meets the criteria for commuter transportation allowance payment is determined from the multiple routes based on the acquired payment regulation information. Then, the simulation result generation means generates a simulation result based on the route information related to the determined route.

[0021] [Invention 6] Furthermore, the commuter route simulation system of Invention 6 is the commuter route simulation system of any one of Inventions 1 to 3, wherein the second nearest station information acquisition means acquires nearest station information for each of a plurality of target workplaces of the company from a storage means which stores nearest station information related to the nearest station for each of the plurality of workplaces of the company, the route information acquisition means searches for a route between the nearest station to the home of the target employee and the nearest station to the target workplace for each of the target workplaces and for each of the target employees using a search server and acquires route information related to the route from the search server, and when there are a plurality of nearest stations to the home of one of the target employees and a plurality of nearest stations to one of the target workplaces, the route information acquisition means transmits a request to the search server in which the plurality of nearest stations to the home of the target employee are set as one of the departure station and arrival station and the plurality of nearest stations to the target workplace are set as the other of the departure station and arrival station.

[0022] In this configuration, the second nearest station information acquisition means acquires nearest station information for each of the multiple target workplaces.Then, the route information acquisition means causes the search server to search for a route between the nearest station to the target employee's home and the nearest station to the target workplace for each target workplace and each target employee, and acquires route information related to the route from the search server.At this time, if there are multiple nearest stations to the home of a target employee and the nearest station to a target workplace, a request is sent to the search server in which multiple nearest stations to the target employee's home are set as one of the departure station and arrival station, and multiple nearest stations to the target workplace are set as the other of the departure station and arrival station.

[0023] [Invention 7] Furthermore, the commuter route simulation system of Invention 7 is the commuter route simulation system of any one of Inventions 1 to 3, wherein the second nearest station information acquisition means acquires nearest station information for each of a plurality of target workplaces of the company from a storage means which stores nearest station information related to the nearest station for each of the plurality of workplaces of the company, the route information acquisition means searches for a route between the nearest station to the home of the target employee and the nearest station to the target workplace by a search server and acquires route information related to the route from the search server, and when there are multiple nearest stations to the home of one of the target employee, the route information acquisition means transmits a request to the search server in which the multiple nearest stations to the home of the target employee are set as one of the departure station and arrival station and the nearest stations to the multiple target workplaces are set as the other of the departure station and arrival station.

[0024] With this configuration, the second nearest station information acquisition means acquires nearest station information for each of the multiple target workplaces.Then, the route information acquisition means causes the search server to search for a route between the nearest station to the target employee's home and the nearest station to the target workplace for each target workplace and each target employee, and acquires route information related to the route from the search server.At this time, if there are multiple nearest stations to a target employee's home, a request is sent to the search server in which multiple nearest stations to the target employee's home are set as one of the departure station and arrival station, and multiple nearest stations to the target workplaces are set as the other of the departure station and arrival station. Effect of the Invention

[0025] As described above, according to the commuting route simulation system of the first aspect, when there are multiple nearest stations to the home and workplace of a target employee, one request is sent to the search server, so the number of requests can be reduced. Also, a simulation result is obtained that takes into account the routes connecting the multiple nearest stations to the home and the multiple nearest stations to the target workplace.

[0026] Furthermore, according to the commuting route simulation system of the second aspect, when a target employee has one nearest station to his / her home and multiple nearest stations to his / her workplace, only one request is sent to the search server, so the number of requests can be reduced. Also, the simulation results can be obtained by considering the routes connecting the nearest station to the home and the multiple nearest stations to the target workplace.

[0027] Furthermore, according to the commuting route simulation system of the third aspect, when a target employee has multiple nearest stations to his / her home and only one nearest station to his / her workplace, only one request is sent to the search server, so the number of requests can be reduced. Also, the simulation results can be obtained that take into account the routes connecting the multiple nearest stations to the home and the nearest station to the target workplace.

[0028] Furthermore, according to the commute route simulation system of the fourth aspect, route search conditions are set based on payment regulations information regarding the payment of corporate commuter transportation expenses, so that simulation results that take into account the payment of corporate commuter transportation expenses can be obtained.

[0029] Furthermore, according to the commuting route simulation system of Invention 5, the route that meets the criteria for commuting allowances from among multiple routes is determined based on the payment regulations information regarding the company's commuting allowances, so that simulation results that take into account the company's commuting allowances can be obtained.

[0030] Furthermore, the commuting route simulation system of the sixth or seventh aspect of the present invention can reduce the number of requests when there are multiple target workplaces. Also, it can obtain simulation results that take into account routes connecting multiple nearest stations to the home and multiple nearest stations to each of the multiple target workplaces.

[0031] Furthermore, according to the commuting route simulation system of Invention 7, a request is sent to the search server in which multiple stations closest to the target employee's home are set as one of the departure and arrival stations, and multiple stations closest to the target workplace are set as the other of the departure and arrival stations, thereby making it possible to reduce the number of requests compared to Invention 6. [Brief description of the drawings]

[0032] [Figure 1] 1 is a block diagram showing a configuration of a network system according to an embodiment of the present invention; [Diagram 2] FIG. 2 is a diagram showing a hardware configuration of a commute expense calculation server 100. [Diagram 3] 4 shows the data structures of a company master table 400, a workplace master table 402, an employee information master table 404, an employee-specific route information table 406, and an employee-specific payment information table 408. [Figure 4]4A and 4B are diagrams showing the data structures of an employee-by-daily-proration-payment-information table 410, a department information table 412, a freight information table 414, a payment regulations information table 416, and a search result information table 418. [Diagram 5] 13 is a flowchart showing a commute route simulation process. [Figure 6] This is a screen for selecting target employees and target workplaces. [Figure 7] 13 is a screen showing the results of a simulation of a commuting route. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0033] BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a block diagram showing an embodiment of the present invention; FIG. In this embodiment, the term "employee" refers to a full-time employee, a part-time employee, or any other employee.

[0034] 〔composition〕 First, the configuration of this embodiment will be described. FIG. 1 is a block diagram showing a configuration of a network system according to the present embodiment.

[0035] As shown in FIG. 1, the Internet 199 is connected to a commuter expense calculation server 100 that calculates commuter expenses and the amount of commuter expense to be paid, a database server 120 that manages various table information used by the commuter expense calculation server 100, a route search server 130 that searches for routes in response to requests, and employee terminals 200 used by company employees.

[0036] [Commuting travel expense calculation server 100] Next, the configuration of the commute expense calculation server 100 will be described.

[0037] FIG. 2 is a diagram showing a hardware configuration of the commute expense calculation server 100. As shown in FIG. As shown in Figure 2, the commuter expense calculation server 100 is composed of a CPU (Central Processing Unit) 30 which controls calculations and the entire system based on a control program, a ROM (Read Only Memory) 32 which has the control program etc. of the CPU 30 stored in advance in a specified area, a RAM (Random Access Memory) 34 for storing data read from the ROM 32 etc. and calculation results required in the calculation process of the CPU 30, and an I / F (InterFace) 38 which mediates the input and output of data to and from external devices, and these are connected to each other and capable of sending and receiving data by a bus 39, which is a signal line for transferring data.

[0038] The I / F 38 is connected to external devices such as an input device 40 consisting of a keyboard, mouse, etc. that can input data as a human interface, a storage device 42 that stores data, tables, etc. as files, a display device 44 that displays a screen based on an image signal, and a signal line for connecting to the Internet 199.

[0039] [Database Server 120] Next, the configuration of the database server 120 will be described. The database server 120 has the same hardware configuration as the commute expense calculation server 100 .

[0040] 3(a) to (e) are diagrams showing the data structures of a company master table 400, a workplace master table 402, an employee information master table 404, an employee-specific route information table 406, and an employee-specific payment information table 408.

[0041] As shown in Figures 3(a) to (e), the storage device of the database server 120 stores a company master table 400 for registering company information, a workplace master table 402 for registering workplace information for each company, an employee information master table 404 for registering employee information, an employee-specific route information table 406 for registering commuting route information for each employee, and an employee-specific payment information table 408 for registering commuting transportation expense payment information for each employee.

[0042] As shown in Fig. 3(a), one record is registered for each combination of company ID and application start date in the company master table 400. Each record contains main information including company ID, company name, application control category, employee group category information, application start date, application end date, last update date, last updater, and other information.

[0043] Here, the company ID is information for identifying a company, and is composed of, for example, a unique number for each company (for example, numbers only or a combination of letters and numbers), etc. Also, the application control category is information that sets whether applications from employees can be accepted, and the employee group category information is information that indicates categories such as job type, office, and affiliation between paid employee groups and other employee groups.

[0044] 3(b), one record is registered for each combination of company ID, workplace ID, and application start date in the workplace master table 402. Each record contains main information including company ID, workplace ID, workplace name, workplace address, calendar ID, start time, end time, fuel unit price type ID, map information, application start date, application end date, last update date, last updater, and other information.

[0045] Here, the workplace ID is information for identifying the workplace, and is composed of, for example, a unique number for each workplace (for example, numbers only, a combination of letters and numbers). The calendar ID is information for identifying a calendar in which the business days and holidays of the workplace set for each company are written, and is composed of, for example, a unique number for each type of calendar (for example, numbers only, a combination of letters and numbers). The fuel unit price type ID is information for identifying a fuel unit price type set for each company, and is composed of, for example, a unique number for each unit price type (for example, numbers only, a combination of letters and numbers). The fuel unit price types include unit price types for each fuel, such as gasoline (regular), gasoline (high octane), and diesel (diesel), and unit price types for each type of eco-friendly automobile, such as EV (electric vehicle), PHV (plug-in hybrid electric vehicle), and FCV (fuel cell vehicle). The map information includes location information of the workplace and information on the nearest station.

[0046] 3(c), one record is registered for each combination of company ID, employee ID, and application start date in employee information master table 404. Each record contains main information including company ID, employee ID, employee name, employee name (kana), employee home postal code, employee home address, telephone number, email address, workplace ID, workplace name, department ID, department name, employee category, payment rule ID, password, authority level, map information, application start date, application end date, last update date, last updater, and other information.

[0047] Here, the department ID is information for identifying the department to which the employee belongs, and is composed of, for example, a unique number for each department (for example, numbers only, or a combination of letters and numbers). The employee classification is information for classifying employees as full-time employees, part-time employees, etc., and the authority level is information indicating one of personnel authority, superior authority, and employee authority. Personnel authority is the authority to use all functions related to commuting expense operations in this system, superior authority is the authority to only apply for commuting routes and approve the contents of the application, and employee authority is the authority to only apply for commuting routes. In addition, the map information includes the location information of the employee's home and information on the nearest station.

[0048] One employee may belong to multiple workplaces. For example, an employee may commute to workplace A in the beginning of the month and to workplace B in the latter half of the month. For this reason, one or multiple workplace IDs and workplace names can be registered for each employee in the employee information master table 404.

[0049] 3(d), one record is registered for each combination of company ID, employee ID, and route ID in the employee-specific route information table 406. Each record contains main information including company ID, employee ID, vehicle ID, route direction type, nearest station to employee's home, workplace ID, workplace name, nearest station to workplace, route ID, commuting route, route usage period, one-month commuter fare, three-month commuter fare, six-month commuter fare, twelve-month commuter fare, one-way fare, one-way distance, one-way time, number of transfers, route reference date, application start date, application end date, last update date, last updater, and other information.

[0050] Here, the route direction type is information indicating the direction of use of the commuting route, and is information on outward, return, or round trip. The route ID is information for identifying the commuting route, and is composed of, for example, a unique number for each commuting route (for example, only numbers, or a combination of letters and numbers). The commuting route is the route from home to the workplace, and for example, if the commuting means is a train, it is "home → walk → nearest station (home) → intermediate station → nearest station (workplace) → walk → workplace", and for example, if the commuting means is a car, it is "home → car → workplace". The one-month commuter fare, three-month commuter fare, six-month commuter fare, and 12-month commuter fare are the amounts of commuting transportation expenses for the 1st, 3rd, 6th, and 12th months of the set commuting means and route direction type, and the route reference date is the reference date on which the commuting route becomes valid.

[0051] When the destination or arrival point of a commuting route is a workplace, the workplace ID and workplace name of the workplace that is the destination or arrival point are registered in association with the commuting route in the employee-specific route information table 406. Also, since one employee may belong to multiple workplaces as described above, one or multiple pieces of route information can be registered for one employee in the employee-specific route information table 406. When registering route information for multiple workplaces, the employee-specific route information table 406 registers the workplace IDs and workplace names for multiple workplaces for one employee.

[0052] 3(e), one record is registered for each combination of company ID, employee ID, route ID, and payment ID in the employee-specific payment information table 408. Each record contains main information including company ID, employee ID, route ID, payment ID, start date, end date, payment date, payment method, payment period, payment months, payment / deduction amount, self-payment amount, type, period, remarks, cancellation date, payment details, number of regular months, number of regular sheets, payment amount, total payment amount, total self-payment amount, and other information.

[0053] Here, the payment ID is information for identifying the payment information, and is composed of, for example, a unique number for each payment information (for example, numbers only, or a combination of letters and numbers). The payment method is information indicating the payment method for commuting expenses, such as incorporation into salary, transfer to a bank account, or payment in kind (cash), and the number of months for which payment is made and the number of regular months are either 1 month, 3 months, 6 months, or 12 months. The payment details are information indicating whether or not the payment is continuous, whether or not the payment cycle is fixed, and whether or not the fare revision process is applicable.

[0054] 4(a) to (e) are diagrams showing the data structures of an employee-by-daily-proration-payment information table 410, a department information table 412, a fare information table 414, a payment regulations information table 416, and a search result information table 418. FIG.

[0055] As shown in Figures 4(a) to (e), the storage device of the database server 120 stores an employee-specific daily payment information table 410 for registering daily commuter expense payment information for each employee, a department information table 412 for registering information on approvers and proxy applicants for each department, a fare information table 414 for registering fare information related to fares for transportation such as trains and buses, a payment regulations information table 416 for registering payment regulations information related to the payment of commuter expenses, and a search result information table 418 for registering search result information related to the search results of the route search server 130.

[0056] 4(a), one record is registered for each combination of company ID, employee ID, route ID, and daily rate ID in employee-specific daily rate payment information table 410. Each record contains main information including company ID, employee ID, route ID, daily rate ID, start date, end date, payment date, payment method, period for daily rate payment, number of days for payment, type of direction of use (outbound / return / round trip), payment details, payment amount, total payment amount, and other information.

[0057] Here, the per diem ID is information for identifying the per diem information, and is composed of, for example, a unique number for each per diem information (for example, numbers only or a combination of letters and numbers). The per diem payment period is information indicating the period for which commuting expenses are calculated on a per diem basis, the number of payment days is information on the number of days during the per diem payment period for which commuting expenses are paid on a per diem basis, and the direction type is information indicating the direction of the commuting route used during the per diem payment period, and is information on outbound, return, or round trip. The payment details information is information indicating whether or not the fare is subject to fare revision processing.

[0058] 4(b), one record is registered for each combination of company and department in the department information table 412. Each record contains main information including the company ID, department ID, approver ID, proxy applicant ID, application start date, application end date, last update date, last updater, and other information.

[0059] Here, the approver ID is the employee ID of an employee with supervisor authority who is authorized to approve applications for commuting routes for employees who belong to the department corresponding to the department ID, and the proxy applicant ID is the employee ID of an employee with authority to submit commuting route applications on behalf of other employees who belong to the same department.

[0060] As shown in FIG. 4(c), the fare information table 414 has one record registered for each fare ID. Each record has main information registered, including the fare ID, section information (e.g., the station numbers of the departure station and the arrival station), fare type (e.g., one-month commuter fare, three-month commuter fare, six-month commuter fare, 12-month commuter fare, one-way fare), fare, fare revision date, last update date, last updater, and other information. When a fare revision occurs, records with different revision dates are registered for the same section. In this case, the fare related to the record with the older revision date can be specified as the fare before revision (hereinafter referred to as the "fare before revision"), and the fare related to the record with the newer revision date can be specified as the fare after revision (hereinafter referred to as the "fare after revision"). The revision date of the record is the application date of the fare, and the period from the older revision date of the record before and after the revision to the day before the new revision date is the application period of the fare before revision, and the period after the revision date of the new record is the application period of the fare after revision. For past revisions, the fare before revision, the fare after revision, the date and period of application of the fare can be identified similarly from the fare and revision date of the record.

[0061] The commuting expenses of an employee can be calculated by accumulating the fares for the commuting route based on the route information in the employee route information table 406 and the fare information in the fare information table 414 .

[0062] Furthermore, when commuting expenses are paid on a pro rata basis, the commuting expenses of an employee can be calculated by accumulating the fares for the commuting route based on the route information in employee route information table 406, the pro rata payment information in employee pro rata payment information table 410, and the fare information in fare information table 414. When calculating commuting expenses, the fare for the applicable date or applicable period corresponding to the date or period of use is applied to calculate the commuting expenses for each commuting route related to the date or period of use when that commuting route was used.

[0063] 4(d), one record is registered for each company ID in the payment regulation information table 416. Each record stores main information including the company ID, regulation judgment criteria, and other information.

[0064] Here, the regulation judgment criteria are standards for judging whether a commuting route is appropriate or not, and are set for each company in accordance with the company's commuting allowance regulations. As the regulation judgment criteria, for example, the commuting route that complies with the commuting allowance regulations can be set as (1) the route with the shortest travel time, (2) the route with the fewest transfers, (3) the route with the cheapest one-way fare, (4) the route with the cheapest one-month commuter pass fare, (5) the route with the cheapest three-month commuter pass fare, or (6) the route with the cheapest six-month commuter pass fare. In addition, it can be set that (1) IC fares (fares applied when using IC card tickets) should be applied, or (2) regular fares should be applied instead of IC fares.

[0065] 4(e), the search result information table 418 has one record registered for each combination of company ID, employee ID, workplace ID, search date and time, and route. Each record has registered main information including company ID, employee ID, workplace ID, search date and time, departure station, arrival station, route search conditions, route, fare, and other information.

[0066] Here, the route is a route that is a search result of the route search server 130, and is a route from the nearest station to the home to the nearest station to the workplace. The fare includes a one-month commuter fare, a three-month commuter fare, a six-month commuter fare, a 12-month commuter fare, and a one-way fare.

[0067] Although not shown, the storage device of database server 120 stores tables in which various definition data for calculating commuting expenses and tables in which various basic data for linking commuting expenses with salary are registered, in addition to tables 400 to 424. Specific examples of basic data tables include a salary basic data table, a taxation basic data table, a social insurance basic data table, and an employment insurance basic data table.

[0068] Here, the basic salary data is data on the amount of commuting allowance paid, the basic tax data is data on the taxable or non-taxable amount on the amount of commuting allowance paid, the basic social insurance data is data on social insurance premiums on the amount of commuting allowance paid, and the basic employment insurance data is data on employment insurance premiums on the amount of commuting allowance paid.

[0069] [Route Search Server 130] Next, the configuration of the route search server 130 will be described. The route search server 130 has the same hardware configuration as the commute expense calculation server 100 .

[0070] The route search server 130 is configured to have a database in which route information and fare information are registered. When the route search server 130 receives a request including a departure station, an arrival station, and route search conditions, it searches the database for a route and fare from the departure station to the arrival station according to the route search conditions, and transmits the route information and fare information as search results to the terminal that sent the request.

[0071] The request may include one or more departure stations and one or more arrival stations. In response to a request including one departure station and one arrival station, the route search server 130 searches for the route and fare from the one departure station to the one arrival station, and returns the search results.

[0072] For a request that includes multiple departure stations and one arrival station, the route search server 130 searches for the route and fare from each departure station to one arrival station, and returns the search results. For example, if the departure stations are A and B and the arrival station is C, route AC and its fare and route BC and its fare are obtained as search results.

[0073] For a request that includes one departure station and multiple arrival stations, the route search server 130 searches for the route and fare from one departure station to the arrival station for each arrival station, and returns the search results. For example, if the departure station is A and the arrival stations are B and C, route AB and its fare and route AC and its fare are obtained as search results.

[0074] For a request that includes multiple departure stations and multiple arrival stations, the route search server 130 searches for the route and fare from each departure station to each arrival station, and returns the search results. For example, if the departure stations are A and B and the arrival stations are C and D, route AC and its fare, route BC and its fare, route AD and its fare, and route BD and its fare are obtained as search results.

[0075] As route search conditions, for example, (1) the route with the shortest travel time, (2) the route with the fewest transfers, (3) the route with the cheapest one-way fare, (4) the route with the cheapest one-month commuter fare, (5) the route with the cheapest three-month commuter fare, or (6) the route with the cheapest six-month commuter fare can be set. In addition, it is possible to set (1) the application of IC fares, or (2) the application of regular fares instead of IC fares. For example, if the departure station is A, the arrival station is B, and (1) is set as the route search condition, the route AB with the shortest travel time and its fare will be obtained as a search result.

[0076] [Employee terminal 200] The employee terminal 200 is composed of a terminal assumed to be a stationary type such as the commuter travel expense calculation server 100, or a mobile terminal such as a smartphone or tablet. In the former case, the hardware configuration is the same as that of the commuter travel expense calculation server 100. On the other hand, in the latter case, the hardware configuration is composed of a CPU, a ROM that stores programs such as application software and data for executing the programs, a RAM for storing data read from the ROM and the calculation results required in the CPU's calculation process, and an I / F that mediates data input / output to various attached devices. These are connected to each other and capable of sending and receiving data by signal lines for transferring data. The I / F is connected to various attached devices such as a touch panel display input device that can input data and display a screen based on an image signal, a storage device, a wireless communication device, and a video camera.

[0077] [Operation] Next, the operation when performing a commute route simulation will be described. In reality, access to tables 400-424 is performed by commute travel expense calculation server 100 communicating with database server 120, but for the sake of simplicity, the following description will be given assuming that commute travel expense calculation server 100 accesses tables 400-424. Also, since a user logs in with an account for each company and performs a commute route simulation, in the following description, "company" refers to the company corresponding to the logged-in account.

[0078] The commute route simulation involves selecting a target employee who is considering a workplace transfer and target workplaces that are potential transfer destinations, searching the route from the nearest station to the target employee's home to the nearest station to the target workplace and the fare associated with that route using route search server 130, and simulating the total commute transportation expenses.

[0079] FIG. 5 is a flowchart showing the commute route simulation process. FIG. 6 shows the screen for selecting the target employee and the target workplace.

[0080] FIG. 7 shows a screen showing the results of a commute route simulation. The CPU 30 is made up of an MPU (Micro-Processing Unit) or the like, and starts up a predetermined program stored in a predetermined area of ​​the ROM 32, and executes the commuting route simulation process shown in the flowchart of FIG. 5 in accordance with the program.

[0081] When the commute route simulation process is executed by CPU 30, as shown in FIG. 5, first, the process proceeds to step S100.

[0082] In step S100, the employee information master table 404 is referenced and target employees are selected from among employees belonging to the company. In the example of FIG. 6, an employee number, an employee name, an address, or an employer is input as a search key in a text box or the like 500. The employer is selected from a list of employers of the company in a select box. When a search key is input and a search button 502 is clicked, employee information corresponding to the input search key is searched from the employee information master table 404, and the employee number, employee name, and commuting means for each employee are displayed in a text box 504 based on the employee information retrieved. Then, when one or more employees are selected from the employees in the text box 504 and a button 506 is clicked, the selected employees are added to a text box 508 as target employees. Target employees can also be added directly. In this case, an employee number, an employee name, an address, or an employer is input as a search key in a text box 510 or the like. The employer is selected from a list of employers of the company in a select box. When a search key is entered and a Search button 512 is clicked, employee information corresponding to the entered search key is searched for in the employee information master table 404, and the employee number, employee name, and commuting method for each target employee are added to the text box 508 based on the retrieved employee information.

[0083] Next, the process proceeds to step S102, where the workplace master table 402 is referenced to select a target workplace from among the workplaces of the company. In the example of FIG. 6, workplaces 1 to 5 can be set as target workplaces. Workplace 1 is selected from a list of workplaces of the company in the selection box 514. The same is true for workplaces 2 to 5. In the example of FIG. 6, the maximum number is five, but it is also possible to set six or more workplaces.

[0084] Next, the process proceeds to step S104, and the company's payment regulation information is obtained from the payment regulation information table 416. In the example of FIG. 6, for example, the route search conditions can be set as follows: (1) the route with the shortest travel time; (2) the route with the fewest transfers; (3) the route with the cheapest one-way fare; (4) the route with the cheapest one-month commuter fare; (5) the route with the cheapest three-month commuter fare; or (6) the route with the cheapest six-month commuter fare. (1) to (6) are selected using the radio buttons 516. In addition, (1) the application of IC fares or (2) the application of normal fares instead of IC fares can be set using the radio buttons 518. (1) to (2) are selected using the radio buttons 518. These initial values ​​are set based on the payment regulation information. That is, if you want to set the payment regulation information as a route search condition, click the execute button 520 with the initial value as is. On the other hand, if you want to set content different from the payment regulation information as a route search condition, change the value from the initial value using the radio buttons 516 and 518 and click the execute button 520. When the execute button 520 is clicked, the processes from step S106 onwards are executed.

[0085] Next, proceed to step S106, where workplace information including the nearest station information for the first target workplace is obtained from the workplace master table 402, proceed to step S108, where employee information including the nearest station information for the home of the first target employee is obtained from the employee information master table 404, and proceed to step S110.

[0086] In step S110, a request to the route search server 130 is generated based on the payment regulation information, workplace information, and employee information acquired in steps S104 to S108, S126, and S128.

[0087] When there is one nearest station to the home of the target employee and one nearest station to the target workplace, a request is generated in which the one nearest station to the home of the target employee is set as the departure station, the one nearest station to the target workplace is set as the arrival station, and the regulation judgment criteria are set as the route search conditions.

[0088] When there is one nearest station to the home of the target employee and multiple nearest stations to the target workplace, a request is generated in which the one nearest station to the home of the target employee is set as the departure station, multiple nearest stations to the target workplace are set as arrival stations, and regulation judgment criteria are set as route search conditions.

[0089] In the case where there are multiple nearest stations to the home of the target employee and one nearest station to the target workplace, a single request is generated in which the multiple nearest stations to the home of the target employee are set as departure stations, one nearest station to the target workplace is set as arrival station, and regulation judgment criteria are set as route search conditions.

[0090] When there are multiple nearest stations to the home of the target employee and multiple nearest stations to the target workplace, a single request is generated in which multiple nearest stations to the home of the target employee are set as departure stations, multiple nearest stations to the target workplace are set as arrival stations, and regulation judgment criteria are set as route search conditions.

[0091] Next, the process proceeds to step S112, where the generated request is transmitted to route search server 130, the process proceeds to step S114, where a search result for the transmitted request is received from route search server 130, and the process proceeds to step S116.

[0092] In step S116, when the search result obtained in step S114 includes multiple routes for a route from a nearest station to the home of the target employee to a nearest station to the workplace of the target employee, one of the multiple routes that meets the regulation judgment criteria is determined based on the payment regulation information obtained in step S104. For example, when the nearest stations to the home of the target employee are two and the nearest stations to the workplace are two, the search result includes four routes. In this case, for example, when the regulation judgment criterion (1) is set to the route with the shortest travel time, the route with the shortest travel time among the four routes is determined to meet the regulation judgment criterion. Also, for example, when the regulation judgment criterion (2) is set to the route with the fewest transfers, the route with the fewest transfers among the four routes is determined to meet the regulation judgment criterion. When the route is determined, the company ID, employee ID, workplace ID, search date and time, departure station, arrival station, route search conditions, the determined route, and fare are registered in the search result information table 418.

[0093] Next, the process proceeds to step S118 to determine whether or not the processing of steps S110 to S116 has been completed for all selected target employees. If it is determined that the processing has been completed for all selected target employees (YES), the process proceeds to step S120 to determine whether or not the processing of steps S108 to S118 has been completed for all selected target workplaces. If it is determined that the processing has been completed for all target workplaces (YES), the process proceeds to step S122.

[0094] In step S122, the search result information table 418 is referenced to generate a simulation result of the commuting route. As shown in FIG. 7, the simulation result is displayed in a text box 520 as a summary for each target workplace, including the name of the workplace, the address of the workplace, the total amount of the one-, three-, six-, and twelve-month commuter fares, the total amount of the one-way fare, and other information. The total amount of the one-month commuter fare can be calculated, for example, by accumulating the one-month commuter fares for the route determined for each target employee for all target employees. The same applies to the total amount of the three-, six-, and twelve-month commuter fares and the total amount of the one-way fare. In addition, when a target workplace is selected in the selection box 522, the employee number, employee name, commuting means, the one-, three-, six-, and twelve-month commuter fares, the one-way fare, the one-way distance, and other information for each target employee for the selected target workplace is displayed in a text box 524. The other information includes, for example, the route from the nearest station to the target employee's home to the nearest station to the target workplace.

[0095] Next, the process proceeds to step S124, where the generated simulation results are transmitted to the employee terminal 200 of the logged-in employee, and the series of processes is terminated.

[0096] On the other hand, if it is determined in step S120 that processing has not been completed for all target workplaces (NO), the process proceeds to step S126, where workplace information including nearest station information for the next target workplace is obtained from the workplace master table 402, and the process proceeds to step S108.

[0097] On the other hand, if it is determined in step S118 that processing has not been completed for all target employees (NO), the process proceeds to step S128, where employee information for the next target employee, including information on the nearest station to the employee's home, is obtained from the employee information master table 404, and the process proceeds to step S110.

[0098] [Effects of the embodiment] Next, the effects of this embodiment will be described. In this embodiment, nearest station information for the home of a target employee and nearest station information for the target workplace are obtained for each of a number of target employees, and based on the obtained nearest station information, if there are multiple nearest stations to the home of a target employee and multiple nearest stations to the target workplace, a request is sent to route search server 130 in which the departure station is set to the multiple nearest stations to the target employee's home and the arrival station is set to the multiple nearest stations to the target workplace, and for each target employee, a route from the nearest station to the home of the target employee to the nearest station to the target workplace and the fare associated with that route are searched for by route search server 130, route information regarding that route and fare information regarding that fare are obtained from route search server 130, and a simulation result is generated based on the obtained route information and fare information.

[0099] This reduces the number of requests when a target employee has multiple nearest stations to his / her home and multiple nearest stations to his / her workplace, since only one request is sent to the route search server 130. Also, a simulation result is obtained that takes into account routes connecting multiple nearest stations to the home and multiple nearest stations to the target workplace.

[0100] Furthermore, in this embodiment, when there is one nearest station to the home of a target employee and multiple nearest stations to the target workplace, a request is sent to the route search server 130 in which the nearest station to the home of the target employee is set as the departure station and multiple nearest stations to the target workplace are set as arrival stations.

[0101] This reduces the number of requests when a target employee has one nearest station to his / her home and multiple nearest stations to his / her workplace, since only one request is sent to the route search server 130. Also, a simulation result is obtained that takes into account the routes connecting the nearest station to the home and multiple nearest stations to the target workplace.

[0102] Furthermore, in this embodiment, if there are multiple nearest stations to the home of a target employee and only one nearest station to the target workplace, a request is sent to the route search server 130 in which the multiple nearest stations to the home of the target employee are set as the departure station and the one nearest station to the target workplace is set as the arrival station.

[0103] This reduces the number of requests when a target employee has multiple nearest stations to his / her home and only one nearest station to the target workplace, since only one request is sent to the route search server 130. In addition, a simulation result can be obtained that takes into account the routes connecting multiple nearest stations to the home and the nearest station to the target workplace.

[0104] Furthermore, in this embodiment, the payment regulation information of the company is obtained from the payment regulation information table 416, and a request in which route search conditions are set based on the obtained payment regulation information is transmitted to the route search server 130.

[0105] This allows us to obtain simulation results that take into account the company's transportation expenses. Furthermore, in this embodiment, the company's payment regulation information is obtained from the payment regulation information table 416, and if the search results of the route search server 130 include multiple routes for a route from a nearest station to the target employee's home to a nearest station to the target workplace, one of the multiple routes is determined based on the obtained payment regulation information, and a simulation result is generated based on the fare information for the determined route.

[0106] This allows us to obtain simulation results that take into account the company's transportation expenses. Furthermore, in this embodiment, nearest station information for each of multiple target workplaces is obtained, and if there are multiple nearest stations to the home of a target employee and to a target workplace, a request is sent to route search server 130 in which the departure stations are set to the multiple nearest stations to the home of the target employee and the arrival stations are set to the multiple nearest stations to the target workplace, and for each target workplace and for each target employee, a route from the nearest station to the home of the target employee to the nearest station to the target workplace and the fare associated with that route is searched for by route search server 130, and route information regarding that route and fare information regarding that fare are obtained from route search server 130.

[0107] This makes it possible to reduce the number of requests when there are multiple target workplaces. Also, for multiple target workplaces, we can obtain simulation results that take into account routes connecting multiple nearest stations to the home and multiple nearest stations to each of the target workplaces.

[0108] [Correspondence] In this embodiment, the route search server 130 corresponds to the search server of inventions 1 to 4 or 6, step S104 corresponds to the payment regulation information acquisition means of invention 4 or 5, and steps S106 and S126 correspond to the second nearest station information acquisition means of invention 1 or 6. Also, steps S108 and S128 correspond to the first nearest station information acquisition means of invention 1, steps S112 and S114 correspond to the route information acquisition means of inventions 1 to 6, and step S122 corresponds to the simulation result generation means of invention 1 or 5.

[0109] In this embodiment, step S116 corresponds to the route determination means of the fifth aspect.

[0110] [Modifications] In the above embodiment and its modified example, the outbound route and the return route are not distinguished from each other, but the present invention is not limited to this. For example, when the fares for the outbound route and the return route are different, the outbound route and the return route can be distinguished from each other when searching. For example, the following configuration can be adopted.

[0111] In the first configuration, for each target employee, when the target employee uses the searched route for commuting on the outward journey, the route and fare obtained when the search is performed as the outward journey (when the search is performed by setting the nearest station to the home as the departure station and the nearest station to the workplace as the arrival station). In addition, when the target employee uses the searched route for commuting on the return journey, the route and fare obtained when the search is performed as the return journey (when the search is performed by setting the nearest station to the workplace as the departure station and the nearest station to the home as the arrival station) are adopted. In addition, when the target employee uses the searched route for commuting on a round trip, the route and fare obtained when the search is performed for the outward journey and the return journey, respectively, are adopted. The distinction between outward journey, return journey, and round trip may be set, for example, by registering information such as the route direction type in the employee-specific route information table 406 or other tables, or may be set by specifying the distinction between outward journey, return journey, and round trip for the route in the search result in the simulation results.

[0112] In the second configuration, when a route searched for a target employee is registered as the target employee's commuting route in the employee-specific route information table 406, a route is determined from the search results of the route search server 130 based on the route direction type corresponding to the commuting route. When the route direction type is an outbound route, the route searched for as the outbound route is determined. When the route direction type is a return route, the route searched for as the return route is determined. When the route direction type is a round trip route, the routes searched for both the outbound route and the return route are determined.

[0113] The third configuration involves registering information on departure and arrival stations for which fares differ between the outbound and return journeys in a table, and by referring to the table, applying the first or second configuration to routes with departure and arrival stations for which fares differ between the outbound and return journeys.

[0114] In the above embodiment and its modified example, (1) to (6) and (1) to (2) are exemplified as the regulation judgment criteria, but the regulation judgment criteria may include, without being limited to these, (7) allowing a change of vehicle (for example, train → bus, bus → train) or (8) allowing different routes for the outbound and return journeys. This criterion may be set as an independent criterion from (1) to (6) and (1) to (2), or may be set as an additional criterion after satisfying any of (1) to (6) and (1) to (2).

[0115] Furthermore, in the above embodiment and its modified examples, a route that meets the regulation judgment criteria is determined from among multiple routes based on the payment regulation information. However, this is not limited to this. If the route is the same as a commuting route registered in employee-specific route information table 406, it meets the regulation judgment criteria and has been approved, so it is possible to determine, from among multiple routes included in the search results of route search server 130, a route that is the same as the commuting route registered in employee-specific route information table 406.

[0116] In the above embodiment and its modified example, one of the multiple routes is determined to meet the regulation judgment criteria for one target employee, but this is not limited to the above, and multiple routes can be determined to meet the regulation judgment criteria. For example, different routes may be determined for the outbound and return journeys, or if the outbound and return journeys have different fares even if the outbound and return journeys are the same, a route for the outbound journey and a route for the return journey may be determined separately.

[0117] In the above embodiment and its modified example, social insurance premiums and employment insurance premiums were not taken into consideration, but since commuting expenses are also included in the calculation of social insurance premiums, etc., social insurance premiums, etc. can be reflected in the simulation results. For example, the basic data table is referenced, and social insurance premiums, etc. are calculated based on the fare information obtained as a search result of the route search server 130, and a simulation result is generated based on the calculated social insurance premiums, etc. The simulation result is configured as a page that provides, for example, a tab or drop-down list for selecting a target workplace, and displays, for each target employee, the route from the nearest station to the home of the target employee to the nearest station of the target workplace, the fare, social insurance premiums, etc., and the total amount of fare and social insurance premiums, etc., for all target employees, for the selected target workplace.

[0118] In the above embodiment and its modified example, one request is generated for each target workplace and each target employee, but this is not limited to the above, and one request can be generated for each target employee. Specifically, if there are multiple stations closest to the home of one target employee, one request is generated with the multiple stations closest to the target employee's home set as the departure station and the stations closest to the multiple target workplaces set as the arrival station.

[0119] In the above embodiment and its modified example, one request is sent to the route search server 130 for one target employee, but this is not limiting. It is possible to determine whether the route information to be obtained by one request (route information related to all routes between the nearest stations to the target employee's home and the nearest stations to the target workplace) is registered in the search result information table 418, and if it is determined that the route information is registered, the request is not sent and the route information is obtained from the search result information table 418. The route information obtained from the search result information table 418 may target all route information or route information that satisfies a predetermined condition. The predetermined condition includes, for example, route information searched within a predetermined period from the present to the past (for example, within the same day, within one day, within three days, within one week), and route information searched after the most recent fare revision by referring to the fare information table 414. For example, if one considers a service that allows users to get a rough estimate by reducing the accuracy of a commute route simulation, provided that the service is offered free or at a low cost, then since searches by route search server 130 incur a fee according to the number of requests, a configuration can be adopted that covers all route information or route information searched within a fairly long period of time (e.g., within one year).

[0120] In addition, in the above embodiment and its variations, in the request, the departure station is set to the nearest station to the target employee's home, and the arrival station is set to the nearest station to the target workplace, but this is not limited to this, and it is also possible to set the departure station to the nearest station to the target workplace, and the arrival station to the nearest station to the target employee's home.

[0121] In addition, in the above embodiment and its variant examples, the regulation judgment criteria are set as route search conditions in the request, but this is not limited to the above, and other conditions may be set as route search conditions, or route search conditions may not be set.

[0122] Furthermore, in the above embodiment and its modified example, the route information and the fare information are acquired from the route search server 130, but this is not limiting, and only one of the route information and the fare information may be acquired.

[0123] In addition, in the above embodiment and its modified examples, both a process of setting route search conditions based on payment regulation information and a process of determining one of a plurality of routes based on the payment regulation information were performed, but this is not limited to the above, and only one of the processes may be performed.

[0124] In addition, in the above embodiment and its modified examples, the route direction type and the usage direction type are configured as outbound, return, or round trip information, but this is not limited to this, and one or both of the route direction type and the usage direction type can be configured as one-way or round trip information.

[0125] Furthermore, in the above embodiment and its modified examples, the system is realized as a network system, but the present invention is not limited to this and can be realized as a single device or application.

[0126] In addition, in the above embodiment and its modified example, the case where the present invention is applied to a network system consisting of the Internet 199 has been described, but the present invention is not limited to this, and may be applied, for example, to a so-called intranet that performs communication in the same manner as the Internet 199. Of course, the present invention is not limited to a network that performs communication in the same manner as the Internet 199, and may be applied to a network of any communication method.

[0127] In addition, in the above embodiment and its modified examples, when executing the process shown in the flowchart of Figure 5, a case has been described in which a program pre-stored in ROM is executed, but this is not limited to the above, and the program showing these procedures may be read into RAM from a storage medium on which the program is stored and executed.

[0128] In the above embodiment and its modified example, the present invention is applied to the case where a simulation result of a commuting route is generated, but the present invention is not limited to this and can be applied to other cases without departing from the scope of the present invention. For example, the present invention can be applied to the case where a business trip travel expense or other travel expense is simulated. [Explanation of symbols]

[0129] 100...commuting travel expense calculation server, 30...CPU, 32...ROM, 34...RAM, 38...I / F, 39...bus, 40...input device, 42...storage device, 44...display device, 120...database server, 130...route search server, 200...employee terminal, 199...Internet, 400...company master table, 402...workplace master table, 404...employee information master table, 406...employee route information table, 408...employee payment information table, 410...employee daily rate payment information table, 412...department information table, 414...fare information table, 416...payment regulations information table, 418...search result information table, 500, 510...text box, etc., 502, 512...search button, 504, 508, 520, 524...text box, 506: Button; 514, 522: Select box; 516, 518: Radio button; 520: Execute button

Claims

1. a first nearest station information acquisition means for acquiring nearest station information of a home of each of a plurality of target employees from a storage means for storing nearest station information of a nearest station to a home of each of a plurality of employees belonging to a company; A second nearest station information acquisition means for acquiring nearest station information of a target workplace from a storage means for storing nearest station information related to nearest stations of the workplaces of the companies; a route information acquisition means for searching for a route between the nearest station to the home of each of the target employees and the nearest station to the target workplace of the target employees using a search server based on the nearest station information acquired by the first nearest station information acquisition means and the second nearest station information acquisition means, and acquiring route information relating to the route from the search server; a payment regulation information acquisition means for acquiring payment regulation information related to the payment of commuting expenses of the company from a storage means for storing the payment regulation information; a route determination means for determining, when the route information acquisition means acquires the route information relating to a plurality of routes for one of the target employees, one of the plurality of routes that satisfies a standard for commuter transportation allowance based on the payment regulations information acquired by the payment regulations information acquisition means; a simulation result generating means for generating a simulation result of a commuting route based on the route information related to the route determined by the route determining means, The route information acquisition means of the commuter route simulation system is characterized in that, when there are multiple nearest stations to the home of one of the target employees and the target workplace, a request is made in which multiple nearest stations to the home of the target employee are set as one of the departure station and arrival station, and multiple nearest stations to the target workplace are set as the other of the departure station and arrival station, and the request includes route search conditions set based on the payment regulation information acquired by the payment regulation information acquisition means, and the request is sent to the search server.

2. In claim 1, The commuter route simulation system is characterized in that, when there is one nearest station to the home of a target employee and multiple nearest stations to the target workplace, the route information acquisition means sends a request to the search server in which the nearest station to the target employee's home is set as one of the departure station and arrival station, and multiple nearest stations to the target workplace are set as the other of the departure station and arrival station.

3. In claim 1, The commuter route simulation system is characterized in that, when there are multiple nearest stations to the home of a target employee and one nearest station to the target workplace, the route information acquisition means sends a request to the search server in which the multiple nearest stations to the target employee's home are set as one of the departure station and arrival station, and the one nearest station to the target workplace is set as the other of the departure station and arrival station.

4. In any one of claims 1 to 3, The second nearest station information acquisition means acquires nearest station information of each of a plurality of target workplaces from a storage means that stores nearest station information regarding a nearest station of each of a plurality of workplaces of the company, The route information acquisition means searches for a route between the nearest station to the home of the target employee and the nearest station to the target workplace for each of the target workplaces and for each of the target employees using a search server, and acquires route information relating to the route from the search server; The commuter route simulation system is characterized in that, when there are multiple nearest stations to the home of one of the target employees and to one of the target workplaces, the route information acquisition means sends a request to the search server in which multiple nearest stations to the home of the target employee are set as one of the departure station and arrival station, and multiple nearest stations to the target workplace are set as the other of the departure station and arrival station.

5. In claim 4, an employee selection means for selecting a plurality of target employees to be the subjects of a simulation from a plurality of employees belonging to a company; a workplace selection means for selecting a plurality of target workplaces to be subjected to a simulation from the plurality of workplaces; The first nearest station information acquisition means acquires nearest station information about the home of each of the plurality of target employees selected by the employee selection means from a storage means that stores nearest station information about the nearest station to the home of each of the plurality of employees, and A commute route simulation system characterized in that the second nearest station information acquisition means acquires nearest station information for each of a plurality of target workplaces selected by the workplace selection means from a memory means which stores nearest station information regarding the nearest station to each of the plurality of workplaces.

6. In any one of claims 1 to 3, The second nearest station information acquisition means acquires nearest station information of each of a plurality of target workplaces from a storage means that stores nearest station information regarding a nearest station of each of a plurality of workplaces of the company, The route information acquisition means searches for a route between the nearest station to the home of the target employee and the nearest station to the target workplace for each of the target workplaces and for each of the target employees using a search server, and acquires route information relating to the route from the search server; The commuting route simulation system is characterized in that, when there are multiple stations nearest to the home of one of the target employees, the route information acquisition means sends a request to the search server in which the multiple nearest stations to the home of the target employee are set as one of the departure station and arrival station, and the nearest stations to the multiple target workplaces are set as the other of the departure station and arrival station.

7. In claim 6, an employee selection means for selecting a plurality of target employees to be the subjects of a simulation from a plurality of employees belonging to a company; a workplace selection means for selecting a plurality of target workplaces to be subjected to a simulation from the plurality of workplaces; The first nearest station information acquisition means acquires nearest station information about the home of each of the plurality of target employees selected by the employee selection means from a storage means that stores nearest station information about the nearest station to the home of each of the plurality of employees, and A commute route simulation system characterized in that the second nearest station information acquisition means acquires nearest station information for each of a plurality of target workplaces selected by the workplace selection means from a memory means which stores nearest station information regarding the nearest station to each of the plurality of workplaces.

Citation Information

Patent Citations

  • Route display system, and program

    JP2004118539A

  • Commuting route calculation system and method

    JP2006099674A

  • Information processing system, information processing device, information processing method, information processing program, terminal device, data, recording medium, and data generation method

    JP2016206939A

  • Information processing system, information processing program, information processing device, information processing method, output data, and storage medium

    JP2022020799A