JP2010052576A - Route search server and program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To search data for moving from a departure place to a destination, particularly the data for moving by using a transportation facilities operated according to a time table, after the last train thereof. <P>SOLUTION: The route search server is provided with: an average route search means 31 for searching and outputting average route data, according to the condition acquired by a condition acquiring means; a last train allotment means 32 for calculating first last train data to be the last train of transportation facilities from a departure place to a destination, based on the average route data; and an allotment means 33 for allotting a train after the last train. The allotment means 33 calculates transfer data by allotting a train to depart the departure place later than a unit time of departure place in the first last train data, about the average route data searched by the average route data means, determines an arrival station of a train after the last train by calculating an overnight day station to be a station for getting on a next day train about the transfer data, calculates a second last train data to be the last train of the transportation facilities from the departure place to the arrival station of the train after the last train, and calculates the movement data including the second last train data. <P>COPYRIGHT: (C)2010,JPO&INPIT

Description

  The present invention relates to a route search server and a route search program for searching for movement data from a departure place to a destination, which is movement data after the last train using a transportation system operating according to a timetable.

  With recent information communication technology, various information is provided via a communication network such as the Internet. One example is transit information for transportation. The transfer information is the information on the train such as which train of which transportation and at which station to change by inputting the departure point, destination, and the time when the user wants to arrive at the destination. It provides transfer information. In the route search service, a method for providing optimal transfer information to the user has been proposed, and one of them is a service for guiding the last train in a predetermined section. The last train information service is used, for example, when searching for the last train in advance when it is late for work or work.

The last train guidance service guides the last train between the departure point and the destination input by the user, but there is also a guidance service in case that the train is not in time for the last train (for example, see Patent Document 1). In the method, the user is provided with information on the nearest station to the destination that can be used within the last train time. At this time, according to the method described in Patent Document 1, based on the position information of the user's current position, the nearest station to the user's position information and available within the last train time, and the nearest to the user's address And the position which can be used within the last train time is searched (see paragraph number [0020] etc. of Patent Document 1). Here, in the method described in Patent Document 1, the nearest station is searched based on the latitude and longitude information of the station based on the position information of the user (see paragraph numbers [0032] and [0033] and the like in Patent Document 1). .
JP 2006-11546 A

  However, the method described in Patent Document 1 is not appropriate when searching using a personal computer or the like that does not have a device that acquires position information. In addition, since the starting point and the destination are searched based on the position information, a route that is not normally used may be searched, and it may be unsuitable for transfer guidance after the last train for a moment.

  As described above, it is expected to provide a route search server and a route search program that appropriately output movement data after the last train.

  Accordingly, an object of the present invention is to provide a route search server and a route search program that appropriately output movement data after the last train.

  In order to solve the above-mentioned problem, a first feature of the present invention is a route search for searching for travel data from a departure place to a destination and using the transportation system operating according to a timetable after the last train. Regarding the server. That is, the route search server according to the first feature of the present invention acquires route data storing means for storing route data in which a route of a transportation facility and a route station are associated with each other in a storage device, and a transfer condition. A condition acquisition means, an average route search means for reading out the route data from the storage device, searching for and outputting the average route data according to the conditions acquired by the condition acquisition means, and a destination from the destination based on the average route data More than the unit time of the departure time of the departure place in the first final train data for the final train allocation means for calculating the first final train data to be the last train of the transportation until the average route data searched by the average route search means Assign a train that will depart later and move from the departure point to the destination, calculate transfer data, and use the transfer data for the next day's train station. Calculates the day crossing station, determines the train arrival station after the last train, calculates the second train last data for transportation from the departure point to the train arrival station after the last train, and includes the second train data Train allocating means for calculating after-train and result presentation means for outputting movement data.

  Here, the taxi fare data storage means for storing the taxi fare data associated with the taxi fare between each station of the transportation system in the storage device, the taxi fare data is read from the storage device, the train arrival station and the destination after the last train The movement data may include the taxi fare calculated by the taxi fare calculation means.

  Further, the average route search means further stores the distance between stations on the route, and when the average route search means calculates a plurality of average route data, the train assignment means after the last train is all calculated by the average route search means. For the average route data, the transfer data and the day crossing station may be calculated, and the day crossing station having the shortest distance from the destination may be the train arrival station after the last train.

  Further, the train allocating means after the last train further calculates new transfer data that departs after the unit time of the departure time of the departure point in the second final train data and moves from the departure point to the destination, and the new Calculate new day crossing station for transfer data, determine the new train arrival station after the last train, and calculate third train last data that will be the last train of transportation from the departure point to the new train arrival station after the last train. New movement data including the third last train data may be calculated.

  Further, the train allocating means after the last train may repeat the process of calculating new movement data until the new train arrival station after the last train becomes the departure place.

  Further, the taxi fare calculation means further calculates a new taxi fare between the new train arrival station and the destination after the last train, and the new movement data may include the new taxi fare calculated by the taxi fare calculation means. good.

  The second feature of the present invention relates to a route search program that searches for travel data from a departure point to a destination and after the last train using a transportation system that operates according to a timetable. That is, the route search program according to the second feature of the present invention acquires route data storing means for storing route data in which a route of a transportation facility and a station of the route are associated with each other in a storage device, and a transfer condition. A condition acquisition means, an average route search means for reading out the route data from the storage device, searching for and outputting the average route data according to the conditions acquired by the condition acquisition means, and a destination from the destination based on the average route data More than the unit time of the departure time of the departure place in the first final train data for the final train allocation means for calculating the first final train data to be the last train of the transportation until the average route data searched by the average route search means Assign the train that will depart later and move from the departure point to the destination and calculate transfer data. Calculate the second station data that will be the last train of transportation from the departure point to the train arrival station after the last train. The computer assigns a post-final train assignment unit that calculates data and a result presentation unit that outputs movement data.

  Here, the taxi fare data storage means for storing the taxi fare data associated with the taxi fare between each station of the transportation system in the storage device, the taxi fare data is read from the storage device, the train arrival station and the destination after the last train The taxi fare calculation means for calculating the taxi fare for the computer may be further caused to function on the computer, and the movement data may include the taxi fare calculated by the taxi fare calculation means.

  Further, the average route search means further stores the distance between stations on the route, and when the average route search means calculates a plurality of average route data, the train assignment means after the last train is all calculated by the average route search means. It is also possible to calculate transfer data and a day crossing station with respect to the average route data, and set the day crossing station having the shortest distance from the destination as the train arrival station after the last train.

  Further, the train allocating means after the last train further calculates new transfer data that departs after the unit time of the departure time of the departure point in the second final train data and moves from the departure point to the destination, and the new Calculate new day crossing station for transfer data, determine the new train arrival station after the last train, and calculate third train last data that will be the last train of transportation from the departure point to the new train arrival station after the last train. New movement data including the third last train data may be calculated.

  Further, the train allocating means after the last train may repeat the process of calculating new movement data until the new train arrival station after the last train becomes the departure place.

  Further, the taxi fare calculation means further calculates a new taxi fare between the new train arrival station and the destination after the last train, and the new movement data may include the new taxi fare calculated by the taxi fare calculation means. good.

  ADVANTAGE OF THE INVENTION According to this invention, the route search server and route search program which output appropriately the movement data after the last train can be provided.

  Next, an embodiment of the present invention will be described with reference to the drawings. In the following description of the drawings, the same or similar parts are denoted by the same or similar reference numerals.

  In the best mode of the present invention, “final train” refers to the final transfer data that is handled on the day of each transportation, among the transportation data of transportation in a predetermined section from the departure point to the destination. Specifically, even if the train arriving at 2:00 am on September 5 at a certain transportation station is the last train, if the train can be boarded with a ticket released on September 4, Searched as the last train.

  “Train after last train” refers to a train that departs after a unit time of the departure time in the last train data based on the last train data of a predetermined section, and arrives at a station on the way to the destination. .

  The “unit time” is a minimum time unit of the timetable data 23 a stored in the route search server 1. For example, when the timetable data 23a is created in units of 1 minute, the unit time is 1 minute. Similarly, when the timetable data 23 is created in units of 10 seconds, the unit time is 10 seconds. In the preferred embodiment of the present invention, a case will be described in which the timetable data 23a is created in units of one minute and the unit time is one minute.

(Best Embodiment)
The route search system according to the best mode of the present invention includes a route search server 1, a client terminal 2a, and the like. The route search server 1 and the client terminal 2a are connected to each other by a communication network 3 such as the Internet.

  The route search server 1 outputs transfer data that is a result of searching for a transfer of transportation from a departure place to a destination under a predetermined condition. The route search server 1 receives a condition from the client terminal 2a, etc., searches for a transfer of transportation from the departure point to the destination according to the condition, and transfers the resulting transfer data to the client terminal 2a, etc. that inputs the condition On the display screen.

  Here, the predetermined condition is input by a user operation from the client terminal 2a or the like. Specific examples of the predetermined condition include a departure point, a destination, a desired departure time that specifies a time to leave the departure point, and a desired arrival time that specifies a time to arrive at the destination. The departure point and destination are points where you can get off at a transportation facility such as a train station or a bus stop. Furthermore, in order to prioritize the conditions that meet the user's needs from multiple transfer data, the predetermined conditions are priority to the required time, priority to the number of transfers, fare priority, priority to the current train, etc. Is mentioned.

  In particular, the route search server 1 according to the preferred embodiment of the present invention appropriately outputs the movement data after the last train. Therefore, the predetermined condition includes an instruction to search for the last train and the train after the last train in addition to the departure point and the destination.

  The client terminal 2a is generally an electronic device that includes a CPU, a storage device, an input device, a display device, and the like. Predetermined software such as a browser is installed in the client terminal 2a. This software supports input of predetermined conditions to be transmitted to the route search server 1, output of search results transmitted from the route search server 1, and the like. The client terminal 2b and the client terminal 2c have the same configuration as the client terminal 2a.

  As shown in FIG. 2, the route search server 1 according to the preferred embodiment of the present invention includes a central processing control device 101, a ROM (Read Only Memory) 102, a RAM (Random Access Memory) 103, and an input / output interface 109. Are connected via a bus 110. An input device 104, a display device 105, a communication control device 106, a storage device 107, and a removable disk 108 are connected to the input / output interface 109.

  The central processing control device 101 reads out and executes a boot program for starting the route search server 1 from the ROM 102 based on an input signal from the input device 104, and further reads out an operating system stored in the storage device 107. Further, the central processing control device 101 controls various devices based on input signals from the input device 104, the communication control device 106, etc., and reads programs and data stored in the RAM 103, the storage device 107, etc. into the RAM 103. A processing device that loads and implements a series of processing described later, such as data calculation or processing, based on a program command read from the RAM 103.

  The input device 104 includes input devices such as a keyboard and a mouse through which an operator inputs various operations. The input device 104 generates an input signal based on the operation of the operator, and inputs via the input / output interface 109 and the bus 110. It is transmitted to the central processing control apparatus 101. The display device 105 is a CRT (Cathode Ray Tube) display, a liquid crystal display, or the like, and receives an output signal to be displayed on the display device 105 from the central processing control device 101 via the bus 110 and the input / output interface 109. It is a device that displays the processing result of the control device 101 and the like. The communication control device 106 is a device such as a LAN card or a modem, and is a device that connects the route search server 1 to a communication network such as the Internet or a LAN. Data transmitted / received to / from the communication network via the communication control device 106 is transmitted / received to / from the central processing control device 101 via the input / output interface 109 and the bus 110 as input signals or output signals.

  The storage device 107 is a semiconductor storage device or a magnetic disk device, and stores programs and data executed by the central processing control device 101. The removable disk 108 is an optical disk or a flexible disk, and signals read / written by the disk drive are transmitted / received to / from the central processing control apparatus 101 via the input / output interface 109 and the bus 110.

  The storage device 107 of the route search server 1 according to the preferred embodiment of the present invention stores a route search program, a search condition data storage unit 21, a route data storage unit 22, a timetable data storage unit 23, A fare data storage unit 24, a taxi fare data storage unit 25, and a result data storage unit 26 are provided. In addition, the condition acquisition unit 11, the route search unit 12, and the result presentation unit 13 are implemented in the route search server 1 by the route search program being read and executed by the central processing control device 101 of the route search server 1.

  The search condition data storage unit 21 is a storage unit in which the search condition data 21a for transit changes received from the client terminal 2a or the like is stored. The condition acquisition unit 11 stores the search condition data 21 a in the search condition data storage unit 21 of the storage device 107. The search condition data 21a is data that includes an identifier of the departure place and the destination, and generally includes a departure desired time of the departure place or an arrival arrival time of the arrival place. In particular, in the best mode of the present invention, the search condition includes the last train of the transportation between the departure point and the destination, and the guidance of the train after the last train. Further, the search condition data 21a may include a sort condition such as whether to output the search results in the order of “required time”.

  The route data storage unit 22 is a storage unit in which route data 22a is stored. A route data storage unit (not shown) stores the route data 22 a in the route data storage unit 22 of the storage device 107. The route data 22a is data in which a route of transportation facilities, a station located on the route, and a distance between stations on the route are associated with each other. The distance between stations on the route may be a business distance, but may be a linear distance calculated from the station position. In the case of a straight distance, it can be used as a reference when moving by taxi from the station where the train is to be deferred to the destination after the last train.

  The timetable data storage unit 23 is a storage unit in which the timetable data 23a is stored. A timetable data storage means (not shown) stores the timetable data 23 a in the timetable data storage unit 23 of the storage device 107. The timetable data 23a is data in which a timetable of a train on a route of transportation is associated. The timetable data 23a is preferably stored for each transportation facility, route station, and train type.

  The fare data storage unit 24 is a storage unit in which fare data 24a is stored. A fare data storage means (not shown) stores the fare data 24 a in the fare data storage unit 22 of the storage device 107. The fare data 24a is data in which the route of the transportation facility is associated with the fare. The fare data 24a is preferably stored for each distance of transportation.

  The taxi fare data storage unit 25 is a storage unit in which taxi fare data 25a is stored. A taxi fare data storage means (not shown) stores the taxi fare data 25a in the taxi fare data storage unit 25 of the storage device 107. In the taxi fare data 25a, taxi fare is associated with each station of the transportation facility. As another example, information on the initial fare and the distance to which the initial fare is applied, and the metered distance and fare, which are necessary for calculating the taxi fare, may be stored. In this case, the taxi fee calculating means 35 described later may calculate the taxi fee by acquiring the distance traveled by taxi.

  The route data 22a, the timetable data 23a, the fare data 24a, and the taxi fare data 25a are information that a general route search server has, and can have any configuration as long as the route search is possible. good.

  The result data storage unit 26 is a storage unit in which result data 26a is stored. The route search unit 12 stores the result data 26 a in the result data storage unit 26 of the storage device 107. The result data 25a is a train after the last train from the departure point to the destination, and includes transfer data from the departure point at a unit time after the departure time of the departure point at the last train to the arrival station of the train after the last train. Furthermore, the result data 25a may include the time required for traveling by taxi from the train arrival station to the destination after the last train, fees, and the like.

  The search condition data 21a stored in the search condition data storage unit 21 and the result data 25a stored in the result data storage unit 25 are temporary data in the processing of the route search server 1 according to the preferred embodiment of the present invention. Therefore, it may be stored in the RAM 103 instead of the storage device 107 and erased as necessary.

  Next, with reference to FIG. 3, an outline of the processing of the route search server 1 according to the preferred embodiment of the present invention will be described.

  First, when a search condition is input from the client terminal 2a or the like, initialization is performed prior to the route search process in step S1. Specifically, initialization of variables used in route search processing is performed. Here, the search conditions are conditions for determining a route such as a departure place, a destination, a waypoint, etc., a desired departure time, a desired arrival time, a desired time priority, a transfer priority, a fare priority, a current train priority, Conditions for outputting a route optimal for the user are included. Here, it is assumed that the departure point is “A station” and the destination is “B station”, and a condition for obtaining the last train from the departure point to the destination or a train after the last train is input.

  Next, in steps S2 to S6, processing for calculating transfer data is performed. Specifically, in step S2, average route data from A station to B station is searched. Here, the average route data is route data that may meet the conditions input by the user. In this average route data, more routes than the number of routes to be output are output. Next, for each of the average routes searched in step S2, in step S3, referring to the train timetable data and the like, the last train from station A to station B is assigned.

  Next, in step S4, a time obtained by adding a unit time to the departure time at the departure station A of the last train searched in step S3 is calculated as time T. Furthermore, in step S5, the train after the last train is assigned. Specifically, a train that departs from departure station A at time T calculated in step S4 is searched. Since the train allocated in step S5 is a train after the last train from A station to B station, it is a last train from A station to C station between A station and B station. In step S6, the fare is calculated with reference to train fare data and the like. In step S7, a taxi fare is calculated. The taxi fare calculated here is the taxi fare from station C to station B.

  Steps S3 to S7 are repeated for all or part of the average route calculated in step S2. The results calculated in steps S2 to S7 are stored in the storage device 107 as result data 25a.

  Further, in step S8, transfer data that matches the search condition input by the user is output from the result data 25a. Here, since the user is searching for a route with “prioritized time”, in step S8, transfer data prioritized from the shortest time is output to the client terminal 2a or the like. One or more route data may be output in step S8.

  Next, with reference to FIG. 1, each processing means of the route search server 1 according to the preferred embodiment of the present invention will be described in detail.

  The condition acquisition unit 11 acquires search conditions for transfer. The condition acquisition unit 11 stores the search condition data 21a input from the client terminal 2a or the like via the communication network 4, the communication control device 106, or the like in the search condition data storage unit 21. The search condition data 21a includes conditions for determining a route such as a departure place, a destination, a waypoint, a desired departure time, a desired arrival time, a time priority, a transfer priority, a fare priority, a current train priority, Conditions for outputting a route optimal for the user are included. In the best embodiment of the present invention, the search condition data 21a particularly includes searching for the last train or a train after the last train. Moreover, the condition acquisition means 11 will perform the initialization process for a route search, if conditions are acquired.

  The route search unit 12 reads the route data 22a from the storage device 107, searches for the transfer data according to the search condition data 21a acquired by the condition acquisition unit 11, and outputs it. The transfer data output here is transfer data related to the train after the last train of transportation from the departure point to the destination input by the user. The route search means 12 further reads the timetable data 23a from the storage device 107, assigns the train time of the transportation facility to the output transfer data, and outputs the time of the transportation facility and the required time in the transfer data. . The route search means 12 further outputs the number of transfers in the output transfer data. The route search means 12 further reads the fare data from the storage device 107, calculates the fare of the output transfer data, and outputs it. The transfer search means 12 further reads the taxi fare data 25a from the storage device 107, and outputs the taxi fare and required time from the train arrival station to the destination after the last train.

  As shown in FIG. 1, the route search means 12 further includes an average route search means 31, a final train assignment means 32, a post-end train assignment means 33, a train charge calculation means 34, a taxi charge calculation means 35, and an output order calculation means 36. Prepare.

  The average route search means 31 reads the route data 22a from the storage device 107, searches for the average route data according to the condition acquired by the condition acquisition means 11, and outputs it.

  Regarding the route search method of the average route search means 31 of the route search means 12 according to the embodiment of the present invention, first, a network composed of a plurality of “nodes” and “arcs” connecting the nodes will be described. A network used for route search is basically created by regarding stations as “nodes” and providing “arcs” between adjacent stations on the track. “Ark” is given the travel time between stations, which is called “weight”. As an example of this, a network of X station and Y station is shown in FIG. Here, X station and Y station are nodes, and double-ended arrows indicated by solid lines with symbols A, B, C, D, and E represent arcs (up / down two arcs are collectively represented as one). ing). Symbols A, B, C, D, and E attached to the arc represent route names. In addition, an up / down flag, an average required time, and the like are attached to each arc of the route. Further, in FIG. 5, the area between the X station and the Y station is indicated by a broken arc, and it is assumed that the station is at a position 13 minutes on foot.

  There are two types of transfer between routes: changing at the same station and transferring between different stations. For transfers at the same station, make the station a creek. A “clique” is a complete subgraph composed of a plurality of points (nodes) included in a given graph. “Clique” means that one station is represented by a node corresponding to the number of routes connected to the station, and an arc for transfer is provided between the nodes. An arc is set between a plurality of creeked nodes to give a transfer time. FIG. 5 shows an example in which the X and Y stations are creeked.

  X station is creeked into a three-point complete graph (triangle) consisting of X station (A) on route A, X station (B) on route B, and X station (C) on route C. Transfer between nodes The time is all 3 minutes. Y station is creeked into a two-point complete graph consisting of Y station (D) on D route and Y station (E) on E route, and the transfer time between nodes is 2 minutes. Nodes in the creek are called “creek stations”, and arcs between creek stations are called “route change arcs”.

  Changing the route in the case of a train means changing the route. For walking transfers between different stations, a new “walking arc” will be established. The route change arc and the walking arc are both moved by walking, but are used separately for convenience. In FIG. 5, a thick line represents a route change arc, and a broken line represents a walking arc. A walking arc is applied to every pair of creek stations at X and Y stations. The walking arc or the route change arc has a flag for identifying it, a movement or transfer time, and the like.

  In addition, in order to distinguish the original station from the creek station, the original station will be called an original station. For example, X station and Y station are originally stations, and X station (A), X station (B), and X station (C) are creek stations. X station remains on the network as multiple creek stations.

  Next, the route search method of the route search means 12 according to the preferred embodiment of the present invention will be described with reference to FIG.

  First, as a premise for performing a route search, in step S101, a network having a station as a node and expressing a route between stations and a transfer on foot by an arc is created. At this time, the network to be created is, for example, the network A, and stores the location where the group numbers among A, A2, A1, A0, etc. are switched. The created network is stored in the route data storage unit 21 as route data. The plurality of networks may be created in advance by another device and stored in the route data storage unit 21.

  Next, in step S102, the retrieval conditions such as the boarding station, the getting-off station, the departure time, and the arrival time input from the client terminal 2a by the user are read. In step S103, necessary data such as route data, timetable data, and fare data is read from the storage device 107.

  Next, in step S104, the shortest path tree is created using the Dijkstra method or the like. The shortest path tree created here is stored as the shortest path tree data. In step S105, the first to K shortest paths from the representative creek station of the boarding station to the representative creek station of the disembarking station are searched based on the shortest path tree data using the Martin algorithm or the like. At this time, using the networks A, A2, A1, and A0, a group of paths using airplanes, bullet trains, toll express trains, ordinary trains, and the like are obtained with a good balance. Since these paths may happen to contain the same path, they are removed and finally the first to K shortest paths are obtained. The obtained first to K shortest paths are stored in multiple path data.

  Next, in step S106, the first to K shortest paths are shortened to obtain first to K paths. Specifically, all the route change arcs are removed for each of the first to K shortest paths, and all the arcs having the same route name are shortened. The obtained multiple routes are stored in the multiple route data. In the best mode of the present invention, the route obtained here is referred to as average route data. In the preferred embodiment of the present invention, the last train and the train after the last train are searched based on the average route data calculated in steps S101 to S106.

  According to the route search method by the route search means 12 according to the preferred embodiment of the present invention, in a network that has points as nodes and expresses routes between points and walk transfers by arcs, an airplane, a bullet train, a toll Routes using limited express, regular trains, etc. can be found with a good balance.

  Based on the average route data output by the average route search means 31, the last train assignment unit 32 calculates first final train data that is the last train of the transportation system from the departure point to the destination. The last train allocation means 32 outputs the last train transfer data in the transportation from the departure point A station to the destination B station as usual. The transfer data output by the last train allocating means 32 is transfer data when moving from the departure point A station to the destination B station by transportation. According to the example shown in FIG. 11, the last train allocation means 32 outputs the transfer data which departs A station at 23:25 and arrives at B station at 00:07 as last train data.

  The last train assignment means 32 calculates the last train transfer data by assigning the train that arrives by the last time of the time that is handled on the day, for example, 3 am, and leaves the departure place the latest. can do. Moreover, the last train allocation means 32 may set each time of the time zone considered to be the last train as the departure time, and search for a train that leaves the departure place at the latest and arrives by the time that is handled on the day. .

  The train allocating means 33 after the last train departs after the unit time of the departure time of the departure point in the first final train data for the average route data retrieved by the average route retrieval unit 31, and travels from the departure point to the destination. To calculate transfer data. Further, the train allocating means 33 after the last train calculates the day crossing station for this transfer data, determines the train arrival station after the last train, and the second last train serving as the last train of transportation from the departure point to the train arrival station after the last train. Calculate the data. The train allocating means 33 after the last train calculates movement data including the second last train data. Here, Hitsugetsu Station is the boarding station for the next day's train.

  The last train allocation means 32 searches for trains leaving A station at 23:36 as last train data. Since the unit time is 1 minute in the best mode of the present invention, the train allocation means 33 after the last train searches for transfer data to the B station that departs from the A station after 23:37 minutes. Even if you take a train that departs from A station after 23:37 minutes, the train at A station ends at 23:36 minutes, so when you search for transfer data from A station to B station, A section that uses is generated. For example, although it is possible to move from A station to C station by a train that is handled on the same day, a search result using trains from the first train on the next day is output from C station to B station.

  Therefore, in the preferred embodiment of the present invention, the C station which is the boarding station for the next day's train is defined as the train arrival station after the last train. From station A to station C is guided by means of transportation, and from station C to station B, for example, as a means of transportation that does not depend on transportation, it is guided by taxi or on foot. In this way, the train arrival station after the last train is a station that can be moved on the same day when boarding a train that departs after the unit time from the departure time for the last train entered by the user. It is the closest station to B station.

  The process of the train allocation means 33 after the last train will be described in detail later.

  The train fee calculation means 34 reads the fare data 24a from the storage device 107, and calculates the fare of the transportation from the departure point to the train arrival station after the last train for the second last train data calculated by the train allocation means 33 after the last train. calculate. When the route search server 1 calculates the first last train data calculated by the last train allocation means 32, the transportation fee from the departure point to the destination is calculated for the first last train data. When calculating the first final train data for a plurality of average routes, or when calculating a plurality of second final train data by assigning a plurality of trains after the final train, the train fee calculating means 34 The transportation fare is calculated for the second last train data.

  The taxi fee calculating means 35 reads the taxi fee data 25a from the storage device 107, and calculates the taxi fee between the train arrival station and the destination after the last train. The taxi fare calculation means 35 extracts the fare between the train arrival station after the last train and the destination from the taxi fare data 25a for the second last train data calculated by the train assignment means 33 after the last train. The taxi fee calculating means 35 may read the route data 22a from the storage device 107, calculate the distance between the train arrival station and the destination after the last train, and calculate the taxi fee based on the calculated distance. When calculating a plurality of second last train data by assigning a plurality of trains after the last train, the taxi fare calculator 35 calculates a taxi fare for each second last train data.

  The output order calculation means 36, when assigning a plurality of trains after the last train and calculating a plurality of second train data, according to the conditions acquired by the condition acquisition means 11 such as required time priority, transfer priority, fare priority, etc. The plurality of second last train data is sorted and assigned a sort number.

  The output result by each means of the route search means 12 is stored in the result data storage unit 26 of the storage device 107 as result data 26a.

  The result presentation unit 13 reads the result data 26a from the storage device 107, forms the data into a format that can be displayed on the display device of the client terminal 2a, and transmits the data to the client terminal 2a.

(Train search method after the last train)
With reference to FIG. 7 and FIG. 8, the after-train-train assignment process by the train-ending train search means 32 and the train-after-train assignment means 33 according to the preferred embodiment of the present invention will be described.

  First, with reference to FIG. 7, an outline of the post-final train assignment process according to the preferred embodiment of the present invention will be described. As shown in FIG. 7A, the last train search means 32 searches for the last train from the departure point A station to the destination B station, and uses it as the first last train data. Here, the departure time of departure station A is TD0.

  Next, as shown in FIG. 7B, a train time from A station to B station that departs from departure station A at time T (one minute after time TD0) is assigned. Here, when a plurality of average routes are obtained by the average route search means 31, a plurality of trains are allocated as shown in FIG. At this time, the day crossing station is determined for each train allocation, and it is set as C1, C2, and C3 stations, respectively. Here, as shown in FIG. 7 (b), the Hitsugetsu station is the train of the next day when the train time from the departure point A station that departs the departure point A station to the destination B station is assigned at time T. It is a station that will be the boarding station. In other words, the Hitsugoshi station is a station that can be moved from the departure station A station by a ticket handled on the day, and is the station closest to the station B on the average route. Here, the station having the shortest distance from the destination B station is searched from among the day crossing stations C1, C2 and C3, and is set as the train arrival station after the last train. In the example shown in FIG. 7B, the station C1 is a train arrival station after the last train. By searching for the train arrival station after the last train so that the distance from the train arrival station to the destination B station after the last train is the shortest, search for the route that will most easily move from the train arrival station to the destination B station after the last train. Can do. In particular, on a route such as a ring line, it is possible to search for a route that is more convenient for the user by determining the train arrival station after the last train based on the distance rather than the number of stations to the destination and the required time.

  When the train arrival station after the last train is determined as shown in FIG. 7 (b), as shown in FIG. 7 (c), the last train allocation means 32 is provided for the section from the departure station A station to the train arrival station C1 station after the last train. By searching for the last train, the second train data is obtained. Further, a charge and time required for traveling by taxi for the section from the train arrival station C1 station to the destination B station after the last train is searched.

  With reference to FIG. 8, the post-final train assignment process according to the preferred embodiment of the present invention will be described.

  First, in step S201, a departure place is set as a variable “train arrival station after last train”. Since the station set here is a station used for the determination in step S207 described later, a dummy station that does not correspond to any station or null may be used. Furthermore, the distance between the departure point and the destination is substituted as a variable “D_min”. Any numerical value may be substituted for the variable D_min as long as it is larger than the maximum distance between the station and the destination.

  Next, in step S202, the processing from step S202 to step S206 is repeated for each of the average route data searched by the average route search means 31.

  In step S202, a train from the departure point to the destination, and departing from the departure point at time T is assigned. In step S203, a day crossing station is specified about the train allocated in step S202. Specifically, the station closest to the destination on the route that can be reached with a ticket handled on the day is assumed to be the Nikkotsu station. For example, if a certain transportation system can be reached on the same day until it gets off at 3 o'clock at night, the station that can get off at the nearest time at 3 o'clock at night is set as the Nikkotsu station.

  Next, in step S204, the distance between the station and the destination is substituted for the variable “D”. At this time, the train allocation means 33 after the last train reads the route data 22a from the storage device 107, and extracts the distance between the station and the destination. In step S205, it is determined whether or not the variable D_min is larger than the variable D. When not large, the process of step S202 thru | or step S206 is repeated about another average path | route.

  On the other hand, when the variable “D_min” is larger than the variable D, in step S206, the day-over station identified in step S203 is substituted for the variable “train arrival station after the last train”, and the train arrival after the last train is assigned to the variable “D_min”. Substitute the distance between the station and the destination. Furthermore, the process of step S202 thru | or step S206 is repeated about another average path | route.

  When the processing of step S202 to step S206 is completed for all average routes, in step S207, it is determined whether or not the variable “train arrival station after last train” is the departure place, specifically, the initial value set in step S201. It is determined whether or not it remains. In the case of the initial value, it is assumed that transfer data that can be moved by a ticket handled on the day of the train after the last train cannot be guided, and the process is terminated. On the other hand, if the variable “train arrival station after last train” is not the departure place, the last train is searched for the section from the departure place to the train arrival station after the last train in step S208, and is output as second last train data.

  As described above, according to the route search server 1 according to the best embodiment of the present invention, after searching for the last train for a predetermined section, the departure station is departed from the departure station of the departure station of the last train after a unit time. Search for the train to the destination and identify the train arrival station after the last train that will become the Higacrossing station. Therefore, it is possible to easily guide the transfer data after the last train by devising input data of a normal search engine, so that development can be easily performed.

  Furthermore, by searching for the last train from the departure point to the train arrival station after the last train, it is possible to guide a train that departs from the departure point later.

(First modification)
Next, a first modification of the present invention will be described with reference to FIGS.

  First, with reference to FIG. 9, an outline of the post-final-train assignment process according to the first modification of the present invention will be described. As shown in FIG. 9A, the last train search means 32 searches for the last train from the departure point A station to the destination B station, and uses it as the first last train data. Here, the departure time of departure station A is TD0.

  Next, as shown in FIG. 9B, a train time from A station to B station that departs from departure station A at time T (one minute after time TD0) is assigned. Here, when a plurality of average routes are obtained by the average route search means 31, a plurality of trains are allocated as shown in FIG. At this time, the day crossing station is determined for each train allocation, and it is set as C1, C2, and C3 stations, respectively. Here, the station that has the shortest distance from the destination B station is searched from among the day crossing stations C1, C2, and C3, and is set as the first train arrival station after the last train. In the example shown in FIG. 9B, the station C1 is the train arrival station after the last train. By selecting the train arrival station after the last train so that the distance from the train arrival station after the first train to the destination B station is the shortest, it is easiest to move from the train arrival station after the first train to the destination B station. Can be searched.

  As shown in FIG. 9 (b), when the train arrival station after the first train is determined, as shown in FIG. 9 (c), from the departure station A station to the first train arrival station C1 station after the last train Then, the last train is searched by the last train allocation means 32, and the second train data is obtained. Furthermore, the charge and time required for traveling by taxi for the section from the train arrival station C1 station to the destination B station after the first final train is searched. Here, the departure time of departure station A is TD1.

  Further, as shown in FIG. 9 (d), a train time from A station to B station that departs from departure station A at time T1 (one minute after time TD1) is assigned. Here, when a plurality of average routes are obtained by the average route search means 31, a plurality of trains are allocated as shown in FIG. 9 (d). At this time, the day crossing station is determined for each train allocation, and it is set as the C4 station, the C5 station, and the C6 station, respectively. Here, the station having the shortest distance from the destination B station is searched out of each day crossing station C4 station, C5 station, and C6 station, and a second train arrival station (new train arrival station after the last train) is searched. ). In the example shown in FIG. 9D, the station C4 is assumed to be a train arrival station after the second train. By selecting the train arrival station after the second train so that the distance from the train arrival station after the second train to the destination B station is the shortest, the destination B station can be moved from the train arrival station after the second train. You can search for the easiest route.

  As shown in FIG. 9 (d), when the train arrival station after the second train is determined, as shown in FIG. 9 (e), about the section from the departure station A station to the second train arrival station C4 station after the last train. Then, the last train is searched by the last train allocation means 32, and the third train data is obtained. Furthermore, the charge and time required for traveling by taxi for the section from the train arrival station C4 station after the second final train to the destination B station are searched. Here, the departure time of departure station A is TD2.

  Further, as shown in FIG. 10 (a), a train time from A station to B station that departs from departure station A at time T2 (one minute after time TD2) is assigned. Here, when a plurality of average routes are obtained by the average route search means 31, a plurality of trains are allocated as shown in FIG. At this time, a day crossing station is determined for each train allocation, and it is set as a C7 station and a C8 station, respectively. Here, the station that has the shortest distance from the destination B station is searched from among the day crossing stations C7 and C8, and is set as the train arrival station after the third train. In the example shown in FIG. 10B, the station C7 is a train arrival station after the third final train. By selecting the third post-train arrival station so that the distance from the third post-train arrival station to the destination B station is the shortest, the destination B station can be moved from the third post-train arrival station. You can search for the easiest route.

  In the example shown in FIG. 10A, in the second route from the top, there is no route that departs after the departure time T2 and can be moved from the departure point A station to the arrival point B station with a ticket handled on the day. Indicates. In this case, since the departure station A station is the Higakoshi station, the station on the route does not become the train arrival station after the last train.

  As shown in FIG. 10 (b), when the train arrival station after the third train is determined, as shown in FIG. 10 (c), the section from the departure station A station to the third train arrival station C7 station after the last train. Then, the last train is searched by the last train allocation means 32, and the fourth train data is obtained. Furthermore, the charge and time required for traveling by taxi for the section from the train arrival station C7 station after the third final train to the destination B station are searched. Here, the departure time of departure station A is TD3.

  Here, the train assignment from the A station to the B station that departs from the departure station A at time T3 (one minute after time TD3) is repeated. This train assignment is repeated until there is no route that can be moved from the departure point A station to the arrival point B station with a ticket handled on the day.

  As shown in FIG. 10 (c), when there is no route that can be moved from the departure point A station to the arrival point B station with the ticket handled on the day, as shown in FIG. 10 (d), from the departure point A station to the destination. Search for the fare and required time to travel by taxi for the section to station B.

  In the first modified example of the present invention, a plurality of trains after the last train can be presented as shown in FIG. In the screen example shown in FIG. 11, a final train route display unit 601 that displays the last train from the departure point A station to the destination B station, and a plurality of taxi use route displays that display a route using the taxi in the train after the last train. Parts 602a, 602b, 602c and 602d.

  With reference to FIG. 12, the post-final train assignment process according to the first modification of the present invention will be described.

  Steps S301 to S308 shown in FIG. 12 are the same as Steps S201 to S208 of the post-final train assignment process according to the preferred embodiment of the present invention described with reference to FIG.

  Specifically, first, in step S301, a departure place is set as a variable “train arrival station after the last train” (first train arrival station after the last train). Furthermore, the distance between the departure point and the destination is substituted as a variable “D_min”.

  Next, the processing from step S302 to step S306 is repeated for each of the average route data searched by the average route search means 31.

  In step S302, a train from the departure point to the destination and starting from the departure point at time T is assigned. In step S303, the day crossing station is specified for the train assigned in step S202. Specifically, the station closest to the destination on the route that can be reached with a ticket handled on the day is assumed to be the Nikkotsu station.

  Next, in step S304, the distance between the station and the destination is substituted for the variable “D”. At this time, the train allocation means 33 after the last train reads the route data 22a from the storage device 107, and extracts the distance between the station and the destination. In step S305, it is determined whether or not the variable D_min is larger than the variable D. If not, the process from step S302 to step S306 is repeated for the other average route.

  On the other hand, when the variable “D_min” is larger than the variable D, in step S306, the station that has passed the day specified in step S203 is substituted for the variable “train arrival station after the last train”, and the train arrival after the last train is assigned to the variable “D_min” Substitute the distance between the station and the destination. Furthermore, the process of step S302 thru | or step S306 is repeated about another average path | route.

  When the processing of steps S302 to S306 is completed for all average routes, in step S307, it is determined whether or not the variable “train arrival station after last train” is the departure place, specifically, the initial value set in step S201. It is determined whether or not it remains. In the case of the initial value, it is assumed that transfer data that can be moved by a ticket handled on the day of the train after the last train cannot be guided, and the process is terminated. On the other hand, if the variable “train arrival station after last train” is not the departure place, the last train is searched for the section from the departure place to the train arrival station after the last train in step S308, and is output as second last train data.

  Furthermore, in step S309, unit time 1 minute is added to the departure time of the departure place A station in the second final train data to calculate time T1. Next, in step S310, in order to search for a train that departs after time T1 and arrives at the destination B station from the departure place A station, a post-end train assignment process by the post-end train assignment means 33 is executed. Also in this process, when the departure place becomes the train arrival station after the last train in the departure place S307, the process is terminated.

  Thus, according to the post-end train allocation process according to the first modification of the present invention, the search for the last train data is continued until the train arrival station after the last train matches the departure place. A plurality of routes can be output after the last train. Furthermore, since the taxi use distance increases and the departure time of the departure place can be delayed, the user can select an appropriate route according to his / her situation.

(Second modification)
In the second modification, a plurality of route data after the last train can be output as in the first modification, but the calculation method is different.

  First, with reference to FIG. 13, an outline of the post-final train assignment process according to the second modification of the present invention will be described. As shown in FIG. 13A, the last train search means 32 searches for the last train from the departure point A station to the destination B station, and uses it as the first last train data. Here, the departure time of departure station A is TD0.

  Next, as shown in FIG. 13B, a train time from A station to B station that departs from departure station A at time T (one minute after time TD0) is assigned. Here, when a plurality of average routes are obtained by the average route search means 31, a plurality of trains are allocated as shown in FIG. At this time, the day crossing station is determined for each train allocation, and it is set as C1, C2, and C3 stations, respectively. Here, the station that has the shortest distance from the destination B station is searched from among the day crossing stations C1, C2, and C3, and is set as the first train arrival station after the last train. In the example shown in FIG. 13B, the station C1 is a train arrival station after the last train. By selecting the train arrival station after the last train so that the distance from the train arrival station after the first train to the destination B station is the shortest, it is easiest to move from the train arrival station after the first train to the destination B station. Can be searched.

  When the train arrival station after the first train is determined as shown in FIG. 13 (b), as shown in FIG. 13 (c), the section from the departure station A station to the first train arrival station C1 station after the last train is reached. Then, the last train is searched by the last train allocation means 32, and the second train data is obtained. Furthermore, the charge and time required for traveling by taxi for the section from the train arrival station C1 station to the destination B station after the first final train is searched. Here, the departure time of departure station A is TD_C1.

  Further, as shown in FIG. 13 (d), a train time is assigned from the A station that departs from the departure place A station at time T1 (one minute after the time TD_C1) to the first train arrival station C1 station after the last train. Here, when a plurality of average routes are obtained by the average route search means 31, a plurality of trains are allocated as shown in FIG. 9 (d). At this time, the day crossing station is determined for each train allocation, and it is set as the C4 station and the C5 station, respectively. Here, the station that has the shortest distance from the destination B station is searched for among the day surpassing stations C4 and C5, and the C2 and C3 stations calculated in FIG. It will be the train arrival station. In the example shown in FIG. 13 (d), the station C2 is the train arrival station after the second train. By selecting the train arrival station after the second train so that the distance from the train arrival station after the second train to the destination B station is the shortest, the destination B station can be moved from the train arrival station after the second train. You can search for the easiest route.

  As shown in FIG. 13 (d), when the train arrival station after the second train is determined, as shown in FIG. 13 (e), the section from the departure station A station to the second train arrival station C2 station after the last train. Then, the last train is searched by the last train allocation means 32, and the third train data is obtained. Furthermore, the charge and time required for traveling by taxi for the section from the train arrival station C2 station after the second final train to the destination B station are searched. Here, the departure time of departure station A is TD_C2.

  Furthermore, as shown to Fig.14 (a), the train time from the A station which leaves the departure place A station at the time T2 (1 minute after the time TD_C2) to the 2nd train arrival station C2 station after the last train is allocated. Here, when a plurality of average routes are obtained by the average route search means 31, a plurality of trains are allocated. At this time, the Hoshiketsu station is determined for each train allocation. Here, the station that has the shortest distance from the destination B station is searched for among the Hikago station C6 station and the already calculated Higagoe stations C3, C4, and C5. To do. In the example shown in FIG. 14B, the station C4 is the train arrival station after the third train. By selecting the third post-train arrival station so that the distance from the third post-train arrival station to the destination B station is the shortest, the destination B station can be moved from the third post-train arrival station. You can search for the easiest route.

  As shown in FIG. 14 (b), when the train arrival station after the third train is determined, as shown in FIG. 14 (c), from the departure station A station to the third train arrival station C4 station after the last train. Then, the last train is searched by the last train allocation means 32, and the fourth train data is obtained. Furthermore, the charge and time required for moving by taxi for the section from the train arrival station C4 after the third final train to the destination B station are searched. Here, the departure time of departure station A is TD_C4.

  Here, of the four routes shown in FIG. 14 (a), the upper two are the routes calculated in FIG. 13 (d), and the bottom is calculated in FIG. 13 (b). Route. In this way, the data of the day crossing station calculated in each processing step is taken over, and the process is repeated until all final trains between the departure point A station and the destination B station are finally assigned.

  As shown in FIG. 14 (c), when there is no route that can be moved from the departure point A station to the arrival point B station with a ticket handled on the day, as shown in FIG. 14 (d), from the departure point A station to the destination. Search for the fare and required time to travel by taxi for the section to station B.

  In such a second modification of the present invention, since all the last trains between the departure point A station and the destination B station are searched, more routes can be presented to the user.

  Next, with reference to FIG. 15 and FIG. 16, the post-end train allocation process according to the second modification of the present invention will be described.

  First, in step S301 shown in FIG. 15, a destination is set as a variable “train arrival station after last train” (first train arrival station after train last). Further, the variable “arrival candidate station list” is initialized. In this arrival candidate station list, the day crossing station located on each route from the departure point to the destination is inserted. Until this arrival candidate station list becomes empty, the processing from step S402 to step S407 is repeated.

  Next, in step S402, a day crossing station search process is executed. As a result, if there is a station that passes through the day, the station that passes through the station is inserted into the list of candidate stations for arrival. This process will be described in detail later.

  In step S403, it is searched whether the arrival candidate station list is empty. If the arrival candidate station list is empty, the process is terminated. If the arrival candidate station is inserted in the arrival candidate station list, in step S404, the station having the shortest distance from the destination is extracted and deleted from the stations in the arrival candidate station list. Further, in step S405, the station extracted in step S404 is inserted into the train arrival station after the last train.

  In step S406, the last train is searched for the section between the departure point and the train arrival station after the last train. In step S407, the time T is calculated by adding the unit time to the departure time at the last departure point calculated in step S406.

  If the process of step S402 thru | or step S407 is repeated until the arrival candidate station list becomes empty, a train allocation process will be complete | finished after the last train.

  Next, with reference to FIG. 16, the day crossing station search process corresponding to step S402 in FIG. 15 will be described. In the day crossing station search process, the processes in steps S451 to S454 are repeated for all average routes calculated by the average route search means 31.

  First, in step S451, the train at the train arrival station after the last train is assigned from the departure place that departs from the departure place at time T. In step S452, the day crossing station is specified for the train assigned in step S451.

  In step S453, it is determined whether or not the departure station is the same as the day pass station. If they are the same, the process of step S451 is executed for the other average paths. On the other hand, if the departure point is different from the day crossing station, in step S454, the day crossing station specified in step S452 is added to the arrival candidate station list, and the process of step S451 is executed for other average routes.

  As described above, according to the post-last train allocation process according to the second modification of the present invention, since all the stations that have passed through the train from the departure point to the destination can be extracted, Many trains can be assigned after the last train.

(Third Modification)
Next, a third modification of the present invention will be described with reference to FIGS.

  First, with reference to FIG. 17, an outline of the post-final train assignment process according to the first modification of the present invention will be described. As shown in FIG. 17A, the last train search means 32 searches for the last train from the departure point A station to the destination B station, and uses it as the first last train data. Here, the departure time of departure station A is TD0.

  Next, as shown in FIG. 17B, a train time from A station to B station that departs from departure station A at time T (one minute after time TD0) is assigned. At this time, the day crossing station is determined with respect to the train allocation, and it is set as C station. If a day crossing station is determined for each of a plurality of routes, the day crossing station that is closest to the destination B station is set as the train arrival station after the first train. By selecting the train arrival station after the last train so that the distance from the train arrival station after the first train to the destination B station is the shortest, it is easiest to move from the train arrival station after the first train to the destination B station. Can be searched.

  As shown in FIG. 17 (b), when the train arrival station after the first train is determined, as shown in FIG. 17 (c), from the departure station A station to the first train arrival station C station after the last train. Then, the last train is searched by the last train allocation means 32, and the second train data is obtained. Furthermore, the charge and time required for traveling by taxi for the section from the train arrival station C station to the destination B station after the first final train is searched. Here, the departure time of departure station A is TD1.

  Further, as shown in FIG. 17 (d), a train time from A station to C station that departs from departure station A at time T1 (one minute after time TD1) is assigned. At this time, the day crossing station is determined with respect to the train allocation, and it is set as D station. Here, when the day crossing station is determined for each of the plurality of routes, the day crossing station that is closest to the station C of the first train arrival station after that is the second post-train arrival station.

  As shown in FIG. 17 (d), when the train arrival station after the second train is determined, as shown in FIG. 17 (e), the section from the departure station A station to the second train arrival station D station after the last train is reached. Then, the last train is searched by the last train allocation means 32, and the third train data is obtained. Furthermore, the charge and time required for traveling by taxi for the section from the train arrival station D station to the destination B station after the second final train is searched. Here, the departure time of departure station A is TD2.

  Furthermore, as shown in FIG. 17 (f), the train time from station A to station D, which departs from departure station A at time T2 (one minute after time TD2), is assigned, and FIG. 17 (d) and FIG. The same processing as (e) is repeated until the train arrival station and the departure place match after the last train.

  When there is no route that can be moved from the departure point A station to the arrival point B station with a ticket handled on the day, as shown in FIG. 17 (g), the section from the departure point A station to the destination B station is moved by taxi. Search for rates and time required.

  In such a third modification of the present invention, the process is repeated with the train arrival station as the destination after the last train.

  With reference to FIG. 18, the post-final train assignment process according to the third modification of the present invention will be described.

  Steps S501 to S509 shown in FIG. 18 are the same as steps S301 to S309 of the post-final train assignment process according to the first modification of the present invention described with reference to FIG.

  In step S510, in order to search for a train that departs after time T1 and arrives at the train arrival station from the departure station A after the last train, a train assignment process after the last train is executed by the train assignment unit 33 after the last train. Also in this process, when the departure place becomes the train arrival station after the last train in the departure place S507, the process ends.

  In the second modification of the present invention, the last train between the departure point and the destination is searched in step S310 in FIG. On the other hand, in the third modification of the present invention, in step S510 in FIG. 18, the last train between the departure station and the train arrival station after the last train is searched.

(Other embodiments)
As described above, the best embodiment of the present invention and the first to third modifications have been described. However, it should be understood that the description and drawings constituting a part of this disclosure limit the present invention. is not. From this disclosure, various alternative embodiments, examples, and operational techniques will be apparent to those skilled in the art.

  For example, the route search server 1 described in the best mode of the present invention may be configured on one piece of hardware as shown in FIG. 1, or a plurality of pieces of hardware depending on the functions and the number of processes. It may be configured above.

  It goes without saying that the present invention includes various embodiments not described herein. Therefore, the technical scope of the present invention is defined only by the invention specifying matters according to the scope of claims reasonable from the above description.

It is a figure explaining the system configuration | structure of the route search system which concerns on the best embodiment of this invention, and the functional block of a route search server. It is a hardware block diagram of the route search server which concerns on the best embodiment of this invention. It is a flowchart explaining the outline | summary of the route search process by the route search server which concerns on best embodiment of this invention. It is a figure explaining an example of the network in the route search process which concerns on the best embodiment of this invention. It is a figure explaining an example of the clique-formed network in the route search process which concerns on best embodiment of this invention. It is a flowchart explaining the average route search process by the average route search means of the route search means according to the preferred embodiment of the present invention. It is a figure explaining the outline | summary of the train allocation process after the last train by the train allocation means after the last train of the route search means concerning the best embodiment of the present invention. It is a flowchart explaining the train allocation process after the last train by the train allocation means after the last train of the route search means according to the preferred embodiment of the present invention. It is a figure explaining the outline | summary of the train allocation process after the last train by the train allocation means after the last train of the route search means concerning the 1st modification of this invention. (Part 1) It is a figure explaining the outline | summary of the train allocation process after the last train by the train allocation means after the last train of the route search means concerning the 1st modification of this invention. (Part 2) The route search server according to the preferred embodiment of the present invention is an example of a screen that displays search results. It is a flowchart explaining the train allocation process after the last train by the train allocation means after the last train of the route search means according to the first modification of the present invention. It is a figure explaining the outline | summary of the train assignment process after the last train by the train assignment means after train lasts of the route search means concerning the 2nd modification of this invention. (Part 1) It is a figure explaining the outline | summary of the train assignment process after the last train by the train assignment means after train lasts of the route search means concerning the 2nd modification of this invention. (Part 2) It is a flowchart explaining the train allocation process after the last train by the train allocation means after the last train of the route search means according to the second modification of the present invention. It is a flowchart explaining the day crossing station search process by the train allocation means after the last train of the route search means which concerns on the 2nd modification of this invention. It is a figure explaining the outline | summary of the train allocation process after the last train by the train allocation means after the last train of the route search means concerning the 3rd modification of this invention. It is a flowchart explaining the day crossing station search process by the train allocation means after the last train of the route search means which concerns on the 3rd modification of this invention. A general route search server is an example of a screen that displays search results.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 Route search server 2 Client terminal 3 Communication network 11 Condition acquisition means 12 Route search means 13 Result presentation means 21 Search condition data storage part 22 Route data storage part 23 Timetable data storage part 24 Fare data storage part 25 Taxi fare data storage part 26 Result data storage unit 31 Average route search means 32 Last train assignment means 33 Train assignment means after train last train 34 Train charge calculation means 35 Taxi charge calculation means 36 Output order calculation means 101 Central processing control device 102 ROM
103 RAM
104 Input Device 105 Display Device 106 Communication Control Device 107, 30 Storage Device 108 Removable Disk 109 Input / Output Interface 110 Bus

Claims (12)

A route search server that searches for travel data from a departure place to a destination, and searches for travel data after the last train using transportation that operates according to a timetable,
Route data storage means for storing route data in which a route of transportation and a station of the route are associated in a storage device;
Condition acquisition means for acquiring the transfer condition;
Average route search means for reading out the route data from the storage device and searching for and outputting average route data in accordance with the conditions acquired by the condition acquisition means;
Based on the average route data, a final train allocation means for calculating first final train data that is a final train of the transportation from the departure place to the destination;
For the average route data searched by the average route search means, a train that departs after a unit time of the departure time of the departure place in the first final train data, and moves from the departure place to the destination is assigned and transferred. Calculating the data, and calculating the day transit station that will be the next train station for the transfer data, determining the train arrival station after the last train, and the transportation from the departure point to the train arrival station after the last train 2nd last train data to be the last train of the train, and train allocating means after the last train to calculate movement data including the second train last data,
A route search server comprising: result presentation means for outputting the movement data. Taxi fare data storage means for storing, in the storage device, taxi fare data associated with taxi fare between stations of the transportation facility;
It further comprises taxi fare calculation means for reading the taxi fare data from the storage device and calculating taxi fare between the train arrival station after the last train and the destination,
The route search server according to claim 1, wherein the movement data includes the taxi fare calculated by the taxi fare calculation means. The average route search means further stores a distance between stations on the route,
When the average route search means calculates a plurality of average route data,
The train allocating unit after the last train calculates the transfer data and the day transit station for all the average route data calculated by the average route retrieval unit, and selects the day transit station having the smallest distance from the destination after the train last train. The route search server according to claim 1, wherein the route search server is a train arrival station. The train allocating means after the last train is further
New transfer data that starts after the unit time of the departure time of the departure point in the second last train data and moves from the departure point to the destination is calculated, and a new date for the new transfer data is calculated. A crossing station is calculated to determine a new train arrival station after the last train, and a third train last data to be the last train of the transportation from the departure point to the new train arrival station after the last train is calculated. 2. The route search server according to claim 1, wherein new movement data including the last train data is calculated. The route search server according to claim 4, wherein the train allocating unit after the last train repeats the process of calculating the new movement data until the new train arrival station after the last train is the departure place. The taxi fare calculation means further calculates a new taxi fare between the new train arrival station and the destination after the last train,
The route search server according to claim 4 or 5, wherein the new movement data includes the new taxi fare calculated by the taxi fare calculation means. It is a route search program that searches for travel data from the departure point to the destination and after the last train using transportation that operates according to the timetable,
Route data storage means for storing route data in which a route of transportation and a station of the route are associated in a storage device;
Condition acquisition means for acquiring the transfer condition;
Average route search means for reading out the route data from the storage device and searching for and outputting average route data in accordance with the conditions acquired by the condition acquisition means;
Based on the average route data, a final train allocation means for calculating first final train data that is a final train of the transportation from the departure place to the destination;
For the average route data searched by the average route search means, a train that departs after a unit time of the departure time of the departure place in the first final train data, and moves from the departure place to the destination is assigned and transferred. Calculating the data, and calculating the day transit station that will be the next train station for the transfer data, determining the train arrival station after the last train, and the transportation from the departure point to the train arrival station after the last train 2nd last train data to be the last train of the train, and train allocating means after the last train to calculate movement data including the second train last data,
A route search program for causing a computer to function as result presentation means for outputting the movement data. Taxi fare data storage means for storing, in the storage device, taxi fare data associated with taxi fare between stations of the transportation facility;
Reading the taxi fare data from the storage device, further causing the computer to function as taxi fare calculation means for calculating taxi fare between the train arrival station after the last train and the destination,
The route search program according to claim 7, wherein the movement data includes the taxi fare calculated by the taxi fare calculation means. The average route search means further stores a distance between stations on the route,
When the average route search means calculates a plurality of average route data,
The train allocating unit after the last train calculates the transfer data and the day transit station for all the average route data calculated by the average route retrieval unit, and selects the day transit station having the smallest distance from the destination after the train last train. The route search program according to claim 7, wherein the route arrival program is a train arrival station. The train allocating means after the last train is further
New transfer data that starts after the unit time of the departure time of the departure point in the second last train data and moves from the departure point to the destination is calculated, and a new date for the new transfer data is calculated. A crossing station is calculated to determine a new train arrival station after the last train, and a third train last data to be the last train of the transportation from the departure point to the new train arrival station after the last train is calculated. The route search program according to claim 7, wherein new travel data including the last train data is calculated. The route search program according to claim 10, wherein the after-train-ending train assignment unit repeats the process of calculating the new movement data until the new after-train-ending train arrival station becomes the departure place. The taxi fare calculation means further calculates a new taxi fare between the new train arrival station and the destination after the last train,
The route search program according to claim 10 or 11, wherein the new movement data includes the new taxi fare calculated by the taxi fare calculation means.

Images