Commuting Route Simulation System

Abstract

Provided is a commuting route simulation system that is suitable for obtaining a desired simulation result by suppressing the number of requests when there are a plurality of nearest stations to the user's home or workplace. 【Solution means】 The commuting transportation cost calculation server 100 acquires the nearest station information of the home of each of a plurality of target employees and the nearest station information of the target workplace, and based on the acquired nearest station information, when there are a plurality of nearest stations of the home of one target employee and the target workplace, it sets a plurality of nearest stations of the home of the target employee as the departure stations and a plurality of nearest stations of the target workplace as the arrival stations, and sends a single request to the route search server 130. Then, for each target employee, it acquires route information and fare information from the route search server 130. And based on the acquired route information and fare information, it generates a simulation result of the commuting route.

Description

Technical Field

[0001] The present invention relates to a system for simulating a commuting route, and particularly to a commuting route simulation system suitable for obtaining a desired simulation result by suppressing the number of requests when there are multiple nearest stations to the home or workplace.

Background Art

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

[0003] The technique described in Patent Document 1 includes a destination information acquisition unit that acquires destination information including the location information of the first and second destinations, a mover information acquisition unit that acquires mover information including the location information of the departure places of a plurality of movers, and based on the destination information and the mover information, a first movement cost information including the movement cost of each mover when a plurality of movers move between their respective departure places and the first destination, and a second movement cost information including the movement cost of each mover when a plurality of movers move between their respective departure places and the second destination, and a movement cost information acquisition unit that acquires the first and second movement cost information, and a destination-specific movement cost information generation unit that statistically processes the first and second movement cost information respectively to generate first destination-specific movement cost information and second destination-specific movement cost information.

Prior Art Documents

Patent Documents

[0004]

Patent Document 1

Summary of the Invention

Problems to be Solved by the Invention

[0005] However, in the technology described in Patent Document 1, when there are multiple nearest stations to the home or workplace of the traveler, it is impossible to calculate the desired travel cost. For example, it is impossible to calculate the travel cost considering the routes of each nearest station or the travel cost in accordance with the company's commuting transportation expense payment regulations. Also, when performing a route search using a search server, for one user, requests equal to the number of nearest stations to the home × the number of nearest stations to the workplace will be sent. For example, when there are 2 nearest stations to the home and 2 nearest stations to the workplace, 2 × 2 = 4 requests will be sent. Therefore, the search load increases, or when usage fees are set according to the number of requests, the search cost increases.

[0006] Therefore, the present invention has been made paying attention to such unsolved problems of the conventional technology, and aims to provide a commuting route simulation system suitable for obtaining a desired simulation result by suppressing the number of requests when there are multiple nearest stations to the home or workplace.

Means for Solving the Problem

[0007] [[Invention 1]] To achieve the above object, the commuting route simulation system of Invention 1 includes: a first nearest station information acquisition means for acquiring, for each of a plurality of target employees, the nearest station information regarding the nearest station to the home of the target employee from a storage means that stores the nearest station information regarding the nearest station to the home of each of the plurality of employees belonging to a company; a second nearest station information acquisition means for acquiring the nearest station information of the target workplace from a storage means that stores the nearest station information regarding the nearest station to the workplace of the company; a route information acquisition means for searching, for each of the target employees, 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 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 regarding the route from the search server; and a simulation result generation means for generating a simulation result of the commuting route based on the route information acquired by the route information acquisition means. The route information acquisition means, when there are a plurality of nearest stations to the home of one of the target employees and a plurality of nearest stations to the target workplace, transmits a single request to the search server in which a plurality of nearest stations to the home of the target employee are set for one of the departure station and the arrival station, and a plurality of nearest stations to the target workplace are set for the other of the departure station and the arrival station.

[0008] With such a configuration, the first nearest station information acquisition means acquires the nearest station information regarding the nearest station to the home of each of the plurality of target employees, and the second nearest station information acquisition means acquires the nearest station information of the target workplace. Next, the route information acquisition means searches, for each of the target employees, 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 based on the acquired nearest station information, and acquires route information regarding the route from the search server. At this time, when there are a plurality of nearest stations to the home of one of the target employees and a plurality of nearest stations to the target workplace, a single request in which a plurality of nearest stations to the home of the target employee are set for one of the departure station and the arrival station, and a plurality of nearest stations to the target workplace are set for the other of the departure station and the arrival station is transmitted to the search server. Then, the simulation result generation means generates a simulation result based on the acquired route information.

[0009] Here, as the route information, for example, route information regarding a route when using a transportation means is included.

[0010] In addition, the "station" of the nearest station refers to a place used for passengers to board and alight or for cargo to be loaded and unloaded, and includes, for example, a railway station and a bus stop.

[0011] Also, the storage means stores the nearest station information by any means and at any time. It may store the nearest station information in advance, or may be configured to store the nearest station information from an external input or the like during the operation of the present system without pre-storing the nearest station information. The same applies to other storage means below.

[0012] Further, the present system may be realized as a single device, terminal, or other equipment, or may be realized as a network system in which a plurality of devices, terminals, or other equipment are communicably connected. In the latter case, each component may belong to any of the plurality of devices or the like as long as they are communicably connected to each other.

[0013] 〔Invention 2〕Furthermore, in the commuting route simulation system of Invention 2, in the commuting route simulation system of Invention 1, when there is one nearest station to the home of one of the target employees and a plurality of nearest stations to the target workplace, the route information acquisition means transmits a request to the search server in which one nearest station to the home of the target employee is set for one of the departure station and the arrival station, and a plurality of nearest stations to the target workplace are set for the other of the departure station and the arrival station.

[0014] With such a configuration, when there is one nearest station to the home of one of the target employees and a plurality of nearest stations to the target workplace, the route information acquisition means transmits a request to the search server in which one nearest station to the home of the target employee is set for one of the departure station and the arrival station, and a plurality of nearest stations to the target workplace are set for the other of the departure station and the arrival station.

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

[0016] With such a configuration, when there are multiple nearest stations to the home of one target employee and only one nearest station to the target workplace, the route information acquisition means sends a request to the search server in which a plurality of nearest stations to the home of the target employee are set for one of the departure station and the arrival station, and one nearest station to the target workplace is set for the other of the departure station and the arrival station.

[0017] [Invention 4] Furthermore, in the commuting route simulation system of Invention 4, in the commuting route simulation system of any one of Inventions 1 to 3, the commuting route simulation system includes a payment regulation information acquisition means for acquiring payment regulation information regarding the payment of commuting transportation expenses of the company from a storage means for storing the payment regulation information. 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 a request including the set route search conditions to the search server.

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

[0019] [[Invention 5]] Further, in the commuting route simulation system of Invention 5, in the commuting route simulation system of any one of Inventions 1 to 3, there is provided a payment regulation information acquisition means for acquiring the payment regulation information from a storage means for storing the payment regulation information regarding the payment of the commuting transportation expenses of the company, and when the route information acquisition means acquires the route information regarding a plurality of routes for one of the target employees, based on the payment regulation information acquired by the payment regulation information acquisition means, there is provided a route determination means for determining which of the plurality of routes conforms to the criteria regarding the payment of commuting transportation expenses. The simulation result generation means generates a simulation result of the commuting route based on the route information regarding the route determined by the route determination means.

[0020] With such a configuration, the payment regulation information acquisition means acquires the payment regulation information. When the route determination means acquires the route information regarding a plurality of routes for one target employee, based on the acquired payment regulation information, which of the plurality of routes conforms to the criteria regarding the payment of commuting transportation expenses is determined. Then, the simulation result generation means generates a simulation result based on the route information regarding the determined route.

[0021] [[Invention 6]] Further, in the commuting route simulation system of Invention 6, in the commuting route simulation system of any one of Inventions 1 to 3, the second nearest station information acquisition means acquires the nearest station information regarding the nearest station of each of a plurality of workplaces of the company from a storage means for storing the nearest station information regarding the nearest station of each workplace, and for each of the plurality of target workplaces, acquires the nearest station information regarding the nearest station of the target workplace. The route information acquisition means searches, for each of the target workplaces and each of the target employees, for the route between the nearest station of the target employee's home and the nearest station of the target workplace by a search server and acquires the route information regarding the route from the search server. When there are a plurality of nearest stations of the home of one of the target employees and a plurality of nearest stations of one of the target workplaces, the route information acquisition means transmits to the search server a single request in which a plurality of the nearest stations of the home of the target employee are set for one of the departure station and the arrival station, and a plurality of the nearest stations of the target workplace are set for the other of the departure station and the arrival station.

[0022] With such a configuration, the second nearest station information acquisition means acquires the nearest station information of each of the plurality of target workplaces. Then, the route information acquisition means searches, for each target workplace and each target employee, the route between the nearest station of the target employee's home and the nearest station of the target workplace from the search server, and acquires route information regarding the route from the search server. At this time, when there are a plurality of nearest stations of the home of one target employee and a plurality of nearest stations of one target workplace, a single request is sent to the search server in which a plurality of nearest stations of the home of the target employee are set for one of the departure station and the arrival station, and a plurality of nearest stations of the target workplace are set for the other of the departure station and the arrival station.

[0023] 〔Invention 7〕 Further, in the commuting route simulation system of Invention 7, in the commuting route simulation system according to any one of Inventions 1 to 3, the second nearest station information acquisition means acquires the nearest station information of each of the plurality of workplaces of the company from the storage means that stores the nearest station information regarding the nearest station of each workplace, for each of the plurality of target workplaces. The route information acquisition means searches, for each target workplace and each target employee, the route between the nearest station of the target employee's home and the nearest station of the target workplace from the search server, and acquires route information regarding the route from the search server. When there are a plurality of nearest stations of the home of one target employee, the route information acquisition means sends a single request to the search server in which a plurality of nearest stations of the home of the target employee are set for one of the departure station and the arrival station, and a plurality of nearest stations of the plurality of target workplaces are set for the other of the departure station and the arrival station.

[0024] With such a configuration, the second nearest station information acquisition means acquires the nearest station information of each of the plurality of target workplaces. Then, the route information acquisition means searches the search server for the route between the nearest station of the home of the target employee and the nearest station of the target workplace for each target workplace and each target employee, and acquires the route information regarding the route from the search server. At this time, when there are a plurality of nearest stations of the home of one target employee, one request is transmitted to the search server in which a plurality of nearest stations of the home of the target employee are set for one of the departure station and the arrival station, and the nearest stations of the plurality of target workplaces are set for the other of the departure station and the arrival station.

Effect of the Invention

[0025] As described above, according to the commuting route simulation system of Invention 1, when there are a plurality of nearest stations of the home of one target employee and a plurality of nearest stations of the target workplace, one request is transmitted to the search server, so the number of requests can be suppressed. In addition, a simulation result considering the routes connecting the plurality of nearest stations of the home and the plurality of nearest stations of the target workplace can be obtained.

[0026] Furthermore, according to the commuting route simulation system of Invention 2, when there is one nearest station of the home of one target employee and a plurality of nearest stations of the target workplace, one request is transmitted to the search server, so the number of requests can be suppressed. In addition, a simulation result considering the routes connecting the nearest station of the home and the plurality of nearest stations of the target workplace can be obtained.

[0027] Furthermore, according to the commuting route simulation system of Invention 3, when there are a plurality of nearest stations of the home of one target employee and one nearest station of the target workplace, one request is transmitted to the search server, so the number of requests can be suppressed. In addition, a simulation result considering the routes connecting the plurality of nearest stations of the home and the nearest station of the target workplace can be obtained.

[0028] Furthermore, according to the commuting route simulation system of Invention 4, since the route search conditions are set based on the payment regulations information regarding the commuting transportation expenses paid by the company, a simulation result considering the commuting transportation expenses paid by the company can be obtained.

[0029] Furthermore, according to the commuting route simulation system of Invention 5, since among a plurality of routes, those conforming to the criteria regarding the commuting transportation expenses payment are determined based on the payment regulations information regarding the commuting transportation expenses paid by the company, a simulation result considering the commuting transportation expenses paid by the company can be obtained.

[0030] Furthermore, according to the commuting route simulation system of Invention 6 or 7, when there are a plurality of target workplaces, the number of requests can be suppressed. Also, a simulation result considering the routes connecting the plurality of nearest stations to the home of the employee and the plurality of nearest stations to the target workplace for the plurality of target workplaces can be obtained.

[0031] Furthermore, according to the commuting route simulation system of Invention 7, since one request in which a plurality of nearest stations to the home of the target employee are set for one of the departure station and the arrival station, and a plurality of nearest stations to the target workplace are set for the other of the departure station and the arrival station is transmitted to the search server, the number of requests can be suppressed more than that of Invention 6.

Brief Description of the Drawings

[0032]

Figure 1

Figure 2

Figure 3

Figure 4

Figure 5

Figure 6

Figure 7

Mode for Carrying Out the Invention

[0033] Hereinafter, embodiments of the present invention will be described. FIGS. 1 to 7 are diagrams showing this embodiment. In this embodiment, "employee" refers to full-time employees, part-timers, and other workers.

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

[0035] As shown in FIG. 1, the Internet 199 is connected to a commuting transportation fee calculation server 100 that calculates the commuting transportation fee and the amount of the commuting transportation fee payment, a database server 120 that manages various table information used by the commuting transportation fee calculation server 100, a route search server 130 that performs a route search in response to a request, and an employee terminal 200 used by the employees of the company.

[0036] 〔Commuting Transportation Fee Calculation Server 100〕 Next, the configuration of the commuting transportation fee calculation server 100 will be described.

[0037] FIG. 2 is a diagram showing the hardware configuration of the commuting transportation fee calculation server 100. As shown in FIG. 2, the commuting transportation expense calculation server 100 includes a CPU (Central Processing Unit) 30 that controls operations and the entire system based on a control program, a ROM (Read Only Memory) 32 that stores the control program of the CPU 30 and the like in a predetermined area in advance, a RAM (Random Access Memory) 34 that stores data read from the ROM 32 and the like and calculation results necessary in the calculation process of the CPU 30, and an I / F (InterFace) 38 that mediates data input and output to and from external devices. These are connected to each other via a bus 39, which is a signal line for transferring data, so that data can be exchanged between them.

[0038] Connected to the I / F 38 as external devices are an input device 40 consisting of a keyboard, a 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 commuting transportation expense calculation server 100.

[0040] FIGS. 3(a) to (e) are diagrams showing the data structures of the company master table 400, the work location master table 402, the employee information master table 404, the route information table 406 for each employee, and the payment information table 408 for each employee.

[0041] As shown in FIGS. 3(a) to 3(e), the storage device of the database server 120 stores a company master table 400 for registering company information, a work location master table 402 for registering work location 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 the commuting routes for each employee, and an employee-specific payment information table 408 for registering information on the payment of commuting transportation expenses for each employee.

[0042] As shown in FIG. 3(a), in the company master table 400, one record is registered for each combination of company ID and application start date. Each record stores main information including company ID, company name, application control classification, employee group classification 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 (e.g., only numbers, a combination of letters and numbers). The application control classification is information for setting whether to accept applications from employees, and the employee group classification information is information indicating classifications such as the paid employee group, the job types, offices, and affiliations of other employee groups.

[0044] As shown in FIG. 3(b), in the work location master table 402, one record is registered for each combination of company ID, work location ID, and application start date. Each record stores main information including company ID, work location ID, work location name, work location 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 (e.g., only numbers, a combination of letters and numbers). Also, the calendar ID is information for identifying a calendar in which business days and holidays of workplaces set for each company are recorded, and is composed of, for example, a unique number for each type of calendar (e.g., only numbers, a combination of letters and numbers). Also, the fuel unit price type ID is information for identifying the fuel unit price types set for each company, and is composed of, for example, a unique number for each unit price type (e.g., only numbers, a combination of letters and numbers). Note that as fuel unit price types, there are unit price types for each fuel such as gasoline (regular), gasoline (high-octane), diesel (gas oil), etc., and unit price types for each type of eco-car such as EV (electric vehicle), PHV (plug-in hybrid electric vehicle), FCV (fuel cell vehicle). Also, the map information includes the location information of the workplace and the nearest station information.

[0046] As shown in FIG. 3(c), in the employee information master table 404, one record is registered for each combination of company ID, employee ID, and application start date. Each record registers main information including company ID, employee ID, employee name, employee name (in kana), postal code of the employee's home, address of the employee's home, 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 for identifying the department to which an employee belongs. For example, it is composed of a unique number for each department (e.g., only numbers, a combination of letters and numbers). The employee classification is information for classifying full-time employees, part-timers, etc. The authority level is information indicating any one of personnel authority, superior authority, and employee authority. Personnel authority is the authority to use all functions related to the commuting expenses business of this system. Superior authority is the authority to only apply for and approve the application content of the commuting route. Employee authority is the authority to only apply for the commuting route. Also, the map information includes the location information of the employee's home and the information of the nearest station.

[0048] An employee may belong to multiple workplaces. For example, in the case of commuting to Workplace A in the first half of the month and Workplace B in the second half of the month. Therefore, in the employee information master table 404, one or more workplace IDs and workplace names can be registered for one employee.

[0049] In the route information table 406 for each employee, as shown in FIG. 3(d), one record is registered for each combination of company ID, employee ID, and route ID. Each record registers main information including company ID, employee ID, vehicle ID, route direction type, the nearest station to the employee's home, workplace ID, workplace name, the nearest station to the workplace, route ID, commuting route, route usage period, one-month season ticket fare, three-month season ticket fare, six-month season ticket fare, twelve-month season ticket 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 utilization direction of the commuting route, which is information on the outbound route, return route, or round trip. Also, the route ID is information for identifying the commuting route and is composed of, for example, a unique number (e.g., only numbers, combinations of letters and numbers) for each commuting route. Further, the commuting route is the route from home to the workplace. For example, if the commuting means is a railway, it is "home → walk → nearest station (home) → intermediate station → nearest station (workplace) → walk → workplace", and if the commuting means is a car, it is "home → car → workplace". Also, the one-month fixed fare, three-month fixed fare, six-month fixed fare, and twelve-month fixed fare are the amounts of the commuting transportation costs for 1, 3, 6, and 12 months for the set commuting means and route direction type, and the route reference date is the reference date when the commuting route becomes valid.

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

[0052] As shown in FIG. 3(e), in the employee-specific payment information table 408, one record is registered for each combination of the company ID, employee ID, route ID, and payment ID. Each record registers main information including the company ID, employee ID, route ID, payment ID, start date, end date, payment date, payment method, payment target period, number of months of payment target, payment / deduction amount, self-burden amount, type, period, remarks, cancellation date, payment details information, number of regular months, number of regular sheets, payment amount, total payment amount, total self-burden 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 piece of payment information (for example, only numbers, a combination of letters and numbers), etc. Also, the payment method is information indicating the method of paying commuting transportation expenses such as incorporating into salary, transferring to a bank account, paying in kind (cash), etc. The number of months of payment target and the regular number of months are either 1 month, 3 months, 6 months, or 12 months. Also, the payment details information is information indicating whether it is the target of continuous payment, whether it is the target of fixed payment cycle, and whether it is the target of wage revision processing.

[0054] Figures 4(a) to (e) are diagrams showing the data structures of the daily rate payment information table 410 for each employee, 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), in the storage device of the database server 120, there is a daily rate payment information table 410 for registering the daily rate commuting transportation expense payment information for each employee, a department information table 412 for registering the information of approvers and proxy applicants for each affiliated department, a fare information table 414 for registering fare information regarding transportation means such as railways and buses, a payment regulations information table 416 for registering payment regulations information regarding commuting transportation expense payment, and a search result information table 418 for registering search result information regarding the search results of the route search server 130.

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

[0057] Here, the schedule ID is information for identifying schedule information, and is composed of, for example, a unique number (e.g., only numbers, combinations of characters and numbers) for each piece of schedule information. Also, the schedule payment target period is information indicating the target period for calculating commuting transportation expenses on a per-schedule basis, the number of payable days is information on the number of days for which commuting transportation expenses are paid on a per-schedule basis within the schedule payment target period, the usage direction type is information indicating the usage direction of the commuting route used during the schedule payment target period, and is information on the outbound trip, inbound trip, or round trip. Also, the payment details information is information indicating whether or not it is subject to fare revision processing.

[0058] As shown in FIG. 4(b), for each combination of company and affiliated department, one record is registered in the department information table 412. Each record contains main information including company ID, affiliated 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 has the authority to approve applications for the commuting routes of employees belonging to the affiliated department corresponding to the affiliated department ID, and the proxy applicant ID is the employee ID of an employee who has the authority to proxy-apply for commuting route applications for other employees belonging to the same affiliated department.

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

[0061] The commuting transportation expenses of employees can be calculated by accumulating the freight related to the commuting route based on the route information in the employee - specific route information table 406 and the freight information in the freight information table 414.

[0062] Also, when paying the commuting transportation expenses on a daily basis, the commuting transportation expenses of employees can be calculated by accumulating the freight related to the commuting route based on the route information in the employee - specific route information table 406, the daily payment information in the employee - specific daily payment information table 410, and the freight information in the freight information table 414. When calculating the commuting transportation expenses, for each commuting route, regarding the calculation of the commuting transportation expenses for the usage date or usage period using that commuting route, the freight corresponding to the application date or application period corresponding to that usage date or usage period is applied.

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

[0064] Here, the regulation determination criteria are criteria for determining the suitability of the commuting route, and are set for each company in accordance with the company's commuting transportation expense payment regulations. As the regulation determination criteria, as a commuting route that conforms to the commuting transportation expense payment regulations, for example, (1) the route with the shortest required time, (2) the route with the fewest transfer times, (3) the route with the lowest one-way fare, (4) the route with the lowest monthly commuter pass fare, (5) the route with the lowest three-month commuter pass fare, or (6) the route with the lowest six-month commuter pass fare can be set. Also, it can be set to (1) apply the IC fare (the fare applicable when using an IC card commuter ticket), or (2) apply the normal fare instead of the IC fare.

[0065] As shown in FIG. 4(e), in the search result information table 418, one record is registered for each combination of company ID, employee ID, work location ID, search date and time, and route. In each record, main information including company ID, employee ID, work location ID, search date and time, departure station, arrival station, route search conditions, route, fare, and other information is registered.

[0066] Here, the route is the route that is the search result of the route search server 130, and is the route from the nearest station to the home to the nearest station to the work location. Also, the fare includes the monthly commuter pass fare, the three-month commuter pass fare, the six-month commuter pass fare, the twelve-month commuter pass fare, and the one-way fare.

[0067] Although not shown in the figure, in the storage device of the database server 120, in addition to the tables 400 to 424, tables in which various definition data for calculating commuting transportation expenses and the like are registered, tables in which various basic data for linking commuting transportation expenses with salaries are registered, and the like are stored. Specifically, as the basic data tables, there are a salary basic data table, a tax base data table, a social insurance basic data table, an employment insurance basic data table, and the like.

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

[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 commuting transportation expense calculation server 100.

[0070] The route search server 130 is configured to have a database in which route information regarding routes and fare information regarding 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 the route and fare from the departure station to the arrival station according to the route search conditions, and transmits the route information regarding the retrieved route and the fare information regarding the retrieved fare as search results to the terminal that is the request source.

[0071] The request can include one or more departure stations and one or more arrival stations. For 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 including a plurality of departure stations and one arrival station, the route search server 130 searches for the route and fare from each departure station to the one arrival station and returns those search results. For example, when the departure stations are A and B and the arrival station is C, the route A-C and its fare, and the route B-C and its fare are obtained as search results.

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

[0074] For a request including 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 those search results. For example, when the departure stations are A and B and the arrival stations are C and D, the route A-C and its fare, the route B-C and its fare, the route A-D and its fare, and the route B-D and its fare are obtained as search results.

[0075] As route search conditions, for example, (1) the route with the shortest required time, (2) the route with the fewest number of transfers, (3) the route with the lowest one-way fare, (4) the route with the lowest monthly commuter pass fare, (5) the route with the lowest three-month commuter pass fare, or (6) the route with the lowest six-month commuter pass fare can be set. Also, (1) applying the IC fare or (2) applying the normal fare instead of the IC fare can be set. For example, when the departure station is A and the arrival station is B and (1) is set as the route search condition, the route A-B with the shortest required time and its fare are obtained as search results.

[0076] 〔Employee terminal 200〕 The employee terminal 200 is composed of a stationary terminal such as the commuting transportation expense calculation server 100, or a portable terminal such as a smartphone or a tablet. In the former case, its hardware configuration is the same as that of the commuting transportation expense calculation server 100. On the other hand, 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, etc. and calculation results required in the calculation process of the CPU, and an I / F that mediates data input and output to various attached devices. These are connected to each other via signal lines for transferring data and can exchange data. To the I / F, as various attached devices, a touch panel type display input device capable of data input and displaying a screen based on an image signal, a storage device, a wireless communication device, a video camera, etc. are connected.

[0077] 〔Operation〕 Next, the operation when performing the commuting route simulation will be described. Note that the access to the tables 400 to 424 is actually performed by the commuting transportation expense calculation server 100 communicating with the database server 120. However, for the sake of simplicity of explanation, the following explanation will be made assuming that the commuting transportation expense calculation server 100 accesses the tables 400 to 424. Also, since each company logs in with its account and performs the commuting route simulation, in the following explanation, the "company" refers to the company corresponding to the logged-in account.

[0078] The commuting route simulation selects the target employee considering the change of the workplace and the target workplace as a candidate for the change destination, searches the route from the nearest station to the target employee's home to the nearest station to the target workplace and the fare related to the route by the route search server 130, and simulates the total amount of commuting transportation expenses.

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

[0080] FIG. 7 is a screen showing the simulation result of the commuting route. The CPU 30 is composed of an MPU (Micro-Processing Unit) or the like, starts 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 according to the program.

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

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

[0083] Next, proceed to step S102, refer to the work location master table 402, and select the target work location from among the company's work locations. In the example of FIG. 6, 1 to 5 work locations can be set as the target work location. Work location 1 is selected from the list of the company's work locations in the select box 514. The same applies to work locations 2 to 5. In the example of FIG. 6, the maximum is 5, but 6 or more work locations may be set.

[0084] Next, proceed to step S104, and acquire the company's payment regulations information from the payment regulations information table 416. In the example of FIG. 6, as route search conditions, for example, (1) the route with the shortest required time, (2) the route with the fewest transfer times, (3) the route with the lowest one-way fare, (4) the route with the lowest monthly commuter pass fare, (5) the route with the lowest three-month commuter pass fare, or (6) the route with the lowest six-month commuter pass fare can be set. (1) to (6) are selected by the radio buttons 516. Also, it can be set by the radio button 518 whether to apply (1) IC fare or (2) normal fare instead of IC fare. (1) to (2) are selected by the radio button 518. These initial values are set based on the payment regulations information. That is, when you want to set the payment regulations information as the route search condition, click the execute button 520 with the initial values as they are. On the other hand, when you want to set contents different from the payment regulations information as the route search condition, change the values from the initial values by the radio buttons 516 and 518 and click the execute button 520. When the execute button 520 is clicked, the processing from step S106 onward is executed.

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

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

[0087] When there is one nearest station to the home of the target employee and one nearest station to the target work location, a request is generated as one request, with one nearest station to the home of the target employee as the departure station, one nearest station to the target work location as the arrival station, and the regulation determination criteria as the route search conditions respectively.

[0088] When there is one nearest station to the home of the target employee and multiple nearest stations to the target work location, a request is generated as one request, with one nearest station to the home of the target employee as the departure station, multiple nearest stations to the target work location as the arrival stations, and the regulation determination criteria as the route search conditions respectively.

[0089] When there are multiple nearest stations to the home of the target employee and one nearest station to the target work location, a request is generated as one request, with multiple nearest stations to the home of the target employee as the departure stations, one nearest station to the target work location as the arrival station, and the regulation determination criteria as the route search conditions respectively.

[0090] When there are multiple nearest stations to the home of the target employee and multiple nearest stations to the target work location, a request is generated as one request, with multiple nearest stations to the home of the target employee as the departure stations, multiple nearest stations to the target work location as the arrival stations, and the regulation determination criteria as the route search conditions respectively.

[0091] Next, proceed to step S112, send the generated request to the route search server 130, proceed to step S114, receive the search result for the sent request from the route search server 130, and proceed to step S116.

[0092] In step S116, for the route from the nearest station to the target employee's home to the nearest station to the target workplace, if the search results obtained in step S114 include multiple routes, one route that meets the regulation determination criteria is determined based on the payment regulation information obtained in step S104. For example, if there are two nearest stations to the target employee's home and two nearest stations to the workplace, the search results will include four routes. At this time, for example, if the regulation determination criteria is (1) the route with the shortest required time is set, the route with the shortest required time among the four routes is determined as the one that meets the regulation determination criteria. Also, for example, if the regulation determination criteria is (2) the route with the fewest transfer times is set, the route with the fewest transfer times among the four routes is determined as the one that meets the regulation determination criteria. After determining the route, the company ID, employee ID, workplace ID, search date and time, departure station, arrival station, route search conditions, the determined route, and the fare are registered in the search result information table 418.

[0093] Next, proceed to step S118 to determine whether the processing in steps S110 to S116 has been completed for all selected target employees. If it is determined that the processing has been completed for all target employees (YES), proceed to step S120 to determine whether the processing in 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), proceed to step S122.

[0094] In step S122, the search result information table 418 is referred to, and the simulation result of the commuting route is generated. As shown in FIG. 7, the simulation result is that for each target workplace, the workplace name, workplace address, total amounts of the monthly, quarterly, semi-annual, and annual commuting fares, total amount of the one-way fare, and other information are summarized and displayed in the text box 520. The total amount of the monthly commuting fare can be calculated, for example, by accumulating the monthly commuting fares of the routes determined for each target employee for all target employees. The same applies to the total amounts of the quarterly, semi-annual, and annual commuting fares and the total amount of the one-way fare. Also, when a target workplace is selected in the select box 522, for the selected target workplace, for each target employee, the employee number, employee name, commuting means, monthly, quarterly, semi-annual, and annual commuting fares, one-way fare, one-way distance, and other information are displayed in the text box 524. Other information includes, for example, the route from the nearest station to the employee's home to the nearest station to the target workplace for that target employee.

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

[0096] On the other hand, if it is determined in step S120 that the processing for all target workplaces has not been completed (NO), the process proceeds to step S126, where workplace information including the nearest station information for the next target workplace is acquired 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 the processing for all target employees has not been completed (NO), the process proceeds to step S128, where employee information including the nearest station information for the next target employee's home is acquired 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, for each of a plurality of target employees, the nearest station information of the target employee's home and the nearest station information of the target workplace are acquired. Based on the acquired nearest station information, when there are a plurality of nearest stations of the home of one target employee and a plurality of nearest stations of the target workplace, a request is sent to the route search server 130 in which a plurality of nearest stations of the home of the target employee are set as the departure stations and a plurality of nearest stations of the target workplace are set as the arrival stations. For each target employee, the route from the nearest station of the target employee's home to the nearest station of the target workplace and the fare related to the route are searched by the route search server 130, and the route information related to the route and the fare information related to the fare are acquired from the route search server 130, and a simulation result is generated based on the acquired route information and fare information.

[0099] As a result, when there are a plurality of nearest stations of the home of one target employee and a plurality of nearest stations of the target workplace, one request is sent to the route search server 130, so that the number of requests can be suppressed. In addition, a simulation result considering the routes connecting the plurality of nearest stations of the home and the plurality of nearest stations of the target workplace can be obtained.

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

[0101] As a result, when there is one nearest station of the home of one target employee and a plurality of nearest stations of the target workplace, one request is sent to the route search server 130, so that the number of requests can be suppressed. In addition, a simulation result considering the routes connecting the nearest station of the home and the plurality of nearest stations of the target workplace can be obtained.

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

[0103] As a result, when there are multiple nearest stations to the home of a single target employee and only one nearest station to the target workplace, one request is sent to the route search server 130, so the number of requests can be suppressed. Also, a simulation result considering the routes connecting the multiple nearest stations to the home and the nearest station to the target workplace is obtained.

[0104] Furthermore, in the present embodiment, the company's payment regulations information is acquired from the payment regulations information table 416, and a request for setting route search conditions based on the acquired payment regulations information is sent to the route search server 130.

[0105] As a result, a simulation result considering the company's transportation expense payment is obtained. Furthermore, in the present embodiment, the company's payment regulations information is acquired from the payment regulations information table 416. For the route from one nearest station to the home of the target employee to one nearest station to the target workplace, when the search results of the route search server 130 include multiple routes, one of the multiple routes is determined based on the acquired payment regulations information, and a simulation result is generated based on the freight information regarding the determined route.

[0106] As a result, a simulation result considering the company's transportation expense payment is obtained. Furthermore, in the present embodiment, for each of the multiple target workplaces, the nearest station information of the target workplace is acquired. When there are multiple nearest stations to the home of a single target employee and multiple nearest stations to one target workplace, one request with the multiple nearest stations to the home of the target employee set as the departure station and the multiple nearest stations to the target workplace set as the arrival station is sent to the route search server 130. 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 freight related to the route are searched by the route search server 130, and the route information regarding the route and the freight information regarding the freight are acquired from the route search server 130.

[0107] This makes it possible to suppress the number of requests when there are multiple target workplaces. In addition, simulation results can be obtained by considering the routes connecting the multiple nearest stations to the home and the multiple nearest stations to the target workplace for each of the multiple target workplaces.

[0108] 〔Corresponding relationship〕 In the present embodiment, the route search server 130 corresponds to the search servers 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. Further, 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] Also, in the present embodiment, step S116 corresponds to the route determination means of Invention 5.

[0110] 〔Modification example〕 In the above embodiment and its modification example, the route is not distinguished between the outbound and return trips. However, the present invention is not limited to this, and the outbound and return trips can be distinguished and searched when the fares are different for the outbound and return trips. For example, the following configuration can be adopted.

[0111] The first configuration is that for each target employee, when the target employee uses the searched route for the outbound commute, the route and fare obtained when searched as the outbound route (when setting the nearest station to the home as the departure station and the nearest station to the workplace as the arrival station for the search) are adopted. Also, when the target employee uses the searched route for the return commute, the route and fare obtained when searched as the return route (when setting the nearest station to the workplace as the departure station and the nearest station to the home as the arrival station for the search) are adopted. Further, when the target employee uses the searched route for the round-trip commute, the routes and fares obtained when searched as the outbound and return routes respectively are adopted. The distinction between outbound, return, or round-trip can 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 by specifying the distinction between outbound, return, or round-trip for the searched routes in the simulation results.

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

[0113] The third configuration is to register in a table information on departure and arrival stations where the fares are different for the outbound and return trips, refer to the table, and apply the first or second configuration to the routes of departure and arrival stations where the fares are different for the outbound and return trips.

[0114] In addition, in the above-described embodiments and their modifications, although (1) to (6) and (1) to (2) are exemplified as the regulation determination criteria, it is not limited thereto, and allowing (7) changes in the vehicle (for example, railway → bus, bus → railway), or allowing different routes for the outbound and return trips can be included in the regulation determination criteria. 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] In addition, in the above-described embodiments and their modifications, based on the payment regulation information, the one that conforms to the regulation determination criteria among the plurality of routes is determined. However, it is not limited thereto. If it is the same route as the commuting route registered in the employee-specific route information table 406, it conforms to the regulation determination criteria and has been approved. Therefore, among the plurality of routes included in the search result of the route search server 130, the route that is the same as the commuting route registered in the employee-specific route information table 406 can be determined.

[0116] In addition, in the above-described embodiments and their modifications, for one target employee, one route that conforms to the regulation determination criteria is determined among the plurality of routes. However, it is not limited thereto, and a plurality of routes that conform to the regulation determination criteria can be determined. For example, different routes for the outbound and return trips may be determined, or even if the outbound and return trips are the same route, if the fares for the outbound and return trips are different, the outbound route and the return route may be determined respectively.

[0117] Also, in the above-described embodiments and their modifications, social insurance premiums and employment insurance premiums were not considered. However, not limited to this, since commuting transportation expenses are subject to calculation of social insurance premiums and the like, social insurance premiums and the like can be reflected in the simulation results. For example, referring to the above basic data table, social insurance premiums and the like are calculated based on the freight information obtained as the search result of the route search server 130, and a simulation result is generated based on the calculated social insurance premiums and the like. The simulation result is configured as, for example, a page that provides a tab or a drop-down list for selecting a target workplace, and for the selected target workplace, for each target employee, the route, freight, social insurance premiums, etc. from the nearest station to the employee's home to the nearest station to the target workplace, as well as the total amount of freight and the total amount of social insurance premiums, etc. for all target employees are displayed.

[0118] Also, in the above-described embodiments and their modifications, one request was generated for each target workplace and each target employee. However, not limited to this, one request can be generated for each target employee. Specifically, when there are a plurality of nearest stations to the home of one target employee, one request is generated in which the plurality of nearest stations to the home of the target employee are set as the departure stations and the nearest stations to the plurality of target workplaces are set as the arrival stations.

[0119] Also, in the above-described embodiment and its modified examples, although one request per target employee was sent to the route search server 130, it is not limited to this. Instead, it is determined whether the route information (route information regarding all routes between each nearest station to the target employee's home and each nearest station to the target workplace) to be obtained with one request is registered in the search result information table 418. If it is determined that the route information is registered, a configuration may be adopted in which the request is not sent and the route information is acquired from the search result information table 418. The route information acquired from the search result information table 418 may target all route information or route information that satisfies a predetermined condition. Examples of the predetermined condition include, for example, route information searched within a predetermined period in the past from the present (e.g., within the same day, within 1 day, within 3 days, within 1 week), and route information searched after the most recent fare revision with reference to the fare information table 414. For example, when considering a service that can grasp an approximation with reduced accuracy on the condition that the commuting route simulation is used at a low cost or free of charge, since a fee corresponding to the number of requests is incurred for the search by the route search server 130, a configuration may be adopted that targets all route information or route information searched within a considerably long period (e.g., within 1 year).

[0120] Also, in the above-described embodiment and its modified examples, in the request, the nearest station to the target employee's home was set as the departure station and the nearest station to the target workplace was set as the arrival station. However, it is not limited to this, and the nearest station to the target workplace may be set as the departure station and the nearest station to the target employee's home may be set as the arrival station.

[0121] Also, in the above-described embodiment and its modified examples, in the request, the regulation determination criteria were set as the route search conditions. However, it is not limited to this, and other conditions may be set as the route search conditions, or the route search conditions may not be set.

[0122] Also, in the above-described embodiment and its modified examples, although the route information and the fare information were acquired from the route search server 130, it is not limited to this, and only one of the route information and the fare information may be acquired.

[0123] Also, in the above-described embodiments and their modifications, both the process of setting route search conditions based on payment regulation information and the process of determining any one of a plurality of routes based on payment regulation information are performed, but not limited thereto, only one of the processes may be performed.

[0124] Also, in the above-described embodiments and their modifications, the route direction type and the usage direction type are configured as information on the outbound route, the return route, or the round trip, but not limited thereto, one or both of the route direction type and the usage direction type can be configured as information on a one-way or round trip.

[0125] Also, in the above-described embodiments and their modifications, it is realized as a network system, but not limited thereto, it can be realized as a single device or application.

[0126] Also, in the above-described embodiments and their modifications, the case where it is applied to a network system composed of the Internet 199 has been described, but not limited thereto, for example, it may be applied to a so-called intranet that communicates in the same manner as the Internet 199. Of course, it is not limited to a network that communicates in the same manner as the Internet 199, and it can be applied to a network of any communication method.

[0127] Also, in the above-described embodiments and their modifications, when executing the process shown in the flowchart of FIG. 5, the case where a program pre-stored in the ROM is executed has been described, but not limited thereto, the program may be read from a storage medium storing the program showing these procedures into the RAM and executed.

[0128] In addition, in the above-described embodiments and their modifications, the present invention is applied to cases such as generating simulation results of commuting routes. However, the present invention is not limited to this, and can be applied to other cases without departing from the gist of the present invention. For example, the present invention can also be applied to cases where business trip expenses and other transportation expenses are simulated.

Explanation of Signs

[0129] 100... Commuting transportation 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... Work location master table, 404... Employee information master table, 406... Employee-specific route information table, 408... Employee-specific payment information table, 410... Employee-specific daily allowance payment information table, 412... Department information table, 414... Freight 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... Drop-down boxes, 516, 518... Radio buttons, 520... Execution button

Claims

1. Employee selection means for selecting a plurality of target employees to be simulated from a plurality of employees belonging to the enterprise; Workplace selection means for selecting a plurality of target workplaces to be simulated from a plurality of workplaces of the enterprise; First nearest station information acquisition means for acquiring, from storage means for storing nearest station information regarding the nearest station to the home of each of the plurality of employees, the nearest station information of the home of each of the plurality of target employees selected by the employee selection means; Second nearest station information acquisition means for acquiring, from storage means for storing nearest station information regarding the nearest station to each of the plurality of workplaces, the nearest station information of each of the plurality of target workplaces selected by the workplace selection means; Route information acquisition means for searching, by a search server, a route between the nearest station to the home of each target employee and the nearest station to each target workplace for each target workplace and each target employee 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 regarding the route from the search server; 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; and The route information acquisition means is characterized in that, 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, a request is sent to the search server in which a plurality of nearest stations to the home of the target employee are set for one of the departure station and the arrival station, and a plurality of nearest stations to the target workplace are set for the other of the departure station and the arrival station. A commuting route simulation system.

2. Employee selection means for selecting a plurality of target employees to be simulated from a plurality of employees belonging to the enterprise; Workplace selection means for selecting a plurality of target workplaces to be simulated from a plurality of workplaces of the enterprise; First nearest station information acquisition means for acquiring, from storage means for storing nearest station information regarding the nearest station to the home of each of the plurality of employees, the nearest station information of the home of each of the plurality of target employees selected by the employee selection means; Second nearest station information acquisition means for acquiring, from storage means for storing nearest station information regarding the nearest station to each of the plurality of workplaces, the nearest station information for each of the plurality of target workplaces selected by the workplace selection means; Route information acquisition means for searching, based on the nearest station information acquired by the first nearest station information acquisition means and the second nearest station information acquisition means, 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, and acquiring route information regarding the route from the search server; Simulation result generation means for generating a simulation result of the commuting route based on the route information acquired by the route information acquisition means; The route information acquisition means, when there are a plurality of nearest stations to the home of a target employee, sends a request to the search server in which a plurality of nearest stations to the home of the target employee are set for one of the departure station and the arrival station, and the nearest stations to the plurality of target workplaces are set for the other of the departure station and the arrival station. A commuting route simulation system characterized by this.

3. In any one of Claims 1 and 2, The employee selection means searches for employees who meet given conditions from an employee information table in which the plurality of employees are registered, and selects a plurality of target employees to be the subjects of simulation from the found employees. A commuting route simulation system characterized by this.

4. In any one of Claims 1 and 2, The simulation result generation means generates a simulation result of the commuting route for the plurality of target employees for each of the target workplaces. A commuting route simulation system characterized by this.

5. In any one of Claims 1 and 2, It is provided with target workplace selection means for selecting any one from the plurality of target workplaces, The simulation result generation means generates a simulation result of the commuting route for each of the target employees for the target workplace selected by the target workplace selection means. A commuting route simulation system characterized by this.

Images