Commute route simulation system

The commuter route simulation system optimizes route selection and cost calculation by combining multiple nearest stations into a single request and adhering to company payment regulations, addressing inefficiencies in existing systems.

JP2026002265AActive Publication Date: 2026-01-08BAIT AL HIKMA
View PDF 4 Cites 0 Cited by

Patent Information

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

AI Technical Summary

Technical Problem

Existing commuter route simulation systems fail to efficiently calculate travel costs when there are multiple stations nearest to a traveler's home or workplace, leading to increased search loads and costs due to multiple requests, and do not account for company-specific commuter travel expense payment regulations.

Method used

A commuter route simulation system that acquires nearest station information for both home and workplace, reduces the number of requests by combining multiple nearest stations into a single request, and sets route search conditions based on payment regulations to determine compliant routes.

Benefits of technology

Reduces the number of requests to search servers and provides simulation results that consider multiple stations and comply with company travel expense payment regulations, optimizing route selection and cost calculation.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 2026002265000001_ABST
    Figure 2026002265000001_ABST
Patent Text Reader

Abstract

To provide a commuting route simulation system suitable for obtaining a desired simulation result by suppressing the number of requests when there are a plurality of homes or the nearest train station from workplace.SOLUTION: The commute travel expense calculating server 100 acquires, for each of a plurality of target employees, information on the nearest station to the home of the target employee and information on a target the nearest train station from workplace, transmits, to the route search server 130, a request in which a plurality of nearest stations to the home of the target employee are set as departure stations and a plurality of nearest stations to the target the nearest train station from workplace are set as arrival stations, based on the acquired information on the nearest stations, and acquires route information and transportation expense information for each target employee from the route search server 130. Then, the simulation result of the commuting route is generated based on the acquired route information and fare information.SELECTED DRAWING: Figure 5
Need to check novelty before this filing date? Find Prior Art

Description

[Technical Field]

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

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

[0003] The technology described in Patent Document 1 includes a destination information acquisition unit that acquires destination information including location information of first and second destinations; a traveler information acquisition unit that acquires traveler information including location information of departure points of multiple travelers; a travel cost information acquisition unit that acquires, based on the destination information and the traveler information, first travel cost information including the travel cost of each traveler when the multiple travelers travel between their respective departure points and the first destination, and second travel cost information including the travel cost of each traveler when the multiple travelers 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] Japanese Patent Publication No. 2022-20799 Summary of the Invention [Problem to be solved by the invention]

[0005] However, the technology described in Patent Document 1 cannot calculate the desired travel cost when there are multiple stations nearest to a traveler's home or workplace. For example, it cannot calculate travel costs that take into account the route to each nearest station or travel costs that comply with a company's commuter travel expense payment regulations. Furthermore, when searching for routes using a search server, each user will send requests equal to the number of stations nearest to the home multiplied by the number of stations nearest to the workplace. For example, if there are two stations nearest to the home and two stations nearest to the workplace, 2 x 2 = 4 requests will be sent. This increases the search load, and if a usage fee is set according to the number of requests, the search cost will increase.

[0006] Therefore, the present invention has been made with a focus on these unresolved issues in 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 commute 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 first 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. In a case where there are multiple nearest stations 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 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] With this configuration, the first nearest station information acquisition means acquires nearest station information to the home of each of 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 target employee's home and the nearest station to the target workplace for each target employee based on the acquired nearest station information, and route information related to that route is acquired from the search server. At this time, if there are multiple nearest stations to a target employee's home and the target workplace, a request is sent to the search server, setting multiple nearest stations to the target employee's home as one of the departure station and arrival station, and multiple nearest stations to the target workplace as the other of the departure station and arrival station. Then, the simulation result generation means generates simulation results based on the acquired route information.

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

[0010] Furthermore, the term "station" in the phrase "nearest station" refers to a location used for passenger boarding and disembarking or for loading and unloading cargo, and includes, for example, a train station or a bus stop.

[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 external input or the like during operation of the system without storing the nearest station information in advance. The same applies to other storage means hereinafter.

[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 of the multiple devices, etc., as long as they are communicatively connected.

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

[0015] [Invention 3] Furthermore, in the commuter route simulation system of Invention 3, in the commuter route simulation system of Invention 1, when there are multiple stations nearest to the home of one of the target employees and one station nearest to the target workplace, the route information acquisition means sends a request to the search server in which the multiple stations nearest to the target employee's home are set as one of the departure station and arrival station, and the single station nearest 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 is the commuter route simulation system of any one of Inventions 1 to 3, and further comprises a payment regulation information acquisition means for acquiring payment regulation information related to the company's commuter travel expense payment from a storage means that stores the payment regulation information, and the route information acquisition means sets route search conditions based on the payment regulation information acquired by the payment regulation 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 is the commuter route simulation system of any one of Inventions 1 to 3, further comprising: payment regulation information acquisition means for acquiring payment regulation information from storage means for storing said payment regulation information regarding the company's commuter expense payment; and, when said route information acquisition means has acquired said route information regarding multiple routes for one of said target employees, route determination means for determining which of said multiple routes conforms to the standards regarding commuter expense payment based on the payment regulation information acquired by said payment regulation information acquisition means; and said simulation result generation means generates a commuter route simulation result based on the route information regarding the route determined by said route determination means.

[0020] With this configuration, when the payment regulation information acquisition means acquires payment regulation information and the route determination means acquires route information relating to multiple routes for one target employee, one of the multiple routes that meets the criteria for commuter transportation expense payment is determined based on the acquired payment regulation information.The simulation result generation means then generates simulation results based on the route information relating 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 from storage means that stores nearest station information related to the nearest station to each of a plurality of workplaces of the company, the route information acquisition means searches for a route between the nearest station to the target employee's home 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 employee and one of the target workplaces, the route information acquisition means sends a request to the search server in which the plurality of nearest stations to the target employee's home 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] With this configuration, the second nearest station information acquisition means acquires nearest station information for each of 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 that route from the search server.At this time, if there are multiple nearest stations to a target employee's home and 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 from storage means that stores nearest station information related to the nearest station to each of a plurality of workplaces of the company, the route information acquisition means searches for a route between the nearest station to the target employee's home 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 if there are multiple nearest stations to the home of one of the target employees, the route information acquisition means sends a request to the search server in which one of the departure station and arrival station is set to the multiple nearest stations to the target employee's home and the other of the departure station and arrival station is set to the nearest station to the multiple target workplaces.

[0024] With this configuration, the second nearest station information acquisition means acquires nearest station information for each of 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 that 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 the multiple nearest stations to the target employee's home are set as one of the departure station and arrival station, and the multiple nearest stations to the target workplaces are set as the other of the departure station and arrival station. [Effects of the Invention]

[0025] As explained above, with the commuting route simulation system of Invention 1, when there are multiple stations nearest to the home of a target employee and multiple stations nearest to the target workplace, only one request is sent to the search server, thereby reducing the number of requests. Also, simulation results are obtained that take into account the routes connecting the multiple stations nearest to the home and the multiple stations nearest to the target workplace.

[0026] Furthermore, with the commuting route simulation system of Invention 2, when a target employee has one nearest station to their home and multiple nearest stations to their workplace, only one request is sent to the search server, thereby reducing the number of requests. Also, simulation results are obtained that take into account the routes connecting the nearest station to the home and the multiple nearest stations to the target workplace.

[0027] Furthermore, with the commuting route simulation system of Invention 3, if there are multiple stations nearest to the home of a target employee and only one station nearest to the target workplace, only one request is sent to the search server, thereby reducing the number of requests. Also, simulation results are obtained that take into account the routes connecting the multiple stations nearest to the home and the station nearest to the target workplace.

[0028] Furthermore, according to the commute route simulation system of Invention 4, route search conditions are set based on payment regulations information regarding the company's commuter transportation expense payment, so simulation results can be obtained that take into account the company's commuter transportation expense payment.

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

[0030] Furthermore, the commute route simulation system of Inventions 6 and 7 can reduce the number of requests when there are multiple target workplaces. Also, for multiple target workplaces, simulation results can be obtained that take into account routes connecting multiple nearest stations to the home and multiple nearest stations to each of the target workplaces.

[0031] Furthermore, according to the commuting route simulation system of Invention 7, a single request is sent to the search server, in which multiple stations nearest to the target employee's home are set as one of the departure and arrival stations, and multiple stations nearest to the target workplace are set as the other of the departure and arrival stations, thereby reducing the number of requests compared to Invention 6. [Brief explanation 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; [Figure 2] FIG. 2 is a diagram illustrating a hardware configuration of a commute expense calculation server 100. [Figure 3] 4A and 4B 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. [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 fare information table 414, a payment regulations information table 416, and a search result information table 418. FIG. [Figure 5] 10 is a flowchart showing a commute route simulation process. [Figure 6] This is a screen for selecting the target employee and the target workplace. [Figure 7] 10 is a screen showing the results of a commute route simulation. DETAILED DESCRIPTION OF THE INVENTION

[0033] An embodiment of the present invention will be described below, with reference to Figures 1 to 7 showing the embodiment. In this embodiment, "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 the configuration of a network system according to this 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 Expense Calculation Server 100] Next, the configuration of the commute expense calculation server 100 will be described.

[0037] FIG. 2 is a diagram showing the hardware configuration of the commute expense calculation server 100. As shown in FIG. As shown in Figure 2, the commuter travel expense calculation server 100 is composed of a CPU (Central Processing Unit) 30 that controls calculations and the entire system based on a control program, a ROM (Read Only Memory) 32 that has the control program etc. of the CPU 30 stored in advance in a specified area, a RAM (Random Access Memory) 34 that stores data read from the ROM 32 etc. and the calculation results required in the calculation process of the CPU 30, and an I / F (Interface) 38 that 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 memory 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 3(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. FIG.

[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 information on commuting routes 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). The application control classification is information that determines whether or not applications from employees can be accepted, and the employee group classification information is information that indicates classifications such as job type, office, and affiliation of paid employee groups and other employee groups.

[0044] 3(b), one record is registered for each combination of company ID, company ID, and application start date in the workplace master table 402. Each record contains main information including company ID, company ID, company name, company 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 set for each company that lists the business days and holidays of the workplace, 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 the 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 (premium), and diesel (diesel), as well as unit price types for each type of eco-friendly vehicle, 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 the 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 classification, 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 used to identify the department to which an 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 that distinguishes between full-time employees, part-time employees, etc., and the authority level is information that indicates one of personnel authority, superior authority, and employee authority. Personnel authority is the authority to use all functions related to commuting expense management in this system, superior authority is the authority to only apply for commuting routes and approve the application contents, 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 about 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 more 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 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, commuter route, route usage period, 1-month commuter fare, 3-month commuter fare, 6-month commuter fare, 12-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 indicates the direction of the commute route, and can be outbound, return, or round trip. The route ID is information for identifying the commute route, and is composed of, for example, a unique number for each commute route (e.g., numbers only, a combination of letters and numbers). The commute route is the route from home to work. For example, if the commuter is a train, the route is "home → walk → nearest station (home) → intermediate station → nearest station (workplace) → walk → work." For example, if the commuter is a car, the route is "home → car → work." The one-month, three-month, six-month, and twelve-month commuter fares are the amounts of commuting expenses for the first, third, sixth, and twelve months for the specified commuter mode and route direction type, and the route reference date is the reference date on which the commuter route becomes valid.

[0051] When the destination or arrival point of a commute route is the workplace, the workplace ID and workplace name for the workplace that is the destination or arrival point are registered in association with the commute 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), the employee-specific payment information table 408 has one record registered for each combination of company ID, employee ID, route ID, and payment ID. Each record contains main information including company ID, employee ID, route ID, payment ID, start date, end date, payment date, payment method, payment period, number of payment months, payment / deduction amount, self-payment amount, type, period, remarks, cancellation date, payment details, number of subscription months, number of subscriptions, payment amount, total payment amount, total self-payment amount, and other information.

[0053] Here, the payment ID is information for identifying 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 commuter expenses, such as inclusion in salary, transfer to a bank account, or payment in kind (cash), and the number of months for payment and the number of regular months are either 1 month, 3 months, 6 months, or 12 months. The payment details are information indicating whether the payment is continuous, whether the payment cycle is fixed, and whether the fare revision process is applicable.

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

[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 that registers daily commuter travel expense payment information for each employee, a department information table 412 that registers information on approvers and proxy applicants for each department, a fare information table 414 that registers fare information related to fares for transportation such as trains and buses, a payment regulations information table 416 that registers payment regulations information related to the payment of commuter travel expenses, and a search result information table 418 that registers search result information related to search results from the route search server 130.

[0056] 4(a), the employee-specific daily payment information table 410 has one record registered for each combination of company ID, employee ID, route ID, and daily payment ID. Each record contains main information including company ID, employee ID, route ID, daily payment ID, start date, end date, payment date, payment method, daily payment period, number of days eligible for payment, type of direction of use (outbound / return / round trip), detailed payment information, 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 of use is information indicating the direction of use 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 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 supervisory authority who has the authority to approve commuting route applications for employees belonging to the department corresponding to the department ID, and the proxy applicant ID is the employee ID of an employee with authority to apply for commuting route applications on behalf of other employees belonging to the same department.

[0060] As shown in Figure 4(c), the fare information table 414 stores one record for each fare ID. Each record stores key information, including the fare ID, section information (e.g., the station numbers of the departure and arrival stations), fare type (e.g., one-month, three-month, six-month, 12-month, or 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 associated with the record with the older revision date can be identified as the fare before revision (hereinafter referred to as the "pre-revision fare"), and the fare associated with the record with the newer revision date can be identified as the revised fare (hereinafter referred to as the "revised fare"). The revision date of a record is the date on which the fare applies. The period from the older revision date to the day before the new revision date of the records before and after the revision is the applicable period of the pre-revision fare, and the period after the revision date of the newer record is the applicable period of the revised fare. For past revisions, the fare before revision, the fare after revision, the date and period of application of the fare can be identified from the fare and revision date of the record.

[0061] The employee's commuting expenses 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 employee's commuting expenses can be calculated by accumulating the fares for the commuting route based on the route information in the employee route information table 406, the pro rata payment information in the employee daily payment information table 410, and the fare information in the fare information table 414. When calculating commuting expenses, for each commuting route, 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 the date or period of use on which that commuting route was used.

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

[0064] Here, the regulation criteria are standards for determining whether a commuter route is appropriate, and are set for each company in accordance with the company's commuter travel expense payment regulations. The regulation criteria can be set to determine whether a commuter route complies with the commuter travel expense payment regulations, for example, by (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. It can also be set to (1) apply an IC fare (the fare applicable when using an IC card ticket) or (2) apply a regular fare instead of an IC fare.

[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 contains 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 pass fare, a three-month pass fare, a six-month pass fare, a 12-month pass fare, and a one-way fare.

[0067] Although not shown, the storage device of database server 120 stores, in addition to tables 400 to 424, tables in which various definition data for calculating commuter expenses and tables in which various basic data for linking commuter expenses with salary are registered. Specific examples of basic data tables include a salary basic data table, a tax 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 for the amount of commuting allowance paid, the basic social insurance data is data on social insurance premiums for the amount of commuting allowance paid, and the basic employment insurance data is data on employment insurance premiums for 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 related to routes and fare information related to fares 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 related to the retrieved route and the fare information related to the retrieved fare 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 one departure station to 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 routes and fares from one departure station to that 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 routes and fares 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, the search results will include route AC and its fare, route BC and its fare, route AD and its fare, and route BD and its fare.

[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 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 can be set. It is also possible to set (1) the application of IC card fares, or (2) the application of regular fares instead of IC cards. For example, if the departure station is A, the arrival station is B, and (1) is set as the route search condition, the search results will show the route A and its fare with the shortest travel time.

[0076] [Employee terminal 200] The employee terminal 200 may be a stationary terminal like the commuter travel expense calculation server 100, or a portable terminal such as a smartphone or tablet. In the former case, its hardware configuration is the same as that of the commuter travel expense calculation server 100. In the latter case, its hardware configuration is composed of a CPU, a ROM that stores programs such as application software and data for executing the programs, a RAM that stores data read from the ROM and calculation results required for the CPU's calculation process, and an interface that mediates data input and output to various attached devices. These are connected to each other via signal lines for data transfer so that data can be exchanged. The interface is connected to various attached devices such as a touch-panel display input device that can input data and display a screen based on image signals, a storage device, a wireless communication device, and a video camera.

[0077] [Operation] Next, the operation when performing a commute route simulation will be explained. Note that, 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 explanation will be given assuming that commute travel expense calculation server 100 accesses tables 400-424. Also, since a commute route simulation is performed by logging in for each company using its account, in the following explanation, "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 a target workplace that is a candidate for the transfer, searching the route from the nearest station to the target employee's home to the nearest station to the target workplace and the fare for that route using the route search server 130, and simulating the total commute transportation costs.

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

[0080] Figure 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 a predetermined program stored in a predetermined area of ​​the ROM 32, and executes the commute 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, the process first proceeds to step S100.

[0082] In step S100, the employee information master table 404 is referenced to select target employees from among the employees belonging to the company. In the example of FIG. 6, the employee number, employee name, address, or workplace is entered as a search key in a text box or the like 500. The workplace is selected from a list of workplaces for the company in a select box. When the search key is entered and the search button 502 is clicked, employee information corresponding to the entered search key is searched from the employee information master table 404, and the employee number, employee name, and commuting method for each employee based on the retrieved employee information are displayed in a text box 504. Then, when one or more employees are selected from the employees in the text box 504 and button 506 is clicked, the selected employees are added as target employees in a text box 508. Target employees can also be added directly. In this case, the employee number, employee name, address, or workplace is entered as a search key in a text box or the like 510. The workplace is selected from a list of workplaces for the company in a select box. When a search key is entered and the search button 512 is clicked, the 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 select box 514. The same is true for workplaces 2 to 5. In the example of FIG. 6, the maximum number of workplaces is five, but it is also possible to set six or more workplaces.

[0084] Next, the process proceeds to step S104, where the company's payment regulation information is obtained from payment regulation information table 416. In the example of FIG. 6, the route search conditions can be set, for example, 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. (1) to (6) are selected using radio buttons 516. Also, (1) applying IC card fares or (2) applying regular fares instead of IC cards fares can be set using radio buttons 518. (1) to (2) are selected using 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, leave the default value and click execute button 520. 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 default using radio buttons 516 and 518 and click execute button 520. When the execute button 520 is clicked, the processes from step S106 onwards are executed.

[0085] Next, the process proceeds to step S106, where workplace information including the nearest station information for the first target workplace is obtained from the workplace master table 402, the process proceeds 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 the process proceeds 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] If there is one nearest station to the target employee's home and one nearest station to the target workplace, a request is generated in which the one nearest station to the target employee's home 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] If 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 the regulation determination criteria are set as route search conditions.

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

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

[0091] Next, the process proceeds to step S112, where the generated request is sent to route search server 130, and then to step S114, where the search results for the sent request are received from route search server 130, and then to step S116.

[0092] In step S116, if the search results obtained in step S114 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 that meets the regulation criteria is determined based on the payment regulation information obtained in step S104. For example, if the target employee has two nearest stations to his or her home and two nearest stations to his or her workplace, the search results will include four routes. In this case, for example, if the regulation criteria (1) are 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 criteria. Also, for example, if the regulation criteria (2) are set to the route with the fewest transfers, the route with the fewest transfers among the four routes is determined to meet the regulation criteria. Once the route is determined, the company ID, employee ID, workplace ID, search date and time, departure station, arrival station, route search criteria, 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 the processing of steps S110 to S116 has been completed for all selected target employees, and if it is determined that the processing has been completed for all target employees (YES), the process proceeds to step S120 to determine whether the processing of steps S108 to S118 has been completed for all selected target workplaces, and 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 simulation results for the commuter route. As shown in FIG. 7, the simulation results are displayed as a summary in text box 520 for each target workplace, including the employer's name, workplace address, total 1-, 3-, 6-, and 12-month commuter fares, total one-way fare, and other information. The total monthly commuter fare can be calculated, for example, by adding up the monthly commuter fares for the route determined for each target employee for all target employees. The same applies to the total 3-, 6-, and 12-month commuter fares and total one-way fare. Furthermore, when a target workplace is selected in select box 522, the employee number, employee name, commuting method, 1-, 3-, 6-, and 12-month commuter fares, one-way fare, one-way distance, and other information for each target employee for the selected target workplace are displayed in text box 524. 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 sent to the employee terminal 200 of the employee who is logged in, and the series of processes ends.

[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, information on the nearest station to the home of each of multiple target employees and information on the nearest station to the target workplace is obtained for each of multiple 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 multiple nearest stations to the target workplace are set to the arrival station, and for each target employee, the 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, route information related to that route and fare information related to that fare are obtained from route search server 130, and simulation results are generated based on the obtained route information and fare information.

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

[0100] Furthermore, in this embodiment, if 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 their home and multiple nearest stations to their workplace, since only one request is sent to the route search server 130. Furthermore, simulation results are obtained that take into account 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 stations nearest to the home of a target employee and one station nearest to the target workplace, a request is sent to the route search server 130, in which the multiple stations nearest to the target employee's home are set as the departure station and the one station nearest to the target workplace is set as the arrival station.

[0103] This reduces the number of requests when there are multiple stations nearest to the home of a target employee and only one station nearest to the target workplace, since only one request is sent to the route search server 130. Also, simulation results are obtained that take into account the routes connecting the multiple stations nearest to the home and the station nearest to the target workplace.

[0104] Furthermore, in this embodiment, the payment regulation information of the company is acquired from the payment regulation information table 416, and a request in which route search conditions are set based on the acquired 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 the route from one nearest station to the target employee's home to one 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 multiple nearest stations 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 each target employee, the 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 related to that route and fare information related to that fare are obtained from route search server 130.

[0107] This allows us to reduce the number of requests when there are multiple target workplaces. Also, we can obtain simulation results that take into account the routes connecting the multiple nearest stations to the home and the multiple nearest stations to 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 invention 5.

[0110] [Modification] In the above embodiment and its modified example, the route is not distinguished between outbound and inbound journeys, but this is not limiting, and it is possible to search by distinguishing between outbound and inbound journeys, for example, when the fares for the outbound and inbound journeys are different. For example, the following configuration can be adopted.

[0111] In the first configuration, for each target employee, if the target employee uses the searched route for the outbound journey to commute, the route and fare obtained when the search is performed for the outbound journey (by setting the nearest station to the home as the departure station and the nearest station to the workplace as the arrival station) are adopted. Also, if the target employee uses the searched route for the return journey to commute, the route and fare obtained when the search is performed for the return journey (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. Also, if the target employee uses the searched route for a round-trip journey to commute, the route and fare obtained when the search is performed for both the outbound and return journeys are adopted. The determination of whether the route is outbound, return, or 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 another table, or by specifying whether the route is outbound, return, or round-trip in the simulation results.

[0112] In the second configuration, if the route searched for the target employee is registered as the target employee's commute 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 that commute route. If the route direction type is the outbound route, the route searched for as the outbound route is determined. If the route direction type is the return route, the route searched for as the return route is determined. If the route direction type is a round trip, the routes searched for both the outbound route and the return route are determined.

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

[0114] In the above embodiment and its modified examples, (1) to (6) and (1) to (2) are exemplified as the regulation determination criteria, but the regulation determination criteria are not 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 can also be included. This criterion may be set as a criterion independent of (1) to (6) and (1) to (2), or may be set as an additional criterion after satisfying either (1) to (6) or (1) to (2).

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

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

[0117] Furthermore, while the above-described embodiment and its variations did not take social insurance premiums and employment insurance premiums into consideration, this is not limiting and since commuting expenses are also subject to 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 from the route search server 130, and simulation results are generated based on the calculated social insurance premiums, etc. The simulation results are configured as a page that provides, for example, a tab or drop-down list for selecting target workplaces, and displays, for each target employee, the route from the nearest station to the target employee's home to the nearest station to the target workplace, fares and social insurance premiums, etc., as well as the total fares and social insurance premiums, etc., for all target employees, for the selected target workplaces.

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

[0119] Furthermore, in the above embodiment and its variations, one request per target employee is sent to the route search server 130. However, this is not limited to this. Alternatively, a configuration may be adopted in which it is determined whether the route information to be obtained with one request (route information relating 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 may include, for example, route information searched within a predetermined period from the present (e.g., within the same day, within one day, within three days, or within one week) or route information searched after the most recent fare revision by referring to the fare information table 414. For example, if we consider a service that allows users to get a rough estimate by reducing the accuracy of a commute route simulation, provided that it is available for a low or no charge, since searches by the route search server 130 incur a fee according to the number of requests, we can adopt a configuration that covers all route information or route information searched within a fairly long period of time (for example, within one year).

[0120] Furthermore, in the above embodiment and its variations, the departure station in the request 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 the departure station can also be set to the nearest station to the target workplace, and the arrival station can also be set to the nearest station to the target employee's home.

[0121] Furthermore, in the above embodiment and its variants, regulation judgment criteria are set as route search conditions in the request, but this is not limited to this, and other conditions may be set as route search conditions, or route search conditions may not be set at all.

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

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

[0124] Furthermore, in the above embodiment and its variants, the route direction type and 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 usage direction type can be configured as one-way or round-trip information.

[0125] Furthermore, in the above embodiment and its modifications, 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] Furthermore, in the above embodiment and its modifications, 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 communicates using the same method as the Internet 199. Of course, the present invention is not limited to a network that communicates using the same method as the Internet 199, and may be applied to a network of any communication method.

[0127] Furthermore, in the above embodiment and its variants, the processing shown in the flowchart of FIG. 5 is performed by executing a program that is pre-stored in ROM. However, this is not limited to this, 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 modifications, the present invention is applied to cases such as generating a simulation result of a commute route, but it is not limited to this and can be applied to other cases without departing from the spirit of the present invention. For example, the present invention can be applied to cases such as simulating travel expenses for business trips and other travel expenses. [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 boxes, etc., 502, 512...search buttons, 504, 508, 520, 524...text boxes, 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 for each of a plurality of target employees from a storage means for storing nearest station information for each of a plurality of employees belonging to a company, the nearest station information being related to the nearest station to the home of the employee; a second nearest station information acquisition means for acquiring nearest station information of the target workplace from a storage means for storing nearest station information relating to the nearest station of the workplace of the company; a route information acquisition means for searching, for each target employee, a route between the nearest station to the target employee's home and the nearest station to the target workplace 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 simulation result generation means for generating a simulation result of a commute route based on the route information acquired by the route information acquisition means; 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 nearest stations to the target workplace, the route information acquisition means sends a request to the search server in which one of the departure station and arrival station is set to multiple nearest stations to the home of the target employee, and the other of the departure station and arrival station is set to multiple nearest stations to the target workplace.

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

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

4. In any one of claims 1 to 3, a payment regulations information acquisition means for acquiring payment regulations information relating to the payment of commuting expenses from a storage means for storing the payment regulations information; A commuter route simulation system characterized in that the route information acquisition means sets route search conditions based on the payment regulation information acquired by the payment regulation information acquisition means, and sends the request including the set route search conditions to the search server.

5. In any one of claims 1 to 3, a payment regulation information acquisition means for acquiring payment regulation information relating 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, which of the plurality of routes conforms to the criteria for commuter transportation allowance based on the payment regulations information acquired by the payment regulations information acquisition means; The commute route simulation system is characterized in that the simulation result generating means generates a commute route simulation result based on the route information relating to the route determined by the route determining means.

6. In any one of claims 1 to 3, the second nearest station information acquisition means acquires nearest station information of a target workplace for each of a plurality of target workplaces from a storage means that stores nearest station information relating to the nearest station of the workplace for 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 the nearest stations to one of the target workplaces, the route information acquisition means sends a request to the search server in which one of the departure station and arrival station is set to multiple nearest stations to the home of the target employee, and the other of the departure station and arrival station is set to multiple nearest stations to the target workplace.

7. In any one of claims 1 to 3, the second nearest station information acquisition means acquires nearest station information of a target workplace for each of a plurality of target workplaces from a storage means that stores nearest station information relating to the nearest station of the workplace for 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; A commute route simulation system 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 one of the departure station and arrival station is set to the multiple stations nearest to the target employee's home, and the other of the departure station and arrival station is set to the stations nearest to the multiple target 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