JP2013083610A - Route calculation method and route calculation device - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a route calculation method and a route calculation device which facilitate creation of a network data for route retrieval using simple algorithm.SOLUTION: Recording means records in advance a plurality of first node points corresponding to transport means for moving from a departure point to a destination, a plurality of first routes of which one ends or both ends are connected to the first node points, and respective pieces of attribute information corresponding to the plurality of first routes. Also, the recording means records in advance a plurality of second routes of which respective one ends are connected to the plurality of first node points corresponding to the transport means for moving from the departure point to the destination, respective pieces of attribute information corresponding to the plurality of second routes, and a second node point that connects the other ends of the plurality of second routes at one point. The route calculation method receives input of a departure point and a destination. Then, the route calculation method calculates a route in which the first routes and/or the second routes satisfying predetermined attribute conditions continue, on the basis of the received departure point and destination by using a content recorded in the recording means.

Description

  The present invention relates to a route calculation method and a route calculation device for calculating a route of a desired section.

  When performing a route search that minimizes the cost required for movement such as required time and fee, a route network that associates the costs is constructed, and a route search using a simple algorithm such as the Dijkstra method is performed. When incorporating the transfer time of a route at a station into such network data, a station is represented as a plurality of nodes corresponding to the number of routes connected to the station, and a route in which transfer times are associated between the nodes. (For example, Patent Document 1).

JP 2004-61291 A

  However, as the number of routes related to transfer increases, the number of combinations of routes associated with transfer times increases rapidly, and the network data preparation work for route search becomes complicated. In the case of route search using a simple algorithm, although network data creation is inherently easy, when performing route search considering transfer times, etc., it takes a lot of time, labor, and expense to create network data. Occur.

  The present invention has been made in view of such circumstances. An object of the present invention is to provide a route calculation method and a route calculation device that make it easy to create network data for route search using a simple algorithm.

  The route calculation method according to the present application corresponds to the plurality of first nodes recorded in the recording unit, the plurality of first routes whose one or both ends are connected at the first node, and the plurality of first routes, respectively. In the route calculation method of calculating a route in which a plurality of first routes satisfying a predetermined attribute condition for a section from the departure point to the destination using the attribute information is calculated by the computer, the recording means stores the destination from the departure point in advance. Corresponding to the plurality of first nodes and the first route corresponding to the moving means moving to the ground, the plurality of second routes each having one end connected to the plurality of first nodes, respectively. Record attribute information and a second node connecting the other ends of the plurality of second routes at one point, accept a departure place and a destination, and based on the accepted departure place and destination, the recording means Using the recorded contents, Wherein the sex satisfying first path and / or the second path calculates the continuous path.

  In the route calculation method according to the present application, a plurality of first nodal points corresponding to the moving means for moving from the departure place to the destination in advance in the recording means, and a plurality of first nodules connected at one end or both ends at the first nodal point. Attribute information corresponding to each of the one route and the plurality of first routes is recorded. In addition, the recording means corresponds in advance to a plurality of second paths, one end of which is connected to a plurality of first knot points corresponding to the moving means for moving from the departure place to the destination, respectively. Record the attribute information and the second node connecting the other ends of the plurality of second paths at one point. The route calculation method accepts a starting point and a destination. Then, the route calculation method uses the contents recorded in the recording means based on the received departure place and destination, and thereby the route in which the first route and / or the second route satisfying the predetermined attribute condition are continuous. Is calculated.

  In the route calculation method according to the present application, the attribute information corresponding to each of the plurality of second routes includes a waiting time for using the moving unit, a transfer time between the same or different moving units, and a moving distance for transfer. Including the height difference between transfer points or energy consumed for transfer.

  In the route calculation method according to the present application, the attribute information corresponding to each of the plurality of second routes recorded in advance in the recording unit includes a waiting time for using the moving unit, a transfer time between the same or different moving units, It includes the distance traveled for transfers between the same or different moving means, the height difference between transfer points between the same or different moving means, or the energy consumed for transferring between the same or different moving means .

  In the route calculation method according to the present application, each of the plurality of second routes includes a forward route and a reverse route, and attribute information corresponding to each of the plurality of second routes is an attribute corresponding to the forward route and the reverse route. It is characterized by including information.

  In the route calculation method according to the present application, each of the plurality of second routes includes a forward route and a reverse route in which the moving directions of the moving units are opposite to each other. The attribute information corresponding to each of the plurality of second paths includes attribute information corresponding to the forward path and the reverse path.

  In the route calculation method according to the present application, when the received starting point or destination is not located on the first nodal point and the first route recorded in the recording unit, the first point that is the shortest distance from the starting point or destination is Generate a new first node on the route, generate a new first route connecting the starting point or destination and the generated first first node, and calculate the route generated Using the new first node, the new first route, the first route at the shortest distance divided by the new first node, and the content recorded in the recording means, a predetermined attribute condition The route satisfying the above is calculated.

  In the route calculation method according to the present application, when the received starting point or destination is not located on the first nodal point and the first route recorded in the recording means, the first distance that is the shortest distance from the received starting point or destination. Create a new first node on the path. In the route calculation method, a new first route that connects the generated first first node and the received starting point or destination is generated. The route calculation method uses the generated new first node, the new first route, the first route at the shortest distance divided by the new first node, and the content recorded in the recording means. The first route and / or the second route satisfying the predetermined attribute condition are calculated.

  The route calculation method according to the present application is characterized in that the route calculation processing calculates the route that minimizes the sum of values related to attribute information corresponding to the first route and / or the second route, respectively. .

  In the route calculation method according to the present application, the first route and / or the second route satisfying a predetermined condition in which the sum of the values related to the attribute information corresponding to the first route and / or the second route is minimized is continuous. Calculate the route.

  In the route calculation method according to the present application, the attribute information is time information, and the process of calculating the route calculates the route having a minimum sum of values related to the time information.

  In the route calculation method according to the present application, the attribute information corresponding to the first route and / or the second route is time information. The route calculation method calculates a route in which a first route and / or a second route satisfying a predetermined condition that minimizes the sum of values related to time information is continuous.

  In the route calculation method according to the present application, a map including the information of the first route is recorded in the recording unit in advance, and the process of calculating the route is calculated in the map recorded in the recording unit. The first route is characterized by adding information of a continuous route.

  In the route calculation method according to the present application, a map including information on the first route is recorded in advance in the recording means. The route calculation method adds a method of dividing a route in which the calculated first route is continuous to the map recorded in the recording means.

  The route calculation apparatus according to the present application corresponds to the plurality of first nodes recorded in the recording unit, the plurality of first routes connected at one or both ends at the first node, and the plurality of first routes, respectively. In the route calculation device for calculating a route in which a plurality of first routes satisfying a predetermined attribute condition for a section from the departure point to the destination using the attribute information, the recording means includes the departure point to the destination. A plurality of first nodes and first paths corresponding to the moving means to move, a plurality of second paths each having one end connected to the plurality of first nodes, and attribute information corresponding to the plurality of second paths, respectively. And a second nodal point connecting the other ends of the plurality of second routes at one point, and receiving means for receiving the starting point and destination, and based on the starting point and destination received by the receiving means , Using the contents recorded in the recording means Characterized in that it comprises a means for calculating a path predetermined attribute satisfies the first path and / or second path are consecutive.

  In the route calculation device according to the present application, the recording means includes a plurality of first nodes corresponding to the moving means for moving from the departure place to the destination, and a plurality of one ends or both ends connected to the first nodes. Attribute information corresponding to the first route and the plurality of first routes is recorded. In addition, the recording means connects a plurality of second paths each having one end connected to the plurality of first nodes, attribute information corresponding to each of the plurality of second paths, and the other end of the plurality of second paths at one point. The second node to be recorded is recorded. The route calculation device receives a starting point and a destination. Then, the route calculation device uses the content recorded in the recording unit based on the received departure place and destination, and thereby the route in which the first route and / or the second route satisfying the predetermined attribute condition are continuous. Is calculated.

  According to the route calculation method and the like according to the present application, it becomes easy to create network data for route search using a simple algorithm.

It is a block diagram which shows the hardware constitutions of a route search apparatus. It is explanatory drawing which shows the component of a network. It is explanatory drawing which shows an example of the table layout of a path | route table. It is explanatory drawing which shows an example of the table layout of a nodal point table. It is explanatory drawing which shows an example of a route search input screen. It is explanatory drawing which shows the network in the real world. It is explanatory drawing which shows the integrated network which integrated the network of the real world and the network of the virtual world. It is explanatory drawing which shows an example of a route search result screen. It is explanatory drawing which shows an example of a route search result screen. It is explanatory drawing which shows an example of a route search result screen. It is a flowchart which shows an example of the procedure of a route search process. It is explanatory drawing which shows an example of the integrated network which does not contain a virtual node in the terminal station where four routes were connected. It is explanatory drawing which shows an example of the integrated network containing a virtual node in the terminal station where four routes were connected. It is explanatory drawing which shows an example of the table layout of a path | route table. It is explanatory drawing which shows an example of a route search input screen. It is explanatory drawing which shows the network in the real world. It is explanatory drawing which shows the integrated network which integrated the network of the real world and the network of the virtual world. It is explanatory drawing which shows an example of a route search result screen. It is a flowchart which shows an example of the procedure of a route search process. It is explanatory drawing for demonstrating the procedure of the process which newly produces | generates a node and an edge. It is a flowchart which shows an example of the procedure of the process which incorporates a new node and edge in the integrated network 3N. It is a block diagram which shows the hardware constitutions of a route search apparatus. It is a flowchart which shows an example of the procedure of the process which calculates | requires the shortest distance between each facility and each town chome. It is a flowchart which shows an example of the procedure of the process which classifies a town couch based on the total floor area of a facility. It is a graph which shows the validity evaluation matrix of facility installation. It is a flowchart which shows an example of the procedure of the process which produces | generates the assistance information for evaluating the validity of a facility.

  Hereinafter, a route search device (route calculation device) according to an embodiment of the present invention will be described with reference to the drawings illustrating embodiments. The route search device according to the present embodiment is, for example, a PC (personal computer), a notebook PC, a workstation, a tablet PC, a PDA (Personal Digital Assistant), a mobile phone, a smartphone, a game device, or the like. The route search apparatus may be a terminal used as an electronic book reader. Hereinafter, a PC will be described as an example of the route search device.

The processing executed by the route search device to present the route to the destination includes processing such as calculation, comparison, and rearrangement related to the cost (attribute information) associated with the route. The search processing is performed by the route search device. Part of the process to be executed. However, in general, in a service field that guides route information from a departure place to a destination, a process or action for examining a route is called route search. In the present embodiment, in accordance with this, even if the central processing for presenting route information from the departure place to the destination does not include the search processing, the processing for examining the route is widely referred to as route search.
Note that the present invention is not limited to the following embodiments.

Embodiment 1
FIG. 1 is a block diagram showing a hardware configuration of the route search apparatus 1. The route search apparatus 1 includes a control unit (accepting unit, calculating unit) 11, a RAM (Random Access Memory) 12, a hard disk (recording unit) 13, a disk drive 14, a communication unit 15, a timer 16, a display unit 17, and an operation unit. 18 is included. Each component of the route search apparatus 1 is connected via a bus 1b.

The control unit 11 is a processor such as a CPU (Central Processing Unit) or an MPU (Micro Processor Unit), and controls each component of the route search apparatus 1. The control unit 11 reads the program 1P recorded on the hard disk 13 into the RAM 12, and executes the read program 1P.
The RAM 12 temporarily records work variables, data, and the like necessary during the process of the control unit 11. The RAM 12 is an example of a main storage device, and a flash memory, a memory card, or the like may be used instead of the RAM 12.

The hard disk 13 records a program 1P, a route table 1T, a nodal point table 2T, and a map table 3T.
The program 1P searches for a route that minimizes the cost (attribute information) required for movement. The program 1P displays the search result on the display unit 17.
The route table 1T is a master table used by the program 1P for route search. In the route table 1T, the cost required for movement is recorded in association with the route.
The map table 3T stores a map to be superimposed on the route when the route of the search result is displayed on the display unit 17. The data of the map table 3T includes, for example, vector data and raster data. The map table 3T records addresses, place names, or facility names corresponding to points, lines, and polygons constituting the map in association with latitude and longitude. The map table 3T may be a map database made up of a plurality of tables.

  The hard disk 13 may be mounted inside the route search device 1 or may be placed outside the route search device 1. The hard disk 13 is an example of an auxiliary storage device such as a flash memory capable of recording a large amount of information, a CD (Compact Disc), a DVD (Digital Versatile Disk), a BD (Blu-ray Disc, registered trademark), or the like. The optical disk 1a may be substituted.

The disk drive 14 reads information from the optical disk 1a which is an external recording medium. The disk drive 14 records information on the optical disk 1a.
The communication unit 15 is a modem, a LAN (Local Area Network) card, or the like, and is connected to the communication network 1N. The communication network 1N includes a LAN, a WAN (Wide Area Network), the Internet, a VPN (Virtual Private Network), a telephone line, a satellite communication line, and the like.

The timer 16 transmits the time measurement result as a signal to the control unit 11.
The display part 17 has screens, such as a liquid crystal display, an organic EL (Electro-Luminescence) display, a plasma display, for example, and displays the various screens concerning the program 1P according to the instruction | indication from the control part 11. FIG. The display unit 17 may incorporate a speaker.

  The operation unit 18 includes input devices such as a keyboard, a mouse, and a touch panel on which a user performs various inputs. The operation unit 18 generates an input signal based on an operation by the user. The generated input signal is transmitted to the control unit 11 via the bus 1b.

Next, the operation of the route search apparatus 1 will be described.
Hereinafter, the transportation means related to route search includes public transportation used by an unspecified number of users. Public transport includes, for example, buses, railroads, subways, monorails, ropeways, ferries, passenger ships, airplanes, and the like.
The moving means handled by the route search device 1 includes walking. Transportation means a means of transportation other than walking.

  As a route calculation method of the program 1P, for example, a Dijkstra algorithm using an algorithm in graph theory is used. Note that the algorithm used by the route calculation method of the program 1P is not limited to the Dijkstra method, and may be, for example, the Bellman-Ford algorithm or the Warshall-Floyd Algorithm. Alternatively, the algorithm used by the route calculation method of the program 1P may be an A * algorithm (Aster algorithm), another algorithm, or the like.

FIG. 2 is an explanatory diagram showing components of the network 2N. The network 2N in FIG. 2 is a traffic network.
The network 2N includes a node (first node) 21 and an edge (first route) 22. The node 21 corresponds to a point (point, vertex) in the graph theory. The node 21 corresponds to a node in the route search. A node is, for example, a railway station, a bus stop, an airport, or the like, and is also a transfer facility that connects the same or different transportation means to each other.

The edge 22 corresponds to a line (line, edge, branch) in the graph theory. The edge 22 corresponds to a route in the route search. The route is, for example, a sidewalk, a bus route, an air route, a railroad track, or the like. The edge 22 has information on the moving direction. In FIG. 2, the moving direction of the edge 22 is indicated by an arrow. The edge 22 may include two of an outward path and a return path. The forward path and the return path here are paths in which the moving directions of the moving means are opposite to each other. Therefore, the forward path and the return path may be referred to as a forward path and a reverse path. For example, the forward route and the return route are an upstream railway track, a downstream railroad track, an upstream highway, a downstream highway, and the like. Both the outbound route and the inbound route can be routes to the destination depending on the search conditions. The forward path and the return path are paths for distinguishing and setting the moving direction. Therefore, for example, with respect to a double-track railway track, which of the upstream rail track and the downstream rail track is used as the forward route or the return route may be freely determined when the network 2N data is created.
In the example of FIG. 2, the edge 22 positioned at the upper side consists only of the forward path or the return path, whereas the edge 22 positioned below is composed of the forward path and the return path.

  The edge 22 is associated with a cost. The cost here is a cost required for movement, such as a movement distance, a movement time, and a charge.

  Nodes 21 are arranged at both ends of the edge 22, and the node 21 has a function of connecting the edges 22 to each other. However, there may be a node 21 that does not connect the edges 22 like the terminal station of the dead-end line.

The node 21 and the edge 22 exist for each type of moving means. For example, there are a node 21 and an edge 22 of a bus, and a node 21 and an edge 22 of a walk. The node 21 and the edge 22 of the bus are associated with a connection policy that defines the connection of the bus route. The walking node 21 and the edge 22 are associated with a connection policy that defines the connection of the sidewalk. In FIG. 2, the node 21 and the edge 22 positioned above and the node 21 and the edge 22 positioned below are components of the network 2N relating to the bus and the walk, respectively, and an example in which the moving means is different is shown.
Note that the node 21 and the edge 22 of the same moving means may be further subdivided as necessary. For example, the node 21 and the edge 22 of the bus may be further subdivided to define the node 21 and the edge 22 of the A bus route, the node 21 and the edge 22 of the B bus route, and the like.

  The network 2N includes a virtual node (second node) 23 and a virtual edge (second route) 24. The virtual node 23 and the virtual edge 24 are components of the network 2N that connects the nodes 21 of the same or different moving means when the user changes between the same or different moving means. The transfer of the same moving means corresponds to the case where, for example, even if the moving means is the same railway, the transfer is made from the A railway line to the B railway line.

In FIG. 2, the virtual edge 24 is indicated by a chain line. One end of the virtual edge 24 is connected to the node 21. In the example of FIG. 2, one end of the virtual edge 24 is connected to the node 21 on the bus route. One end of the virtual edge 24 is also connected to the walking node 21.
The virtual node 23 is a component of the network 2N that connects the virtual edges 24 to each other. In the example of FIG. 2, the other end of the virtual edge 24 connected to the node 21 on the bus route and the other end of the virtual edge 24 connected to the walking node 21 are connected by the virtual node 23.
Similar to the edge 22, the virtual edge 24 may include two of an outward path and a return path.

  The virtual node 23 and the virtual edge 24 are associated with a connection policy that defines the connection between the virtual node 23 and the virtual edge 24. In addition, when one end of the virtual edge 24 is connected, the node 21 is associated with a connection policy that defines connection with the virtual edge 24 in addition to a connection policy that defines connection with the edge 22. Therefore, for example, among the nodes 21 related to the bus in FIG. 2, the central node 21 is associated with a connection policy that defines connection with the edge 22 of the bus and a connection policy that defines connection with the virtual edge 24. Similarly, among the nodes 21 related to walking in FIG. 2, the central node 21 is associated with a connection policy defining a connection with the walking edge 22 and a connection policy defining a connection with the virtual edge 24.

  A cost is associated with the virtual edge 24. The cost here is a cost required for transfer of the same or different moving means, such as waiting time required for transfer, transfer time, walking distance, energy consumption, and the like.

Note that the waiting time is the time that the user waits when there is little or no movement due to walking or the like for changing when the user changes the moving means at the node 21. There are a case where the user moves for the transfer and a case where there is little or no movement as described above. Therefore, the waiting time is included in a broad transfer time.
For example, there are cases where the user moves on foot from a certain point to a bus stop, waits for 5 minutes at the bus stop, then gets on the bus and moves to another point. In this embodiment, since walking is included in the moving means, 5 minutes at the bus stop in the above case may be called a waiting time or a transfer time. If walking is not included in the moving means, 5 minutes at the bus stop in the above case is a waiting time.

  The node 21 and the edge 22 correspond to nodes and paths that exist in the real world, respectively. On the other hand, the virtual node 23 does not exist in the real world but exists only in the virtual space. The virtual edge 24 includes a case corresponding to a path existing in the real world and a case corresponding to a path not existing in the real world. Since the virtual edge 24 includes a case corresponding to a route that does not exist in the real world, the term “virtual” is given to the virtual edge 24 here.

  The route existing in the real world with respect to the virtual edge 24 is a moving route when a user who gets off the train from the train passes through the ticket gate of the station and moves to the bus stop in front of the station. On the other hand, for a route that does not exist in the real world with respect to the virtual edge 24, for example, a user who gets off from a bus of a certain route waits until the bus of another route arrives at the bus stop at the bus stop of the other route, This is the travel route when changing to a bus. Further, for a route that does not exist in the real world with respect to the virtual edge 24, for example, a user who gets off from an express train to the station platform waits until the ordinary train enters the platform at the platform where the train got off, and This is the travel route when transferring. When the virtual edge 24 corresponds to a route that does not exist in the real world, the user can be regarded as not moving due to the transfer of the moving means.

  The virtual edge 24 includes a case corresponding to a route that does not exist in the real world as described above. However, as long as the virtual edge 24 is connected to the network 2N between the departure point and the destination, for example, in the route search based on the Dijkstra method, the route search device 1 treats the virtual edge 24 as a search target route. Then, the route search device 1 extracts from the route table 1T the route with the minimum cost associated with the edge 22 and the virtual edge 24.

FIG. 3 is an explanatory diagram showing an example of the table layout of the route table 1T. The route table 1T includes columns of edge ID, name, moving distance, elapsed time, waiting time, and walking distance.
The edge ID is a symbol that identifies the edge 22 and the virtual edge 24. The route table 1T is associated with a graphic table (not shown) in which the positions of routes corresponding to the edge 22 and the virtual edge 24 are recorded. The graphic table is recorded on the hard disk 13 and includes each column of edge ID and position.
In the position row of the graphic table, the position of the route corresponding to the edge 22 and the virtual edge 24 is recorded by latitude and longitude. For example, in the position row, both end positions of the route and positions at predetermined distance intervals on the route are recorded in latitude and longitude. Therefore, by referring to the graphic table, the positions of the edge 22 and the virtual edge 24 corresponding to the edge ID can be extracted from the edge ID. However, in the case of a virtual edge 24 that does not exist, only the latitude and longitude of the position of the node 21 to which the virtual edge 24 is connected are recorded in the position column, and the position of the virtual node 23 to which the virtual edges 24 are connected is Not recorded.

  In the case of the edge 22, the name of the route table 1 </ b> T is a name indicating the name of the moving unit and the both end positions of the edge 22. Names indicating both end positions of the edge 22 are added in parentheses after the name of the moving means. For example, in the case of the edge 22 with the edge ID = 0002, the name “walking (X to Y)” indicates that the moving means is walking and both ends of the moving path are the X point and the Y point. In the case of edge 22 with edge ID = 0034, the name “bus (A01 to A02)” indicates that the moving means is a bus and both ends of the bus route are a bus stop A01 and a bus stop A02. .

  In the case of the virtual edge 24, the name is “virtual” and the name of the moving means of the node 21 to which the virtual edge 24 is connected. In the case of the virtual edge 24, the name of the node 21 to which the virtual edge 24 is connected is added in parentheses after the name of the moving means. For example, in the case of the virtual edge 24 with the edge ID = 0016, the name “virtual walking (A01)” indicates that the virtual edge 24 is connected to the walking node 21. In the case of the virtual edge 24 with the edge ID = 0016, the name “virtual walk (A01)” indicates that the virtual edge 24 is connected to the node 21 that changes to the bus at the bus stop A01. For example, in the case of the virtual edge 24 with the edge ID = 0039, the name “virtual bus (A01)” indicates the virtual edge 24 connected to the node 21 of the bus. Further, in the case of the virtual edge 24 with the edge ID = 0039, the name “virtual bus (A01)” indicates that the virtual edge 24 is connected to the node 21 to be transferred at the bus stop A01.

The moving distance is a moving distance by the moving means, and the unit is m.
The elapsed time is the time required for movement between the nodes 21, and is the time required when using the transportation facility or the time required when moving by walking. The unit of elapsed time is minutes. The elapsed time includes a waiting time or transit time of the transportation facility.

The waiting time is the time required for changing the moving means, and the unit is minutes. The waiting time is a cost associated with the virtual edge 24 and is not associated with the edge 22.
The waiting time includes an average time to wait at the node 21 to change from walking to transportation. The waiting time includes an average transfer time when moving between the nodes 21 by walking or the like for transfer of the same or different transportation. For example, moving between platforms within a railway station, moving between bus stops within a bus terminal, moving between different platform platforms within a subway station, and between a boarding area and the nearest bus stop. Including movement. That is, the waiting time of the route table 1T is the waiting time and transfer time for transferring the moving means.

  Note that the waiting time may be calculated in real time. In such a case, a timetable of transportation is recorded on the hard disk 13. The route search device 1 refers to the timetable and calculates the waiting time based on the time measured from the timer 16 and the scheduled transfer time (calculated from the elapsed time).

  The walking distance is a moving distance by walking, and its unit is m. The walking distance is a cost associated with the edge 22 where the moving means is walking. The walking distance is also a cost associated with the virtual edge 24 when the transfer of the moving means involves a movement by walking.

The route table 1T includes columns for toll, energy, CO ₂ , forward, reverse, and number of boarding.
The fee is a fare when moving between the nodes 21 using toll transportation, and the unit is, for example, a yen. FIG. 3 exemplifies an adult fee, but when a child fee is also handled, the fee column may be divided into an adult fee column and a child fee column. Furthermore, the toll train may be divided into classes such as a normal train fee and an express fee.

The energy is energy consumed when the user moves between the nodes 21 on foot, and the unit is kilocalories. The energy includes energy consumed when the user moves the virtual edge 24 by foot for transfer.
Note that the energy includes basal metabolic energy when the user only stands by without moving to change the transportation means. The energy may include energy consumption (power consumption) when the user moves the virtual edge 24 with the electric wheelchair for transfer.

CO ₂ is the amount of carbon dioxide exhausted from transportation moving between the nodes 21 or the amount of carbon dioxide related to power generation for operating the transportation, and the unit is gram. CO ₂ includes the amount of carbon dioxide released from the user's body by walking or waiting. However, since the amount of carbon dioxide discharged from the user by waiting for 1 or 2 minutes is very small, the amount of carbon dioxide in this case is approximated to 0 grams.

Forward and backward are flags indicating whether the edge 22 or the virtual edge 24 is the forward path or the backward path. When the edge 22 or the virtual edge 24 is the forward path, 1 is stored in the forward direction and 0 is stored in the reverse direction. When the edge 22 or the virtual edge 24 is a return path, 0 is stored in the forward direction and 1 is stored in the backward direction.
If the forward and backward directions are 1, 0, 0, and 1, respectively, this indicates that the edge 22 or the virtual edge 24 is one-way. For example, the virtual edge 24 with the edge ID = 0038 in FIG. 3 indicates the moving direction when the user gets off the bus at the bus stop A01. On the other hand, the virtual edge 24 of edge ID = 0039 in FIG. 3 indicates the moving direction when the user gets on the bus at the bus stop A01.

  When the forward and backward directions are 1, 1 respectively, it indicates that the edge 22 or the virtual edge 24 can pass in both directions. When the forward and backward directions are 0 and 0, respectively, it indicates that the edge 22 or the virtual edge 24 cannot pass in both directions. For example, even if a walking edge 22 is set on an expressway, 0 and 0 are stored in the forward and backward directions of the edge 22, respectively.

  The number of times of boarding is the number of times when the user gets on the transportation, boarding, boarding, etc., and the unit is times. The number of boarding times is a cost associated with the virtual edge 24 connected to the node 21 of the transportation facility. In the example of FIG. 3, the number of times of boarding is registered in the record of edge ID = 0039 corresponding to the virtual edge 24 connected to the node 21 on the bus route.

FIG. 4 is an explanatory diagram showing an example of the table layout of the nodal point table 2T. The node table 2T includes columns of node ID, name, and position.
The node ID is a symbol that identifies the node 21 and the virtual node 23.
In the case of the node 21, the name is the name of the moving means and the name of the position of the node 21. The name of the position of the node 21 is added after the name of the moving means in parentheses. For example, in the case of the node 21 with the node ID = 0001, the name “walking (XX memorial)” indicates that the moving means is walking and the name of the position is XX memorial. In the case of the node 21 with the node ID = 0050, the name “bus (A01)” indicates that the moving means is a bus and the position name is a bus stop A01.

  In the case of the virtual node 23, the name is obtained by adding the name of the position of the transit node 21 to which the virtual node 23 is related in parentheses to “virtual node”. For example, in the case of the virtual node 23 with the node ID = 0056, the name “virtual node (A01)” indicates that the node is the virtual node 23 and is related to the transfer at the bus stop A01.

The position is a latitude / longitude indicating the position of the node 21 or the virtual node 23. Since the virtual node 23 exists only in the virtual space, its position is blank. Even the nodes 21 of different moving means may have the same position. The node ID = 0028 and the node ID = 0050 in FIG. 4 are examples in which the moving units correspond to different walks and buses, but the positions are the same.
The connection between the node 21 and the edge 22 or the connection between the node 21 and the virtual edge 24 is determined from the identity between the position of the node 21 and the position of the edge 22 or the end of the virtual edge 24.
It should be noted that a graphic table corresponding to the node 21 and the virtual node 23 may be separately prepared in the hard disk 13, and information on the position sequence of the nodal point table 2T may be recorded in the graphic table.

  The hard disk 13 is separately recorded with a connection table (not shown) that defines connections between the node 21 and the edge 22 and the virtual edge 24 and connections between the virtual node 23 and the virtual edge 24. The connection table is a table that records the node ID of the node table 2T in association with the edge ID of the route table 1T. The connection table is also a table that defines a connection policy between the node 21 and the edge 22 and the virtual edge 24 and a connection policy between the virtual node 23 and the virtual edge 24.

FIG. 5 is an explanatory diagram showing an example of the route search input screen 5f. The route search input screen 5f is a screen for the user to input route search conditions for route search executed by the route search device 1.
The route search input screen 5f includes a departure place text box 51c, a destination text box 52c, and a map display button 53c. The departure place text box 51c and the destination place text box 52c are screen controls for the user to input a departure place and a destination for route search, respectively, from the keyboard of the operation unit 18 with latitude and longitude.

  The starting point and the destination can also be input by clicking on the operation unit 18. In such a case, the user presses the map display button 53c. When the map display button 53c is pressed, the route search device 1 reads the map table 3T and displays the read map in another window (not shown) of the display unit 17. When the user clicks the position of the departure point and the destination once on the map displayed in this separate window, the latitude and longitude corresponding to the clicked position are displayed in the departure place text box 51c and the destination text box 52c. Entered.

When the latitude and longitude of the departure place and the destination are input in the departure place text box 51c and the destination place text box 52c, respectively, the route search device 1 reads the address, place name or facility name including the departure place or the destination from the map table 3T. Search for. The route search device 1 displays the searched address, place name, or facility name on the right side of the departure place text box 51c and the destination place text box 52c, respectively. In the example of FIG. 5, the XX Memorial Hall and the YY Town 3-chome are displayed on the right side of the departure place text box 51c and the destination text box 52c, respectively.
The route search device 1 receives an address, a place name or a facility name including the departure place and the destination from the user, the latitude and longitude of the departure place and the destination from the received address, place name or facility name, and the map table 3T. You may search using it.

The route search input screen 5f includes combo boxes 54c, 55c, 56c, and 57c.
Each combo box 54c to 57c is a screen control for designating the cost of the search condition. What combo box 54c~57c also, including time required, fee, boarding coupon, walking distance, each selected item of energy and CO _2. The user sets the cost that he / she wants to be most important in the combo box 54c of cost 1. Hereinafter, the cost to be emphasized is selected and set in the order of the combo boxes 54c to 57c with the smallest cost numbers. Then, the route search device 1 sets the route search conditions so that the total cost is minimized in the order in which the costs are specified. When the user does not specify a cost using the combo boxes 54c to 57c, the route search device 1 uses the shortest required time as a search condition by default.

The route search input screen 5f includes a clear button 58c and a search execution button 59c.
When each search condition is set and the clear button 58c is pressed, the route search device 1 clears the value of each screen control on the route search input screen 5f. When each search condition is set and the search execution button 59c is pressed, the route search device 1 searches for a route based on the search condition and information in the route table 1T.

Hereinafter, the operation of the route search apparatus 1 will be described with a simple example. The search condition is the shortest required time.
FIG. 6 is an explanatory diagram showing the network 2N in the real world. The black circles at the left end and the right end in FIG. 6 indicate the starting point 1n and the destination 8n, respectively. The starting point 1n and the destination 8n are nodes 21. Six nodes 2n, 3n, 4n, 5n, 6n, and 7n are distributed between the starting point 1n and the destination 8n, and these nodes are also nodes 21. A solid line connecting the nodes 21 in FIG. 6 is a walking edge 22. On the other hand, the broken line is the edge 22 of the bus route. For the sake of simplicity, the edge 22 of the bus route is shown only in the forward direction, and the directionality thereof is indicated by an arrow. However, there are two bus routes shown in FIG. The bus route passing through the nodes 2n, 3n and 4n is the A bus route, and the bus route passing through the nodes 5n, 6n and 7n is the B bus route.

Nodes 2n, 3n, and 4n are bus stops on the A bus route, and correspond to bus stops A01, A02, and A03, respectively. Nodes 5n, 6n, and 7n are bus stops on the B bus route, and correspond to bus stops B01, B02, and B03, respectively.
At nodes 2n to 7n in FIG. 6, the walking edge 22 and the bus route edge 22 intersect. The nodal points 2n to 7n are drawn one by one in FIG. 6, but a walking node 21 and a bus route node 21 are located for each nodal point 2n to 7n. In FIG. 6, at the nodes 2n to 7n, the walking node 21 and the bus route node 21 are drawn so as to overlap each other. In FIG. 6, reference numerals of the walking node 21 and the bus route node 21 are omitted.

  FIG. 7 is an explanatory diagram showing an integrated network 3N that integrates a real-world network 2N and a virtual-world network 2N. The integrated network 3N will be described later. In FIG. 7, the nodes 2 n to 7 n in FIG. 6 are divided into a walking node 21 and a bus route node 21. The route search apparatus 1 treats the walking node 21 and the bus route node 21 as different nodes 21 in the route search, and searches for the route.

  In FIG. 7, the walking edge 22 and the bus route edge 22 are indicated by a simplified solid line, and the virtual edge 24 is indicated by a simplified straight chain line. In FIG. 7, the reference numerals of the edge 22 and the virtual edge 24 are omitted in order to avoid complexity. Moreover, in FIG. 7, the symbols of the nodal points 1n to 8n are also omitted. The names of the corresponding bus stops A01, A02, A03, B01, B02, and B03 are attached to the walking node 21 and the bus route node 21, respectively. The walking node 21 and the bus route node 21 are connected by a virtual edge 24 -a virtual node 23 -a virtual edge 24. For example, the walking node 21 corresponding to the bus stop A01 and the node 21 on the A bus route corresponding to the bus stop A01 are connected by a virtual edge 24-virtual node 23-virtual edge 24. The time written to the edge 22 and the virtual edge 24 is a movement time and a waiting time associated with the edge 22 and the virtual edge 24, respectively.

  When the user moves from the node 21 at the departure point 1n to the node 21 at the destination 8n in FIG. 7, the user may change to a bus or may pass by the bus stop without changing to the bus and continue moving on foot. In some cases. When the user switches from walking to bus movement, the user waits for the bus at the bus stop and gets on the bus. This transfer action causes a waiting time for the bus, but the walking distance for changing is zero. Here, even if the user moves slightly near the bus stop, it is ignored as the moving distance from the departure point 1n to the destination 8n. In addition, when the user gets off the bus at the bus stop and switches to walking movement, the moving distance by getting off is zero.

  When the moving means is a combination of walking and bus as in the example of FIG. 7, the virtual edge 24 corresponds to a route that does not exist in the real world. That is, the virtual edge 24 in such a case exists only in the virtual space. Also, the virtual node 23 that connects the virtual edges 24 exists only in the virtual space. From this, it can be said that FIG. 7 shows a network 2N in which the real world and the virtual world are integrated. Hereinafter, the network 2N that integrates the real world and the virtual world is referred to as an integrated network 3N.

Each record of edge ID = 0016, 0017, 0038, 0039 of the route table 1T shown in FIG. 3 is a virtual edge 24 between the walking node 21 and the node 21 of the A bus route in the bus stop A01 shown in FIG. Corresponds to each record.
For example, the record with edge ID = 0017 shown in FIG. 3 corresponds to the virtual edge 24 from the walking node 21 to the virtual node 23 at the bus stop A01. The forward of edge ID = 0017 is 1 and the backward is 0. The record with the edge ID = 0039 corresponds to the virtual edge 24 heading from the virtual node 23 which is the end point of the virtual edge 24 corresponding to the edge ID = 0017 to the node 21 on the A bus route in the bus stop A01. The forward of the edge ID = 0039 is 1, the backward is 0, and the waiting time is 1 minute. The virtual edge 24 corresponding to the edge ID = 0017 and the edge ID = 0039 corresponds to the boarding action on the bus, and the number of times of boarding associated with the virtual edge 24 of the edge ID = 0039 is one.

  For example, the record of edge ID = 0038 shown in FIG. 3 corresponds to the virtual edge 24 from the node 21 on the A bus route to the virtual node 23 at the bus stop A01. The forward of the edge ID = 0038 is 0, and the backward is 1. The record with the edge ID = 0016 corresponds to the virtual edge 24 heading from the virtual node 23 which is the end point of the virtual edge 24 corresponding to the edge ID = 0038 to the walking node 21 in the bus stop A01. The forward of the edge ID = 0016 is 0, and the backward is 1. The virtual edge 24 corresponding to the edge ID = 0038 and the edge ID = 0016 corresponds to the getting-off action from the bus to the bus stop A01. Since no waiting time occurs in the action of getting off the bus, 0 minutes is set as the waiting time associated with the virtual edge 24 with the edge ID = 0038.

In addition, when a time cost generate | occur | produces from the moving means including a bus | bath, a time cost may be matched with the virtual edge 24 corresponding to alighting action. For example, when a user who moves in a wheelchair gets out of the moving means, when an assistance action of an assistant is required, a time cost may be appropriately associated with the virtual edge 24 corresponding to the getting-off action.
In FIG. 3, since the waiting time is set for the record with edge ID = 0039, the waiting time for edge ID = 0017 is set to 0 minutes. However, the time cost may also be associated with the virtual edge 24 of edge ID = 0017 that connects the walking node 21 and the virtual node 23 at the bus stop A01. For example, when traveling with the wheelchair mentioned above, it takes time to check the safety when boarding, or when it takes time to purchase a boarding ticket, boarding pass or boarding pass, etc. A time cost may be associated with the virtual edge 24. Similarly, a time cost may be appropriately associated with the virtual edge 24 corresponding to the dismounting action.

When the route search is executed by the Dijkstra method or the like, the processing by the route search apparatus 1 is lighter when the time cost associated with one route is one than the plurality. Alternatively, route search processing by the Dijkstra method or the like is lighter if one time cost corresponds to one route. For this reason, when a transfer means is changed, a virtual edge 24 associated with a time cost other than the waiting time or the transfer time is required when the route search is performed in consideration of the time cost other than the waiting time or the transfer time. .
In the present embodiment, there are two virtual edges 24 connected to the node 21 of the walking route and the virtual edge 24 connected to the node 21 of the walking route when changing between the walking and the bus route. For this reason, one virtual edge 24 can be associated with a waiting time or a transfer time, and another virtual edge 24 can be associated with a time cost other than the waiting time or the transfer time. As described above, when the number of virtual edges 24 relating to the transfer of the moving means is two, the route search can be easily extended to one added with a waiting time or a time cost other than the transfer time.

  On the other hand, for example, at the bus stop A01, the walking node 21 and the node 21 on the A bus route can be connected by only one virtual edge 24. However, in such a case, since only one virtual edge 24 can be associated with the temporal cost, only one type of temporal cost can be considered in the transfer.

  For example, at the bus stop A01, the walking node 21 and the node 21 on the A bus route may be connected by three or more virtual edges 24 connected in series. In such a case, the virtual nodes 23 that connect the virtual edges 24 must be prepared by the number of the virtual edges 24 that have increased, but it is possible to perform a route search in consideration of three or more time costs when switching.

  In the above description, the movement cost has been described by taking the time cost as an example of the cost. However, it goes without saying that the cost associated with the virtual edge 24 is not limited to the time cost.

When the search execution button 59c on the route search input screen 5f in FIG. 5 is pressed, the route search device 1 executes a route search and displays the search result on the route search result screen. The route search result screen is a screen on which the result of route search is displayed.
FIG. 8 is an explanatory diagram showing an example of the route search result screen 8f. The route search result screen 8f includes a list tab 81t, a sheet tab 82t, and a map tab 83t. FIG. 8 shows a state in which the list tab 81t is displayed.

  The list tab 81t is a sub-screen that displays a list of route search results. The list tab 81t includes a departure place label 81c, a destination label 82c, a total travel distance label 83c, a required time label 84c, and a charge label 85c. On the right side of each label, search results corresponding to each label are displayed. The numerical value of the search result displayed on the list tab 81t is equal to the total value displayed on the sheet tab 82t described later.

On the right side of the departure place label 81c and the destination label 82c, the address, place name, or facility name of the departure place and the destination are displayed, respectively. The latitude and longitude of the departure point and destination are also displayed.
On the right side of the total movement distance label 83c, the total movement distance from the departure place to the destination is displayed in km.
On the right side of the required time label 84c, the total required time required for movement including the waiting time, transfer time, etc. is displayed in minutes.
On the right side of the fee label 85c, the total fee for transportation used for movement is displayed in, for example, a circle.

The list tab 81t includes a transfer frequency label 86c, a walking distance label 87c, a calorie consumption label 88c, and an exhausted CO ₂ amount label 89c.
On the right side of the number-of-transfers label 86c, the number of times of transportation used for movement, that is, the total number of transfers, is displayed in times.
On the right side of the walking distance label 87c, the total walking distance moved by walking is displayed in km.
On the right side of the consumed calorie label 88c, the energy consumption of the user consumed by walking or the like is displayed in kcal.
On the right side of the exhausted CO ₂ amount label 89c, the amount of carbon dioxide originating from fossil fuel generated for transportation operation and the amount of carbon dioxide released from the user's body when the user moves are displayed in g. The

FIG. 9 is an explanatory diagram showing an example of the route search result screen 8f. When the tab portion of the sheet tab 82t is clicked, the sheet tab 82t is displayed. FIG. 9 shows a state where the sheet tab 82t of the route search result screen 8f is displayed. The sheet tab 82t is a sub-screen that displays the route information of the route search result in the form of a table in the order of movement.
The sheet tab 82t includes a list 90c. In the list table 90c, the attribute data of the edge 22 and the virtual edge 24 extracted from the route table 1T by the route search is displayed in the order of the movement route. The last line of the list table 90c displays the total value of each cost extracted from the route table 1T.

The list table 90c includes each column of a route, a moving means, and a section. The normal route is a number indicating the moving order of the moving route. A moving means is a moving means and a transfer action in each route. For example, walking on route = 1, route = 3 bus is a moving means, and getting off on route = 2 ride, route = 4 indicates a transfer action. The section is the name of the movement start position and movement end position of each route.
The list 90c includes columns for travel distance, elapsed time, waiting time, walking distance, fee, energy, CO ₂ and number of boarding. These columns are the same as the columns of the corresponding route table 1T, respectively.

FIG. 10 is an explanatory diagram showing an example of the route search result screen 8f. When the tab portion of the map tab 83t is clicked, the map tab 83t is displayed. FIG. 10 shows a state where the map tab 83t is displayed. The map tab 83t is a sub-screen that displays a map showing the searched route.
FIG. 10 shows an example of presenting the route searched by the route search process in a simplified manner. The route search device 1 generates an image in which the search route is superimposed on the map read from the map table 1T. The route search device 1 displays the generated image on the map tab 83t. The search path is highlighted by a thick line or a brightly colored thick line. Alternatively, the search route may be displayed blinking. In the example of FIG. 10, the search path is indicated by a bold line.

  The route search device 1 generates an image to be displayed on the map tab 83t by superimposing the map layer and the search route layer. However, the map may be generated in other ways. For example, a map composed of vector data having points, lines, and polygons is recorded in the map table 1T. The route search device 1 may generate an image to be displayed on the map tab 83t by reading a map from the map table 3T and changing the color or line width of the line portion corresponding to the search route for the read map.

FIG. 11 is a flowchart illustrating an example of a procedure of route search processing.
The control unit 11 receives search conditions such as a departure place, a destination, and a cost (step S101). When the search condition regarding the cost is not input from the route search input screen 5f, in step S101, the control unit 11 sets that the total required time is the shortest as the cost condition. The control unit 11 reads the route table 1T and the nodal point table 2T into the RAM 12 (step S102).

  Based on the data in the route table 1T and the nodal point table 2T, the control unit 11 searches for a route that satisfies the accepted search condition (step S103). In step S103, the search result acquired by the control unit 11 includes the order in which the user moves the route and the route information. The route information here includes information of the route table 1T associated with the route, and is information displayed on the list 90c of the sheet tab 82t of the route search result screen 8f, for example. In step S <b> 103, the control unit 11 records the search result in the RAM 12.

The control unit 11 adds up the costs included in the route information of the search result (step S104). The cost added in step S104 corresponds to the value of the total row of the list 90c, for example.
In step S104, the control unit 11 records the summed data in the RAM 12. In step S104, the control unit 11 extracts the value of the item to be displayed on the list tab 81t, and records the extracted value in the RAM 12.

  The control unit 11 reads the map table 3T into the RAM 12 (Step S105). In step S105, the control unit 11 extracts a map of the area including the route of the search result from the map table 3T. The control part 11 produces | generates the image superimposed on the map which extracted the path | route of the search result (step S106). The image generated in step S106 is an image displayed on the map tab 83t of the route search result screen 8f, for example. In step S <b> 106, the control unit 11 records the generated image in the RAM 12.

  The control unit 11 displays the route search result screen 8f on the display unit 17 (step S107), and ends the process. The route search result screen 8f displayed in step S107 is an initial screen in which the list tab 81t is selected. The control unit 11 reads the value recorded in the RAM 12 in step S104 from the RAM 12, and sets the read value in each item of the list tab 81t.

When the tab portion of the sheet tab 82t of the route search result screen 8f is clicked by the user, the control unit 11 reads the data recorded in the RAM 12 in steps S103 and S104 from the RAM 12, and displays the read data on the sheet tab 82t.
When the tab portion of the map tab 83t of the route search result screen 8f is clicked by the user, the control unit 11 reads the image from the RAM 12 in step S106, and displays the read image on the map tab 83t.

According to the route search device 1, it is easy to create network data for route search using a simple algorithm.
It is not easy to search for a route that takes into consideration the waiting time of transit facilities, transfer time, etc. using only a simple algorithm such as the Dijkstra method. This is because the cost used for the search condition is associated with the edge 22, but the edge 22 associated with the cost does not exist in the real world when there is no movement due to walking or the like to change transportation. Therefore, even if there is no movement due to walking or the like for transfer, the cost can be associated with the virtual edge 24 by connecting the nodes 21 related to transfer of transportation with the virtual edge 24. Thus, by sequentially tracing the edge 22 and the virtual edge 24, a route search can be performed in consideration of the waiting time of the transportation facility, the transfer time, etc. even with a simple algorithm such as Dijkstra method.

When costs such as waiting time and transfer time are incorporated in the route search without using the virtual edge 24, a file, table, database, or the like in which costs such as waiting time and transfer time are recorded is required in addition to the route information. In such a case, a simple route search process using the Dijkstra method or the like adds a process in which the processor reads the above-mentioned file and adds the costs such as the waiting time and transfer time to the required time due to the operation of the moving means. This leads to new program development, increased load on the processor, increased computer resources, and the like.
However, the route search by the route search apparatus 1 does not require algorithm expansion, original program development, creation of complicated network data, and the like. In order to execute the route search by the route search apparatus 1, it is only necessary to construct the integrated network 3N and associate the costs with the edge 22 and the virtual edge 24.

According to the route search device 1, the data creation amount of the virtual edge 24 can be minimized.
Suppose that there is a terminal station to which four routes are connected. When changing between two lines at the station, ₄ C ₂ = 6 ways are possible.
FIG. 12 is an explanatory diagram illustrating an example of the integrated network 3N that does not include the virtual node 23 in a terminal station to which four routes are connected. The edge 22 is indicated by a solid line, and the virtual edge 24 is indicated by a chain line. In this terminal station, four edges 22 meet, and there is a node 21 at one end of each edge 22 toward the station. A total of four nodes 21 are connected by virtual edges 24, and the total number of virtual edges 24 is six.
FIG. 13 is an explanatory diagram showing an example of the integrated network 3N including the virtual node 23 at a terminal station to which four routes are connected. The edge 22 is indicated by a solid line, and the virtual edge 24 is indicated by a chain line. In this terminal station, four edges 22 meet, and there is a node 21 at one end of each edge 22 toward the station. A total of four nodes 21 are connected by virtual edge 24 -virtual node 23 -virtual edge 24, and the total number of virtual edges 24 is four.

In both the case of FIG. 12 and the case of FIG. 13, route search by the Dijkstra method or the like is possible. However, as shown in FIGS. 12 and 13, when the virtual node 23 is introduced, the number of virtual edges 24 to be created is smaller. For example, assuming a terminal station to which n routes are connected, the number of virtual edges 24 to be created is _n C ₂ = n × (n−1) / 2 when the virtual node 23 is not introduced. When virtual nodes 23 are introduced, _n C ₁ = n. In other words, as the number of types of transferable transfer means increases beyond four, the data construction of the integrated network 3N becomes much easier when the virtual nodes are introduced.

  In the integrated network 3N, the waiting time of the moving means, the transfer time, etc. may be associated with the node 21 related to the transfer. However, in such a case, branch processing occurs every time the route search moves on the edge 22 and reaches the node 21, so that there is a disadvantage that a program based on an algorithm that extends the Dijkstra method or the like must be newly developed. . In addition, since the number of steps of the newly developed program is increased by branch processing, a load is applied to hardware such as a processor and a memory, and a search speed is also reduced.

  The virtual edge 24 includes a case where it corresponds to a route that exists in the real world and a case that corresponds to a route that does not exist in the real world when the moving means is changed. However, the virtual edge 24 may correspond only to a route that does not exist in the real world when the moving means is changed. In such a case, when the transfer means is changed, an edge 22 such as a walk is associated with the transfer route existing in the real world.

  In addition to the virtual edge 24 and the virtual node 23 connected in series, the nodes 21 related to the transfer of the same or different moving means may be connected by a virtual edge 24 and a virtual node 23 connected in parallel or in a mesh shape. For example, there are cases where the route moving between the nodes 21 related to the transfer branches in various ways due to differences in moving means such as walking, escalators, elevators, moving walkways and the like. There is a case where a waiting time is generated in the moving means for these transfers. In addition, even when moving on foot for transfer, a large airport, a railway station, or the like usually has a plurality of transfer routes instead of a single transfer route. Accordingly, by connecting the nodes 21 related to the transfer by the virtual edge 24 and the virtual node 23 connected in parallel or in a mesh shape, it is possible to set the time cost according to the case when transferring.

  When the virtual edge 24 and the virtual node 23 are connected in series, parallel connection, or network connection between the nodes 21 related to the transfer of the same or different moving means, the two nodes 21 related to the transfer are set as the departure point and the destination. Also good. In such a case, the route search apparatus 1 searches for the route between the nodes 21 related to the transfer based on the designated cost condition, and the edge 22 is not included in the route of the search result.

  The program 1P may be a program related to geographic information system (GIS) software equipped with a route search engine. The geographic information system software is, for example, ArcGIS (registered trademark), TNTlite, STIMS, or the like. Since the geographic information system software has map information, the map table 3T is not necessary when the geographic information system software is used. Data corresponding to the route table 1T is stored in an attribute table managed by the geographic information system software. Even if the data of the integrated network 3N is constructed for the geographic information system software, the same route search as that of the present embodiment is possible. In addition, the geographic information system software can perform data analysis, data management, data collection, data sharing, and the like regarding GIS data including map information. Therefore, the route search device 1 may acquire a route search result as one of the geospatial data, and use the acquired route search result in various geographic information analysis models.

Embodiment 2
The second embodiment relates to a mode in which a cost associated with the edge 22 or the virtual edge 24 is added to the route table 1T. In the second embodiment, an example of route search for a subway will be described.

FIG. 14 is an explanatory diagram showing an example of a table layout of the route table 1T. The route table 1T includes the columns shown in FIG. 14 in addition to the columns shown in FIG.
The route table 1T includes columns for uplink, downlink, start time, and end time. The names in FIG. 14 are described according to the same rules as the names in FIG.

Uphill is an altitude difference when the user moves from a node 21 with a low altitude to a node 21 with a high altitude by walking or the like to change the means of transportation, and the unit is m. Downhill is an altitude difference when the user moves from a node 21 with a high altitude to a node 21 with a low altitude by walking or the like to change the means of transportation, and the unit is m. Up and down are costs associated with the virtual edge 24.
In FIG. 14, for example, a record with edge ID = 0082 shows a virtual edge 24 connected to the node 21 (named AD station) of the subway D line, and the user has a lower altitude by walking because of a transfer at the AD station. When moving to 21, it indicates that the down value is 25 m.

The start time and the end time are a start time and an end time, respectively, during which the transportation facility can be operated. The start time and end time are costs associated with the edge 22.
In FIG. 14, for example, the record of edge ID = 0051 corresponds to the edge 22 from the A station on the subway A line to the AD station, and indicates that the first departure time is 5: 1 and the last train time is 23:57. ing. Thereby, the available time of the subway A line between A station and AD station in route search is controlled.

FIG. 15 is an explanatory diagram showing an example of the route search input screen 15f. The route search input screen 15f of FIG. 15 has screen controls for setting departure time or arrival time as route search conditions with respect to the route search input screen 5f of FIG.
Combo boxes 54c~57c route search input window 15f is required time, including rates, the boarding coupon, walking distance, energy, CO _2, and each choice of uplink and downlink. When selecting a route with the smallest sum of the altitude differences of the uphill, the uphill is set by the combo boxes 54c to 57c. When selecting a route with the minimum total altitude difference of the downhill, the downhill is set by the combo boxes 54c to 57c. It should be noted that an item for designating a route that minimizes the sum of the uplink and downlink values may be added to the combo boxes 54c to 57c.

The route search input screen 15f includes radio buttons 60c and 61c. The user selects the radio button 60c when setting the departure time in the search condition. The user selects the radio button 61c when setting the arrival time in the search condition. By default, the departure time setting radio button 60c is selected.
The route search input screen 15f includes combo boxes 62c, 63c, and 64c. The user sets the departure time or arrival time from the combo boxes 62c, 63c, and 64c according to the year, month, day, hour and minute. By default, the current time measured by the timer 16 is set in the combo boxes 62c, 63c, and 64c.

When the departure time is designated, the route search device 1 selects, as a route, the edge 22 corresponding to all the transportations operating after the departure time among the transportations operating on the integrated network 3N.
When the arrival time is designated, the route search device 1 selects, as a route, the edge 22 corresponding to all the transportations operating before the arrival time among the transportations operating on the integrated network 3N.
In the present embodiment, when the departure time is designated, the route search device 1 uses the edge 22 corresponding to the train that operates after the departure time among the trains that operate on the integrated network 3N of the subway as a route. select. When the arrival time is designated, the route search device 1 selects, as a route, an edge 22 corresponding to a train that operates before the arrival time among trains that operate on the integrated network 3N of the subway.

  When the departure time is designated, the route search device 1 displays the estimated arrival time on the sheet tab 82t. When the arrival time is designated, the route search device 1 displays the scheduled departure time on the sheet tab 82t.

  Next, the operation of the route search apparatus 1 will be described. In the following, the first requirement for cost 1 is that the total required time is the shortest, the second condition for cost 2 is that the difference in total uplink altitude is the minimum, and the third condition for cost 3 is that the total difference in total downlink is the minimum. Assume that there are three conditions. Further, it is assumed that the departure time is set on the route search input screen 15f.

  FIG. 16 is an explanatory diagram showing the network 2N in the real world. The black circles at the left end and the right end in FIG. 16 indicate the starting point 9n and the destination 13n, respectively. The starting point 9n and the destination 13n are nodes 21 and are also subway stations. Three nodes 10n, 11n, 12n are distributed between the starting point 9n and the destination 13n, and these nodes are also nodes 21 and subway stations. In FIG. 16, the symbol of the node 21 is omitted.

  The solid line connecting the nodes 21 in FIG. 16 is the edge 22 of the subway. The subway edge 22 is shown only for the sake of simplicity, and its direction is indicated by an arrow. However, the subway shown in FIG. 16 has four lines. The subway that passes through nodes 9n, 10n, and 11n is the A line, the subway that passes through nodes 11n and 12n is the B line, the subway that passes through nodes 12n and 13n is the C line, and the subway that passes through nodes 10n and 12n Is D line.

  Nodes 9n, 10n, and 11n are A-line subway stations, and are referred to as A station, AD station, and AB station, respectively. Nodes 11n and 12n are B-line subway stations, and are called AB and BCD stations, respectively. Nodes 12n and 13n are C-line subway stations and are called BCD station and C station, respectively. Nodes 10n and 12n are D-line subway stations, which are called AD and BCD stations, respectively. In addition, AD station is a transfer station of A line and D line. AB station is a transfer station between A line and B line. The BCD station is a transfer station for B, C and D lines.

  The nodal points 10n, 11n, and 12n in FIG. 16 are connected to the edge 22 of the A line and the D line, the edge 22 of the A line and the B line, and the edge 22 of the B line, the C line, and the D line, respectively. The nodal points 10n, 11n, and 12n are drawn one by one in FIG. 16, but nodes 21 of different subway lines are located at the nodal points 10n, 11n, and 12n, respectively. At the node 10n, the node 21 on the A line and the node 21 on the D line overlap. At the node 11n, the node 21 on the A line and the node 21 on the B line overlap. At the node 12n, the B-line node 21, the C-line node 21, and the D-line node 21 overlap.

FIG. 17 is an explanatory diagram showing an integrated network 3N that integrates a real-world network 2N and a virtual-world network 2N. In FIG. 17, the nodal points 10 n, 11 n, and 12 n in FIG. 16 are illustrated by being divided into nodes 21 for each route. In FIG. 17, the symbols of the nodal points 9n, 10n, 11n, 12n, and 13n are omitted.
In the route search, the route search device 1 treats the node 21 of each route as a different node 21 and searches for a route.

  In FIG. 17, the edge 22 of each route is indicated by a simplified straight solid line, and the virtual edge 24 is indicated by a simplified straight chain line. In FIG. 17, the reference numerals of the edge 22 and the virtual edge 24 are omitted in order to avoid complexity. The names of the corresponding subway stations A, AD, AB, BCD, and C are given to the nodes 21 of the respective lines. The node 21 corresponding to the AD station on the subway A line and the node 21 corresponding to the AD station on the subway D line are connected by a virtual edge 24-virtual node 23-virtual edge 24.

  Similarly, the node 21 corresponding to the AB station on the subway A line and the node 21 corresponding to the AB station on the subway B line are also connected by the virtual edge 24 -the virtual node 23 -the virtual edge 24. Further, a node 21 corresponding to the BCD station on the subway B line and a node 21 corresponding to the BCD station on the subway C line, and a node 21 corresponding to the BCD station on the subway D line and a node 21 corresponding to the BCD station on the subway C line. Are connected by virtual edge 24 -virtual node 23 -virtual edge 24, respectively. The numerical value attached to the virtual edge 24 is an altitude difference between the up and down directions associated with the virtual edge 24.

  Note that the BCD station is a transfer station where three lines of the B line, the C line, and the D line merge. In FIG. 17, two virtual nodes 23 corresponding to the BCD station are drawn. However, actually, as shown in FIG. 13, there is one virtual node 23 corresponding to the BCD station. In FIG. 17, in order to show the connection between the virtual node 23 and the virtual edge 24 in a two-dimensional manner in an easy-to-understand manner, two virtual nodes 23 corresponding to the BCD station are drawn for convenience.

  In the case of the example shown in FIG. 16 or FIG. 17, there are two routes to be searched. That is, the route to be searched is the first course of A station (departure point) -AD station-AB station-BCD station-C station (destination) and A station (departure point) -AD station-BCD station-C. It is the second course of the station (destination). Assume that both routes have the same total required time corresponding to the first condition of cost 1. Therefore, the route search device 1 searches for a route that satisfies the second condition of the cost 2 with the smallest total difference in uplink height.

  From FIG. 17, the difference in total climb height for the first course is 6 m, and the total difference in climb height for the second course is 12 m. Therefore, the route search device 1 displays the route search result screen 8f with the first course having the smaller total difference in ascent as the search result.

FIG. 18 is an explanatory diagram showing an example of the route search result screen 8f. When the tab portion of the sheet tab 82t is clicked, the sheet tab 82t is displayed. FIG. 18 shows a state where the sheet tab 82t of the route search result screen 8f is displayed.
In the list 90c, the route of the first course is displayed in ascending order according to the normal route. Below the list 90c, the designated departure time and estimated arrival time are displayed. The designated departure time and estimated arrival time are displayed when the departure time is set on the route search input screen 15f. When the arrival time is set on the route search input screen 15f, the scheduled departure time and the designated arrival time are displayed below the list 90c.

  FIG. 19 is a flowchart illustrating an example of a procedure of route search processing. FIG. 19 shows an example of the procedure of processing inserted between step S104 and step S105 of FIG. In FIG. 19, the process before step S104 and the process after step S105 are omitted. In the route search process of FIG. 19, when the last train time of the subway elapses, the control unit 11 sets the waiting time from the stop time of the subway at the end of the day of departure to the start time of the next subway. To do.

  The control unit 11 determines whether or not the departure time is designated on the route search input screen 15f (step S201). When it is determined that the departure time is designated on the route search input screen 15f (step S201: YES), the control unit 11 sets the departure time of the first subway on the route as the departure time (step S202). The control unit 11 calculates the estimated arrival time based on the departure time set in step S202 (step S203).

  When it is determined that the departure time is not designated on the route search input screen 15f (step S201: NO), that is, when it is determined that the arrival time is designated, the control unit 11 determines the last subway getting-off time on the route. The arrival time is set (step S204). The control unit 11 calculates a scheduled departure time based on the arrival time set in step S204 (step S205), and advances the process to step S206.

  In step S203 and step S205, the control unit 11 also calculates the boarding times of all subways used for moving the search results. In step S203 and step S205, the control unit 11 records the calculated estimated arrival time and estimated departure time in the RAM 12 as items to be displayed on the list tab 81t.

  The control unit 11 determines whether there is a departure time at which the last train time elapses among all the departure times of subways used for the movement of the search result (step S206). When it is determined that there is no departure time that passes the last train time among all departure times of subways used for movement of the search result (step S206: NO), the control unit 11 moves the process to step S105. When it is determined that there is a departure time that passes the final train time among all the departure times of the subways used for the movement of the search result (step S206: YES), the control unit 11 starts from the subway departure time before the transfer. The waiting time is set until the first departure time of the subway to be transferred (step S207). The control unit 11 recalculates the estimated arrival time or the scheduled departure time based on the waiting time set in step S207 (step S208). The control unit 11 adds up the time costs again (step S209), and proceeds to step S105.

  In step S208 and step S209, the control unit 11 records the recalculated estimated arrival time or departure scheduled time and the resumed time cost in the RAM 12 as items to be displayed on the list tab 81t. The control unit 11 uses these data recorded in the RAM 12 when displaying the sheet tab 82t of the route search result screen 8f.

According to the route search device 1, when the user moves between the nodes 21 on foot or the like, the route search can be performed in consideration of the height difference between the nodes 21.
There are many users who feel resistance when walking on a route with a difference in elevation. In particular, the user may want to avoid going up by walking. For example, a person with a physical disability, an elderly person, etc. may be more satisfied when a route with a small height difference is presented even if the travel distance is slightly longer than a route with a large height difference. In addition, for users who live in areas with many slopes, it is also beneficial to search for routes with little difference in elevation.
In the present embodiment, the uplink and downlink costs are associated with the virtual edge 24, but the uplink and downlink costs may be associated with the edge 22. Thereby, the route search in consideration of the height difference is also possible for the movement on the edge 22 by transportation or walking.

  On the other hand, the user may desire a route with a large difference in elevation in order to eliminate lack of exercise. Therefore, the route search device 1 may execute the route search in addition to the search condition that the total value of the uplink or the downlink is the maximum.

  The second embodiment is as described above, and the other parts are the same as those of the first embodiment. Accordingly, the corresponding parts are denoted by the same reference numerals, and detailed description thereof is omitted.

Embodiment 3
In the first and second embodiments, the starting point and the destination are set to positions that coincide with the node 21, respectively. However, the position of the departure point or destination accepted by the route search device 1 is not necessarily the position on the node 21. The third embodiment relates to route search when the starting point or destination is set at a position other than the node 21.

FIG. 20 is an explanatory diagram for explaining a procedure of processing for newly generating the node 21 and the edge 22. A node 21 in FIG. 20 is a walking node 21 and is indicated by a white circle, a black circle, or a cross. The edge 22 in FIG. 20 is a walking edge 22 and is indicated by a straight solid line. The numerical values of 400 m, 160 m, and 240 m represent the movement distance of the edge 22 near the position where the numerical values are indicated.
FIG. 20A shows the integrated network 3N before a new node 21 and edge 22 are generated. FIG. 20B shows the integrated network 3N including the newly generated node 21 and edge 22. In FIG. 20B, x indicates a newly generated starting node 21, and a black circle indicates a newly generated node 21 on the existing edge 22. In FIG. 20B, the edge 22 connecting the nodes 21 indicated by x and black circles is also a newly generated edge 22 (value of 100 m is attached).

  When the map display button 53c on the search route input screen 15f of FIG. 15 is pressed, the control unit 11 reads the map table 3T and displays the read map on another window (not shown) of the display unit 17. When the user clicks on a position other than the node 21 on the map, the control unit 11 sets the clicked position as the departure place. Further, the control unit 11 searches the map table 3T for an address, a name or a facility name and a latitude / longitude corresponding to the clicked position. The control unit 11 issues a new node ID, and additionally registers the issued node ID, the searched name, and the position as a record of the node 21 at the departure point in the nodal point table 2T. As shown in 20B, for example, “x” is displayed at the position of the departure point of the map displayed in another window.

  The control unit 11 detects a position closest to the designated departure place on the existing walking edge 22. The control unit 11 generates a new node 21 at a position closest to the designated departure place, and additionally registers a record corresponding to the new node 21 in the node table 2T in the same manner as described above. Further, as shown in FIG. 20B, the control unit 11 displays, for example, a black circle at the position of the new node 21 on the map displayed in another window.

  The control unit 11 generates a walking edge 22 that connects the newly generated starting node 21 and the newly generated node 21. The control unit 11 calculates a movement distance, a walking distance, and an elapsed time corresponding to the generated edge 22. The control unit 11 issues a new edge ID, and additionally registers the issued edge ID, the calculated travel time, elapsed time, and walking distance as a record of the new edge 22 in the route table 1T. The forward direction of this record is 1 and the backward direction is 0. The control unit 11 searches the map table 3T for information on the up or down of the altitude difference corresponding to the newly generated edge 22, and additionally registers the information obtained by the search in the route table 1T. The control unit 11 records the position of the route corresponding to the new edge 22 and the issued edge ID in a graphic table (not shown) in association with each other. Further, as shown in FIG. 20B, the control unit 11 displays, for example, a solid straight line at the position of the newly generated edge 22 on the map displayed in another window. Further, as illustrated in FIG. 20B, the control unit 11 may display, for example, the movement distance in the vicinity of the new edge 22 on the map displayed in another window.

  Based on the newly generated node 21 (black circle in FIG. 20B), the control unit 11 divides the edge 22 overlapping with the node 21 (the edge 22 having a movement distance of 400 m in FIG. 20A) into two. That is, for example, the control unit 11 divides the edge 22 having a moving distance of 400 m in FIG. 20A into each edge 22 having moving distances of 160 m and 240 m in FIG. 20B. The control unit 11 additionally registers each record corresponding to each new edge 22 generated by division in the route table 1T in the same manner as described above. In addition, the control unit 11 additionally registers the connection policy for the newly generated node 21 and edge 22 in the connection table (not shown).

Even when the user designates a destination instead of a starting point on a map in another window, the control unit 11 newly generates a node 21 and an edge 22, and records related thereto in the route table 1T and the nodal point table 2T. Register each additional.
That is, the control unit 11 generates a destination node 21, a new node 21 on the walking edge 22 closest to the destination, a new edge 22 extending to the node 21 generated from the destination, and each divided edge 22. To do. Then, the control unit 11 additionally registers records corresponding to the newly generated node 21 and edge 22 in the route table 1T and the nodal point table 2T, respectively. Further, the control unit 11 additionally registers necessary information in a graphic table and a connection table (not shown).

  When the user designates the departure point or destination on the existing edge 22, the departure point or destination is designated, for example, at the position of the black circle in FIG. 20B. In such a case, x is displayed at the position of the black circle, and a node 21 of x and an edge 22 divided by the node 21 are newly generated. Therefore, the process when the starting point or destination is specified on the existing edge 22 is a part of the above processing corresponding to the case where the starting point or destination is specified at a position away from the existing edge 22. Is the same.

  Thus, when the user designates a position other than the existing node 21 as the departure point or destination, the designated departure point or destination is connected to the integrated network 3N as a new node 21. And the control part 11 searches the path | route which connects the designated start point and destination by the Dijkstra method etc. based on the integrated network 3N to which the newly generated node 21 and edge were added.

FIG. 21 is a flowchart illustrating an example of a processing procedure for incorporating the new node 21 and the edge 22 into the integrated network 3N. In FIG. 21, the record addition registration process to the graphic table and the connection table (not shown) is omitted.
The process of FIG. 21 is a process included in step S101 of FIG. In step S101 in FIG. 11, the control unit 11 accepts search conditions such as a departure place, a destination, and a cost. The control unit 11 may generate a new node 21 corresponding to the departure point or the destination when receiving the departure point and the destination. Processing related to generation of a new node 21 corresponding to the departure place and processing related to generation of a new node 21 corresponding to the destination are similar processing. Therefore, in the following, processing related to generation of a new node 21 corresponding to the destination is omitted.

  The control unit 11 determines whether or not the departure place designated on the route search input screen 15f is located on the node 21 (step S301). When the control unit 11 determines that the departure place designated on the route search input screen 5f is located on the node 21 (step S301: YES), the control unit 11 ends the process.

  When the control unit 11 determines that the departure place designated on the route search input screen 5f is not located on the node 21 (step S301: NO), the attribute information associated with the node 21 and the node 21 corresponding to the departure place. Is newly generated (step S302). The control unit 11 additionally registers a record corresponding to the generated departure node 21 in the node table 2T (step S303).

  The control unit 11 generates the node 21 on the edge 22 closest to the departure place and attribute information associated with the node 21 (step S304). The control unit 11 additionally registers a record corresponding to the node 21 closest to the departure place in the nodal point table 2T (step S305).

  The control unit 11 generates an edge 22 connecting the two newly generated nodes 21 and attribute information associated with the edge 22 (step S306). The control unit 11 additionally registers a record corresponding to the edge 22 connecting the two newly generated nodes 21 in the route table 1T (step S307).

  The control unit 11 generates each edge 22 divided into two from the existing edge 22 and attribute information associated with each edge 22 (step S308). The control unit 11 additionally registers each record corresponding to each edge 22 divided into two from the existing edge 22 in the route table 1T (step S309), and ends the process.

According to the route search device 1, when a position other than the position of the node 21 is designated as the position of the departure place or the destination, the departure place or the destination can be incorporated as a new node 21 in the integrated network 3N. it can. For this reason, the route search apparatus 1 can perform route search even when a position other than the position of the node 21 is designated as the position of the departure place or the destination.
When the position of the departure point or destination is input, the conventional route retrieval device sets the node 21 closest to the departure point or destination as the departure point or destination, and executes route retrieval. In many cases, since the user does not always designate the node 21 as the starting point or the destination, the search result of the conventional route search apparatus lacks accuracy. However, the route search device 1 can realize a more accurate route search by dynamically incorporating the designated starting point or destination into the integrated network 3N.

  In the present embodiment, the newly generated node 21 and edge 22 information is additionally registered in a table such as the route table 1T. Therefore, the subsequent route search process is performed on the updated table group. However, the route search device 1 may record the newly generated information of the node 21 and the edge 22 in the RAM 12 and execute the route search processing on the information recorded in the RAM 12 and the existing table group.

  The control unit 11 may read the program 1P, the route table 1T, the node table 2T, or the map table 3T from the optical disc 1a via the disc drive 14. The control unit 11 may read the program 1P, the route table 1T, the nodal point table 2T, or the map table 3T from an external information processing device or recording device via the communication unit 15. Furthermore, a semiconductor memory 1c such as a flash memory in which the program 1P, the route table 1T, the nodal point table 2T, or the map table 3T is recorded may be mounted in the route search apparatus 1.

  The third embodiment is as described above, and the other parts are the same as those of the first embodiment. Accordingly, the corresponding parts are denoted by the same reference numerals, and detailed description thereof is omitted.

Embodiment 4
The fourth embodiment relates to a mode of generating support information for evaluating the validity of a service using a route search result. Services here include administrative services related to public facilities, information providing services related to real estate, location condition information providing services related to medical facilities, demand information providing services related to commercial facilities, and the like. Below, the Example of the route search apparatus which illustrated the validity evaluation of the administrative service regarding a public facility is described.

  FIG. 22 is a block diagram illustrating a hardware configuration of the route search apparatus 10. The hardware configuration of the route search device 10 is the same as the hardware configuration of the route search device 1 shown in FIG. However, in addition to the information recorded on the hard disk 13 of the route search device 1, the program 2P, the population table 4T, the facility table 5T, the town chome table 6T, and the graph template 1G are recorded on the hard disk 130 of the route search device 10. Has been.

The program 2P uses the route information searched by the program 1P to generate support information for evaluating the validity of the administrative service related to the public facility.
The population table 4T records the population of each municipality in each prefecture, the town and the capital of the municipality in the municipality, and the population of the town and the capital of the municipality in the municipality. The population recorded in the population table 4T includes the current population, the population in the past 50 years, and the estimated population in the future 50 years. The estimated future population is a value proportional to the predicted transition population of the entire municipality to which the town chome and character boundaries belong, for example.

The facility table 5T includes columns for recording names, total floor area, address, position (latitude and longitude), number of users per year, attribute information of building structures, and the like regarding public facilities. In addition, the facility table 5T includes a column that records the shortest distance required to move from the facility to each town chome (including characters). The point of town chome is a representative point described later. Furthermore, the facility table 5T includes a column for recording a population ratio described later. Hereinafter, a facility shall mean a public facility.
The town-chome table 6T includes columns for recording names related to town-chomes (including characters), positions of representative points (latitude and longitude), and the like. In addition, the town chome table 6T includes a column that records the shortest distance required to move from the representative point of the town chome to each facility. Further, the town chome table 6T includes a column for recording an evaluation classification of an administrative service described later.
The graph template 1G is a template file related to a graph for supporting the validity evaluation of facility installation by the user.

  Next, the operation of the route search apparatus 10 will be described. Below, the route search apparatus 10 shall generate | occur | produce the information which supports the validity evaluation of the administrative service regarding a facility of a city about a city with a population of several hundred thousand people, for example. In order to quantify administrative services related to city facilities, the total floor area of facilities available to citizens is used as an evaluation standard indicator for administrative services in view of interregional and intergenerational fairness.

  In order to evaluate the facility, the route search apparatus 10 roughly divides and processes two steps. The first step is a step of classifying the streets into three based on the average administrative service amount in the city as seen from the facility point of view. The second step is a step of classifying the facilities into four based on the population ratio of the town streets classified into three in the first step. The route search apparatus 10 supports a user who evaluates the validity of the administrative service related to each facility by presenting which of the four classifications each facility belongs to.

First, the first step will be described.
As a starting point and a destination to be input to the route search apparatus 10, each facility in the city and a representative point of each town are set. Then, the route search device 10 searches each route corresponding to the combination of each facility and each representative point, for example, using the shortest distance as a cost condition, and calculates the shortest distance of each route. The route search apparatus 10 may select either the facility or the representative point as the departure place or the destination. The representative point of the town street here may be the center of gravity of the polygon corresponding to the town street, or the point at the west end, east end, north end or south end of the polygon. This representative point is recorded in the town chome table 6T as a position calculated in advance. Note that the route search device 10 may calculate the representative points one by one at the time of route search based on the map table 3T.

  When the one-way edge 22 is included in the route, the shortest distance of the route to be searched may be different depending on which of the facility and the representative point of the town street is the departure point. Therefore, the route when the departure point is set as the facility and the route when the departure point is set as the representative point of the town street are searched, and the average of these shortest distances is determined as the representative point of the final facility and the town street. It is good also as the shortest distance between.

The route search device 10 searches for the shortest distance route required for the movement between the facility and the representative point of each town couch for all the facilities registered in the facility table 5T. Further, the route search device 10 records the distance of the searched route in the facility table 5T of the hard disk 130 for each facility. Further, the route search apparatus 10 records the distance of the searched route for each town street in the town street table 6T of the hard disk 130. Hereinafter, the distance stored in the shortest distance column of the facility table 5T is regarded as the shortest distance required for the movement from the facility to the representative point of each town street. Further, the distance stored in the shortest distance column of the town chome table 6T is regarded as the shortest distance required to move from the representative point of the town chome to each facility.
In consideration of the case where the one-way edge 22 is included in the route as described above, the shortest distance column of the facility table 5T stores the distance searched by setting the facility as the starting point, and the town-chome table 6T. May store the distance searched by setting the representative point of the town chome as the starting point.

FIG. 23 is a flowchart illustrating an example of a processing procedure for obtaining the shortest distance between each facility and each street. Hereinafter, handling of the route table 1T and the like will be omitted.
The control unit 11 reads the facility table 5T and the town chome table 6T into the RAM 12 (step S401). The control unit 11 selects one unprocessed facility from the data of the facility table 5T that has been read, and uses the selected facility and the representative points of each town chome recorded in the town chome table 6T as the departure point and destination. Accept (step S402). In step S402, there are as many combinations of departure points and destinations as there are combinations of one facility and each town chome. The control unit 11 searches for the shortest path between the selected facility and the representative point of each town chome (step S403).

  The control unit 11 determines whether or not all the facilities recorded in the facility table 5T have been processed (step S404). When it is determined that the processing is not performed for all the facilities recorded in the facility table 5T (step S404: NO), the control unit 11 returns the processing to step S402. If it is determined that all the facilities recorded in the facility table 5T have been processed (step S404: YES), the control unit 11 determines the shortest distance between each facility searched in step S403 and the representative point of each town chome. The information is recorded in the facility table 5T and the town chome table 6T (step S405), and the process ends.

Next, the route search apparatus 10 classifies each town couch into three categories of “appropriate”, “excess”, and “insufficient” based on the total floor area of the facility.
The route search device 10 generates a buffer by setting the area where the shortest distance for moving from the facility to the representative point of each town street is within 4 km, for example, as the service providing range of the facility. The route search device 10 totals the population of the service providing range for each facility based on the population table 4T. Specifically, the route search apparatus 10 extracts a representative point of a town couch that has a shortest distance of, for example, 4 km or less from the facility to the representative point of each town chome. The route search apparatus 10 aggregates the population of each town couch corresponding to the extracted representative point based on the population table 4T, and sets the aggregated population as the population of the service providing range of the facility. The route search apparatus 10 totals the population of the service providing range for all the facilities recorded in the facility table 5T. The route search device 10 calculates the total floor area per person in each facility by dividing the total floor area of each facility recorded in the facility table 5T by the population of the service provision range that is tabulated for each facility.

  The polygon corresponding to the service providing range is a collection of polygons of each town chome whose shortest distance from the facility is within 4 km, for example. Alternatively, the polygon corresponding to the service providing range may be a curve surrounding a region in which representative points of each town street whose shortest distance from the facility is within 4 km, for example. The curve may pass through the inside of the town street polygon. In such a case, the population of the town streets used for population calculation of the service provision range is a population that is proportionally distributed to the area ratio of the town streets divided by the curve.

  The route search device 10 extracts all facilities located in an area where the shortest distance for movement from the town chome to each facility is within 4 km, for example, in the town chome recorded in the town chome table 6T. The route search device 10 adds up the total floor area per person in each extracted facility. Hereinafter, the total floor area per person of the facilities combined for each town chome is called the town chome total floor area. The route search device 10 calculates the total area of the town chome for each town chome recorded in the town chome table 6T.

On the other hand, the route search device 10 calculates the total floor area of all facilities in the city based on the facility table 5T. The route search device 10 divides the calculated total floor area of all facilities in the city by the total population in the city recorded in the population table 4T, so that the average total floor area per person regarding the facilities in the city ( Hereinafter, it is referred to as the city-wide average total floor area). The average floor area of the entire city can be regarded as the average administrative service amount in the city from the viewpoint of the facility.
The city-wide average floor area calculated in advance may be recorded in the facility table 5T.

The route search device 10 classifies the total floor area of each town chome into three, based on the average total floor area of the entire city. When the total floor area of the town chome falls within the range of, for example, 0.5 to 1.5 times the average total floor area of the whole city, the route search device 10 makes the town couch corresponding to the total floor area of the town “appropriate”. Classify. When the total floor area of the town chome is 1.5 times or more than the average total floor area of the whole city, the route search apparatus 10 classifies the town couch corresponding to the total floor area of the town chome as “excess”. When the total floor area of the town chome is not more than 0.5 times the average total floor area of the entire city, the route search device 10 classifies the town couch corresponding to the total floor area of the town chome as “insufficient”. The route search apparatus 10 records the classification result of the town-chome total floor area as the classification of the town-chome corresponding to the town-chome total floor area in the evaluation classification column of the town-chome table 6T.
The numerical values 0.5 and 1.5 are examples, and other numerical values may be used as appropriate.

FIG. 24 is a flowchart illustrating an example of a processing procedure for classifying a town street based on the total floor area of the facility. In the example of FIG. 24, it is assumed that the city-wide average floor area is recorded in advance in the facility table 5T.
The control unit 11 reads the population table 4T, the facility table 5T, and the town chome table 6T into the RAM 12 (step S501). The control unit 11 selects one facility that has not been processed from the data in the facility table 5T that has been read out, and all the representatives whose shortest distance for moving from the selected facility to the representative point of the town street is within a predetermined distance. A point is extracted (step S502). The control part 11 totals the population of the town streets corresponding to the extracted representative points (step S503). The population calculated in step S503 corresponds to the total population of the service provision range of the facility.

  The control unit 11 calculates the total floor area per person of the selected facility by dividing the total floor area of the selected facility by the population of the service provision range obtained (step S504). The control unit 11 determines whether or not all the facilities recorded in the facility table 5T have been processed (step S505). If the control unit 11 determines that all the facilities recorded in the facility table 5T have not been processed (step S505: NO), the control unit 11 returns the process to step S502.

  If the control unit 11 determines that all the facilities recorded in the facility table 5T have been processed (step S505: YES), the process proceeds to step S506. The control unit 11 selects one unprocessed town street from the read data in the town street table 6T, and the shortest distance for moving from the representative point of the selected town street to the facility is within a predetermined value. All facilities are extracted (step S506). The control unit 11 acquires the total floor area per town for all the extracted facilities by adding the total floor area per person calculated in step S504 (step S507). The control unit 11 determines whether or not processing has been performed for all the town streets recorded in the town street table 6T (step S508).

  When it is determined that the processing has not been performed for all the town streets recorded in the town street table 6T (step S508: NO), the control unit 11 returns the processing to step S506. When it is determined that the processing has been performed for all the town chomes recorded in the town chome table 6T (step S508: YES), the control unit 11 is based on the town chome total floor area and the total city average total floor area of each town chome. Then, each street is classified as “appropriate”, “excess” or “insufficient” (step S509). The control unit 11 records the classification result in the town chome table 6T (step S510), and ends the process.

Next, the second step will be described.
The route search device 10 obtains a population ratio corresponding to each facility based on the population distribution of the streets included in the service provision range of the facility. This population ratio has three population components respectively corresponding to “Correct”, “Excess” and “Insufficient” classification types of town chome.
The route search apparatus 10 sets the area where the shortest distance for moving from the facility to each town chome is within 4 km, for example, as a service providing range, and generates a buffer again. Specifically, the route search apparatus 10 extracts a town street whose shortest distance for moving from the facility to each town street is within 4 km, for example. Based on the population table 4T and the town chome table 6T, the route search device 10 totals the population of town chomes extracted within the service providing range into three classification types. The route search apparatus 10 calculates the population ratio of the three classification types totaled for each facility. The population ratio here is the total population ratio in the service provision range of the town chome classified into one of “appropriate”, “excess”, and “insufficient”, and is represented by a percentage, for example. Hereinafter, the population ratio of the three classification types calculated for the service provision range of the facility is referred to as the facility population ratio. The route search device 10 obtains the facility population ratio for each facility, and records the found facility population ratio of each facility in the facility table 5T.

On the other hand, the route search device 10 aggregates the population of the town streets in the entire city into three classification types based on the population of each town street and the 3 classifications of each town street. The route search device 10 calculates the population ratio of the three classification types totaled for the three types of town streets. The population ratio here is a total population ratio in the entire city of the town chome classified into one of “appropriate”, “excess”, and “insufficient”, and is expressed as a percentage, for example. Hereinafter, the population ratio of the three classification types totaled for the entire city is referred to as the city-wide average population ratio. The city average population ratio can be regarded as an average indicator of facilities from the viewpoint of the balance of administrative services. Alternatively, the city average population ratio can be regarded as an average indicator of facilities from the viewpoint of installation validity.
Note that the city-wide average population ratio calculated in advance may be recorded in the facility table 5T or the town chome table 6T.

Next, the route search device 10 classifies the facility population ratio of each facility into four based on the city-wide average population ratio. Specifically, the route search device 10 displays the average population of the entire city on a graph with the horizontal axis and the vertical axis representing the population ratio corresponding to “insufficient” and “excess” among the three population components in the population ratio. An image plotting the ratio and the facility population ratio of each facility is generated. The route search device 10 displays the generated image on the display unit 17.
The facility table 5T may be provided with a column for recording the results of the above four classifications, and the route search apparatus 10 may record the classification results of each facility in the facility table 5T.

FIG. 25 is a graph showing a validity evaluation matrix for facility installation. The horizontal axis of FIG. 25 is the population ratio of “insufficient”, and the unit is%. The ratio of the “insufficient” population decreases toward the right in FIG. The vertical axis in FIG. 25 is the population ratio of “excess”, and the unit is%. In the upper part of FIG. 25, the ratio of “excess” population increases. The city average population ratio and the facility population ratio of each facility are plotted at any position within a right triangle with the horizontal axis in FIG. 25 as the base. In FIG. 25, the population ratio of 99 facilities corresponding to the facility population ratio is plotted as an example.
The horizontal axis and the vertical axis of the graph indicating the validity evaluation matrix for facility installation may be reversed.

The graph area of FIG. 25 is divided into four areas by two straight lines extending up and down from the point 1A indicating the city average population ratio. The area on the upper right of the city average population ratio point 1A is an area where administrative services are “excessive”, and the facilities plotted in this area should be reviewed for floor use, consolidation, etc.
The area on the lower left of the city average population ratio point 1A has a high “insufficient” population ratio and few “excessive” states. Therefore, the facilities plotted in this area need to be expanded. Another facility may be newly established in the area around the facility. Therefore, the area on the lower left with respect to the point 1A of the average population ratio of the entire city can be said to be a new expansion examination area for the facility.

The area at the lower right of the city average population ratio point 1A is an area that is neither “excessive” nor “insufficient”, and the facilities plotted in this area provide appropriate balanced administrative services. It is a facility. Therefore, the area on the lower right with respect to the city average population ratio point 1A is close to the ideal and can be said to be a facility maintenance examination area.
The area on the upper left with respect to the city average population ratio point 1A is an area where the ratio of the population of “excess” and “insufficient” is high and the balance of administrative services has been lost. Facilities that are plotted in this area may be considered for consolidation. At the same time, another facility may be newly established in the area around the facility. Therefore, it can be said that the area at the upper left of the city average population ratio point 1A is a new facility expansion / consolidation examination area.

The validity evaluation matrix for the establishment of facilities is based on the fact that data on population ratios corresponding to “insufficient” and “excess” are plotted relative to the average population ratio of the entire city in a matrix, so that facilities can be evaluated from the viewpoint of administrative services. The user can be provided with useful information for evaluating the validity.
Note that the background color or background pattern of each area in the graph template 1G may be set differently in order to emphasize the difference in area.

FIG. 26 is a flowchart illustrating an example of a processing procedure for generating support information for evaluating the validity of a facility. In the following, it is assumed that the pre-calculated total city population ratio is recorded in the facility table 5T.
The control unit 11 reads the population table 4T, the facility table 5T, and the town chome table 6T into the RAM 12 (step S601). The control unit 11 selects one facility that has not been processed from the data of the facility table 5T that has been read, and totals the classification type population of the service provision range corresponding to the selected facility (step S602). In step S602, the control unit 11 extracts the town streets within the service providing range, and totals the extracted populations of the town streets for each of the already classified three classification types.

  The control unit 11 calculates a facility population ratio corresponding to the selected facility (step S603). The control unit 11 determines whether or not all the facilities recorded in the facility table 5T have been processed (step S604). When the control unit 11 determines that all the facilities recorded in the facility table 5T are not processed (step S604: NO), the control unit 11 returns the process to step S602.

  When it determines with having processed about all the facilities recorded on the facility table 5T (step S604: YES), the control part 11 records the facility population ratio corresponding to each facility on the facility table 5T (step S605). The control unit 11 extracts “insufficient” and “excess” population ratios included in the facility population ratio and the city average population ratio of each facility, respectively (step S606). The control unit 11 classifies each facility based on the population ratio of “insufficient” and “excess” extracted in step S606 (step S607). The control unit 11 may record the classification result of each facility in the facility table 5T.

  The control unit 11 reads the graph template 1G indicating the validity evaluation matrix for facility installation from the hard disk 130 to the RAM 12 (step S608). The control unit 11 generates an image in which the ratios of “insufficient” and “excess” included in the extracted facility population ratio and the city average population ratio of each facility are plotted in a graph showing the validity evaluation matrix of the facility installation. (Step S609). The control unit 11 displays on the display unit 17 a graph indicating the appropriateness evaluation matrix of the facility installation, with the “insufficient” and “excess” population ratios included in the facility population ratio and the city average population ratio of each facility (step 17). S610), the process ends.

According to the route search device 10, it is possible to provide support information for evaluating the validity of the service amount related to the facility.
The route search device 10 can define the service provision range of the facility using the result of the route search. The route search device 10 can classify the town chome into three from the viewpoint of the administrative service amount by comparing the town chome total floor area and the total city average total floor area. Note that the route search device 10 may output the geographical distribution of the sorted town streets using the map table 3T.
The route search device 10 can calculate the population ratio reflecting the excess or deficiency of the service amount for the service provision range of the facility based on the classified population of the town streets. The route search device 10 can classify the facilities into four from the viewpoint of the balance of administrative service amount by comparing the facility population ratio and the city-wide average population ratio. The route search apparatus 10 may output the geographical distribution of the classified facilities using the map table 3T. By visualizing the facilities classified based on the quantitative evaluation of the administrative service amount, the route search device 10 can support the user's examination of establishment, expansion, consolidation, etc. of the facilities.

  In the fourth embodiment, the validity evaluation of the administrative service related to the public facilities is dealt with. Therefore, in quantifying administrative services, the total floor area of public facilities was used as the evaluation standard. When the route search device 10 evaluates the validity of services related to real estate, medical facilities, commercial facilities, etc., parameters other than the total floor area of the facilities may be used to quantify each service. These parameters include, for example, unit price of land, convenience of transportation, estimated number of patients, population distribution by age in the area surrounding the facility, parking space of the facility, customer attraction such as variety of store types, density of competing stores, etc. Includes commercial information or road information such as road width and congestion frequency.

In the fourth embodiment, prior to the validity evaluation of the facility, the route search apparatus 10 performs route search using the shortest distance as a cost condition in order to define the service provision range. However, the cost condition for demarcating the service provision range is not limited to the shortest distance, but may be the shortest time, the minimum fee, the minimum walking distance, the minimum energy consumption, and the like.
The population of each country will fluctuate. In the case of a country where a rapid increase or decrease in population is predicted, the past or future population recorded in the population table 4T may be used for the calculation related to the population in the fourth embodiment. Thereby, the route search device 10 can provide the user with temporal transition information of the validity evaluation of the facility.

  The control unit 11 may read the program 2P, the population table 4T, the facility table 5T, or the town chome table 6T from the optical disc 1a via the disc drive 14. The control unit 11 may read the program 2P, the population table 4T, the facility table 5T, or the town chome table 6T from an external information processing device or recording device via the communication unit 15. Furthermore, a semiconductor memory 1c such as a flash memory in which the program 2P, the population table 4T, the facility table 5T, or the town chome table 6T is recorded may be installed in the route search apparatus 10.

  The fourth embodiment is as described above, and the other parts are the same as those of the first embodiment. Therefore, the corresponding parts are denoted by the same reference numerals, and detailed description thereof is omitted.

  Regarding the above embodiment, the following additional notes are disclosed.

(Appendix 1)
In the facility classification device that classifies the facility based on the population of the administrative community and the total floor area of the facility,
A plurality of first nodes corresponding to moving means moving between the facility and the administrative world, a plurality of first paths having one or both ends connected at the first nodes, and one ends of the plurality of first nodes Each of a plurality of second routes connected to each other, attribute information corresponding to each of the plurality of first routes and the second route, a second node connecting the other ends of the plurality of second routes at one point, and each in a predetermined area A recording means for recording the population of the administrative community and the total floor area of each facility in the predetermined area;
Receiving means for receiving each facility and each administrative boundary in the predetermined area;
Based on the combination of each facility and each administrative boundary received by the receiving means, the contents recorded in the recording means are used to obtain a route in which a first route and / or a second route satisfying a predetermined attribute condition are continuous. A route calculation means for calculating each combination;
Extraction means for extracting, for each facility, administrative boundaries in which the sum of values related to attribute information corresponding to the route calculated by the route calculation means is within a predetermined value;
Administrative boundary classification means for classifying the administrative boundaries extracted for each facility by the extracting means, based on the population of each administrative boundary recorded in the recording means and the total floor area of each facility;
Facility classification for classifying the facility based on the administrative boundaries extracted by the extraction means for each facility, the population of each administrative boundary recorded in the recording means, and the administrative boundaries classified by the administrative boundary classification means A facility classification apparatus comprising: means.

(Appendix 2)
The administrative boundary classification means is:
Using the population of each administrative boundary recorded in the recording means, a counting means for totaling the administrative population extracted by the extracting means for each facility;
A total floor area calculating means for calculating the total floor area per person of each facility by dividing the total floor area of each facility recorded in the recording means by the population totaled for each facility by the totaling means; ,
Facility extraction means for extracting, for each administrative boundary, a facility whose sum of values relating to attribute information corresponding to the route calculated by the route calculation means is within a predetermined value;
Summing means for summing up the total floor area per person calculated by the total floor area calculating means for each of the administrative boundaries for the facilities extracted by the facility extraction means for each of the administrative boundaries;
By dividing the total floor area of each facility recorded in the recording means by the total population of each administrative community recorded in the recording means, the average total floor area per person in all facilities in the predetermined area Mean total floor area calculating means for calculating
A classifying means for classifying the administrative boundaries based on the total floor area per person calculated by the totaling area and the average total floor area calculated by the average total floor area calculating means; The facility classification apparatus according to Appendix 1, which is characterized.

(Appendix 3)
The facility classification means includes
Average population ratio calculating means for calculating an average population ratio corresponding to the classification type in the entire predetermined area based on the population of each administrative boundary recorded in the recording means and the classification type of the administrative boundary classified by the classification means When,
Corresponding to the classification type in each facility based on the administrative boundaries extracted for each facility by the extraction means, the population of each administrative boundary recorded in the recording means, and the classification type of the administrative boundaries classified by the classification means Facility population ratio calculating means for calculating the ratio of the population for each facility;
And means for classifying the facilities based on the average population ratio in the entire predetermined area calculated by the average population ratio calculating means and the population ratio calculated by the facility population ratio calculating means for each facility. The facility classification apparatus according to Appendix 2.

(Appendix 4)
The attribute information is distance information;
The route calculation means calculates the route that minimizes the sum of the values related to the distance information,
The extraction means is configured to extract, for each facility, an administrative boundary in which a sum of values related to the distance information corresponding to the route calculated by the route calculation means is within a predetermined value,
The facility extracting unit extracts, for each administrative boundary, a facility whose sum of values related to the distance information corresponding to the route calculated by the route calculating unit is within a predetermined value. Facility classification apparatus according to 2 or Appendix 3.

(Appendix 5)
The facility classification apparatus according to any one of Supplementary Note 1 to Supplementary Note 4, wherein the administrative boundary includes a town chome or a character.

(Appendix 6)
In the facility classification method of classifying the facility with a computer based on the population of the administrative community and the total floor area of the facility,
A plurality of first nodes corresponding to moving means that move between the facility and the administrative boundary, a plurality of first paths having one or both ends connected to the first nodes, and a plurality of first paths; A plurality of second paths each having one end connected to the node, attribute information corresponding to the plurality of first paths and the second path, and a second node connecting the other ends of the plurality of second paths at one point , Record the population of each administrative circle in a given area and the total floor area of each facility in that given area,
A reception step of receiving each facility and each administrative boundary in the predetermined area;
Based on the combination of each facility and each administrative boundary received by the reception step, a route in which a first route and / or a second route satisfying a predetermined attribute condition is used using the content recorded in the recording means. A route calculation step for calculating each combination;
An extraction step for extracting, for each facility, an administrative boundary in which the sum of values related to the attribute information corresponding to the route calculated by the route calculation step is within a predetermined value;
Based on the population of each administrative boundary recorded in the recording means and the total floor area of each facility, the administrative boundary classification step in which the extracting step classifies the administrative boundaries extracted for each facility;
Facility classification that classifies the facility based on the administrative boundaries extracted for each facility by the extraction step, the population of each administrative boundary recorded in the recording means, and the administrative boundaries classified by the administrative boundary classification step A facility classification method comprising the steps of:

(Appendix 7)
In a program for causing a computer to execute a process of classifying the facility based on the population of the administrative community and the total floor area of the facility,
A plurality of first nodes corresponding to moving means that move between the facility and the administrative boundary, a plurality of first paths having one or both ends connected to the first nodes, and a plurality of first paths; A plurality of second paths each having one end connected to the node, attribute information corresponding to the plurality of first paths and the second path, and a second node connecting the other ends of the plurality of second paths at one point , Record the population of each administrative circle in a given area and the total floor area of each facility in that given area,
Accept each facility and each administrative boundary in the predetermined area,
Based on the received combination of each facility and each administrative boundary, using the contents recorded in the recording means, a route in which the first route and / or the second route satisfying a predetermined attribute condition is continued for each combination. Calculate
For each facility, extract the administrative boundaries in which the sum of the values related to the attribute information corresponding to the calculated route is within a predetermined value,
Based on the population of each administrative boundary recorded in the recording means and the total floor area of each facility, the process of extracting the administrative boundary is classified for each facility,
Based on the administrative boundaries extracted for each facility, the administrative boundaries extracted for each facility, the population of each administrative boundary recorded in the recording means, and the administrative boundaries classified by the administrative boundaries, A program for causing a computer to execute a process of classifying a facility.

1, 10 route search device (computer, route calculation device)
11 Control unit (accepting means, calculating means)
13, 130 Hard disk (recording means)
17 Display section 21 Node (first node)
22 Edge (first route)
23 Virtual node (second node)
24 Virtual edge (second route)
1P program 2P program 1T route table 2T knot point table 3T map table

Claims (8)

Using a plurality of first nodes recorded in the recording means, a plurality of first paths connected at one or both ends at the first nodes, and attribute information corresponding to the plurality of first paths, In a route calculation method of calculating a route in which a plurality of first routes satisfying predetermined attribute conditions for a section from a destination to a destination are continuous by a computer,
A plurality of first nodal points and first paths corresponding to moving means for moving from the departure place to the destination in advance in the recording means, a plurality of second paths each having one end connected to the plurality of first nodal points; Record the attribute information corresponding to each of the plurality of second paths and the second node connecting the other ends of the plurality of second paths at one point,
Accept departure and destination,
Based on the received starting point and destination, a route in which the first route and / or the second route satisfying a predetermined attribute condition is calculated using the content recorded in the recording means. Route calculation method. The attribute information corresponding to each of the plurality of second routes includes a waiting time for using the moving means, a transfer time between the same or different moving means, a moving distance for transferring, a height difference between transfer points, or The route calculation method according to claim 1, comprising energy consumed for transfer. The plurality of second paths include a forward path and a backward path, respectively.
The route calculation method according to claim 1, wherein the attribute information corresponding to each of the plurality of second routes includes attribute information corresponding to the forward route and the reverse route. If the received starting point or destination is not located on the first nodal point and the first route recorded in the recording means, a new first nodule on the first route that is the shortest distance from the starting point or destination Generate points,
Generating a new first route connecting the starting point or destination and the generated new first node;
The process for calculating the route is recorded on the generated first first node, the new first route, the first route at the shortest distance divided by the new first node, and the recording means. The route calculation method according to any one of claims 1 to 3, wherein the route that satisfies a predetermined attribute condition is calculated using a certain content. The processing for calculating the route calculates the route that minimizes the sum of the values related to the attribute information corresponding to the first route and / or the second route, respectively. The route calculation method according to any one of the above. The attribute information is time information,
The route calculation method according to claim 5, wherein the process of calculating the route calculates the route that minimizes the sum of the values related to the time information. Record a map including the first route information in the recording means in advance,
7. The information of a route in which the first route calculated by the route calculating process is added to the map recorded in the recording unit. 8. The route calculation method according to the item. Using a plurality of first nodes recorded in the recording means, a plurality of first routes connected at one or both ends at the first nodes, and attribute information corresponding to the plurality of first routes, In a route calculation device that calculates a route in which a plurality of first routes satisfying predetermined attribute conditions for a section from a destination to a destination are continuous,
The recording means includes a plurality of first nodal points and a first path corresponding to a moving means that moves from a starting point to a destination, a plurality of second paths each having one end connected to the plurality of first nodal points, The attribute information corresponding to each of the plurality of second paths and the second node connecting the other ends of the plurality of second paths at one point are recorded,
A reception means for receiving the starting point and destination;
Means for calculating a route in which a first route and / or a second route satisfying a predetermined attribute condition are used by using the contents recorded in the recording means based on the departure place and destination received by the acceptance means. A route calculation device comprising:

Images