JP2009051293A - Path searching server and path searching program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To output supplementary path data advantageous to a user. <P>SOLUTION: A searching server is equipped with a path searching means 12 which searches output path data, and outputs the data according to a condition acquired by a condition acquisition means 11, a condition change means 13 which searches a supplementary path candidate data, and outputs the data according to a new condition, a supplementary path extracting means 14 for extracting supplementary path data including a predominant evaluation parameter compared to the output path data for each evaluation parameter, an abstract information generation means 15 which reads abstract information matrix data and acquires the abstract information data correlated to the result in which the output path data are compared with the supplementary path data for each evaluation parameter, and a result presentation means 16 which outputs the output path data, the supplementary path data and abstract information. <P>COPYRIGHT: (C)2009,JPO&INPIT

Description

  The present invention relates to a route search server and a route search program for outputting output route data obtained by searching for transfer of a transportation facility from a departure place to a destination under predetermined conditions.

  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 that can provide optimal transfer information to the user has been proposed.

  On the other hand, with the recent development of transportation systems, transportation systems are becoming more complex, especially in urban areas.

  Therefore, for example, in the display of transfer information, there is one that displays a station between the boarding station and the getting-off station (see Patent Document 1). In general, in the display of transfer information, only the boarding station, the getting-off station, and the transferring station are displayed. However, in the method described in Patent Document 1, a station located between the boarding station and the getting-off station of the transportation facility. Or only stations in a predetermined section designated by the user can be displayed.

In addition, as the transportation facilities become more complicated, there are cases where a plurality of routes are listed as search results in the transportation switching method for a predetermined section. In addition, since each transportation system operates a plurality of types of trains such as train stops at each station and rapid trains, a plurality of trains may be considered along the same route of the same transportation system. The user selects and uses the optimum one of the plurality of transfers output by the route search server.
JP 2004-262446 A

  However, the optimal transfer when the transportation system is complicated differs depending on individual circumstances. For example, it is better that the number of times of transfer is small even if the required time is longer, or if you want to get on an express even if you run at the time of transfer.

  In the route search service, it is necessary to provide a transfer guidance service to a plurality of users. Therefore, it is necessary to provide a route that seems to be optimal on average under predetermined conditions designated by the user. Therefore, when the user searches for a transfer more suitable for his / her preference, the user himself / herself has to change the conditions and search repeatedly.

  In addition, even if a search is performed under different conditions, the merits and demerits of the search results have to be determined by themselves. Furthermore, if the search is repeated with one browser, it is not possible to compare new search results while checking the previous search results. Moreover, although it can also be displayed on a plurality of browsers, it is necessary to start the browser every time the search is performed by changing the conditions, which complicates the user.

  Patent Document 1 is effective in that it makes it possible to visually recognize the position of the getting-off station, the boarding time, etc., even if the transportation becomes complicated. However, it is not considered sufficient to provide a transfer suitable for the individual user.

  Accordingly, an object of the present invention is to provide a route search server and a route search program for outputting supplementary route data that is advantageous to the user when outputting route data searched under a predetermined condition input by the user.

  In order to solve the above-mentioned problem, the first feature of the present invention is that output route data obtained by searching for transfer of transportation from a departure place to a destination under a predetermined condition, and a new condition different from the predetermined condition The present invention relates to a route search server that outputs supplemental route data obtained by searching for transportation changes from a departure point to a destination. That is, the route search server according to the first feature of the present invention includes route data storage 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, an evaluation parameter, and an evaluation parameter. Summary information matrix data storage means for storing summary information matrix data in which the result of comparing output route data and supplementary route data and summary information data, which is information summarizing the results, are associated with each other, and transfer conditions A condition acquisition means for acquiring the route, a route search means for reading out the route data from the storage device, searching for the output route data according to the condition acquired by the condition acquisition means, and a transfer condition acquired by the condition acquisition means Condition change means for searching for and outputting supplemental route candidate data in accordance with new conditions different from Complementary route extraction means for extracting supplementary route data including a superior evaluation parameter compared to output route data for each evaluation parameter from the supplementary route candidate data, and reading summary information matrix data from the storage device, for each evaluation parameter, Summary information generating means for obtaining summary information data associated with the result of comparison between the output route data searched by the route search means and the supplementary route data extracted by the supplementary route extraction means, and by the route search means A result presentation unit that outputs the retrieved output route data, the supplemental route data extracted by the supplemental route extraction unit, and the summary information acquired by the summary information generation unit;

  Here, the summary information data of the summary information matrix data includes information regarding parameters in which the supplementary route data is superior to the output route data, and the summary information data of the summary information matrix data is a search for retrieving supplementary route data. It may be set for each condition.

  In addition, the predetermined condition is any one of departure time designation, arrival time designation, required time priority, transfer frequency priority, and fare priority, and the new condition is different from the predetermined condition and the departure time designation. , Arrival time designation, required time priority, transfer frequency priority, and fare priority may be used.

  Further, the evaluation parameter of the summary information matrix data is any one or more of departure time, arrival time, required time, number of transfers, and fare, and the summary information generation means uses the route search means for each of the evaluation parameters. The value in the retrieved output route data may be compared with the value in the supplementary route data extracted by the supplementary route extraction means.

  A timetable data storage means for storing timetable data of trains on the route of the transportation system in a storage device may be further provided. In this case, the route search means further reads timetable data from the storage device, assigns the time of transportation to the output route data searched by the route search means, and the time of the transportation and the required time in the output route data. The condition changing means further reads the timetable data from the storage device, assigns the time of transportation to the supplementary route candidate data searched by the condition changing means, and sets the time of the transportation and the supplementary route candidate data. The supplementary route extraction means is further superior in any one or more of the departure time, arrival time and required time from the supplementary route candidate data to the output route data output by the route search means. Extract supplementary route data.

  The route search means further outputs the number of transfers in the output route data searched for by the route search means, and the condition change means further outputs the number of transfers in the supplementary route candidate data searched by the condition change means for supplementary route extraction. The means may further extract supplementary route data that is superior in number of transfers compared to the output route data output by the route search means from the supplementary route candidate data.

  You may further provide the fare data storage means which memorize | stores the fare data of the route | route of a transportation system in a memory | storage device. In this case, the route search means further reads the fare data from the storage device, calculates and outputs the fare of the output route data searched by the route search means, and the condition change means further reads the timetable data from the storage device. The fare of the supplementary route candidate data searched by the condition changing means is calculated and output, and the supplementary route extraction means is superior in fare compared to the output route data output by the route search means from the supplementary route candidate data. Extract supplementary route data.

  The route search program according to the second feature of the present invention is based on output route data obtained by searching for a transfer of transportation from a departure place to a destination under a predetermined condition, and with a new condition different from the predetermined condition. The supplementary route data searched for the transfer of transportation from the ground to the destination is output. That is, the route search program according to the second feature of the present invention is a route data storage means for storing route data in which a route of a transportation facility and a route station are associated in a storage device, an evaluation parameter, and an evaluation parameter. Summary information matrix data storage means for storing summary information matrix data in which the result of comparing output route data and supplementary route data and summary information data, which is information summarizing the results, are associated with each other, and transfer conditions A condition acquisition means for acquiring the route, a route search means for reading out the route data from the storage device, searching for the output route data according to the condition acquired by the condition acquisition means, and a transfer condition acquired by the condition acquisition means Condition change means for searching for and outputting supplemental route candidate data according to new conditions different from the above and output by the condition change means The supplementary route extraction means for extracting supplementary route data including a superior evaluation parameter compared to the output route data for each evaluation parameter from the supplementary route candidate data, and the summary information matrix data is read from the storage device for each evaluation parameter. A summary information generating means for obtaining summary information data associated with the result of comparing the output route data searched for by the route search means and the supplementary route data extracted by the supplementary route extracting means; and a route search Causing the computer to function as output route data retrieved by the means, supplementary route data extracted by the supplementary route extracting means, and summary information acquired by the summary information generating means.

  Here, the summary information data of the summary information matrix data includes information regarding parameters in which the supplementary route data is superior to the output route data, and the summary information data of the summary information matrix data is a search for retrieving supplementary route data. It may be set for each condition.

  In addition, the predetermined condition is any one of departure time designation, arrival time designation, required time priority, transfer frequency priority, and fare priority, and the new condition is different from the predetermined condition and the departure time designation. , Arrival time designation, required time priority, transfer frequency priority, and fare priority may be used.

  Further, the evaluation parameter of the summary information matrix data is any one or more of departure time, arrival time, required time, number of transfers, and fare, and the summary information generation means uses the route search means for each of the evaluation parameters. The value in the retrieved output route data may be compared with the value in the supplementary route data extracted by the supplementary route extraction means.

  You may make a computer function further the timetable data storage means which memorize | stores the timetable data of the train of the route of a transportation system in a memory | storage device. In this case, the route search means further reads timetable data from the storage device, assigns the time of transportation to the output route data searched by the route search means, and the time of the transportation and the required time in the output route data. The condition changing means further reads the timetable data from the storage device, assigns the time of transportation to the supplementary route candidate data searched by the condition changing means, and sets the time of the transportation and the supplementary route candidate data. The supplementary route extraction means is further superior in any one or more of the departure time, arrival time and required time from the supplementary route candidate data to the output route data output by the route search means. Extract supplementary route data.

  The route search means further outputs the number of transfers in the output route data searched for by the route search means, and the condition change means further outputs the number of transfers in the supplementary route candidate data searched by the condition change means for supplementary route extraction. The means may further extract supplementary route data that is superior in number of transfers compared to the output route data output by the route search means from the supplementary route candidate data.

  The fare data storage means for storing the fare data of the route of the transportation facility in the storage device may be further caused to function in the computer. In this case, the route search means further reads the fare data from the storage device, calculates and outputs the fare of the output route data searched by the route search means, and the condition change means further reads the timetable data from the storage device. The fare of the supplementary route candidate data searched by the condition changing means is calculated and output, and the supplementary route extraction means is superior in fare compared to the output route data output by the route search means from the supplementary route candidate data. Extract supplementary route data.

  According to the present invention, it is possible to provide a route search server and a route search program for outputting supplementary route data that is advantageous to the user when outputting route data searched under a predetermined condition input by the user.

  Next, embodiments 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.

(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 uses the output route data obtained by searching for the transfer of the transportation from the departure point to the destination under a predetermined condition, and the transportation from the departure point to the destination under a new condition different from the predetermined condition. The supplementary route data searched for the transfer of is output. Here, the predetermined condition is input by a user operation from client terminals 2a, 2b, 2c... Such as a desktop computer or a mobile phone operated by the user. Specifically, the specified conditions are the departure time designation that specifies the time to depart from the departure place, the arrival time designation that designates the arrival time at the destination, priority on the required time, priority on the number of transfers, priority on the fare, For example, the priority is now on trains that give priority to riding. The output route data and supplementary route data output by the route search server 1 are displayed on the display screen of the electronic device operated by the user.

  The supplementary route data output by the route search server 1 includes the following route data, for example.

(1) A route that departs (arrives) within N minutes before (after) the time specified as the departure (arrival) time, and is advantageous in terms of the number of transfers, required time, and charges. (For example, when the user specifies 10:00 departure, the search is re-searched on condition of 9:50 departure)
(2) A route that is not in time when walking at an average speed, but is advantageous in terms of the number of transfers, time required, and fees, etc.
(3) A route that can be boarded by moving in consideration of the boarding / exiting position of the train car and shortening the time required for transfer, and is advantageous in terms of the number of transfers, required time, and charges.
(4) A route that is advantageous in terms of conditions (number of transfers, charges, required time) that the user does not designate as priority conditions.

  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. A browser, predetermined software, and the like are 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 processes to be 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. The display device 105 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 an input signal or an output signal.

  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 best mode of the present invention stores a route search program, a route data storage unit 21, a timetable data storage unit 22, a fare data storage unit 23, and a summary. An information matrix data storage unit 24, a search condition data storage unit 31, an output route data storage unit 32, a supplementary route candidate data storage unit 33, a supplemental route data storage unit 34, and a summary information data storage unit 35 are provided. In addition, the route search program is read and executed by the central processing control device 101 of the route search server 1, so that the condition acquisition unit 11, the route search unit 12, the condition change unit 13, the supplemental route extraction unit 14, and the summary information generation unit 15 and result presentation means 16 are implemented in the route search server 1.

  The route data storage unit 21 stores route data in which a route for transportation and a station of the route are associated with each other. The timetable data storage unit 22 stores timetable data of trains on the route of transportation. The timetable data is preferably stored for each transportation facility, route station, and train type. The fare data storage unit 23 stores fare data for transportation routes. The fare data is preferably stored for each distance of transportation. The route data, the timetable data, and the fare data are information that a general route search server has, and may have any configuration as long as the route search is possible.

  The summary information matrix data storage unit 24 includes summary information matrix data in which the evaluation parameter, the result of comparing the output route data and the supplementary route data with the evaluation parameter, and the summary information data, which is information summarizing the result, are associated with each other. It is remembered. Here, the evaluation parameters are departure time, arrival time, required time, number of transfers, fare, and the like.

  The summary information matrix data in the summary information matrix data storage unit 24 includes an example of the data structure and data shown in FIG. The summary information matrix data is displayed for each of the results of comparing the output route data and the supplementary route data for each of the evaluation parameters such as “departure time”, “arrival time”, “number of transfers”, etc. Summary information such as “arrives early when you get on!” Is associated. This summary information may be provided for each new search condition that is changed by the condition changing unit 13 in order to search for a supplementary route. The summary information may include summary information expressed by a small number of characters and detailed information expressed in detail.

  For example, for the evaluation parameter “departure time”, when the departure time in the supplemental route data is later than the departure time in the output route data, the evaluation result of the evaluation parameter “departure time” is “late”. For the evaluation parameter “arrival time”, when the arrival time in the supplemental route data is earlier than the arrival time in the output route data, the evaluation result of the evaluation parameter “arrival time” is “early”. For the evaluation parameter “number of transfers”, when the number of transfers in the supplemental route data is larger than the number of transfers in the evaluation parameter output route data, the evaluation result of the evaluation parameter “number of transfers” is “large”. In the example shown in FIG. 3, if the comparison result between the output route data and the supplemental route data is as described above, and the search condition input by the user is “time priority”, the summary information “ "Early arrival!"

  Depending on the comparison result, the summary information of the summary information matrix data includes, in addition to those described above, “Short transfer time and same arrival time”, “High cost but early arrival, few transfer times”, “Hurry ”If you take care of the boarding position, the number of transfers will be low”, “If you leave early 5 minutes, you can get on the first train”, “Even if you take the current train, you will arrive at the same time”, etc. There is.

  The search condition data storage unit 31 stores search condition data. Search condition data is ideal for users who decide conditions such as departure station, arrival station, transit station, and departure time, desired arrival time, time priority, transfer priority, fare priority, and current train priority. A search condition for outputting a simple route is included. The user must input the departure station and the arrival station, and further output a route that is optimal for the user such as a transit station, departure time, desired arrival time, time priority, transfer priority, fare priority, and current train priority. Search conditions can be entered.

  The output route data storage unit 32 stores the output route data searched by the route search means 12 based on the search conditions stored in the search condition data storage unit 31.

  The supplemental route candidate data storage unit 33 stores supplemental route candidate data searched according to the search condition change data changed by the condition changing unit 13 based on the search condition data in the search condition data storage unit 31. Compared with the search condition data in the search condition data storage unit 31, the search condition change data has the same conditions for determining routes such as departure station, arrival station, and transit station, and outputs the optimum route to the user. Only the search conditions are different. Supplementary route candidate data is output for each condition of the search condition change data. The supplementary route candidate data storage unit 33 preferably stores supplementary route candidate data for each condition changed by the condition changing unit 13 described later.

  The supplementary route data storage unit 34 has an advantage over the output route data stored in the output route data storage unit 32 among the supplementary route candidate data stored in the supplementary route candidate data storage unit 33. Supplementary route data is stored.

  The summary information data storage unit 35 stores summary information data generated by the summary information generation unit 15.

  Search condition data stored in the search condition data storage unit 31, output route data stored in the output route data storage unit 32, supplementary route candidate data stored in the supplemental route candidate data storage unit 33, supplementary route data storage unit 34 The supplementary route data stored in the summary information data and the summary information data stored in the summary information data storage unit 3 are temporary data in the processing of the route search server according to the preferred embodiment of the present invention. The data may be stored in the RAM 103 and erased as necessary.

  Next, with reference to FIG. 4, the 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 routes such as departure station, arrival station, and transit station, departure time, desired arrival time, priority on required time, priority on number of transfers, priority on fare, priority on current train, user Includes a condition for outputting an optimum route. Here, it is assumed that the departure station is “K station”, the arrival station is “M station”, and a condition for obtaining a route that prioritizes the required time is input as a route that leaves the departure station at 9:00 am.

  Next, in steps S2 to S5, processing for calculating output path data is performed. Specifically, in step S2, an average route from K station to M station is searched. Here, the average route is route data that may meet the conditions input by the user. In this average route, 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, a train that leaves K station after 9 am is assigned with reference to the train timetable data and the like. Refer to the fare data and calculate the fare. Further, in step S5, route data that best matches the search condition input by the user is output as output route data for the processing results in steps S2 to S4. Here, since the user is searching for the route with “priority required”, in step S5, the route data is output with priority from the shortest required time. One or more route data may be output in step S5.

  Next, when the supplementary route is output in step S6, the search condition is changed in step S7. The search condition to be changed here is not a condition for determining a route among the search conditions described above, but a condition for outputting a route optimal for the user. For example, when the user inputs “Required time priority” as a condition, the condition is changed to a condition other than the required time priority in Step S7. Specifically, it is changed to any one of conditions such as departure time change, arrival time change, transfer frequency priority, fare priority, and current train priority.

  When the search condition is changed in step S7, the processes of step S3 and step S4 are executed according to the changed search condition, a train is assigned to the route determined in step S2, and the fare is calculated. . At this time, for example, when the departure time is specified, a time slightly earlier than the departure time is set and supplemental route candidate data is output. When outputting supplemental route candidate data, step S5 is skipped and the process proceeds to step S7.

  In step S7, the supplementary route candidate data that has been route-searched under conditions other than the search condition input by the user is stored in the supplementary route candidate data storage unit 33, and the process proceeds from step S6 to step S8. When the train assignment and the fare are calculated according to the search conditions changed in step S7 for the average route output in step S2, in step S8, compared with the output route data calculated under the conditions specified by the user, Routes that do not meet the conditions specified by the user but have advantages in terms of departure time, arrival items, number of transfers, required time, fare, etc. are extracted from the supplementary route candidate data in the supplementary route candidate data storage unit 33. Then, it is stored in the supplemental route data storage unit 34 as supplemental route data. In step S9, summary information is generated with reference to the summary information matrix data in the summary information matrix data storage unit 24.

  Finally, in step S10, the output route data output in step S5, the supplementary route data output in step S8, and the corresponding reservation information are output to the client terminal 2a and the like.

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

  The condition acquisition unit 11 acquires a transfer condition. The condition acquisition unit 11 stores the search condition 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 31. This search condition data includes conditions for determining the route such as departure station, arrival station, transit station, etc., departure time, desired arrival time, time priority, transfer priority, fare priority, current train priority, Conditions for outputting the optimum route are included.

  The route search unit 12 reads the route data from the storage device 107, searches for the output route data according to the search condition data acquired by the condition acquisition unit 11, and outputs the output route data. The output route data output here is data that best matches the search condition input by the user.

  Here, the route search means 12 further reads out the timetable data from the storage device 107, assigns the train time of the transportation facility to the output route data retrieved by the route search means 12, and sets the transportation time and the output route. Output the required time in the data. The route search means 12 further outputs the number of transfers in the output route data searched by the route search means 12. The route search means 12 further reads the fare data from the storage device 107, calculates the fare of the output route data searched by the route search means 12, and outputs it.

  Here, an example of processing of the route search means 12 will be described in detail.

  With regard to the route search method according to the embodiment of the present invention, a network composed of a plurality of “nodes” and “arcs” connecting the nodes will be described first. 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, 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. 6, the area between the X station and the Y station is indicated by a dashed 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. 6 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. 6, 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 is provided with 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 according to the preferred embodiment of the present invention will be described with reference to FIG.

  First, as a premise for performing 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.

  Next, in step S107, time allocation is performed for each of the first to K routes while checking the timetable, and in step S108, a fee is calculated. Based on the priority criteria such as the required time among the first to K routes to which the time and the fee are assigned, a plurality of higher-order routes are selected and stored in the output route data storage unit 32 as output route data. When selecting a plurality of higher-order routes, the routes are selected in a well-balanced manner from the routes obtained using the networks A, A2, A1, and A0.

  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 routes and walking transfers by arcs, an airplane, a bullet train, a toll Routes using limited express, regular trains, etc. can be found in a well-balanced manner.

  The condition change means 13 outputs a new condition different from the transfer condition acquired by the condition acquisition means 11 as search condition change data, and searches for and outputs supplemental route candidate data according to the new condition. The conditions to be changed here are the conditions that can be input by the user, such as departure time, desired arrival time, time priority, transfer priority, fare priority, train priority, etc. Search conditions other than those actually input by the user. Specifically, when the condition acquired by the condition acquisition unit 11 is “necessary time priority”, the condition changing unit 13 outputs a condition other than “necessary time priority” and performs a route search, and the result is obtained. The route data is stored in the supplemental route candidate data storage unit 33 as supplemental route candidate data. In addition, when the condition acquired by the condition acquisition unit 11 is “departure time designation”, the condition change unit 13 may search the designated departure time earlier by a predetermined time such as 5 minutes or 10 minutes. Similarly, when the condition acquired by the condition acquisition unit 11 is “designated arrival time”, the condition changing unit 13 may search for the specified arrival time with a delay of a predetermined time such as 5 minutes or 10 minutes. .

  Here, the condition changing means 13 further reads the timetable data from the storage device 107, assigns the train time of the transportation to the supplementary route candidate data retrieved by the condition changing means 13, and sets the transportation time and each supplementary time. The required time in the route candidate data is output. The condition changing unit 13 further outputs the number of transfers in the supplementary route candidate data searched by the condition changing unit 13. The condition changing unit 13 further reads the fare data from the storage device 107, calculates the fare of the supplementary route candidate data searched by the condition changing unit 13, and outputs it.

  With reference to FIG. 8, the condition changing process by the condition changing means 13 according to the preferred embodiment of the present invention will be described.

  First, in step S201, it is determined whether there is a search condition for searching as a supplemental route. Specifically, it is determined whether or not there is a search condition that is not searched for by the supplementary route search means 14 described later, among conditions other than the conditions acquired by the condition acquisition means 11. Specifically, it is determined whether each condition for route search has been input by the user or whether a used flag indicating that it has been used in the subsequent route search processing is set.

  If there is an unused search condition, specifically, if there is a condition in which the used flag is not set, in step S203, supplementary route candidate data searched with the unused search condition is output. Furthermore, a used flag corresponding to the unused search condition is set to clarify that the search for the route under the unused search condition is completed. On the other hand, if there is no unused search condition, the process ends.

  The supplementary route extraction unit 14 extracts supplementary route data including evaluation parameters superior to the output route data for each evaluation parameter from the supplementary route candidate data output by the condition changing unit 13. The supplementary route extraction means 14 compares the output route data with each supplementary route candidate data for each evaluation parameter of the summary information data matrix data, and the evaluation parameter superior to the supplementary route candidate data compared to the output route data. If there is, the supplementary route candidate data is stored in the supplementary route data storage unit 34 as supplementary route data.

  Specifically, the supplementary route extraction unit 14 further supplements the supplementary route candidate data with any one or more of departure time, arrival time, and required time compared to the output route data output by the route search unit 12. Extract route data. Further, the supplementary route extraction means 14 further extracts supplementary route data that is superior in the number of transfers compared to the output route data output by the route search means 12 from the supplementary route candidate data. Further, the supplemental route extraction unit extracts supplemental route data that is superior in fare compared to the output route data output by the search unit 12 from the supplemental route candidate data.

  With reference to FIG. 9, the supplementary route extraction processing by supplementary route extraction means 14 according to the preferred embodiment of the present invention will be described.

  First, in step S301, the same route is removed. Here, of the supplementary route candidate data output by the condition changing unit 13, supplemental route candidate data to which the same train is assigned on the same route as the output route data output by the route search unit 12 is deleted.

  Next, in the processing from step S302 to step S305, the supplementary route candidate data and the output route data are compared for each comparison parameter. Specifically, in step S302, “number of transfers” which is one of the comparison parameters is compared. Of the supplementary route candidate data, supplementary route candidate data that is less than the number of transfers of the output route data is extracted. In step S303, the “required time” that is one of the comparison parameters is compared. Of the supplementary route candidate data, supplementary route candidate data that is less than the required time of the output route data is extracted and newly added to the supplementary route data. In step S304, “fare” which is one of the comparison parameters is compared. Of the supplemental route candidate data, supplemental route candidate data that is less than the fare of the output route data is extracted and newly added to the supplemental route data. In step S305, “departure / arrival time” which is one of the comparison parameters is compared. Of the supplementary route candidate data, supplemental route candidate data that departs at a time closer to the user's input condition than the output route data origination time, and a supplemental route candidate that departs at a time closer to the user's input condition than the arrival time of the output route data The data is extracted and newly added to the supplementary route data.

  In step S306, supplementary route data to be output is determined from the supplementary route data output in steps S302 to S305. Specifically, the supplementary route data output in steps S302 to S305 is weighted from the viewpoint of the number of transfers, the required time, the fee, etc., and a predetermined number of route data is sent to the client terminal 2a in order of better evaluation. Output as supplementary route data to be output.

  The summary information generation means 15 reads the summary information matrix data from the storage device 107, and for each evaluation parameter, the output route data searched by the route search means 12 and the supplementary route data extracted by the supplementary route extraction means 14 are obtained. Summary information data associated with the compared result is acquired. Here, the summary information data acquired by the summary information generation unit 15 includes information regarding parameters in which the supplementary route data is superior to the output route data.

  The summary information generation unit 15 compares the value in the output route data searched by the route search unit 12 with the value in the supplemental route data extracted by the supplemental route extraction unit 14 for each of the evaluation parameters.

  With reference to FIG. 10, the summary information generation processing by the summary information generation means 15 according to the preferred embodiment of the present invention will be described.

  First, in step S401, “departure / arrival time” which is one of the comparison parameters is compared. If the departure time of the supplemental route data is earlier than the departure time of the output route data, the departure time flag is set to “early”, if late, the departure time flag is set to “late”, otherwise the departure time Set the flag to “same”. On the other hand, if the arrival time of the supplemental route data is earlier than the arrival time of the output route data, the arrival time flag is set to “early” if it is late, and if it is late, the arrival time flag is set to “late”. Sets the arrival time flag to “same”. In the comparison of the departure and arrival times, a predetermined threshold value may be provided, and a flag may be set depending on whether it is earlier than or later than the threshold value or within the threshold value.

  Next, in step S402, “required time” that is one of the comparison parameters is compared. If the time required for the supplementary route data is less than the time required for the output route data, the required time flag is set to “less”. If the required time flag is large, the required time flag is set to “high”. Set the flag to “same”. In the comparison of the required times, a predetermined threshold value may be provided, and a flag may be set depending on whether it is greater than, less than, or within the threshold value.

  In step S403, “number of transfers” which is one of the comparison parameters is compared. If the number of transfers in the supplementary route data is smaller than the number of transfers in the output route data, set the transfer count flag to "Low". If there are many, set the transfer count flag to "High". Set the flag to “same”. In comparison of the number of transfers, a predetermined threshold value may be provided, and a flag may be set depending on whether the threshold value is greater than, less than, or within the threshold value.

  Furthermore, in step S404, “fare” which is one of the comparison parameters is compared. If the fare of the supplementary route data is less than the fare of the output route data, the fare flag is set to `` less '', the fare flag is set to `` more '', if it is the same, the fare flag is `` same '' Set to. In the fare comparison, a predetermined threshold value may be provided, and a flag may be set depending on whether the threshold value is greater than, less than, or within the threshold value.

  Finally, in step S405, the summary of the summary information matrix data storage unit 24 is based on the departure time flag, arrival time flag, required time flag, transfer count flag, and fare flag values obtained by the processing in steps S401 to S404. Summary information associated with each flag value is extracted from the information matrix data. At this time, if summary information is set for each condition changed by the condition changing unit 13, the summary information associated with the search condition for the supplemental route data is extracted. At this time, it is preferable to extract summary information expressed with a small number of characters and detailed information expressed in detail as summary information.

  When there are a plurality of supplemental route data, the processing from step S401 to step S405 is executed for each supplemental route data.

  The result presentation unit 16 outputs the output route data searched by the route search unit 12, the supplementary route data extracted by the supplementary route extraction unit 14, and the summary information acquired by the summary information generation unit 15.

  With reference to FIG. 11 and FIG. 12, the result display screens P101 and P102 presented by the result presentation means 16 according to the preferred embodiment of the present invention will be described. The result presentation means 16 first displays a result display screen P101 shown in FIG. 11 on the screen of the client terminal 2a or the like. The result display screen P101 includes an output route display part P101a and an auxiliary route summary information display part P101b. The output route data searched by the route search means 12 is displayed on the output route display part P101a. Only the summary information of the auxiliary route is displayed on the auxiliary route summary information display part P101b. When there are a plurality of supplemental route data, the supplementary route summary information display unit P101b displays summary information for each supplementary route data.

  In the example shown in FIG. 11, transfer from Kichijoji Station to Kunitachi Station on the same route XXX is guided. In the route shown in FIG. 11, the search is performed for the case where the required time is given priority. On the XXX line, commuter rapid stops at Kichijoji Station and Kokubunji Station, while the commuter rapid does not stop at Kunitachiji Station and stops only at high speed. In that case, the conventional route search server 1 guides the transfer as the output route data from Kichijoji Station to Kokubunji Station by commuting fast, changing to the rapid train at Kokubunji Station, and moving to the national station.

  Therefore, the route search server 1 according to the preferred embodiment of the present invention can output supplementary route data having advantages over the output route data as a result of searching under conditions not specified by the user. . For the supplementary route data, only the summary information of the supplementary route is displayed on the result display screen P101 shown in FIG. Here, the summary information is “Easy to go and the same arrival time is here!”, “If you get on now, the arrival time is the same!” And so on.

  When the user clicks on the summary information in the supplementary route summary information display portion P101b in FIG. 11, supplementary route data is displayed on the supplementary route detailed information display portion P102a in FIG. Is done.

  In this case, when the user clicks on the link “Easy way to travel and the same arrival time is here!” In FIG. 11, the supplementary route detailed information display part P102a in FIG. As route data, it guides you to transfer from Kichijoji Station to Kunitachi Station by rapid train. This supplemental route data is route data searched by the condition changing means 13 with priority on the number of transfers. Although this supplementary route data has a later departure time than the output route data, there is an advantage that the arrival time is the same and the number of transfers is small.

  Therefore, in the summary information matrix data shown in FIG. 3, the evaluation of the departure time is “early”, the evaluation of the arrival time is “same”, the evaluation of the rank of transfer rank is “low”, and the search condition “priority of transfer count” is associated. The summary information “Easy way to go and the same arrival time is here!” Is displayed on the supplementary route summary information display portion 101b and the supplementary route detailed information display portion P102a. Although the case where the summary information and the detailed information are the same has been described here, when different comments are registered in the summary information matrix data, the comments may be changed according to the timing at which the summary information is displayed.

  As described above, according to the route search server 1 according to the preferred embodiment of the present invention, after the transfer route search is performed under the condition specified by the user and the output route data is output, the search condition is changed to an unspecified search condition. A transfer route search is performed and supplementary route candidate data is output. Although the supplementary route candidate data does not match the condition specified by the user, the route search server further outputs, as supplementary route data, data having some advantage over the output route data among the supplementary route candidate data. Thereby, the user can acquire another useful route by one search without changing the condition many times and searching. Further, by outputting both the output route data and the supplementary route data, the user can select a route suitable for the user by confirming and comparing the routes at a time. In addition, since it is possible to acquire other useful routes by a single search, it is possible to reduce the load on the server due to the user changing and searching the conditions many times.

  In addition, according to the route search server 1 according to the preferred embodiment of the present invention, first, only the summary information of the supplemental route data is displayed together with the output route data. As a result, the user can grasp the advantages of the supplemental route, so that the route selection can be easily determined. Further, when the user clicks on the summary information, detailed information on the supplementary route is displayed, so that supplementary route data can also be guided without disturbing the confirmation of the output route data that the user desires most. .

(Other embodiments)
As described above, the present invention has been described according to the best mode for carrying out the invention. However, it should not be understood that the description and drawings constituting a part of this disclosure limit the present invention. 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 a single 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 figure explaining an example of the data structure and data of summary information matrix data based 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 the best embodiment of this invention. It is a flowchart explaining the route search process by the route search means which concerns on the best embodiment of this invention. It is a flowchart explaining the condition change process by the condition change means based on the best embodiment of this invention. It is a flowchart explaining the supplementary route extraction process by the supplementary route extraction means which concerns on the best embodiment of this invention. It is a flowchart explaining the summary information generation process by the summary information generation means based on the best embodiment of this invention. It is an example of the screen which the route search server which concerns on the best embodiment of this invention shows. It is an example of the screen which the route search server which concerns on the best embodiment of this invention shows.

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 Condition change means 14 Supplementary route extraction means 15 Summary information generation means 16 Result presentation means 21 Route data storage part 22 Timetable data storage part 23 Fare data Storage unit 24 Summary information matrix data storage unit 31 Search condition data storage unit 32 Output route data storage unit 33 Supplemental route candidate data storage unit 34 Supplementary route data storage unit 35 Summary information data storage unit

Claims (14)

The output route data obtained by searching for the transfer of transportation from the departure point to the destination under a predetermined condition and the transfer of the transportation from the departure point to the destination under a new condition different from the predetermined condition. A route search server that outputs supplementary route data searched for
Route data storage means for storing route data in which a route of the transportation means and a station of the route are associated with each other in a storage device;
Stored in the storage device is an evaluation parameter, a result of comparing the output route data and the supplementary route data with the evaluation parameter, and summary information matrix data in which summary information data, which is information summarizing the result, is associated. Summary information matrix data storage means,
Condition acquisition means for acquiring the transfer condition;
Route search means for reading out route data from the storage device and searching for and outputting output route data according to the conditions acquired by the condition acquisition means;
Condition changing means for searching and outputting supplementary route candidate data according to a new condition different from the transfer condition acquired by the condition acquiring means;
Supplementary route extraction means for extracting supplementary route data including an evaluation parameter superior to the output route data for each evaluation parameter from the supplementary route candidate data output by the condition changing means;
The summary information matrix data is read from the storage device, and the output route data searched by the route search means and the supplementary route data extracted by the supplementary route extraction means are compared for each evaluation parameter. Summary information generating means for acquiring associated summary information data;
A result presentation means for outputting the output route data searched by the route search means, the supplementary route data extracted by the supplementary route extraction means, and the summary information acquired by the summary information generation means; A route search server comprising: The summary information data of the summary information matrix data includes information regarding parameters in which the supplementary route data is superior to the output route data,
The route search server according to claim 1, wherein the summary information data of the summary information matrix data is set for each search condition for searching for the supplementary route data. The predetermined condition is any one of departure time designation, arrival time designation, required time priority, transfer frequency priority and fare priority,
The new condition is a condition different from the predetermined condition, and is any one of a departure time designation, arrival time designation, required time priority, transfer frequency priority, and fare priority. The route search server described in 1. The evaluation parameter of the summary information matrix data is any one or more of departure time, arrival time, required time, number of transfers, and fare,
The summary information generation means compares, for each of the evaluation parameters, a value in the output route data searched by the route search means and a value in the supplementary route data extracted by the supplementary route extraction means. The route search server according to claim 3. Further comprising timetable data storage means for storing timetable data of trains on the route of the transportation means in the storage device;
The route search means further reads the timetable data from the storage device, assigns the time of the transportation means to the output route data searched by the route search means, and the time of the transportation means and the output route Output the time required in the data,
The condition changing means further reads the timetable data from the storage device, assigns the time of the transportation facility to the supplementary route candidate data searched by the condition changing means, and sets the time of the transportation facility and the supplementary time. Output the required time in the route candidate data,
The supplementary route extracting means further extracts supplementary route data that is superior in any one or more of departure time, arrival time and required time from the supplementary route candidate data as compared with the output route data output by the route search means. The route search server according to claim 4, wherein the route search server is extracted. The route search means further outputs the number of transfers in the output route data searched by the route search means,
The condition change means further outputs the number of transfers in the supplementary route candidate data searched by the condition change means,
The supplemental route extraction unit further extracts supplemental route data that is superior in number of transfers compared to the output route data output by the route search unit from the supplementary route candidate data. Route search server. Fare data storage means for storing the fare data of the route of the transportation means in the storage device;
The route search means further reads the fare data from the storage device, calculates and outputs the fare of the output route data searched by the route search means,
The condition changing means further reads the timetable data from the storage device, calculates and outputs a fare of the supplementary route candidate data searched by the condition changing means,
5. The route according to claim 4, wherein the supplementary route extraction unit extracts supplementary route data superior in fare compared to the output route data output by the route search unit from the supplementary route candidate data. Search server. Output route data obtained by searching for transfer of transportation from the departure point to the destination under a predetermined condition, and transfer of the transportation from the departure point to the destination under a new condition different from the predetermined condition A route search program that outputs supplemental route data searched for
Route data storage means for storing route data in which a route of the transportation means and a station of the route are associated with each other in a storage device;
Stored in the storage device is an evaluation parameter, a result of comparing the output route data and the supplementary route data with the evaluation parameter, and summary information matrix data in which summary information data, which is information summarizing the result, is associated. Summary information matrix data storage means,
Condition acquisition means for acquiring the transfer condition;
Route search means for reading out route data from the storage device and searching for and outputting output route data according to the conditions acquired by the condition acquisition means;
Condition changing means for searching and outputting supplementary route candidate data according to a new condition different from the transfer condition acquired by the condition acquiring means;
Supplementary route extraction means for extracting supplementary route data including an evaluation parameter superior to the output route data for each evaluation parameter from the supplementary route candidate data output by the condition changing means;
The summary information matrix data is read from the storage device, and the output route data searched by the route search means and the supplementary route data extracted by the supplementary route extraction means are compared for each evaluation parameter. Summary information generating means for acquiring associated summary information data;
A result presentation means for outputting the output route data searched by the route search means, the supplementary route data extracted by the supplementary route extraction means, and the summary information acquired by the summary information generation means; A route search program that causes a computer to function. The summary information data of the summary information matrix data includes information regarding parameters in which the supplementary route data is superior to the output route data,
The route search program according to claim 8, wherein the summary information data of the summary information matrix data is set for each search condition for searching for the supplementary route data. The predetermined condition is any one of departure time designation, arrival time designation, required time priority, transfer frequency priority and fare priority,
The new condition is a condition different from the predetermined condition, and is any one of departure time designation, arrival time designation, required time priority, transfer frequency priority, and fare priority. Route search program described in. The evaluation parameter of the summary information matrix data is any one or more of departure time, arrival time, required time, number of transfers, and fare,
The summary information generation means compares, for each of the evaluation parameters, a value in the output route data searched by the route search means and a value in the supplementary route data extracted by the supplementary route extraction means. The route search program according to claim 9. The timetable data storage means for storing the timetable data of the train of the route of the transportation in the storage device is further caused to function in the computer,
The route search means further reads the timetable data from the storage device, assigns the time of the transportation means to the output route data searched by the route search means, and the time of the transportation means and the output route Output the time required in the data,
The condition changing means further reads the timetable data from the storage device, assigns the time of the transportation facility to the supplementary route candidate data searched by the condition changing means, and sets the time of the transportation facility and the supplementary time. Output the required time in the route candidate data,
The supplementary route extracting means further extracts supplementary route data that is superior in any one or more of departure time, arrival time and required time from the supplementary route candidate data as compared with the output route data output by the route search means. The route search program according to claim 11, wherein the route search program is extracted. The route search means further outputs the number of transfers in the output route data searched by the route search means,
The condition change means further outputs the number of transfers in the supplementary route candidate data searched by the condition change means,
The supplemental route extraction unit further extracts supplemental route data that is superior in number of transfers compared to the output route data output by the route search unit from the supplementary route candidate data. Route search program. Further causing the computer to function fare data storage means for storing the fare data of the route of the transportation means in the storage device;
The route search means further reads the fare data from the storage device, calculates and outputs the fare of the output route data searched by the route search means,
The condition changing means further reads the timetable data from the storage device, calculates and outputs a fare of the supplementary route candidate data searched by the condition changing means,
The route according to claim 11, wherein the supplementary route extracting unit extracts, from the supplementary route candidate data, supplementary route data that is superior in fare compared to the output route data output by the route search unit. Search program.

Images