JP2011169874A - Route searching system, method, and computer program for transportation - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To enable route searching assuming use of a particular means of transportation. <P>SOLUTION: When there is a route search demand of transportation from a PC 70 or a portable terminal 50, a setting screen 30 is displayed in the PC 70 or the portable terminal 50. On input of an identification name of the particular means of transportation, and input of a starting point and destination, nodes necessary for route search are read from an operation information DB 120, a virtual node DB 130, or the like. A route search tool 110 carries out route search by sequentially tracking nodes existing in a direction from the starting point to the destination. When tracking a plurality of the nodes in route search, further search is terminated in regard to routes discriminated that required operation costs until then exceed a predetermined threshold. From routes discriminated to not exceed the predetermined threshold, a route having the particular means of transportation is specified as an optimal route candidate. <P>COPYRIGHT: (C)2011,JPO&INPIT

Description

  The present invention relates to a route search technique for a transportation facility on the premise that a specific transportation means name desired by a user is used regardless of operation costs. Here, “specific transportation means name” means, for example, a limited express name such as “Cassiopeia” (registered trademark) or “Hokutosei” (registered trademark), a high-speed ferry name such as “Ocean Arrow”, and “Sanriku Railway”. The name of a railway line such as “Night Bus” that runs from Tokyo to various areas.

  Construct a transportation network that includes transferable stations as nodes for route search, and chain search processing for the next node with the lowest operating cost for each node in the transportation network that connects the departure point to the destination. 2. Description of the Related Art A route search device for transportation is known. In this type of conventional route search device, the optimum route candidates are generally output in the order in which the operation cost is minimized. Recently, there is a technology for expanding the range of a transportation network by allowing a new virtual node to be added to an existing node.

  For example, the system disclosed in Patent Document 1 adds a virtual node that links with zero link cost from a node corresponding to a specific location (POI) to the transportation network, and performs a route search including the virtual node. It reduces resources during route search and enables efficient route search efficiently.

  In addition, the system disclosed in Patent Document 2 can be used to move from the departure place and stay longer in the most suitable event time zone and its route when the start time and end time of the event are fixed. Perform a search. More specifically, the stay time in the event is calculated by setting the start time and end time of the event in the node of the transportation means network. The fact that the user can take as long a stay as possible means that, in other words, he / she guides the destination arriving at the earliest destination of the event.

JP 2006-300735 A JP 2009-109273 A

Some users of route search may have a purpose of traveling, such as specifying and using a specific vehicle, bus, ship, aircraft, etc. In other words, there is a user who needs a route search (including a schedule information guide) including a route that does not aim to reduce the operation cost.
Since this type of conventional route search system represented by the systems disclosed in Patent Documents 1 and 2 is designed to search for a route with a low operating cost as an optimum route, It is not possible to accurately meet user demand. For this reason, for example, high-speed night buses that run from within Tokyo's 23 wards across the country have different stops depending on the destination, so where should the user go if they cannot recall the stop that the user should use? I do n’t know and I ’m in trouble. In order to meet such user demand, the entire existing system needs to be reorganized, which places a heavy burden on the developer.

  The present invention enables a route search on the premise that a user wants to use a specific transportation means that the user wants to use regardless of the operation cost, can make effective use of existing resources, and has excellent scalability. The main problem is to provide a route search technique.

In order to solve the above problems, the present invention provides an operation route search device, a route search method, and a computer program.
In the route search system according to the present invention, a user may desire to use a node other than a plurality of actual nodes such as a railway line station as a node constituting a route search transportation means network regardless of the operating cost. Route search that can access a storage device that stores a virtual node associated with any real node at a place where the use of specific transportation means such as sleeper trains, express buses, and ships can be used A traffic condition stored in a storage device triggered by reception of a route search condition and a search condition reception unit that receives an input of a route search condition including an identification name of a departure point, a destination, and a specific transportation means A route search is performed by sequentially following nodes existing in the direction from the departure point to the destination in the means network. A route search means for identifying a specific transport one or more optimal path candidates exists before that a transport route search system comprising a.

  According to this system, in addition to a plurality of actual nodes such as railway stations as nodes constituting the route search transportation means network, it is assumed that the user wants to use it regardless of the operating cost. By using a route search system that can access a storage device stored as a virtual node associated with any real node, a place where the use of a specific transportation means can be started or ended, In response to the input of a route search condition including the identification name of the specific transportation means, the route search is performed by sequentially following the nodes existing in the direction from the departure place to the destination in the transportation means network stored in the storage device. This makes it possible to identify one or more optimal route candidates for which specific transportation means exist from the departure point to the destination. That. This makes it possible to search for routes on the premise that the specific transportation means is used regardless of the operation cost.

  In one embodiment, virtual node setting means for associating a virtual node with any real node and storing the virtual node in a storage device is further provided. This makes it possible to add, modify, and delete virtual nodes in the virtual node storage device at any time, regardless of the operation of the route search system.

  In one embodiment, the virtual node setting unit associates the virtual node with any one of the real nodes, and sets the operation cost between the virtual node and the associated real node to be zero. As a result, it is possible to provide a route search based on the premise that the specific transportation means is used regardless of the operation cost, in an extended form added to the already-operated route search system. Therefore, existing resources can be used effectively.

  In one embodiment, the search condition accepting unit accepts an input of a route search condition including a use time zone, a use start time or a use end time of the specific transportation means, and the storage device is provided for each real node or virtual node. The route search means refers to the operation information by referring to the operation information, and the optimum route in the order of decreasing the operation cost according to the use time zone, the use start time or the use end time. Identify candidates. As a result, it is possible to search for a route specifying the use time zone of the specific transportation means, and further, the convenience of the user is further improved by specifying the optimum route candidate in order of decreasing operation cost based on the specification. It will be.

  In one embodiment, the route search means holds a predetermined search threshold value, and when following a plurality of nodes in route search, for the route whose operation cost required before that exceeds the search threshold value, the subsequent nodes The search for is terminated. As a result, it is possible to determine whether or not the route search result is unrealistic, and it is possible to perform processing such as excluding routes with unrealistic operating costs, for example, routes with operating costs exceeding a predetermined standard. It becomes. This also eliminates unnecessary load on the route search system.

  According to the route search method of the present invention, a user may desire to use a node as a node constituting a route search transportation network, in addition to a plurality of real nodes such as railway stations, regardless of the operating cost. A path that can access a storage device that stores a place where a specific transportation means such as a sleeper train, a high-speed bus, and a ship can be used or ended as a virtual node associated with any of the real nodes A method executed by a search system, wherein a step of receiving an input of a route search condition including an origin, a destination, and an identification name of the specific transportation means, and the reception of the route search condition are triggered by the storage device. A route search is performed by sequentially tracing nodes existing in the direction from the departure point to the destination in the stored transportation mode network. Wherein a route search method from the departure point transport having, a step of identifying one or more best candidate routes which the specific transportation present in up to the destination by.

  The computer program of the present invention assumes that the user wishes to use the node regardless of the operation cost in addition to a plurality of actual nodes such as railway stations as nodes constituting the route means transportation network. A computer that can access a storage device that stores a place where a specific transportation means such as a sleeper train, a high-speed bus, and a ship can be used or ended as a virtual node associated with any of the real nodes A computer program for operating as a route search system, wherein the computer is a search condition receiving unit that receives an input of a route search condition including an origin, a destination, and an identification name of the specific transportation means, and the route search condition In response to the receipt of the information, the output is stored in the transportation means network stored in the storage device. A route search is performed by sequentially following nodes existing in the direction from the ground toward the destination, whereby one or a plurality of optimum route candidates where the specific transportation means exist from the departure location to the destination are determined. It is a computer program that functions as a route search means for specifying.

  In the present invention, it is possible to search for a route on the premise that the user wants to use a specific transportation means that the user wants to use regardless of the operation cost, and it is possible to effectively utilize existing resources and to provide excellent scalability. A unique effect of providing a route search technique can be obtained.

The whole lineblock diagram of the operation course search system of a 1st embodiment. The data structural example figure of a virtual node database. FIG. 3 is an exemplary diagram of a setting screen according to the first embodiment. The route search processing procedure of 1st Embodiment. The schematic diagram which shows the route search of 1st Embodiment. The illustration figure of a route search result display. The illustration figure of the setting screen of 2nd Embodiment. The route search processing procedure of 2nd Embodiment. The whole block diagram of the operation route search system of 3rd Embodiment.

Embodiments of the present invention will be described below in detail with reference to the drawings.
[First Embodiment]
<Overall configuration>
FIG. 1 is a diagram showing an example of the overall configuration of a route search system according to this embodiment, in which characteristic portions are posted. The route search system 1 includes a route search server 10 connected to a digital network N such as the Internet. To the digital network N, a mail server 60 and a personal computer (PC) 70 as an example of an information terminal can be connected. The portable terminal 50 as another example of the information terminal can be connected to the digital network N directly if it has data communication and data processing functions, and via the mail server 60 if it has only the mail function.

<Route search server>
The route search server 10 has a server body provided with a storage device, and is realized by the cooperation of this server body and the computer program of the present invention. That is, when the server body reads and executes the computer program, the server body functions as the data communication interface 100 and the route search tool 110, and the operation information DB (DB is a database of the database) constructed in the storage device. Information processing for route search can be executed by accessing 120 and the virtual node DB 130.

  The main control unit 111 controls operations including activation of the functional blocks 100, 110, 131, and 132 in order to realize various processes related to route search. The control procedure will be described later.

  The data communication interface 100 enables bidirectional communication with the portable terminal 50 and the PC 70 having data communication and data processing functions, and provides a hierarchical page screen that can be browsed by these information terminals. This hierarchical page screen is used to perform route search Web services. The route search satisfying the user is performed by interactively specifying the route search conditions interactively between the system side and the user. It also provides an environment. The route search result information can also be displayed on this page screen.

  The operation information DB 120 stores information necessary for route search, including routes and schedule information of transportation facilities (railways, buses, ships, airplanes, etc.), fare information, and a station list. This information is updated from time to time.

  There are a plurality of real nodes such as railway stations as nodes constituting a route search transportation network. The virtual node DB 130 stores virtual nodes associated with any real node in places where the use of specific transportation means such as sleeper trains, express buses, and ships can be used.

  The virtual node setting unit 132 receives an input from an external input device, and accumulates in the virtual node DB 130 a virtual node that associates one of the real nodes with a place where the use of the specific transportation means can be started or ended. . The virtual node setting unit 132 can also associate the virtual node with any real node and store the virtual node in the virtual node DB 130 as a route in which the operation cost between the virtual node and the virtual node is zero. The operation cost is zero, that is, when the operation cost is regarded as time, it is 0 minutes. Furthermore, the virtual node setting unit 132 can also store link information in the virtual node DB 130 including link information. Details will be described later. Here, the real node associated with the virtual node is referred to as a link point.

  The search threshold determination unit 131 determines whether or not the route search result is unrealistic, and performs a process such as excluding a route with an unrealistic operation cost, for example, a route with an operation cost exceeding a predetermined criterion. Do. By excluding routes that result in unrealistic operating costs, the processing load during search can be reduced.

  FIG. 2 is an example of information stored in the virtual node DB 130. The virtual node includes information for designating a specific transportation means and information necessary for route search. In FIG. 2, “Type” is a type of a specific transportation means such as “Bed Express” or “Express Bus”. The “identification name of the specific transportation means” is an identification name such as “Cassiopeia” (registered trademark) or “Hokutosei” (registered trademark). The “use start / end place” is a place where the use of the specific transportation means can be started or ended. “Operation information DB presence / absence” indicates whether or not operation information including the schedule information of the specific transportation means exists on the operation information DB 120. Here, when the operation information is “present” on the operation information DB 120, the flag is “1”, and when it is “not present”, the flag is “0”. The ID is uniquely identified in the system.

  When the above-mentioned “operation information DB presence / absence” is the flag “0”, the operation information that can be associated with the virtual node on the operation information DB 120 is “not present”. In this case, the operation information stored in the operation information DB 120 is not a reference target when searching for a route. “Link information” is information for making it possible to refer to operation information including diagram information (not shown) other than the operation information stored in the operation information DB 120 if necessary during route search.

Further, even when operation information that can be associated with a virtual node exists on the operation information DB 120, for example, specifying the transportation means that can be transferred is limited by associating the virtual node with specific operation information. It is possible to search for a route referring to the operation information. In this case, even if there is operation information that can be associated with the virtual node on the operation information DB 120, the above-mentioned “operation information DB presence / absence” is set to the flag “0”.
In this embodiment, the operation information DB 120 and the virtual node DB 130 are shown in the form of a database. However, the information may be stored in other forms as long as the information can be prepared at the time of information processing.

  FIG. 3 exemplifies a route search condition setting screen according to this embodiment. The setting screen 230 is displayed by the main control unit 111 in response to a request to display a setting screen performed using the PC 70 or the portable terminal 50. This setting screen 230 is provided with input areas 231, 232, and 233 that can be input using the PC 70 and the portable terminal 50, and has 234 and 235 parts for instructing to confirm or discard the input work.

  The input area 231 receives an input of a departure place. The input area 232 receives a destination input. The input area 233 receives an input of the identification name of the specific transportation means. When receiving the input, the main control unit 111 can read out necessary data from the operation information DB 120 and the virtual node DB 130, for example, at the time of a route search described later.

<Route search>
FIG. 4 shows a main processing procedure of the route search according to this embodiment. The route search processing procedure according to this embodiment will be specifically described with reference to FIG.
When there is a route search request for transportation from the PC 70 or the portable terminal 50 (step S101: yes), the main control unit 111 displays a setting screen 230 as shown in FIG. 3 on the PC 70 or the portable terminal 50 (step S102). .

  The main control unit 111 checks whether there is an input of the identification name of the specific transportation means in the input area 233 (step S103: yes), and if it is input, the departure place and the destination are in the input area 231 and the input area 232, respectively. It is confirmed whether it is input (step S104: yes). Upon confirming these route search conditions, the main control unit 111 is necessary for route search from the operation information DB 120, the virtual node DB 130, etc. based on the information inputted as the identification name of the specific transportation means, the departure place and the destination. A correct node is read (step S105).

  The main control unit 111 activates the route search tool 110. The route search tool 110 performs route search by sequentially following nodes that exist in the direction from the departure point to the destination (step S106). The route search tool 110 identifies one or a plurality of routes in which a virtual node exists from the searched routes as the optimum route candidates (step S107). The route search tool 110 rearranges the optimal route candidates identified in step S107 in order of increasing virtual nodes (step S108). The main control unit 111 instructs display of the optimum route candidates that have been rearranged in step S108 (step S109).

Next, the flow of processing according to this embodiment will be described with a specific example.
FIG. 5 is a schematic diagram showing a route search according to this embodiment. As an example, this figure shows a part of the railway network, SP in the figure indicates the actual node of the departure place, and EP indicates the actual node of the destination. Further, n1 to n15 indicate actual nodes of the railway line station. Real nodes are connected by solid lines and dotted lines and are represented as an iron road network.

  In this figure, the specific transportation means is assumed to be A train. On the actual node, train A travels on the railway network in the order of n5, n3, n4, n6, n8, n9, n12, n13, and n15. A station where the use of the A train can be started or can be ended is defined as virtual nodes N3, N4, N5, N9, N13, and N15, the virtual node N3 and the real node n3, the virtual node N4 and the real node n4, and the virtual node N5 and the real node. n5, the virtual node N9 and the real node n9, the virtual node N13, the real node n13, the virtual node N15, and the real node n15 are associated with each other and information is accumulated in the virtual node DB. For the sake of clarity, a virtual node and a real node are shown in association with one-dot chain line “LK” in FIG.

  In the route search of this example, first, a real node existing in a direction from the departure point SP to the destination EP and the associated virtual node are sequentially traced. One or a plurality of routes in which the virtual node (N3, N4, N5, N9, N13, N15) of the train A exists is specified as the optimum route candidate from the searched routes. For example, it can be seen that there are a plurality of routes from the departure point SP to n1, n4, N4, N9, N13, n13, n14, a destination EP, and the like. If these virtual route candidates are rearranged in the descending order of the virtual nodes, the process proceeds from the departure point SP to n2, n3 becomes the use start station of the A train, and n13 becomes the use end station of the A train. One of them is a route that proceeds to n14 and arrives at the destination EP. Virtual nodes N3, N4, N9, and N13 connected by solid lines are extracted from the boarding section of the A train in the search result.

  FIG. 6 is a display example of optimum search candidates according to this embodiment. The use start place and use end place of the specific transportation means and the route between them are shown in the center. In addition, the upper part shows the departure place, the use start place of the specific transportation means, and the route between them. Further, the lower part shows the use end location and destination of the specific transportation means and the route between them. In this display example, the display of a plurality of optimum route candidates can be switched by the tabs of “candidate 1”, “candidate 2”, and “candidate 3”.

  Thus, according to the route search system of this embodiment, any real node is associated with a virtual node, and a route candidate including a virtual node is specified at the time of route search, so that the user can specify regardless of the operation cost. Optimal route candidates including from the departure point to the destination based on the use of transportation means, that is, the optimum route candidate from the departure point to the place where the use of the specific transportation means can be started, the section using the specific transportation means In addition, it is possible to know by one search including the optimum route candidate from the place where the use of the specific transportation means can be terminated to the destination.

  Moreover, according to the route search system of this embodiment, for example, in the case of a high-speed bus, the boarding points differ depending on the destination in the departure area (for example, in Tokyo 23 wards). Even if the stop to be used in such a case cannot be recalled, the user can know the place where the use of the express bus can be started by a single search by specifying at least the identification name of the specific transportation means and the departure place. it can. At that time, the user can know the optimum route candidate from the departure place to the place where the use of the specific transportation means can be started.

  Furthermore, according to the route search system of this embodiment, it is possible to add, modify, and delete virtual nodes in the virtual node storage device at any time regardless of the operation of the route search system. From this, the maintenance which makes a virtual node correspond to the newest traffic route network can be performed efficiently, and operation of the route search system which suppressed cost by this can be performed. In addition, for example, by limiting the specific transportation means that can be designated in advance by the user, a route search system dedicated to a specific transportation operator can be provided, and even in this case, development and provision with reduced time and cost are possible. .

[Second Embodiment]
This embodiment makes it possible to specify route search conditions including the use time zone, use start time, and use end time of the specific transportation means in the first embodiment.
For example, the setting screen of the first embodiment can be selected as a “simple setting screen”, and the setting screen according to this embodiment can be selected as a “detailed setting screen”. Hereinafter, characteristic portions of this embodiment will be described.

  FIG. 7 illustrates a route search condition setting screen according to this embodiment. The setting screen 260 is displayed by the main control unit 111 in response to a request for displaying a setting screen using the PC 70 or the portable terminal 50. This setting screen 260 is provided with input areas 261, 262, 263, 264, 265, and 266 that can be input using the PC 70 or the portable terminal 50, and 267 and 268 for instructing to confirm or discard these input operations. Part. The input area 261 receives an input of a departure place. The input area 262 receives an input of a destination. The input area 263 receives an input of the identification name of the specific transportation means.

  The input area 264 receives an input of a usage time zone of the specific transportation means. For example, “AM”, “PM”, “after 19:00”, and the like. The input area 265 receives an input of the use start time of the specific transportation means. For example, “Ueno station 10:00”. The input area 266 receives an input of the use end time of the specific transportation means. For example, “Oyama Station 21:00”. Only one of the use start time and use end time can be accepted. This is because, for example, if a use start time is specified and a route search is performed, the use end time is automatically determined. The main control unit 111 can read necessary data from the operation information DB, the virtual node DB, and the like at the time of a route search described later, for example, when triggered by the input.

<Route search>
FIG. 8 shows the main processing procedure of the route search according to this embodiment. The route search processing procedure according to this embodiment will be described with reference to FIG.
When there is a route search request from the PC 70 or the portable terminal 50 (step S201: yes), the main control unit 111 displays a setting screen 260 as shown in FIG. 7 on the PC 70 or the portable terminal 50 (step S202).

  The main control unit 111 checks whether or not the identification name of the specific transportation means is input in the input area 263 (step S203: yes), and if it is input, the departure place and the destination are input to the input areas 261 and 262, respectively. (Step S204: yes). The main control unit 111 checks whether at least one of the use time zone, use start time, or use end time of the specific transportation means has been input in the input areas 264, 265, and 266, respectively (step S205: yes). In response to the confirmation of these route search conditions, the main control unit 111 receives an input including the use time zone, use start time or use end time of the specific transportation means in addition to the identification name, departure place and destination of the specific transportation means. Based on the information, nodes necessary for route search are read out from the operation information DB 120 and the virtual node DB 130 (step S206).

  The main control unit 111 activates the route search tool 110. The route search tool 110 executes route search by sequentially following nodes existing in the direction from the departure point to the destination while referring to the operation information including the diamond information associated with the node read in step S206. (Step S207). The main control unit 111 activates the search threshold value determination unit 131. The search threshold value determination unit 131, when following a plurality of nodes during route search, for a route (step S208: no) that has been determined that the operation cost required until then exceeds a predetermined threshold (step S208: no) Is terminated (step S211).

  The route search tool 110 is the route that the search threshold value determination unit 131 has determined not to exceed the predetermined threshold value (step S208: yes), and the optimal route in the order of decreasing operation cost from the routes in which virtual nodes exist. Candidates are specified (step S209). The main control unit 111 instructs display of the optimum route candidate specified in step S209 (step S210).

As described above, according to the route search system of this embodiment, the user can specify the route search conditions including the use time zone of the specific transportation means, and the purpose from the departure place on the assumption that the specific transportation means is used. The optimum route candidate including the ground can be known in ascending order of operation cost according to the route search condition including the use time zone.
For example, it is assumed that the specific transportation means specified by the user is “Cassiopeia” (registered trademark) and the use start time includes “Ueno Station 16:20”. In this case, the user can search for the optimum route candidate that can arrive at Ueno Station by 16:20 from the departure point in one search, the optimum route candidate from the lower station to the destination of the Cassiopeia, and the ride section of the Cassiopeia. According to the use start time, it can be known in ascending order of operation cost.

In addition, according to the route search system of this embodiment, the route search described below can be realized using a virtual node as long as a place serving as a link point exists.
For example, if the user wants to take a 20-minute stroll from Kamakura Station to Kita-Kamakura Station from the departure point to the destination, the specific transportation means in the virtual node is “walking” and the use start time is “Kamakura Station 13:00” By performing a route search with the use end time set to “Kita-Kamakura Station 13:20”, the user can find the optimal route candidate that arrives at Kamakura Station from the departure point at 13:00 and the time at 13:20. You can know the best route candidate from Kita-Kamakura Station to your destination with a single search.
In this route search, “Kamakura Station” and “Kita-Kamakura Station” are both link points. If the specific transportation means is “walking”, the use start time and use end time are not limited to one, and both can be specified.

  Furthermore, according to the route search system of this embodiment, the specific transportation means is “walking”, the use start time is “14:30 Kamakura Station”, and the use end time is “Kamakura Station 16:30”. Thus, after the user walks around the Kamakura Station area for 2 hours and the optimal route candidate that arrives at Kamakura Station from the departure point at 2:30 hours, the user once selects the optimal route candidate from Kamakura Station to the destination at 16:30. You can also know by searching. For these reasons, the user can also search for a route from the departure point to the destination including leisure time.

  Furthermore, according to the route search system of this embodiment, the route search means ends the search for subsequent nodes for routes that exceed a predetermined search threshold, and excludes routes that cause unrealistic operation costs. be able to. For this reason, it is possible to suppress the addition of new resources by not applying unnecessary search loads to the route search system. In addition, the user can perform a comfortable route search with less stress such as waiting for a response to the route search process.

[Third Embodiment]
<Overall configuration>
FIG. 9 is a diagram showing an example of the overall configuration of the route search system 2 according to this embodiment, in which characteristic portions are posted. The route search system 2 includes a route search server 500 and a virtual node tool 600 connected to a digital network N such as the Internet. In the configuration of this embodiment, the virtual node tool 600 is extended and added to the already-operated route search server 500 to constitute the route search system 2.
Hereinafter, characteristic portions of this embodiment will be described. Note that the basic function of the route search and the search processing procedure are the same as those in the first embodiment and the second embodiment, and thus the description thereof is omitted.

<Virtual node tool>
The virtual node tool 600 includes an I / O interface 601, a control unit 602, a search threshold determination unit 603, a virtual node DB 610, and a virtual node setting unit 611. The control unit 602, the search threshold determination unit 603, and the virtual node DB 610 can access the route search server 500 through the I / O interface 601.

  The I / O interface 601 connects the route search server 500 and the virtual node tool 600 to enable mutual data exchange. The control unit 602 mainly performs control related to data exchange with the route search server 500.

  The virtual node setting unit 611 receives an input from an external input device, associates the virtual node with one of the real nodes, and sets the virtual node as a route in which the operation cost between the virtual node and the virtual node is zero It can be stored in the DB 610. For example, any real node stored in a route search server that is already operated is associated with a virtual node, and a route in which the operation cost during this period is zero is used. Further, the virtual node setting unit 611 can also store link information in the virtual node in the virtual node DB 610.

  For the route search function portion of the route search server 500, for example, the route search software “Electric Spat” (registered trademark) provided by the present applicant can be used. Further, the virtual node tool 600 can be made accessible to the route search server 500 by connecting to the digital network N such as the Internet via the data communication interface.

As described above, according to the route search system of this embodiment, a virtual node is associated with any real node, and is already operated as a route in which the operation cost between the virtual node and the virtual node is zero. Can be extended to existing route search systems.
From this, it is possible to provide a route search system including route search on the premise that the specific transportation means is used, with reduced time and cost. In addition, it has excellent expandability, and it can reduce the burden on the environment by effectively utilizing existing resources.

  Further, according to the route search system of this embodiment, by including the link information in the virtual node, the route search system is reorganized even if the transportation system does not exist on the route search system that is already in operation. In addition, if necessary at the time of the search, it can be extended and added so that the operation information including the schedule information of the specific transportation means can be referred to. This makes it possible to develop and provide time and cost.

  In addition to these embodiments, the route search system according to the present invention can be configured as a stand-alone type.

DESCRIPTION OF SYMBOLS 10 ... Path search server, 50 ... Mobile terminal, 60 ... Mail server, 70 ... PC, 100 ... Data communication interface, 110 ... Path search tool, 111 ... Main Control unit, 120 ... operation information DB, 130 ... virtual node DB, 131 ... search threshold determination unit, 132 ... virtual node setting unit, 230 ... setting screen, 260 ... setting screen , 500 ... Route search server, 600 ... Virtual node tool, 601 ... I / O interface, 602 ... Control unit, 603 ... Search threshold determination unit, 610 ... Virtual node DB, 611... Virtual node setting unit.

Claims (7)

In addition to a plurality of real nodes such as railway lines stations, a sleeper train or express bus that is expected to be used by the user regardless of the operating cost, as nodes constituting the transportation network for route search A route search system capable of accessing a storage device that stores a place where use of a specific transportation means such as a ship can be started or ended as a virtual node associated with any of the real nodes,
A search condition receiving means for receiving an input of a route search condition including a departure place, a destination, and an identification name of the specific transportation means;
In response to acceptance of the route search condition, a route search is performed by sequentially following nodes existing in the direction from the departure point to the destination in the transportation network stored in the storage device. Route search means for specifying one or a plurality of optimal route candidates in which the specific transportation means exists from the starting point to the destination,
A route search system for transportation. Virtual node setting means for storing the virtual node in the storage device in association with any of the real nodes;
The route search system according to claim 1. The virtual node setting means associates the virtual node with any of the real nodes, and sets a route where the operation cost between the virtual node and the associated real node is zero.
The route search system according to claim 2. The search condition accepting means accepts an input of a route search condition including a use time zone, use start time or use end time of the specific transportation means,
In the storage device, for each real node or virtual node, operation information including diagram information in the node is associated,
The route search means refers to the operation information, and specifies the optimal route candidates in order of decreasing operation cost according to the use time zone, use start time, or use end time.
The route search system according to claim 1, 2 or 3. The route search means holds a predetermined search threshold, and when following a plurality of nodes in route search, for a route whose operation cost required before that exceeds the search threshold, search for subsequent nodes End the
The route search system according to claim 4. In addition to a plurality of real nodes such as railway lines stations, a sleeper train or express bus that is expected to be used by the user regardless of the operating cost, as nodes constituting the transportation network for route search This is a method executed by a route search system that can access a storage device that stores a place where use of a specific transportation means such as a ship can be started or ended as a virtual node associated with any of the real nodes. And
Receiving an input of a route search condition including a departure place, a destination, and an identification name of the specific transportation means;
In response to acceptance of the route search condition, a route search is performed by sequentially following nodes existing in the direction from the departure point to the destination in the transportation network stored in the storage device. Identifying one or more optimal route candidates in which the specific means of transportation exists from the starting point to the destination,
A route search method for transportation. In addition to a plurality of real nodes such as railway lines stations, a sleeper train or express bus that is expected to be used by the user regardless of the operating cost, as nodes constituting the transportation network for route search To operate as a route search system a computer that can access a storage device that stores, as a virtual node associated with any one of the real nodes, a place where use of a specific transportation means such as a ship can be started or ended A computer program comprising:
Search condition receiving means for receiving an input of a route search condition including a departure place, a destination, and an identification name of the specific transportation means,
In response to acceptance of the route search condition, a route search is performed by sequentially following nodes existing in the direction from the departure point to the destination in the transportation network stored in the storage device. Function as route search means for specifying one or a plurality of optimum route candidates in which the specific transportation means exists from the starting point to the destination,
Computer program.

Images