JP2006099674A - Commuting route calculation system and method - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To automatically calculate the best commuting route for every employee to reduce commuting costs to the necessity minimum without making employees to submit applications for the nearest station or use lines and verifying the applications. <P>SOLUTION: A commuting route calculation system has a map data storage part 20, which stores map data as station location information; a getting on and off location extraction part 25, which specifies location information on a home address that is a beginning point of a commuting route and an office location that is an end point, and extracts all stations that exist within 2 km in radius from the beginning point and the end point referring to the map data storage part 20; a distance measurement part 26, which measures distances of the extracted stations, the beginning point and the end point along roads; a nearest station specifying part 27 that specifies a station, the distance of which is 2 km or less along roads, as the nearest station; a route search part 28, which calculates a traffic route between two stations, lines that comprise the route, and traffic costs and moving time if the route is used; and a commuting route specifying part 29 that specifies a route, the traffic costs of which are minimum, from the calculated routes as a commuting route for an employee. <P>COPYRIGHT: (C)2006,JPO&NCIPI

Description

  The present invention relates to a system and method for calculating an optimum commuting route of an employee who commute using transportation means by a computer, and calculating commuting expenses such as a regular fee easily and economically.

  In the past, for employees who commute using public transportation in companies, etc., each employee applies for the commute route to the nearest station in the home and the company location (destination), and the predetermined periodic fee And commuter pass tickets are provided. In addition, if the home and the nearest station, or the nearest station of the work place and the work place are separated from each other by a predetermined distance or more, the use of the bus is permitted, and a bus commuter pass and a commuter pass are provided.

  Also, search for multiple routes that are supposed to specify the station name that will be the starting point and destination, calculate the required time and fare (including regular fare, and so on) for each of those routes and calculate the “travel (travel) time” "And" transportation costs "are displayed in the order of services and software. Employees make extensive use of such route search functions when applying for commuting expenses, commuting routes, and paying for travel expenses.

  For example, the following Patent Documents 1 and 2 are useful as a mechanism for calculating a commuting cost and a business trip travel cost by searching for a travel route between two points. Further, Patent Documents 3 and 4 below describe a mechanism for providing real estate information existing in an area within a desired commuting time based on a user's work location, desired commuting time, and traffic information (such as a transportation schedule). Proposed.

JP-A-7-192150 JP 2001-236527 A JP-A-7-271854 (claim 4, paragraph 0021) JP 2001-216409 A (particularly paragraphs 0033 to 0038)

  By the way, in the above-mentioned conventional method for calculating transportation costs, although it is possible to search for the optimum commuting route from the nearest station of the home to the nearest station of work, the nearest station of the home related to the application, It was difficult to verify whether the route was optimal. Here, the “optimum route” means a route with a low transportation cost to the destination and a short travel time.

  Specifically, when an employee's home is in the middle of two stations, which station is applied as the nearest station, or which route is used when multiple routes are available from the nearest station Whether or not was left to the choice of employees. Therefore, there may be cases where the nearest station or commuting route where the transportation cost is intentionally or unconsciously applied is applied. As part of cost savings, there is a demand for companies to verify employee application details, identify optimal commuting routes, and minimize commuting costs.

  However, in order to verify the commuting route, all the stations that exist within a predetermined distance from each employee's home and work place are extracted, and the above route search software etc. is used for the route that combines these stations. Then, it is necessary to search for each of them, and further compare the travel time and transportation cost to identify the route to be used and the nearest station.

  It is very burdensome for a person in charge of personnel / general affairs in a company to perform such individual verification work manually, and human error is likely to occur. This is especially impractical for medium and large companies with hundreds of employees. In addition, with the spread of Geographical Information System (GIS), by entering the address of the departure place (home or work) and destination (station), or by selecting the location on the map with a mouse, Software for route search that can measure the distance between two points is also commercially available, but manual work such as entering a home address is still required for each employee.

  In addition, for a company having a plurality of offices within the commuting range, it is necessary to perform the above-described optimal route identification and verification work for each employee's work location. In addition, in the event of an event such as a relocation of an office, an employee transfer, a route change or abandonment, or the establishment of a new station, the relevant employee must be requested to change the commuting route and the requested route must be verified again. I must.

  The present invention was made in order to solve the above-mentioned problems, and automatically submits the optimum commuting route for each employee without having the employee apply for the nearest station or route and verifying it manually. It is an object of the present invention to provide a commute route calculation system and a commute route calculation method capable of calculating and minimizing commuting costs to the minimum necessary.

  According to a first main aspect of the present invention, there is provided a system for calculating a commuting route of an employee who commute by using a transportation means, wherein the computer includes a public railway station and a bus stop. Locating / departing base storage means for storing location information of boarding / exiting bases for transportation, and specifying location information for each of the address of the home that is the starting point of the commuting route of the employee and the location of the work that is the ending point of the commuting route, Referring to the boarding / exiting base storage means, the boarding / exiting base extracting means for extracting all boarding / exiting bases existing within a predetermined distance from the starting point and the end point, and measuring the distance between the extracted boarding base and the starting point and the end point. A distance measuring means, a nearest station identifying means for identifying a boarding / exiting base whose calculated road distance is a predetermined value or less as a “nearest station” of a starting point and an end point, a traffic route between the two boarding points, and this Sutra The nearest station of the starting point and the ending point for a route search system that calculates one or two or more transportation routes constituting the vehicle and the transportation cost and travel time between two boarding points when this route is used The nearest station information transmitting means for transmitting the information, and the route and the transportation cost between the two nearest stations calculated by the route search system are obtained, and the route with the lowest transportation cost among the obtained transportation routes And a commute route specifying means for specifying the commute route as the employee's commute route.

  According to such a configuration, the nearest station of the employee is objectively identified based on the home address, and the route with the lowest transportation cost from the nearest station to the nearest station of the work is the optimum route. Decided to identify as. As a result, the nearest station and commuting route can be specified based on objective criteria, applications for uneconomic routes can be eliminated, and costs can be reduced. In addition, the employee's home address and work location are usually registered in the employee master table or work location table, and so by using this as it is, all employees can only apply for transportation expenses. There is no need for employees to apply for a home address or work place, and there is no need for the general affairs and personnel personnel to manually verify the applied commute route. Therefore, it is possible to instantly specify the optimum commuting route and calculate the transportation cost. This is particularly advantageous for companies that have many employees and companies that have multiple offices within the commuting range.

  According to a second main aspect of the present invention, there is provided a system for calculating a commuting route of an employee who commute using a means of transportation by means of a computer, wherein the computer detects a railway station or a bus stop. The location information is specified for each of the boarding / departure base storage means for storing the location information of public transportation boarding / exit locations including the home address that is the starting point of the employee's commuting route and the work location that is the ending point of the commuting route. , A boarding / exit base extracting means for extracting all boarding / exit bases existing within a predetermined distance from the starting point and the end point with reference to the boarding / exiting base storage means, and a distance between the extracted boarding base and the starting point and the end point. Distance measuring means to measure, nearest station specifying means to identify the starting and ending “closest station” as the starting point and the ending point where the calculated road distance is a predetermined value or less, and between the two specified getting on and off bases Exchange Route search means for calculating a route, one or more transportation routes constituting this route, and the transportation cost and travel time between two boarding points when this route is used, and the calculated traffic There is provided a system characterized by comprising commuting route specifying means for specifying a route having the lowest transportation cost as a commuting route of the employee among the routes.

  According to such a configuration, since the route search means for calculating the transportation cost and travel time between the two boarding / exiting bases is provided, in addition to the same operations and effects as the first main aspect described above, the use route The search settings can be freely customized, such as changing the upper limit of commuting costs and company standards, and the running costs such as search commission costs can be reduced.

  According to a third main aspect of the present invention, there is provided a method for calculating a commuting route of an employee who commute using public transportation by a computer, the computer including a railway station or a bus stop. Location information for boarding / departing bases that stores the location information of boarding / exiting bases for public transport, and the address of the home that is the starting point of the commuting route of the employee and the location of the work that is the ending point of the commuting route A boarding / exiting base extracting step of identifying information, extracting all boarding / exiting bases existing within a predetermined distance from the start point and end point with reference to the boarding / exiting base storage means, and the path between the extracted boarding base and the start point and end point Distance measurement process that measures the distance of the distance, the closest station identification process that identifies the departure and departure bases where the calculated road distance is less than the predetermined value as the “closest station” of the start and end points, and between the two departure and arrival bases of The starting point for a route search system that calculates a route, a route of one or more transportation facilities constituting the route, and a transportation cost and a travel time between two boarding points when this route is used. And the nearest station information transmission step for transmitting the information of the nearest station at the end point, and the traffic route and the transportation cost between the two nearest stations calculated by the route search system, and the transportation cost among the obtained traffic routes And a commute route specifying step of specifying the route with the minimum amount as the commute route of the employee.

  According to such a configuration, it is possible to obtain a commuting route calculation method that can be suitably realized using the commuting route calculation system in the first main aspect described above.

  According to a fourth main aspect of the present invention, there is provided a method of calculating a commuting route of an employee who commute using a transportation means, wherein the computer includes a railway station and a bus stop. Location information for the boarding and exiting base storage process for storing the location information of the boarding / exiting base for transportation in the boarding / exiting base storage means, and the home address as the starting point of the employee's commuting route and the location of the work place as the ending point of the commuting route A boarding / exiting base extracting step for extracting all boarding / exiting bases existing within a predetermined distance from the start point and end point with reference to the boarding / exiting base storage means, and a path between the extracted boarding base and the start point and end point Distance measurement process to measure the distance of the road, the nearest station identification process to identify the departure and departure bases where the calculated road distance is less than a predetermined value as the “closest station” of the starting point and the ending point, and the two specified getting on and off Ground A route search step for calculating a traffic route between, a route of one or more transportation facilities constituting this route, and a transportation cost and a travel time between two boarding points when this route is used; And a commuting route specifying step of specifying a route having the lowest transportation cost as the commuting route of the employee among the provided traffic routes.

  According to such a configuration, it is possible to obtain a commuting route calculation method that can be suitably realized using the commuting route calculation system according to the second main aspect described above.

  According to the present invention, it is possible to automatically calculate the optimum commuting route for each employee and minimize the commuting cost without having to apply for the nearest station or route to the employee and verifying it manually. be able to.

  Other features and remarkable effects of the present invention will be understood more clearly by referring to the description of the best mode section for carrying out the present invention and the attached drawings.

Hereinafter, embodiments of the present invention will be described with reference to the drawings.
FIG. 1 is a network configuration diagram of an embodiment of the present invention. The commuting route calculation system denoted by reference numeral 1 in this figure is composed of a server 4 of a company 3 that employs employees 2, a map data provider 5 that provides digital map data, and an operator 6 of public transportation. It is possible to obtain map data and operation data by being connected online or offline. The system 1 is connected to an in-house terminal via an in-house network such as a LAN, and is configured to accept various applications from the employee 2 and approval results from the employee 2 who is an administrator. Application in this case includes application for bus use, application for various special approvals, application for office relocation, and application for change of transportation status, but change of commuting route other than moving of employee 2 due to personal circumstances It does not include applications or new payments for transportation expenses. The company 3 can search and verify the optimum commuting route of the employee 2 at any time by only acquiring the home address submitted by the employee 2 at the time of new hiring or moving. The calculated transportation expenses are transferred to a designated account together with the salary, or paid to each employee 2 as a physical ticket such as a commuter pass, as in the past.

  Here, the seven types of patterns shown in FIG. 2 can be considered as types of commuting routes. That is, the first pattern of commuting on foot, bicycle, motorcycle, etc. without using public transport, the second and third patterns that use only buses, the fourth pattern that uses only railroads, and railroads and buses It is the 5th-7th pattern using both. In the conventional route search system, since the commuting route including the bus could not be searched, only the commuting route of the section using the railway in the fourth to seventh patterns could be searched. Also, since the selection of the starting point (the nearest station at home) and the ending point (the nearest station at work) was left to the application (subjective) of the employee, the optimal commuting route should be identified objectively. I could not. As a result, there is a tremendous human burden on the application and processing of commuting costs, and inequality may occur among employees, resulting in companies paying higher commuting costs. .

  In this embodiment, simply acquiring the home address of the employee can search for the optimum commuting route for each employee from all possible commuting route patterns, and can automatically perform the verification up to that. Therefore, the commuting route can be easily and objectively specified, and the burden of commuting expenses can be minimized.

Next, the schematic configuration of the commuting route calculation system 1 will be described with reference to the block diagram of FIG.
In this system 1, a data storage unit 15 and a program storage unit 16 are connected to a bus line 14 to which a CPU 10 of a server 4, a RAM 11, an input / output device 12 such as a keyboard and a liquid crystal display, and a communication device 13 such as a modem are connected. Configured.

  The data storage unit 15 includes a map data storage unit 20 (boarding / departure base storage means), a traffic information storage unit 21, and an employee master table 22.

  The map data storage unit 20 stores electronic map data acquired from the map data provider 5 or the like. Electronic map data includes drawing data for drawing a map as an image, address data that associates location information (for example, latitude / longitude) with address information, trams, monorails, cable car stations, express bus stops, Includes boarding / departure base data that identifies the names and location information of all public transportation boarding locations that can be used for commuting, such as Shinkansen stations, and road data that associates location information with road network information and distance information. . In the following, for convenience of explanation, it is assumed that “station” includes all the getting-on / off bases unless otherwise distinguished.

  The traffic information storage unit 21 includes all stations on the public transport lines, standard travel times for all sections, operation schedules for each direction (up / down, etc.), stop stations, end stations (destinations) ) And other information. This traffic information is periodically acquired from the public transportation operator 6 and stored. When searching for routes between railway stations using a conventionally known route search service or the like, the traffic information storage unit 21 includes traffic information such as local bus routes that cannot be handled by the service. Just store it. In this case, it is not necessary to collect and store information on all the bus routes in the whole country in advance. When an application for a specific bus route is issued by the employee 2, the traffic information acquisition unit 32 described later What is necessary is just to acquire from the service provider 6.

  The employee master table 22 registers personal information such as addresses, names, occupations, and work styles of all the employees 2 and the identified optimum commuting route in association with the identification information (ID) of the employees 2. It is. Thereby, for example, the permission standard of the special approval application can be changed according to the job type of the employee (three shift work, research job, etc.).

  Specifically, as shown in FIG. 4, the employee master table 22 includes the date of birth, gender, home address, optimum route (nearest station and route), work code, working time code, and special approval code. Is registered in association with the employee ID.

  Here, the working time code is set according to the place of work, occupation, etc., for example, the employee 2 for daytime work is 01 (working at the office) or 02 (working at the factory), and the employee 2 at the third shift work is 11 (early morning). One of the codes of (commuting to work), 12 (working for lunch), and 13 (night work) is registered. In the present embodiment, a walking allowable distance Dx set in advance based on employee attributes such as working hours is also stored. The employee attributes include individual attributes based on physical disabilities and other special applications as well as uniform attributes such as the working hours, age, and gender. This walking allowable distance Dx is set to 2 km by default for all employees, and when there is an application from employee 2 with the above-mentioned circumstances, it is examined based on employee attributes and the distance less than 2 km is individually Registered in Note that a standard walking speed (80 m / min by default) may be employed instead of the walking allowable distance Dx.

  In addition, when using special transportation such as a high-speed bus or Shinkansen, the administrator individually examines the change in the commuting route after waiting for a special application from the employee 2. When the special approval application is approved in this way, a code “1” indicating that the special approval application is applied is registered in the employee master table 22 as shown in FIG.

  The program storage unit 16 shown in FIG. 3 mainly stores software programs that respectively execute a function of specifying an optimum commuting route for each employee and registering it in the employee master table 22 and other auxiliary functions. . As the former function, the boarding / exit base extracting unit 25, the distance measuring unit 26, the nearest station specifying unit 27, the route searching unit 28 and the commuting route specifying unit 29, and as the latter function, the application receiving unit 30 and the commuting route verifying unit 31. , A traffic information acquisition unit 32 (transportation cost information acquisition unit), a commuting route update unit 33, and a nearest station search / output unit 34 (nearest station output unit). Each will be described in turn below. In the following, the explanation will be focused on the home of the employee 2, but the same processing is executed in advance for the workplace and stored in an office table (not shown).

  First, the boarding / exiting base extraction unit 25 uses the employee master table 22 or an office table (not shown) to obtain information on the home address that is the starting point of the commuting route of the employee 2 and the work location that is the ending point of the commuting route. A function to acquire each based on the member ID, a function to specify latitude / longitude for these start / end points and register them in the map data storage unit 20, and within a predetermined distance (for example, within a radius of 2 km) from the start / end points A function of extracting all existing stations and delivering them to the distance measuring unit 26 is provided. For example, as shown in FIG. 5, all the stations within a radius of 2 km from the home are extracted for the employee 2 whose home is “Shin-Ochiai 2-X-XX, Shinjuku-ku, Tokyo”. In this example, 6 lines and 11 stations (Takadanobaba and Nakai overlap with multiple lines) are extracted. When no railway station can be searched, it is preferable to extract a bus stop within 2 km.

  The distance measuring unit 26 measures the distances between all the extracted stations and the home and passes them to the nearest station specifying unit 26. The station location is extracted from the map data storage unit 20, and the home address is extracted from the employee master table 22. As the distance measuring unit 26, the function of the distance measuring software described as the prior art can be used. In the example of FIG. 5, among the extracted 11 stations, the closest to home is Takadanobaba Station (3 lines are on board), and the farthest is Nakai Station (2 lines are on board) and Shiinamachi. Yes.

The nearest station specifying unit 27 specifies a station on each route whose calculated road distance is equal to or less than a predetermined value (for example, 2 km) as a “nearest station” at home, and registers it in the employee master table 22. Is. As in the case of Seibu Shinjuku Line in FIG. 5, when a plurality of stations correspond to the same route, the shorter station is identified as the nearest station. However, in this embodiment, like the two stations on the Yamanote Line, all stations with a distance of 0.5 km or less are registered as the nearest stations even on the same route. Therefore, even if it is the same station, like Nakai Station, it may not be the nearest station on one line (Seibu Shinjuku Line) but may be registered at the nearest station on the other line (Oedo Line) obtain. As a result, in the example of FIG. 5, 6 stations on the 6 routes in which “○” is marked in the “judgment result” column from the 11 stations on the extracted 6 routes are the nearest stations of the employee 2 in the employee master table 22. be registered. Actually, as shown in FIG. 4, the nearest station is registered with a station code that is a combination of a route number and a station number that is a combination of an operator code and a route type. If there is no station with a distance of 2 km or less from the station, the station with the shortest distance among the stations with a distance of over 2 km is identified as the nearest station. If there is still no nearest station, it is preferable to re-extract the station by increasing the radius of the extraction area to the getting-on / off base extracting unit 25 by, for example, 100 m in increments of 500 m.

  In addition, when a bus stop is extracted as a base for getting on and off, a station of other public transportation such as a railway that can be reached by using a bus boarding from the stop is searched from the traffic information storage unit 21, and these bus stops and railways are searched. And register as the “nearest station”. Thereby, it becomes possible to search and specify the commuting routes of the fourth and fifth patterns in FIG. For example, “Nakano Station” at the nearest station in FIG. 6 is registered as a “second nearest station” that can be reached by bus from the bus stop near the house (Shimochiai 2-chome: the first nearest station). Is done. It is preferable that the first and second nearest stations register associations on the condition of simultaneous use, and do not use any one as the starting point of the traffic route alone. Even in this case, the transportation cost for using the bus may be paid only when the employee 2 makes an application for using the bus starting from the bus stop identified as the nearest station.

  For the purpose of searching for the most suitable commuting route, stations such as limited express trains / rapid trains and stations / routes with extremely fast final trains may be identified as the nearest station even if the distance from their home is short. It is preferable to change the criteria to lower the registration priority. In this embodiment, when the walking allowable distance Dx is registered in the employee master table 22, the nearest station is specified by replacing the default 2 km with the walking allowable distance Dx.

  The route search unit 28 includes all the traffic routes that can move between the identified nearest home station and the nearest work station, and one or more transportation routes constituting these routes, When these routes are used, the transportation cost between the two stations, the standard travel time, and the number of transfers are calculated and transferred to the commuting route specifying unit 29. As the route search function between the railway stations of the route search unit 28, the function of the route search software described as the prior art can be used as it is.

  Here, when a plurality of nearest home stations and / or nearest work stations are registered, a transportation cost or the like is calculated for each route where a plurality of nearest stations are combined with each other. For example, as shown in the example of FIG. 6, when there are three home nearest stations (one is counted as a bus stop and one station reached using this bus), and two nearest work stations are registered. The route search unit 28 searches for 3 × 2 = 6 routes, and passes the transportation cost and travel time of each route to the commuting route specifying unit 29.

  In addition, when the route is a railroad and any of the nearest stations includes a bus stop (fourth to sixth patterns in FIG. 2), both when the bus is used and when the bus is not used. It is preferable to calculate transportation costs and standard travel times. As a result, the commuting route can be searched and specified even when the employee 2 has not applied for bus use.

  The commuting route specifying unit 29 acquires the calculation result of the route searching unit 28 and temporarily registers a route having the lowest transportation cost as a commuting route of the employee 2 among a plurality of traffic routes. In the present embodiment, as will be described later, since the commuting route verification unit 31 verifies conditions other than transportation expenses and specifies the final optimum route, the commuting route specification unit 29 performs “temporary registration”. "

  Next, the application accepting unit 30 as an auxiliary function receives various applications and approval results from the employee 2, the personnel / general affairs manager, and the employee 2 who is an administrator, and executes predetermined processing according to the contents. To do. Specifically, when an application for bus use or special approval is received from the employee 2, the attribute information of the employee 2 is searched from the employee master table 22 based on the employee ID, and a predetermined administrator ( Send to employee 2) 's terminal and request approval. In addition, when an application (special approval application) is received from the employee 2 to change part or all of the route of the commuting route, the application content is transmitted to the route search unit 28, the commuting route verification unit 31 or the like and can be changed. To determine. Furthermore, when an application for establishment or relocation of a business establishment is received from a person in charge of personnel or general affairs, a business establishment is newly registered in a business establishment table (not shown), or the location after the relocation is registered in association with a business establishment code. In these cases, the boarding / exiting base extraction unit 25 is instructed to extract boarding / exiting bases, and the commuting route updating unit 33 is instructed to update the route. When the approval result is received from the administrator terminal for the special approval application, the commuting route verification unit 31 and the like are instructed to add / delete the route related to the special approval application, the nearest station, and the like, and the employee master table 22 Register the special approval code “1”.

  Here, for example, if you want to shorten the allowable walking distance, or if there are circumstances such as bad weather or few street lamps around the searched nearest station, the specific route included in the optimum route is It is applied for when there are bad circumstances. When such a situation is recognized by an administrator or the like, special measures are taken such as excluding the nearest station or route, or permitting the use of a bus even if it is less than a predetermined distance (2 km).

  The commuting route verification unit 31 verifies whether this route is optimal based on conditions other than transportation costs for the commuting route (first commuting route candidate) specified by the commuting route specifying unit 29. Specifically, the commuting route verification unit 31 sorts all the routes searched by the route searching unit 28 in order of transportation cost and travel time, and the standard travel time is 10 minutes or more than the first commute route candidate. A commute route candidate search unit 40 for searching for a short second commute route candidate and a third commute route candidate whose number of transfers is smaller than that of the first commute route candidate, and the searched second or third route candidate A determination unit 41 that determines whether the increase in transportation expenses (scheduled for 6 months) is within 10,000 yen or the increase rate is within 10%, and any one of the first to third routes based on the determination result A commuting route correction unit 42 that registers an optimum commuting route in the employee master table 22 is provided. Here, even if the commuting route candidate search unit 40 is a route that can reduce the travel time by 10 minutes or more, if the number of transfers exceeds three times, the commuting route candidate search unit 40 does not search for this route as a second route candidate. preferable.

  For example, as illustrated in FIG. 7, when the route search unit 28 searches for five routes of n = 0 to 4 and the route of n = 0 is registered as the optimum route (first route candidate), the commuting route The candidate search unit 40 searches for n = 2 to 4 as the second route candidate and n = 1, 3, and 4 as the third route candidate. Of these route candidates, the determination unit 41 includes an n = 1 route whose travel time is reduced within 10 minutes, an n = 2 route whose number of transfers exceeds three times the first route candidate, The routes of n = 4 where the increase in cost exceeds 10,000 yen or 10% (in this case, 5000 yen) are excluded. As a result, it is determined that the optimal route is n = 3, and the commuting route correction unit 42 deletes the first route from the memory and registers the route of n = 3 in the employee master table 22.

  In addition, the commuting route verification unit 31 searches the traffic information storage unit 21 for the operation time zone of the traffic route constituting the first commuting route candidate, and registers the operation time of the route in the employee master table 22. A re-search instructing unit for instructing the route searching unit 28 to re-search for a route excluding the route when the employee 2 is out of the working time zone and / or the return home time zone. 43.

  For example, community buses operated by some local governments for the elderly and hospital visitors often do not operate during morning and evening commuting hours. For such bus routes as well, conventionally, it has been time-consuming and time-consuming to acquire the type of bus and operation information and individually determine whether or not the bus can be used. Then, if the distance from the home to the station was 2 km or more, the bus was accepted as it was. For this reason, employees are paid regular buses for buses that are not actually used (which cannot be done), which has been problematic in terms of cost savings.

  Therefore, in this embodiment, when an application for bus use is accepted, it is decided to refer to the traffic information on such a route and verify the commuting route temporarily registered or permanently registered as the optimum route. Thereby, it becomes possible to pay the transportation expenses that match the commuting entity of the employee 2.

  The traffic information acquisition unit 32 acquires the information on the transportation schedule, fares, and standard travel time for each section from the transportation operator 6 at regular and irregular intervals, and stores the information in the traffic information storage unit 21. Is. The operation schedule includes stop stations such as express trains and rapid trains, transfer stations to other routes, weekdays, Saturdays and holidays. It is preferable to acquire and store at least the first departure time, the last time, and the operation cycle (number) per hour. As described above, when an external route search system or the like is used, traffic information such as a local bus route that is not a service target is acquired and transferred to the commuting route specifying unit 29. Thereby, the commuting route specifying unit 29 can calculate the transportation cost and travel time of the route by adding the calculation result of the route search service and the traffic information of the specific section acquired individually.

  When the commuting route update unit 33 obtains a business location code and a relocation address from the application reception unit 28 that has accepted a business location relocation application, all commuting employees at this business location are employed. Search from the employee master table 22 and instruct the above-mentioned boarding / exiting base extraction unit 25, the commuting route specifying unit 29, etc., to specify / update the commuting route whose destination is the location of the relocation destination for all the employees concerned. is there. Thereby, it is not necessary to receive an application for changing the commuting route from each employee, and to verify or update the route individually, thereby reducing the burden on changing or providing transportation expenses.

  In addition to the relocation of the office, this commuting route update unit 33 also changes traffic information such as schedule revisions, new establishment / renovation of routes, changes to other routes (increase / decrease in the number of transfers) from the operator 6 It also has a function to change the commuting routes of related employees at once when accepted or when in-house standards such as the distance to the nearest station or special approval conditions are changed.

The nearest station search / output unit 34 searches the employee master table 22 for all employees 2 whose addresses belong to a specific area at a predetermined cycle (every half year, when entering a new graduate, etc.). The nearest station of the employee 2 and its route are sorted by the work of the employee 2 and output. Thereby, it is possible to compare the nearest stations and commuting routes for a plurality of employees 2 commuting to the same office from the same area, and to audit whether the registered commuting route is optimal. It is very burdensome to regularly perform such audit processing for all areas. Therefore, for example, when registering the address or the like of the employee 2 who newly joins, it is preferable to search the commuting route for another employee 2 whose address is registered in the area. As a result of the audit, for the employee 2 who is determined to need to change the commute route, the search for the commute route is instructed to the boarding / exit base extraction unit 25 and the like.
The nearest station search / output unit 34 also has a function of drawing and outputting the searched commuting route on a map. This is a function that is normally provided in conventionally provided map data display software, and this makes it easy to visually confirm the validity of the commuting route.

  Each component described above is actually a certain area secured in a storage medium such as a hard disk, CD-ROM, or DVD-ROM of a computer system, and a program installed in these areas. By being loaded and executed, the functions of the present invention are achieved in cooperation with an OS (operation system).

  Hereinafter, detailed functions of the system 1 will be described together with actual operations with reference to FIGS. In addition, S1-S30 of these figures is a code | symbol which shows a processing order, and respond | corresponds to step S1-S30 of the following description.

  First, the nearest station registration flow in FIG. 8 will be described. This registration process is performed at the same time when the commuting route is changed for a large number of employees, such as when an organization is changed, when personnel changes, or when the office is moved. To be done.

  In this process, the boarding / exit base extraction unit 25 extracts the home address of the target employee 2 from the employee master table 22 based on an instruction to start processing by the operator (step S1), and the latitude / longitude corresponding to this address. Is retrieved from the map data storage unit 20 and the position information is specified (step S2). Next, as illustrated in FIG. 5, the boarding / exiting base extraction unit 25 extracts all stations existing within a radius of 2 km from the home (step S3).

  When one or more stations can be extracted (Yes in Step S4), the distance measuring unit 26 is activated, and the distance D1 along the road from the home is measured for all the extracted stations (Step S5). When the measured distance D1 is 2 km or less (Yes in step S6), the nearest station specifying unit 27 temporarily stores (temporarily registers) the station as “the nearest station” in the memory (step S7). ). For a station exceeding 2 km (No in step S6), the provisional registration process is skipped. The nearest station specifying unit 27 repeats the processes in steps S5 to S7 for all the stations extracted in step S3 (step S8).

  As a result, when a plurality of stations are temporarily registered as the nearest stations (Yes in step S9), the nearest station specifying unit 27 searches for a route in which the plurality of stations are temporarily registered (step S10). ). Among those nearest stations, all the stations whose distance from the home is 0.5 km or less are registered in the employee master table 22 as "nearest stations" (Yes in steps S11, S12). For example, as shown in FIG. 5, when two stations of Takadanobaba and Mejiro are temporarily registered for the Yamanote Line, since both stations have a distance D1 from their home of 0.5 km or less, both Register as the nearest station.

  If no nearest station is temporarily registered (No in step S9), the station with the smallest distance D1 from the home is registered as the nearest station among the stations extracted in step S4 (step S13). ). In addition, when only one nearest station is temporarily registered on one route (such as the Tozai Line in FIG. 5), or for a plurality of stations temporarily registered on one route, the distance D1 is 0.5 km. (Seibu Shinjuku Line, etc. in FIG. 5) (No in step S11), the station having the smallest distance D1 is registered as the nearest station on the route (step S13).

  On the other hand, when no railway station can be extracted in step S4 (No in step S4), the boarding / exiting base extraction unit 25 extracts a bus stop within a radius of 2 km from the home (step S14). As a result, the employee's commuting route can be searched even if the employee 2 does not apply for bus use, and whether or not the bus can be used can be instantly determined when the application is accepted. In this example, the extraction area of the boarding / exiting base is not expanded.

  Next, this boarding / exit base extraction unit 25 extracts all the extracted bus stop operation routes from the traffic information storage unit 21 and determines whether or not a railway station is included on the route (step S15). If a railway station is included (Yes in step S15), the bus stop and the station at which the standard operation time to that station is minimized are the first and second nearest stations as shown in FIG. Register in association (step S16). If there is no station on the route (No in step S15), it is determined that there is no nearest station, and this process ends. In other words, as a general rule, this employee is not allowed to use public transportation and is not paid commuting expenses. As will be described later, when commuting to a commuting destination is possible by bus, the availability is determined after an application for bus use from this employee is made.

  The registration of the nearest station as described above is performed regardless of the work place of the employee 2. As a result, if the employee 2 is not moving at home when transferring, the search for the optimal commuting route and the calculation / payment of commuting expenses are processed quickly without waiting for a change application from the target employee. Will be able to.

  Next, the optimum route searching process will be described with reference to the flowchart of FIG. The following processing is an example of searching for the optimum route for an employee whose home address or nearest station has already been registered and whose work location has been changed due to personnel changes or the like.

  In this process, first, the application reception unit 30 acquires the ID of the target employee 2 input by the operator, and the employee's new work location from the employee master table 22 and the location of this work location. Information is searched (steps S20 and S21).

  Next, the distance measuring unit 26 measures the distance D0 from the home of the employee 2 to the work place on the map (step S22). When the measured distance D0 is 2 km or less (Yes in step S23), this employee 2 determines that he / she does not pay commuting, that is, commuting expenses, and ends the search for the commuting route (step S24). Conversely, if the distance D0 from home to the commuting destination exceeds 2 km (No in step S23), if this employee has issued an application for bus use, the flow proceeds to the bus use permission flow described later. If no bus use application has been issued, the following commuting route search process is executed (step S25).

  In the commuting route search process, the route search unit 28 first searches all the nearest stations of the employee 2 and the nearest station of the new work place (steps S26 and S27). The route search unit 28 searches for all commuting routes that can be moved between the home nearest station and the nearest work station that are found, and information on transportation expenses (six months), travel time, and route information. The commuting route specifying unit 29 is handed over (step S28). The commuting route specifying unit 29 stores (temporarily registers) the commuting route having the lowest transportation cost among all the obtained routes as “optimum route (first route candidate)” in the memory (step S29). . Other paths are also stored in memory for the following verification process.

  Next, the commuting route candidate search unit 40 of the commuting route verification unit 31 is activated, and all the routes stored in the memory are sorted in order of transportation cost / travel time (step S30), as shown in FIG. The travel time of the first route candidate (n = 0) and the other route candidates (n = 1 to 4), the number of transfers, and the increase in transportation costs are verified (steps S31 to S33). For the second route candidates (n = 2 to 4) and the third route candidates (n = 1, 3, 4) searched by the commuting route candidate search unit 40, the determination unit 41 determines the travel time, the number of transfers, and the transportation cost. For the route of n = 3 determined to satisfy all of the increase amount conditions (Yes in steps S31 to S33), the commuting route correction unit 42 registers in the employee master table 22 as the optimum route of the employee 2 ( Step S34). At this time, the first path is erased from the memory.

  As for the optimum commuting route searched and verified in this way, all routes and transfer stations are registered in the employee master table 22 in association with the employee ID.

  Finally, with reference to the flowchart of FIG. 10, processing for determining whether or not the bus can be used for the employee when it is determined that there is a bus use application in step S25 will be described. This process is performed when there is an application from the target employee in patterns 2 to 6 in which the bus is used in the middle of the commuting route among the usage patterns shown in FIG. Further, the following processing is executed by the commuting route specifying unit 29.

  First, a search is made as to whether the bus stop is registered as the nearest station of the employee 2 (step S30). If it is not registered, it is determined that “bus cannot be used” and the process returns to step S26 (step S31). .

  If the bus stop is registered (Yes in step S30), it is searched whether the bus stop is registered as the nearest station in the office table for the work place of the employee 2 searched in step S20 (step S32). ). If a bus stop is registered, it is determined by referring to the traffic information storage unit 21 whether there is a route that can be moved from the bus stop as the nearest station to the bus stop as the nearest station at work (step) S33).

  If it is determined that there is a route, it is determined that this employee can commute to the office by work, and is registered in the employee master table 22 as an optimum route, and this process is terminated (steps S34 and S35). On the other hand, if it is determined that there is no route to the commuting destination, the employee master table 22 is searched for whether there is a railway station associated with the home bus stop (step S36), and such a station is registered. If permitted, use of the bus to the station is permitted (step S37). In this case, the station, the bus fare, and the travel time (the time required for the bus to the station) are registered in the memory, and then the process returns to step S26 (step S38). To identify all processes in the commute route.

  In addition, this invention is not limited to said embodiment, A various deformation | transformation is possible in the range which does not change the summary of invention.

  For example, when the route search unit 28 is not provided in the system 1 and an external route search service or the like is used, information on the nearest home station and work nearest station specified by the nearest station specifying unit 27 is routed. It is preferable to provide a nearest station information transmission unit that transmits to a host computer of the search service.

  Further, when the bus use is identified as the optimum route, the transportation cost may be paid without waiting for an application for bus use from an employee.

  Furthermore, the optimal route calculation system 1 may be provided in an external ASP server so that the calculation of the optimal route is accepted from a company that has concluded an outsourcing contract.

FIG. 1 is a diagram showing a network configuration according to an embodiment of the present invention. FIG. 2 is a diagram for explaining a pattern of commuting routes. FIG. 3 is a block diagram showing a schematic configuration of the commuting route calculation system according to the embodiment of the present invention. FIG. 4 is a diagram for explaining a process of extracting a boarding / alighting base near the home. FIG. 5 is a table showing an example of the specified nearest station. FIG. 6 is a diagram schematically showing the data structure of the employee master table. FIG. 7 is a table for explaining the commuting route candidate verification process. FIG. 8 is a flowchart showing the registration process step of the nearest station. FIG. 9 is a flowchart showing a commuting route search process. FIG. 10 is a flowchart showing the bus use determination processing step.

Explanation of symbols

1 ... Optimal route calculation system 2 ... Employee 3 ... Company 4 ... Server 5 ... Map data provider 6 ... Operator 10 ... CPU
11 ... RAM
DESCRIPTION OF SYMBOLS 12 ... Input / output device 13 ... Communication device 14 ... Bus line 15 ... Data storage part 16 ... Program storage part 20 ... Map data storage part 21 ... Traffic information storage part 22 ... Employee master table 25 ... Boarding / exit base extraction part 26 ... Distance Measuring unit 27: Nearest station specifying unit 28 ... Route searching unit 29 ... Commuting route specifying unit 30 ... Application receiving unit 31 ... Commuting route verification unit 32 ... Traffic information acquiring unit 33 ... Commuting route updating unit 34 ... Searching for nearest station Output unit 40 ... Commuting route candidate search unit 41 ... Determination unit 42 ... Commuting route correction unit 43 ... Re-search instruction unit

Claims (32)

A system that uses a computer to calculate the commute route of employees who commute using means of transportation,
The computer is
A boarding / storage base storing means for storing location information of a boarding / exiting base of public transportation including a railway station and a bus stop;
Identify the location information for each of the home address that is the starting point of the employee's commuting route and the location of the work location that is the ending point of the commuting route, and within a predetermined distance from the starting point and the ending point with reference to the boarding location storage means Boarding / exiting base extracting means for extracting all existing boarding / exiting bases;
A distance measuring means for measuring the distance between the extracted boarding point and the starting point and the end point; and
A nearest station identifying means for identifying a boarding / alighting base whose calculated road distance is equal to or less than a predetermined value as the “closest station” of the start point and the end point;
A route for calculating a traffic route between two boarding points, a route of one or more transportation facilities constituting the route, and a transportation cost and a standard travel time between two boarding points when using this route. Nearest station information transmitting means for transmitting information of the nearest station of the start point and end point to the search system;
Get the traffic route and transportation cost between the two nearest stations calculated by the route search system, and specify the route that has the lowest traffic cost among the obtained traffic routes as the commuting route of the employee A system comprising: means. In the commuting route calculation system according to claim 1,
The computer further comprises verification means for verifying whether the first commuting route candidate is appropriate based on conditions other than the transportation cost of the specified commuting route (first commuting route candidate). Feature system. In the commuting route calculation system according to claim 2,
The commuting route specifying means also obtains a standard travel time between two nearest stations from the route search system,
The verification means searches for a second commute route candidate whose standard travel time is shorter than the first commute route candidate, and when the difference between the standard travel times of the two routes exceeds a predetermined reference time, A system comprising commuting route correction means for replacing a second commuting route candidate with a commuting route. In the commuting route calculation system according to claim 3,
The commuting route correction means replaces the second commuting route candidate with a commuting route when a difference in transportation costs between two commuting route candidates is a predetermined amount or a ratio or less. system. In the commuting route calculation system according to claim 2,
The computer includes a traffic information storage means for storing information of an operation schedule for each route of the transportation facility,
The verification means refers to the traffic information storage means, and the employee's work time zone and / or return home for which the operating time zone of the transportation route constituting at least a part of the first commuting route candidate is preset. When the vehicle is out of the time zone, the route search system is instructed to re-search for a route excluding the route. In the commuting route calculation system according to claim 2,
When the number of transfers of the first commute route candidate is equal to or greater than a predetermined number, the verification unit searches for a third commute route candidate having a lower number of transfers than the first commute route candidate, and A system characterized in that the third commuting route candidate is replaced with a commuting route when the difference in transportation cost of the route candidate is a predetermined amount or a ratio or less. In the commuting route calculation system according to claim 1,
The computer further comprises an employee master table that stores an employee's address, work place, specified nearest station, and commute route in association with each employee's identification information. In the commuting route calculation system according to claim 7,
The employee master table stores the standard walking speed and / or allowable walking distance of each employee in association with employee attributes such as the employee's gender, age, occupation, occupation, job title, and work style. Yes,
The nearest station specifying means determines a predetermined value of the distance between the starting point and the ending point and the boarding / exiting point based on the walking standard speed and / or the allowable walking distance associated with the employee attribute of the employee master table. A system characterized by that. In the commuting route calculation system according to claim 7,
The nearest station specifying means specifies the nearest station when there are a plurality of boarding points on the same route whose distance from the employee's home (starting point) is a predetermined distance or less. A system characterized by being registered in the employee master table in association with identification information. In the commuting route calculation system according to claim 9,
In the case where the nearest station specified includes a bus stop, the nearest station identification means is also an employee master of other public transportation boarding points that can be reached using a bus boarding from that stop. A system that is registered in a table. In the commuting route calculation system according to claim 7,
The computer further searches the employee master table for all employees working at the workplace when receiving information on the transfer of the workplace, and extracts the boarding / exiting base extracting means, the distance measuring means, the nearest A commuting route update means is provided for instructing to update the commuting route with the location of the transfer destination as an end point for all the searched employees for the station specifying means, the nearest station information transmitting means and the commuting route specifying means. Feature system. In the commuting route calculation system according to claim 7,
The computer further searches the employee master table for employees whose addresses belong to a specific area in a predetermined cycle, and sorts the nearest station of the searched employee and its route by the employee's office. A system characterized by comprising a nearest station output means for outputting. In the commuting route calculation system according to claim 1,
The computer further comprises means for obtaining information on the transportation cost of the operating section from an operator operating the transportation for the operating section of the specific transportation that cannot calculate the transportation cost in the route search system,
The commuting route specifying means specifies a commuting route with the lowest transportation cost based on the acquired information on the transportation cost and the calculation result of the route search system. In the commuting route calculation system according to claim 1,
The nearest station specifying means is for identifying the boarding / exiting base having the shortest distance as the nearest station when there is no boarding / exiting base having a predetermined distance or less. In the commuting route calculation system according to claim 1,
The commuting route specifying means transmits information on a plurality of nearest stations for a starting point and / or an ending point to a route search system, and each route and a plurality of routes searched by combining a plurality of nearest stations A system characterized by acquiring transportation expenses. A system that uses a computer to calculate the commute route of employees who commute using means of transportation,
The computer is
A boarding / storage base storing means for storing location information of a boarding / exiting base of public transportation including a railway station and a bus stop;
Identify the location information for each of the home address that is the starting point of the employee's commuting route and the location of the work location that is the ending point of the commuting route, and within a predetermined distance from the starting point and the ending point with reference to the boarding location storage means Boarding / exiting base extracting means for extracting all existing boarding / exiting bases;
A distance measuring means for measuring the distance between the extracted boarding point and the starting point and the end point; and
A nearest station identifying means for identifying a boarding / alighting base whose calculated road distance is equal to or less than a predetermined value as the “closest station” of the start point and the end point;
Calculates the traffic route between two specified boarding / exiting bases, the route of one or more transportation facilities that make up this route, and the transportation cost and travel time between two boarding / exiting bases when using this route Route search means to
A system comprising: a commuting route specifying means for specifying a route having the lowest transportation cost as a commuting route of the employee among the calculated traffic routes. A method of calculating a commuting route of an employee who commute using public transportation by a computer,
The computer is
A boarding / exiting base storage process for storing location information of boarding / exiting bases for public transport including railway stations and bus stops in the boarding / exiting base storage means;
Identify the location information for each of the home address that is the starting point of the employee's commuting route and the location of the work location that is the ending point of the commuting route, and within a predetermined distance from the starting point and the ending point with reference to the boarding location storage means Boarding / exiting base extraction process for extracting all existing boarding / exiting bases;
A distance measuring step for measuring the distance between the extracted boarding point and the starting point and the end point; and
The nearest station identification process for identifying the boarding / exiting base where the calculated road distance is a predetermined value or less as the “nearest station” of the start point and the end point,
Route search that calculates the traffic route between two boarding points, the route of one or more transportation facilities that make up this route, and the transportation cost and travel time between two boarding points when using this route Nearest station information transmission step of transmitting information of the nearest station of the start point and the end point to the system,
Get the traffic route and transportation cost between the two nearest stations calculated by the route search system, and specify the route that has the lowest traffic cost among the obtained traffic routes as the commuting route of the employee A process characterized by performing the steps. In the commuting route calculation method according to claim 17,
The computer further executes a verification step of verifying whether or not the first commuting route candidate is appropriate based on conditions other than the transportation cost of the specified commuting route (first commuting route candidate). Feature method. In the commuting route calculation method according to claim 17,
In the commuting route specifying step, the standard travel time between two nearest stations is also acquired from the route search system.
The verification step searches for a second commute route candidate whose standard travel time is shorter than the first commute route candidate, and when the difference between the standard travel times of the two routes exceeds a predetermined reference time, A method of performing a commuting route correction step of replacing a second commuting route candidate with a commuting route. In the commuting route calculation method according to claim 19,
The commuting route correction step replaces the second commuting route candidate with a commuting route when the difference in transportation costs between the two commuting route candidates is a predetermined amount or a ratio or less. Method. In the commuting route calculation method according to claim 17,
The computer further executes a traffic information storage step of storing information on an operation schedule for each route of the transportation in the traffic information storage means,
The verification step refers to the traffic information storage means, and the employee's office time zone and / or return home where the operating time zone of the transportation route constituting at least a part of the first commuting route candidate is preset. A method characterized by instructing the route search system to re-search for a route excluding the route when it is out of the time zone. In the commuting route calculation method according to claim 17,
In the verification step, when the number of transfers of the first commute route candidate is a predetermined number or more, the third commute route candidate having a smaller number of transfers than the first commute route candidate is searched, and two commute A method characterized in that the third commuting route candidate is replaced with a commuting route when the difference in transportation cost of the route candidate is a predetermined amount or a ratio or less. In the commuting route calculation method according to claim 17,
The computer further executes an employee information storing step of storing the employee's address, work place, the specified nearest station and commuting route in the employee master table in association with the identification information of each employee. Feature method. The commuting route calculation method according to claim 23,
The employee information storing step associates each employee's standard walking speed and / or allowable walking distance with employee attributes such as the employee's gender, age, occupation, type of job, job title, and work style. Is stored in a table,
The nearest station specifying step is to determine a predetermined value of the distance between the starting point and the ending point and the boarding / exiting point based on the walking standard speed and / or the walking allowable distance associated with the employee attribute of the employee master table. A method characterized by that. The commuting route calculation method according to claim 23,
In the nearest station specifying step, when there are a plurality of getting-on / off bases having a predetermined distance or less from the employee's home (starting point) on the same route, all of them are specified as the nearest station. A method of registering in the employee master table in association with identification information. The commuting route calculation method according to claim 25,
In the nearest station identification process, if a bus stop is included in the specified nearest station, the other master stations of public transportation that can be reached by using the bus from the stop are also employee masters. A method characterized by being registered in a table. The commuting route calculation method according to claim 23,
The computer further searches the employee master table for all employees working at the workplace when receiving information on the transfer of the workplace, and extracts the boarding / exiting bases step, the distance measurement step, and the nearest A method comprising: executing a station specifying step, a nearest station information transmitting step, and a commuting route specifying step to update a commuting route with the location of the relocation destination as an end point for all searched employees. The commuting route calculation method according to claim 23,
The computer further searches the employee master table for employees whose addresses belong to a specific area in a predetermined cycle, and sorts the nearest station of the searched employee and its route by the employee's office. And performing the nearest station output process of outputting. In the commuting route calculation method according to claim 17,
The computer further comprises a step of obtaining information on the transportation expenses of the operating section from an operator operating the transportation section for the operating section of the specific transportation system that cannot calculate the transportation cost by the route search method,
The commuting route specifying step specifies the commuting route with the lowest transportation cost based on the acquired information on the transportation cost and the calculation result of the route search system. In the commuting route calculation method according to claim 17,
The nearest station identifying step is to identify the nearest boarding station as the nearest station when there is no boarding / exiting base having a road distance of a predetermined value or less. In the commuting route calculation method according to claim 17,
In the commuting route specifying step, information on a plurality of nearest stations is transmitted with respect to a route search method with respect to a starting point and / or an ending point, and each route for a plurality of routes searched by combining a plurality of nearest stations, A method characterized in that a transportation cost and a standard travel time are obtained. A method of calculating a commuting route of an employee who commute using a transportation means by a computer,
The computer is
A boarding / exiting base storage process for storing location information of boarding / exiting bases for public transport including railway stations and bus stops in the boarding / exiting base storage means;
Identify the location information for each of the home address that is the starting point of the employee's commuting route and the location of the work location that is the ending point of the commuting route, and within a predetermined distance from the starting point and the ending point with reference to the boarding location storage means Boarding / exiting base extraction process for extracting all existing boarding / exiting bases;
A distance measuring step for measuring the distance between the extracted boarding point and the starting point and the end point; and
The nearest station identification process for identifying the boarding / exiting base where the calculated road distance is a predetermined value or less as the “nearest station” of the start point and the end point,
Calculates the traffic route between two specified boarding / exiting bases, the route of one or more transportation facilities that make up this route, and the transportation cost and travel time between two boarding / exiting bases when using this route A route search process to
And a commuting route specifying step of specifying, as a commuting route of the employee, a route having the lowest transportation cost among the calculated traffic routes.

Images