JP2013109649A - Information processor, and control method and program thereof - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a mechanism which is used when the name of a station inputted for pathfinding is changed to a neighboring station and enables pathfinding without additionally receiving input of the name of the neighboring station.SOLUTION: Upon receiving user input with the "right" or "left" key, an origin or destination which has been inputted by a user for pathfinding is changed to a station next or previous to the input origin or destination in order to perform next pathfinding. In addition, input with the "up" or "down" key changes routes for the input origin or destination in order to perform next pathfinding.

Description

  The present invention relates to route search for trains and the like, and more particularly to an information processing apparatus that can easily search a route by changing a search target station, a control method thereof, and a program.

  2. Description of the Related Art Conventionally, there is a route search system for specifying a departure point (departure station) and a destination (destination station) such as a train or a bus and searching for a route to be transferred. In this route search system, the user only specifies the starting point and the destination, and the search result is displayed in consideration of efficient transfer.

  This route search system can be used not only in a personal computer (PC) but also in a portable terminal. Although the PC can accept input of the starting point and the destination through a keyboard, since a smartphone with a touch panel is difficult to input characters, various mechanisms for assisting input are disclosed.

  For example, Patent Document 1 below discloses a mechanism for displaying station name input candidates based on consonants input by a user when a station name is input.

JP 2009-258902 A

  By the way, there may be a plurality of candidates for a departure place and a destination. This is the case when heading to a meeting place located between stations, or when the boarding fare becomes high if one station is advanced. In this case, in order to find out which station it is efficient to get off at, it is necessary to search twice with the route search system and compare each.

  In order to search for the previous or previous station name, the user needs to know the station name. If you do not know it, you need to input it by looking at the route map etc., which is very troublesome.

  The present invention has been made to solve the above-described problem, and provides a mechanism capable of performing a route search without receiving an input of a station name again when performing a route search after changing to a nearby station. The purpose is to do.

  In order to achieve the above object, an information processing apparatus of the present invention is an information processing apparatus for searching a route from a departure place to a destination, and includes a departure point or a destination station and a plurality of stations. Storage means for storing connecting routes, input receiving means for receiving input of the departure place and the destination, and the departure place or destination input by the input receiving means, the input departure place or destination Station name change instruction accepting means for accepting a station name change instruction for changing to a station different from the station name change instruction accepting means when the station name change instruction accepting means accepts the departure place or destination where the change instruction was made, the storage means A station name changing unit that changes based on the route stored in the station, and a route search unit that performs a route search based on the station name changed by the station name changing unit. That.

  According to the present invention, when a station name is input by the user, it is determined whether or not a predetermined operation for changing the station name has been received. If it is determined that the predetermined operation has been received, the input station name is changed. Therefore, the route search can be performed without receiving the input of the station name from the user again.

It is a lineblock diagram showing an example of route search system 100 in an embodiment of the present invention. 2 is a configuration diagram illustrating an example of a hardware configuration of an information processing apparatus 101 and a server 102. FIG. 2 is a configuration diagram illustrating an example of a module configuration of an information processing apparatus 101 and a server 102. FIG. It is a flowchart which shows the detail of the route search process in embodiment of this invention. It is a flowchart which shows the detail of the station change process in embodiment of this invention. It is a flowchart which shows the detail of the route change process in embodiment of this invention. It is a flowchart which shows the detail of the path | route storage process in embodiment of this invention. It is a flowchart which shows the detail of the path | route switching process in embodiment of this invention. It is a flowchart which shows the detail of the route deletion process in embodiment of this invention. It is a block diagram which shows an example of various table structures. It is a block diagram which shows an example of various list structures. It is a block diagram which shows an example of the route search screen 1200 in a present Example. It is a block diagram which shows an example of the search result screen 1300 in a present Example.

  Hereinafter, embodiments of the present invention will be described with reference to the drawings.

  FIG. 1 is a diagram showing an example of a system configuration of a route search system 100 according to the present invention. An information processing apparatus 101 and a server 102 are installed in a route search system 100 of the present invention, and these apparatuses are connected to each other via a network 103 such as a LAN (Local Area Network) so as to be able to perform data communication with each other. The configuration of various terminals or servers connected on the network 103 in FIG. 1 is an example, and it goes without saying that there are various configuration examples depending on the application and purpose.

  The information processing apparatus 101 is an apparatus that executes a route search application. The route search application is stored in the ROM 202 or the external memory 211 of FIG. 1 described later, and the CPU 201 reads out to the RAM 203 and performs various operations in response to instructions from an operator (hereinafter referred to as a user).

  The business support application searches for routes such as trains and buses in accordance with user operations. In the present embodiment, the description will be based on train route search, but the present invention is not limited to this.

  The server 102 is a device for searching for a route in accordance with a route search request instructed from the information processing apparatus 101.

  The information processing apparatus 101 may include the configuration of the server 102, or the server 102 may include the configuration of the information processing apparatus 101.

  FIG. 2 is a diagram illustrating a hardware configuration of various terminals according to the embodiment of the present invention.

  The CPU 201 comprehensively controls each device and controller connected to the system bus 204.

  Further, the ROM 202 or the external memory 211 is necessary to realize a BIOS (Basic Input / Output System), an operating system program (hereinafter referred to as OS), which is a control program of the CPU 201, and a function executed by each server or each PC. Various programs to be described later are stored. The RAM 203 functions as a main memory, work area, and the like for the CPU 201.

  The CPU 201 implements various operations by loading a program necessary for execution of processing into the RAM 203 and executing the program.

  An input controller (input C) 205 controls input from a pointing device such as a keyboard 209 or a mouse (not shown).

  A video controller (VC) 206 controls display on a display device such as a CRT display (CRT) 210. The display device may be a liquid crystal display as well as a CRT. These are used by the administrator as needed.

  A memory controller (MC) 207 is a hard disk (HD), floppy disk (registered trademark FD) or PCMCIA card slot for storing boot programs, browser software, various applications, font data, user files, editing files, various data, and the like. Controls access to an external memory 211 such as a compact flash memory connected via an adapter.

  A communication I / F controller (communication I / FC) 208 is connected to and communicates with an external device via a network, and executes communication control processing in the network. For example, Internet communication using TCP / IP is possible.

  For example, the CPU 201 can perform display on the CRT 210 by executing outline font rasterization processing on a display information area in the RAM 203. In addition, the CPU 201 enables a user instruction with a mouse cursor (not shown) on the CRT 210.

  Various programs used by the information processing apparatus 101 and the server 102 of the present invention to execute various processes to be described later are recorded in the external memory 211 and are executed by the CPU 201 by being loaded into the RAM 203 as necessary. Is. Furthermore, definition files and various information tables used by the program according to the present invention are stored in the external memory 211.

  Next, a functional configuration diagram showing module configurations of the information processing apparatus 101 and the server 102 will be described with reference to FIG. Note that the module configurations of the various terminals or servers in FIG. 3 are merely examples, and it goes without saying that there are various configuration examples depending on applications and purposes.

  The information processing apparatus 101 includes a storage module 301, a screen display module 302, an input reception module 303, and a transmission / reception module 304.

  The storage module 301 is a module for storing various lists (to be described later) (storage means). The transmission / reception module 304 stores the result of the route received from the server 102.

  The screen display module 302 is a module for generating a screen based on various information and displaying it on the CRT 210.

  The input reception module 303 is a module for receiving input from the user on various screens displayed by the screen display module 302. Input is performed by accepting character input from the keyboard or pressing a button such as a mouse.

  The transmission / reception module 304 is a module for transmitting / receiving various types of information to / from the server 102.

  The server 102 includes a storage module 305, a route search module 306, and a transmission / reception module 307.

  The storage module 305 is a module for storing various tables described later (storage means). The route search module 306 is a module for searching for a route based on the departure point, the destination, and the like input in the information processing apparatus 101. The transmission / reception module 307 is a module for transmitting / receiving various information to / from the information processing apparatus 101.

  Next, route search processing in the embodiment of the present invention will be described with reference to the flowchart shown in FIG. In addition, each step of S1010, S1020, S1090, and S1100 is processed under the control of the CPU 201 in the information processing apparatus 101. In addition, each step of S1030 to S1080 is processed under the control of the CPU 201 in the server 102.

  In step S1010, in order to input a route that the user wants to search in the information processing apparatus 101, input to the item 1201 and the item 1202 is received on the route input screen 1200 (see FIG. 12) (input reception unit).

  In step S <b> 1020, when the search button 1203 is pressed on the route input screen 1200 to detect the route input to the information processing apparatus 101, the received content is passed to the server 102.

  In step S1030, the contents passed from the information processing apparatus 101 are received, a route search is performed by a tool, and a route is acquired. The tool here refers to an application for existing route search. In the present embodiment, an application for route search is installed in the server 102 and will be described as a mode in which this operates. However, a route search service provided by a Web application or the like may be used.

  In step S1040, based on the route obtained from the tool, the route name 1002 of the route table 1000 (see FIG. 10) is searched with the route name of the departure place of the route, the route No 1001 is obtained, and the route No 1001 is obtained. Thus, the route No. 1011 in the station name table 1010 (see FIG. 10) is searched, the station No. 1012 and the station name 1013 are acquired, and the station name list for departure place 1100 (see FIG. 11) is created.

  The route table 1000 is a table for registering routes, and it is necessary to register routes in advance.

  The station name table 1010 is a table for registering combinations of routes and stations. If the route No 1011 acquires the same data, the stations included in the route can be acquired, and the arrangement of the stations is expressed by arranging them in the order of the station No 1012. Can do. Further, as with the route table 1000, prior registration is required.

  The departure station name list 1100 is a list for storing stations included in the departure route.

  In step S1050, based on the route obtained from the tool, the station name 1013 in the station name table 1010 is searched with the station name of the departure place of the route, and route No. 1001 is obtained. At this time, if there is a different content in the route No. 1001, a departure route route list 1110 (see FIG. 11) is created for each route No.

  The departure point route list 1110 is a list for storing each route when a plurality of routes are in the departure place.

  In step S1060, based on the route obtained from the tool, the route name 1002 of the route table 1000 is searched with the route name of the destination of the obtained route, route No 1001 is obtained, and the station name table 1010 is obtained with the route No 1001. Route No. 1011 is retrieved, station No. 1012 and station name 1013 are acquired, and a destination station name list 1120 (see FIG. 11) is created.

  The destination station name list 1120 is a list for storing stations included in the destination route.

  In step S1070, based on the route obtained from the tool, the station name 1013 in the station name table 1010 is searched for the destination station name of the route, and route No. 1001 is obtained. At this time, if there is a different content in the route No 1001, a destination route list 1130 is created for each route No.

  The destination route list 1130 (see FIG. 11) is a list for storing each route when a plurality of routes are on the destination.

  In step S1080, the route, the departure station name list 1100, the departure destination route list 1110, the destination station name list 1120, and the destination route list 1130, which are search results, are transmitted to the information processing apparatus 101.

  In step S <b> 1090, the information processing apparatus 101 stores the departure station name list 1100, departure route list 1110, destination station name list 1120, and destination route list 1130 received from the server 102.

  In step S1010, the information processing apparatus 101 displays the route received from the server 102 on the route display screen 1300 (see FIG. 13).

  Next, the station change process in the embodiment of the present invention will be described using the flowchart shown in FIG. In addition, each step of S2010 thru | or S2050, S2100, and S2110 is processed under control of CPU201 in the information processing apparatus 101. FIG. In addition, each step of S2060 to S2090 is processed under the control of the CPU 201 in the server 102.

  At this time, when the information processing apparatus 101 receives an instruction to change either the departure place or the destination and changes the departure place, the route is searched for at the changed departure place, and the destination is changed. The route is searched for at the changed destination and displayed on the screen. For example, if the departure point is “Mita” and you press “Right” on the keyboard, it will be “Damon”. If you press “Left” on the keyboard, it will be “Sengakuji”, and the route from there to the destination will be searched. The Hereinafter, a description will be given by taking as an example a case where a departure place change instruction is given.

  In step S2010, the information processing apparatus 101 detects that the user has pressed the “left” key or the “right” key with respect to the item 1301 and the item 1302 as an operation for changing the departure point or the destination (step S2010). Station name change instruction reception means).

  In step S2020, the key received in step S2010 is determined. If the pressing of the “left” key is accepted, the process proceeds to step S2030. If the pressing of the “right” key is accepted, the process proceeds to step S2021.

  Step S2021 is executed when the received key is “right”, and it is determined whether there is no station No 1101 larger than the current station No 1101 in the station name list 1100 for departure place. If it is determined that the station is an end station, the process ends. If it exists, the station name list 1100 for the departure place is selected at the current station No. 1101 that is next to the current station No. 1101.

  Step S2030 is executed when the accepted key is “left”, and it is determined whether there is no station No 1101 smaller than the current station No 1101 in the station name list 1100 for departure place. If there is no such, step S2031 is executed. If it exists, the station name list 1100 for the departure place is selected at the station No. 1101 that is the next smaller than the current * station No. 1101.

  In step S2040, the contents of the selected departure station name list 1100 are displayed in item 1301 (station name changing means).

  In step S2050, the information processing apparatus 101 transmits the contents of the items 1301 and 1302 to the server 102 in order to acquire a route based on the changed station.

  In step S2060, the server 102 performs a route search with a tool based on the departure place and the destination received from the information processing apparatus 101 (route search means).

  In step S2070, it is determined whether the route obtained from the tool is a plurality of routes. In the case of a plurality of routes, the process proceeds to step S2071, and in the case of one route, the process proceeds to step S2070.

  In step S2071, it is executed when there are a plurality of routes obtained from the tool, and only the route of the same route as the route name displayed in the item 1301 and the item 1302 is left.

  In step S2080, the route name 1002 of the route table 1000 is searched based on the route name of the departure place of the obtained route, route No 1001 is acquired, and if there are two or more types of route No 1001, for each different route No 1001, A departure route list 1110 is created.

  In step S2090, the route and departure route list 1110 are transmitted to the information processing apparatus 101.

  In step S <b> 2100, the information processing apparatus 101 stores the departure route list 1110 received from the server 102.

  In step S2110, the route received from server 102 is displayed in area 1303.

  Next, route change processing in the embodiment of the present invention will be described with reference to the flowchart shown in FIG. Note that steps S3010 to S3060, S3110, and S3120 are performed under the control of the CPU 201 in the information processing apparatus 101. In addition, each step of S3070 to S3100 is processed under the control of the CPU 201 in the server 102.

  At this time, the information processing apparatus 101 receives an instruction to change the route of either the departure point or the destination, and when the route is changed, the route is searched for the changed route.

  In step S3010, the information processing apparatus 101 detects pressing of the “up” key or the “down” key for the items 1301 and 1302 (route change instruction receiving unit).

  In step S3020, it is determined whether or not the departure route route list 1110 is empty. If it is determined that there is a departure route list 1110, the process proceeds to step S3030. If it is determined that there is no departure route list 1110, the process proceeds to step S3021.

  Step S3021 is executed when the departure route list 1110 is empty. Since there is no route to be switched, the process ends.

  In step S3030, the key received in step S3010 is determined. If it is determined that the “up” key has been input, the process proceeds to step S3040. If it is determined that the “down” key has been input, the process proceeds to step S3031.

  Step S3031 is executed when the “down” key is received, and acquires the next route from the route list. Specifically, when there is a route No 1111 that is larger than the current route No 1111 in the route list 1110 for departure place, the route No 1111 that is next larger than the current route No is selected.

  Step S <b> 3032 is executed when the “down” key is received and there is no route larger than the current route No 1111, and the smallest route No 1111 is selected from the departure route list 1110.

  Step S3040 is executed when the “Up” key is received, and the previous route is acquired from the route list. Specifically, when there is a route No 1111 smaller than the current route No 1111 in the route list 1110 for departure place, the route No 1111 that is the next smaller than the current route No is selected.

  Step S3041 is executed when the “Up” key is accepted and there is no route smaller than the current route No. 1111, and the largest route No. 1111 is selected from the departure route route list 1110.

  In step S3050, the contents selected in the departure route list 1110 are displayed in the item 1301.

  In step S <b> 3060, the information processing apparatus 101 transmits the contents of the items 1301 and 1302 to the server 102.

  In step S3070, the server 102 performs a route search using a tool based on the departure place and the destination received from the information processing apparatus 101.

  In step S3080, a route whose route name 1131 matches the route name 1112 selected in the departure route list 1110, the destination route list 1130 is acquired from the route obtained from the tool.

  In step S3090, the route name 1112 is searched based on the route name 1112 in the route table 1000, and the route number 1001 is acquired. A search is made with the route No. 1001 obtained from the route No. 1011 in the station name table 1010 to create a station name list 1100 for departure place.

  In step S 3100, the route and departure station name list 1100 are transmitted to the information processing apparatus 101.

  In step S <b> 3110, the information processing apparatus 101 stores the departure station name list 1100 received from the server 102.

  In step S 3120, the route received from server 102 is displayed in area 1303.

  Next, the path storing process in the embodiment of the present invention will be described with reference to the flowchart shown in FIG. Note that steps S4010 to S4040 are performed under the control of the CPU 201 in the information processing apparatus 101.

  In step S4010, the information processing apparatus 101 accepts pressing of the route storage button 1304.

  In step S4020, when the pressing of the route storage button 1304 is detected, it is determined whether or not the same route as the route in the area 1303 exists in the route list 1140. If the same route exists in the route list 1140, the process proceeds to step S4021, and if the same route does not exist in the route list 1140, the process proceeds to step S4030.

  Step S4021 is executed when the same route as the area 1303 exists in the route list 1140, and the processing is ended because the route has already been registered.

  In step S4030, the route in area 1303 is added to the end of route list 1140.

  In step S4040, the route of area 1303 is displayed in area 1305.

  Next, route switching processing in the embodiment of the present invention will be described with reference to the flowchart shown in FIG. Note that steps S5010 to S5030 are performed under the control of the CPU 201 in the information processing apparatus 101.

  In step S5010, the information processing apparatus 101 accepts a press on one of the items 1306. The item displayed in the item 1306 is a route stored in the route storage process described above.

  In step S5020, the route list 1140 obtains the same item in which the pressed item 1306 No and route No 1141 are the same.

  In step S5030, the contents of the acquired route list 1140 are displayed in area 1305.

  Next, route deletion processing in the embodiment of the present invention will be described with reference to the flowchart shown in FIG. In addition, each step of S6010 thru | or S6080 is processed under control of CPU201 in the information processing apparatus 101. FIG.

  In step S6010, the information processing apparatus 101 accepts pressing of the delete button 1307.

  In step S6020, the same item as the item 1306 selected in the area 1305 and the route No. 1141 is deleted from the route list 1140.

  In step S6030, it is determined whether a route exists in the route list 1140. If it is determined that there is a route in the route list 1140, the process proceeds to step S6040. If it is determined that no route exists in the route list 1140, the process proceeds to step S6031.

  In step S6031, since no route remains in the route list 1140, the area 1305 is displayed as blank.

  Step S6040 is executed when a route remains in the route list 1140, and the route number 1141 larger than the deleted route number is reassigned by a value obtained by subtracting “−1”. For example, when 3 is deleted in the state where 5 items 1 to 5 exist in the list, 4 is changed to 3, and 5 is changed to 4.

  In step S6050, it is determined whether or not the deleted route No. 1141 is the largest No in the route list 1140. If it is determined that the deleted route No. 1141 is the maximum No in the route list 1140, the process proceeds to step S6051. If it is determined that the deleted route No. 1141 is not the maximum No in the route list 1140, The process proceeds to step S6060.

  Step S6051 is executed when it is determined that the deleted route No. 1141 is the largest No in the route list 1140, and the route of the largest route No. 1141 is acquired from the route list 1140.

  Step S6060 is executed when it is determined that the deleted route No. 1141 is not the largest No in the route list 1140, and the same route as the deleted route No. 1141 is acquired from the route list 1140.

  In step S6070, the route acquired from the route list 1140 is displayed in the area 1305. That is, the processing from step S6050 to step S6060 is control of the item 1306 displayed in the area 1305. In step S6051, since the route No. 1141 with the largest route has been deleted, the item 1306 displayed in the area 1305 is displayed with the route No. 1141 having the largest route No. 1141 at this time. On the other hand, in step S6060, since route No. 1141 is packed, the route corresponding to the packed route No. 1141 is displayed.

  In step S6080, the largest item 1306 is deleted. That is, when a deletion instruction for the route 2 is given, there is no route to be displayed on the route 3, so the item 1306 for the route 3 is deleted.

  As described above, according to the present embodiment, when a station name is input by the user, it is determined whether or not a predetermined operation for changing the station name has been received, and it is determined that the predetermined operation has been received. Since the input station name can be changed, route search can be performed without receiving the input of the station name from the user again.

  The present invention can be implemented as a system, apparatus, method, program, storage medium, or the like, and can be applied to a system including a plurality of devices. You may apply to the apparatus which consists of one apparatus.

  Note that the present invention includes a software program that implements the functions of the above-described embodiments directly or remotely from a system or apparatus. The present invention also includes a case where the system or the computer of the apparatus is achieved by reading and executing the supplied program code.

  Accordingly, since the functions of the present invention are implemented by computer, the program code installed in the computer also implements the present invention. In other words, the present invention includes a computer program itself for realizing the functional processing of the present invention.

  In that case, as long as it has the function of a program, it may be in the form of object code, a program executed by an interpreter, script data supplied to the OS, and the like.

  Examples of the recording medium for supplying the program include a flexible disk, hard disk, optical disk, magneto-optical disk, MO, CD-ROM, CD-R, and CD-RW. In addition, there are magnetic tape, nonvolatile memory card, ROM, DVD (DVD-ROM, DVD-R), and the like.

  As another program supply method, a browser on a client computer is used to connect to an Internet home page. The computer program itself of the present invention or a compressed file including an automatic installation function can be downloaded from the homepage by downloading it to a recording medium such as a hard disk.

  It can also be realized by dividing the program code constituting the program of the present invention into a plurality of files and downloading each file from a different homepage. That is, a WWW server that allows a plurality of users to download a program file for realizing the functional processing of the present invention on a computer is also included in the present invention.

  In addition, the program of the present invention is encrypted, stored in a storage medium such as a CD-ROM, distributed to users, and key information for decryption is downloaded from a homepage via the Internet to users who have cleared predetermined conditions. Let It is also possible to execute the encrypted program by using the downloaded key information and install the program on a computer.

  Further, the functions of the above-described embodiments are realized by the computer executing the read program. In addition, based on the instructions of the program, an OS or the like running on the computer performs part or all of the actual processing, and the functions of the above-described embodiments can also be realized by the processing.

  Further, the program read from the recording medium is written in a memory provided in a function expansion board inserted into the computer or a function expansion unit connected to the computer. Thereafter, the CPU of the function expansion board or function expansion unit performs part or all of the actual processing based on the instructions of the program, and the functions of the above-described embodiments are realized by the processing.

  The above-described embodiments are merely examples of implementation in carrying out the present invention, and the technical scope of the present invention should not be construed as being limited thereto. That is, the present invention can be implemented in various forms without departing from the technical idea or the main features thereof.

101 Information processing apparatus 201 CPU
202 RAM
203 ROM
204 System Bus 205 Input Controller 206 Video Controller 207 Memory Controller 208 Communication I / F (Interface) Controller 209 Input Device 210 Display Device 211 External Memory

Claims (7)

An information processing device for searching a route from a departure place to a destination,
Storage means for storing a departure or destination station and a route connecting a plurality of stations;
Input receiving means for receiving input of the departure place and the destination;
A station name change instruction accepting means for accepting a station name change instruction for changing the departure place or destination input by the input accepting means to a station different from the input departure place or destination;
When receiving the station name change instruction by the station name change instruction receiving means, the station name changing means for changing the departure place or destination where the change instruction is made based on the route stored in the storage means,
An information processing apparatus comprising: route search means for performing route search based on the station name changed by the station name change means. The information processing apparatus includes:
A route change instruction receiving means for receiving a route change instruction for changing the route of the searched route to a route different from the route when searched by the route search means;
2. The information processing apparatus according to claim 1, wherein when the route search instruction is received by the route change instruction means, the route search means performs a route search based on the route for which the change instruction is made. The information processing apparatus includes:
The information processing apparatus according to claim 1, further comprising: a route storage unit that stores the route searched by the route search unit in the storage unit and displays the route in accordance with an instruction from a user.   The information processing apparatus according to claim 1, wherein the station name change instruction is information indicating right or left.   The information processing apparatus according to claim 2, wherein the route change instruction is information indicating up or down. A control method for an information processing apparatus for storing a route from a departure place to a destination, comprising storage means for storing a departure or destination station and routes connecting a plurality of stations,
An input receiving step in which the input receiving means of the information processing apparatus receives the input of the departure place and the destination;
The station name change instruction accepting means of the information processing apparatus accepts a station name change instruction for changing the departure point or destination input in the input receiving step to a station different from the input departure point or destination. Station name change instruction reception step,
When the station name changing means of the information processing apparatus receives the station name change instruction in the station name change instruction receiving step, the station name for changing the departure place or destination where the change instruction is made based on the route stored in the storage means Change steps,
A method for controlling an information processing apparatus, comprising: a route search step for performing a route search based on the station name changed by the station name changing step. A storage means for storing a departure or destination station and routes connecting a plurality of stations is read by a computer for causing the computer to execute an information processing device for searching a route from the departure point to the destination. An executable program,
The information processing apparatus;
Input receiving means for receiving input of the departure place and the destination;
A station name change instruction accepting means for accepting a station name change instruction for changing the departure place or destination input by the input accepting means to a station different from the input departure place or destination;
When receiving the station name change instruction by the station name change instruction receiving means, the station name changing means for changing the departure place or destination where the change instruction is made based on the route stored in the storage means,
A computer-readable and executable program that functions as route search means for performing route search based on the station name changed by the station name change means.

Images