Expressway bus system, express bus processing method, express bus processing program, transportation reservation system, transportation reservation method, and transportation reservation program

Abstract

To provide an express bus system, an express bus processing method, an express bus processing program, a transportation reservation system, a transportation reservation method, and a transportation reservation program that increase convenience and a utility value of an express bus.SOLUTION: An express bus system, which includes a user terminal 2 carried by an express bus user, includes: storage means 11 for storing route information of existing express buses; extraction means 12 for extracting, on the basis of the information input by the user terminal 2, an available route that is a route that can be used by the user from the route information; display control means 13 for displaying the extracted information on the available routes on the user terminal 2; and reservation means 14 capable of executing, in response to operation of the user terminal 2, reservation processing for the available route. The extraction means 12 is capable of extracting a transfer route involving a transfer between a plurality of routes including a first route and a second route as the available route, and the reservation means 14 is capable of simultaneously executing, in response to the operation of the user terminal 2, reservation processing for a plurality of routes that make up the transfer route.SELECTED DRAWING: Figure 1

Description

[Technical Field]

[0001] The present invention relates to an express bus system, an express bus processing method, and an express bus processing program that can effectively perform route searches, reservations, payments, etc. for connecting routes in an express bus service. [Background technology]

[0002] A multimodal transportation search system has been proposed that searches for multiple types of transportation such as buses, airplanes, ferries, taxis, rental cars, and rental bicycles all at once and provides search results (for example, Patent Document 1). [Prior art documents] [Patent documents]

[0003] [Patent Document 1] Japanese Patent Application Publication No. 2019-211960 Summary of the Invention [Problem to be solved by the invention]

[0004] When using this type of system and actually using the searched multiple means of transportation, after using the first means of transportation, it is necessary to transfer between means of transportation when using the second means of transportation. Transfers occur not only when multiple types of transportation are used, but also when a single transportation mode is used. For example, express bus routes are set up all over the country along expressways, but because different bus companies (entities) operate in different regions, passengers may need to change buses or routes depending on their departure and arrival points. For example, if bus company A operates highway bus route A in region A (say, eastern Japan), then if a user wants to travel by highway bus within region A (say, Tokyo to Nagoya), they must use highway bus A. Also, if bus company B operates highway bus route B in region B (for example, western Japan), then if a user wants to travel by highway bus within region B (for example, Osaka to Okayama), they must use highway bus B. In this case, if you use express bus A, you will need to access the reservation site or counter (called Counter A) operated by bus company A to make a reservation and payment, and if you use express bus B, you will need to access the reservation site or counter (called Counter B) operated by bus company B to make a reservation and payment. Therefore, when traveling between regions A and B (for example, Tokyo to Okayama) by highway bus, it is necessary to travel on route A by highway bus A, then transfer to highway bus B to travel on route B, and it is also necessary to access counter A in advance to make a reservation and payment for highway bus A's route A (for example, Tokyo to Osaka), and to access counter B to make a reservation and payment for highway bus B's route B (for example, Osaka to Okayama). In other words, in addition to connecting flights, passengers had to visit multiple counters and complete procedures at each one. There are also expected benefits, such as the ability to effectively expand express bus routes by utilizing transfers. However, there remains the problem of cumbersome procedures such as reservations and payments required for transfers. In other words, although the conventional express bus system could be made more useful by allowing passengers to transfer, the cumbersome procedures remained an issue.

[0005] The present invention has been proposed to solve the problems associated with the conventional technology described above, and aims to provide an express bus system, an express bus processing method, and an express bus processing program that make transfers and related procedures easy and useful. [Means for solving the problem]

[0006] In view of the above problems, one embodiment of the present invention provides an expressway bus system equipped with a user terminal carried by an expressway bus user, the system comprising: a storage means for storing route information of existing expressway buses; an extraction means for extracting available routes that are routes that can be used by the user from the route information based on information input by the user terminal; a display control means for displaying the extracted information of the available routes on the user terminal; and a reservation means capable of executing reservation processing for the available routes in response to operation of the user terminal, wherein the extraction means is capable of extracting a transfer route that involves transfers between multiple routes including a first route and a second route as the available route, and the reservation means is capable of executing reservation processing for multiple routes that make up the transfer route all at once in response to operation of the user terminal.

[0007] In addition, another aspect of the present invention is a highway bus processing method using a user terminal carried by a highway bus user, and includes a storage step for storing existing highway bus route information, an extraction step for extracting available routes that are routes that the user can use from the route information based on information input by the user terminal, a display control step for displaying information on the extracted available routes on the user terminal, and a reservation step that can execute reservation processing for the available routes in response to operation of the user terminal, wherein the extraction step can extract a connecting route consisting of multiple routes including a first route and a second route as the available route, and the reservation step can execute reservation processing for the multiple routes that make up the connecting route all at once in response to operation of the user terminal.

[0008] In addition, an expressway bus processing program according to another aspect of the present invention causes a computer connected to a user terminal carried by an expressway bus user to function as a storage means for storing existing expressway bus route information, an extraction means for extracting available routes that are routes that the user can use from the route information based on information input by the user terminal, a display control means for displaying information on the extracted available routes on the user terminal, and a reservation means capable of executing reservation processing for the available routes in response to operation of the user terminal, wherein the extraction means is capable of extracting a connecting route consisting of multiple routes including a first route and a second route as the available route, and the reservation means is capable of executing reservation processing for the multiple routes that make up the connecting route in one go in response to operation of the user terminal. [Effects of the Invention]

[0009] According to the present invention, it is possible to realize a highly useful express bus service similar to a series of long-distance buses with simplified transfer procedures. In areas lacking direct routes, trains, airplanes and other means of transportation, express buses can be introduced as a new means of transportation. It is possible to provide a new form of transportation that utilizes transfers. [Brief explanation of the drawings]

[0010] [Figure 1] 1 is a schematic diagram of a high-speed bus system according to an embodiment of the present invention; [Figure 2] FIG. 2 is a hardware configuration diagram of a server. [Figure 3] FIG. 2 is a hardware configuration diagram of a user terminal. [Figure 4] FIG. 2 is a functional configuration diagram of a server. [Figure 5] 10 is a table showing an example of grouping information. [Figure 6] FIG. 10 is an explanatory diagram of a route search based on grouping. [Figure 7] An explanatory diagram of a special transfer route. [Figure 8]10 is a sequence chart showing a processing procedure for route search. [Figure 9] FIG. 10 is a diagram illustrating an example of a route search screen. [Figure 10] FIG. 10 is a diagram illustrating an example of a search result screen. [Figure 11] FIG. 10 is a diagram showing an example of a flight candidate display / selection screen. [Figure 12] 10 is a sequence chart showing the reservation and payment processing procedure. [Figure 13] FIG. 10 is a diagram showing an example of a fee information display screen. [Figure 14] FIG. 10 is a diagram illustrating an example of a reservation screen. [Figure 15] FIG. 10 is a diagram showing an example of a reservation result screen. [Figure 16] FIG. 10 is a diagram illustrating an example of a payment execution screen. [Figure 17] 10 is a sequence chart showing a procedure for changing a reservation. [Figure 18] 10 is a sequence chart showing a procedure for canceling a reservation. [Figure 19] FIG. 10 is a diagram illustrating an example of a recommendation display screen. [Figure 20] FIG. 10 is a diagram showing another example (part 1) of the display screen. [Figure 21] FIG. 10 is a diagram showing another example (part 2) of the display screen. [Figure 22] FIG. 10 is a diagram showing another example (part 3) of the display screen. DETAILED DESCRIPTION OF THE INVENTION

[0011] A preferred embodiment of the express bus system of the present invention will now be described.

[0012] FIG. 1 is a schematic diagram of a high-speed bus system according to an embodiment of the present invention. As shown in the figure, the express bus system of this embodiment is mainly composed of a server 1, a user terminal 2, a reservation system, and a payment system. The reservation system includes a reservation server 3 that is an information processing device, and is configured so that reservation processing, which will be described later, can be executed substantially by the operation of the reservation server 3. The payment system includes a payment server 4 that is an information processing device, and is configured to be able to execute the payment process described below substantially by the operation of the payment server 4. The devices are connected to each other via the Internet 9 so that they can communicate with each other.

[0013] FIG. 2 is a diagram showing the hardware configuration of the server 1. As shown in FIG. The server 1 is an information processing device (computer) including a control unit 101, a memory 102, a storage 103, and a communication unit 104. The control unit 101 is a processor that executes programs (including a high-speed bus processing program), controls each unit of the server 1, and performs processing to realize the functions of the server 1. The control unit 101 is equipped with a CPU (Central Processing Unit). The memory 102 is a computer-readable storage medium, and is configured from RAM (Random Access Memory), ROM (Read Only Memory), and the like. The storage 103 is a computer-readable storage medium, and is configured by an SSD (Solid State Drive), a hard disk, or the like. The memory 102 and / or the storage 103 store programs executed by the control unit 101. The communication unit 104 is connected to the Internet 9 and communicates with the user terminal 2 , the reservation server 3 , and the payment server 4 via the Internet 9 .

[0014] FIG. 3 is a diagram showing the hardware configuration of the user terminal 2. As shown in FIG. The user terminal 2 is an information processing device (computer) such as a smartphone, tablet terminal, or personal computer, which includes a control unit 201, a memory 202, a storage 203, an operation unit 204, a display unit 205, and a communication unit 206. The control unit 201 is a processor that executes a program, controls each unit of the user terminal 2, and performs processing to realize the functions of the user terminal 2. The control unit 201 uses a CPU (Central Processing Unit). The memory 202 is a computer-readable storage medium, and is configured from RAM (Random Access Memory), ROM (Read Only Memory), and the like. The storage 203 is a computer-readable storage medium, and is configured by an SSD (Solid State Drive), a hard disk, or the like. The memory 202 and / or the storage 203 store programs executed by the control unit 201. The operation unit 204 is used to operate the user terminal 2. The operation unit 204 corresponds to, for example, a keyboard and mouse of a personal computer, or a touch panel of a smartphone or tablet terminal. The display unit 205 displays information received from the server 1 and various screens (FIGS. 9, 10, 11, 13 to 16, and 19). The display unit 205 may be, for example, a liquid crystal display or a touch panel. The communication unit 206 is connected to the Internet 9 and communicates with the server 1 via the Internet 9 . A web browser is installed on the user terminal 2.

[0015] The reservation server 3 is an information processing device having the same hardware configuration as the server 1, and is synonymous with a reservation system. There are multiple reservation servers 3, such as reservation server 3A managed by bus company A that operates express bus A on the first route, and reservation server 3B managed by bus company B that operates express bus B on the second route. The reservation server 3A has traditionally operated reservation site A for express bus A and route 1. For this reason, it has been assumed that users can access reservation site A using an information terminal and make reservations for express bus A and its route A. The reservation server 3B has been operating reservation site B for express bus B and the second route. For this reason, it has been assumed that users can access reservation site B using an information terminal and make reservations for express bus B and its route B. In this way, a plurality of reservation servers 3 are provided according to the operators of express buses, and the express buses and routes operated by the operators. The reservation server 3 communicates with the server 1 via the Internet 9 . The reservation server 3 has the same hardware configuration as the server 1, and therefore a detailed description thereof will be omitted.

[0016] The payment server 4 is an information processing device having the same hardware configuration as the server 1, and is synonymous with a payment system. The payment server 4 performs payment processing for the item for which the reservation processing has been performed by the server 1. The payment server 4 of this embodiment is operated by a credit card company and allows credit card payments. In addition to or in addition to credit card payment, other payment methods (bank transfer, electronic money payment, convenience store payment, etc.) can also be used. The payment server 4 has the same hardware configuration as the server 1 and the reservation server 3, and therefore a detailed description thereof will be omitted.

[0017] FIG. 4 is a functional configuration diagram of the server 1. As shown in the figure, the server 1 (control unit 101) includes a storage means 11, an extraction means 12, a display control means 13, a reservation means 14, a payment means 15, a reservation change means 16, a reservation cancellation means 17, and a benefit granting means 18.

[0018] The storage means 11 stores in advance information on currently existing express bus routes throughout the country. The route information is the same as the route information managed by the reservation server 3. For this reason, it is sufficient to acquire and store route information managed by each reservation server 3 in the storage means 11. For example, when updating route information in each reservation server 3, the updated route information may be transmitted from the reservation server 3, or route information may be acquired from the server 1 as appropriate through API linkage to update the information. Route information may be acquired not only from the reservation server 3, but also from an information disclosure service (information disclosure server) that provides express bus route information. Specifically, the route information is configured to identify various information related to the route, such as the name of the route, the names and order of each stop, the names of the areas where each stop is located, the names of the areas where the route begins and ends, and the operating bus company, and each piece of information is linked to each other. Therefore, by referring to the route information, the control unit 101 can recognize, for example, the names of existing express bus routes, the names and arrangement order of each stop, the names of the areas where each stop is located, the names of the areas where the route starts and ends, the operating bus company, etc.

[0019] In particular, in the server 1 according to this embodiment, the route information groups routes that are the subject of transfers together so that not only direct routes but also transfer routes can be searched for. A "direct route" is a route that does not require a transfer, while a "transfer route" is a route that does require a transfer. "Grouping" basically means that when the area or stop at the end of one line is the same as the area or stop at the beginning of another line, the two lines are linked in series and stored. The explanation of these two routes is just an example, and three or more routes can be linked in series and grouped.

[0020] FIG. 5 is a diagram illustrating an example of grouping information. The grouping information will be explained using the first row in FIG. 5 as an example. This grouping information links the "Tokyo → Osaka" route (preceding route) with the "Osaka → Okayama" route and the "Osaka → Hiroshima" route (following route) as the same group, since the ending region of the "Tokyo → Osaka" route and the starting region of the "Osaka → Okayama" route and the "Osaka → Hiroshima" route are the same, "Osaka." Note that "〇〇→□□" indicates the name of the route, 〇〇 indicates the name of the area where the route starts, and □□ indicates the name of the area where the route ends. This allows you to set (register) a transfer route where you travel by express bus on the "Tokyo → Osaka" route, get off in Osaka and change onto another express bus to head to Okayama, or a transfer route where you travel by express bus on the "Tokyo → Osaka" route, get off in Osaka and change onto another express bus to head to Hiroshima. The setting and registration (storage) of the transfer route may be performed automatically by a computer or manually in accordance with the above-mentioned rules. By doing this artificially, it is possible to set only the transfer routes that are deemed necessary. In the case of computer processing, there is a possibility that a large number of unnecessary transfer routes will be set, but it is possible to reduce the number of unnecessary transfer routes by combining the methods described below (such as limiting the number of transfers) or by thinning them out manually. The grouping information is stored in the storage means 11 as information constituting a part of the route information.

[0021] The extraction means 12 extracts routes that can be used by the user (hereinafter also referred to as “usable routes”) from the track information stored in the storage means 11, based on the information input by the user terminal 2. The extraction means 12 is capable of extracting not only direct routes but also connecting routes. A "transit route" can also be defined as a route (available route) that involves transfers between multiple routes, including a preceding route (first route) and a following route (second route). Because it is "multiple routes," it is not limited to transfers between two routes, but also includes transfers between three or more routes. In other words, available routes include not only connecting routes that connect two routes, but also connecting routes that connect three or more routes.

[0022] FIG. 6 is an explanatory diagram of a route search based on grouping, which is executed in the server 1 (extraction means 12) according to this embodiment. The following describes a case where a route search is performed using the search condition "Tokyo → Okayama." The "search conditions" can be set by the user through input operations on the user terminal 2. That is, when the search conditions (starting point: Tokyo and destination: Okayama) are input on the user terminal 2, the user terminal 2 transmits the input search condition information to the server 1. In the server 1, the communication unit 104 receives the search condition information transmitted from the user terminal 2, and the server 1 can set search conditions based on the search condition information.

[0023] When the search condition is "Tokyo → Okayama," the control unit 101 (extraction unit 12) first refers to the route information (including grouping information) stored in the storage means 11 and extracts the route (first route) whose starting area is "Tokyo." As a result, the routes "Tokyo → Osaka," "Tokyo → Kobe," and "Tokyo → Okayama" are extracted as the first routes. However, routes where the area where the extracted route ends is the same as the starting area will be excluded. In this way, the rule that excludes an extracted route if the area at the end of the route is "the same as the starting point" is called the "first rule." Furthermore, since there are no routes among the above first routes that fall under the first rule, there are no routes that are excluded based on the first rule. If the area at the end of the extracted route is "the same as the destination," the extraction means 12 extracts the route as an available route. The process ends without searching for routes below the route extracted as an available route. In this way, if the area at the end of the extracted route is "the same as the destination," the route is extracted as an available route, and the rule that ends the route search at that point is called the "second rule." Among the first routes, the route that falls under the second rule is "Tokyo → Okayama." Therefore, the extraction means 12 extracts the direct route of the "Tokyo → Okayama" route as an available route, and ends the process without searching for routes lower than "Tokyo → Okayama".

[0024] Next, the control unit 101 (extraction unit 12) extracts a route (second route) that starts from the area where the first route ends. That is, for each of the preceding routes "Tokyo → Osaka" and "Tokyo → Kobe," a following route (second route) is extracted. In the case of the "Tokyo → Osaka" route, the ending region is "Osaka," so routes that start in "Osaka" are extracted. As a result, "Osaka → Tokyo," "Osaka → Okayama," and "Osaka → Hiroshima" are extracted as the second routes. However, based on the first rule, the "Osaka → Tokyo" route is excluded because the area at the end of the extracted route is the same as the starting point. In the case of the "Tokyo → Kobe" route, the ending region is "Kobe," so routes that start in "Kobe" are extracted. As a result, "Kobe → Tokyo" and "Kobe → Okayama" are extracted as the second routes. However, based on the first rule, the "Kobe → Tokyo" route is excluded because the area at the end of the extracted route is the same as the starting point. As a result, the "Osaka → Okayama" route and the "Kobe → Okayama" route are extracted as (part of) available routes based on the second rule, since the region at the end of the route is the same as the destination. That is, in this case, the connecting route "Tokyo → Osaka" → "Osaka → Okayama" and the connecting route "Tokyo → Kobe" → "Kobe → Okayama" are extracted as available routes. The route search for each line is also terminated.

[0025] Next, the control unit 101 (extraction unit 12) extracts a route (third route) that starts from the area where the second route ends. That is, the control unit 101 extracts a route (third route) that follows the preceding route, "Osaka → Hiroshima." In the case of the "Osaka → Hiroshima" route, the ending region is "Hiroshima," so we extract the route with "Hiroshima" as the starting region. As a result, the "Hiroshima → Okayama" route is extracted. The "Hiroshima → Okayama" route is extracted as (part of) an available route based on the second rule, since the area at the end of the route is the same as the destination. That is, in this case, the extraction means 12 extracts the connecting route "Tokyo → Osaka" → "Osaka → Hiroshima" → "Hiroshima → Okayama" as an available route, and terminates the route search. In this way, the route search applies the first and second routes in the order of first route → second route → third route → ..., and executes a process to extract available routes in stages until there are no more routes to search for. In summary, when a route search is performed using "Tokyo → Okayama" as the search criterion, the following routes are extracted as available: "Tokyo → Osaka" → "Osaka → Okayama" (A1 → A3 → A5 in Figure 6), "Tokyo → Osaka" → "Osaka → Hiroshima" → "Hiroshima → Okayama" (A1 → A3 → A6 → A8 in Figure 6), and the connecting routes "Tokyo → Kobe" → "Kobe → Okayama" (B1 → B3 → B5 in Figure 6), as well as the direct route "Tokyo → Okayama" (C1 → C3 in Figure 6).

[0026] However, even if we group route combinations in which the end area of ​​the first route and the start area of ​​the second route are the same while following the first and second rules described above, there are many such combinations, so there is a problem that simply extracting available routes through computer processing may result in extracting many useless available routes. This problem can be addressed by limiting the number of transfers to a certain number. That is, the extraction means 12 extracts, as available routes, transit routes with a specific number of transfers or less, and does not extract, as available routes, transit routes with a specific number of transfers or more. If we set "specific number = 2," the route "Tokyo → Osaka" → "Osaka → Hiroshima" → "Hiroshima → Okayama" (A1 → A3 → A6 → A8 in Figure 6) mentioned above will not be extracted as an available route because it has three transfers.

[0027] In addition to limiting the number of transfers, the available routes can also be limited by other methods. For example, the grouping information is set manually. As an example, a combination (grouping) of routes for which demand for transfers is expected from the perspectives of bus operators, travel agents, and users is manually detected, and the grouping information is stored in the storage means 11. For example, if past usage history shows that many passengers use express buses to travel between Hiroshima and Okayama, or if prior interviews and surveys show that Hiroshima is popular, and Okayama is also the departure and arrival point, Hiroshima, which is one bus stop (nearby area) from Okayama, will be set as the transfer point. As a result, even if the route "Tokyo → Osaka" → "Osaka → Hiroshima" → "Hiroshima → Okayama" (A1 → A3 → A6 → A8 in Figure 6) cannot be extracted due to the limit on the number of transfers, as mentioned above, this route can be extracted as an available route as an exception.

[0028] The aforementioned route "Tokyo → Osaka" → "Osaka → Hiroshima" → "Hiroshima → Okayama" (A1 → A3 → A6 → A8 in Figure 6) is a round-trip transfer route (hereinafter referred to as the special transfer route) in which the passenger passes through Okayama (destination) from Osaka, arrives in Hiroshima, and then transfers to another express bus in Hiroshima to continue to Okayama (destination). FIG. 7 is an explanatory diagram of a special connecting route. As shown in the figure, a special connecting route is, in other words, a connecting route in which the distance from the departure point (Tokyo) to the connecting point (Hiroshima) is longer than the distance from the departure point (Tokyo) to the destination (Okayama). In other words, the special transfer route is also a transfer route that overlaps the preceding route "Osaka → Hiroshima" and the following route "Hiroshima → Okayama" in the "Hiroshima - Okayama" section (part of the section). At first glance, such special transfer routes seem unnecessary.

[0029] However, for example, if a user living in Tokyo whose parents live in Hiroshima needs to go to Okayama for business purposes, they will be able to return to Hiroshima first before traveling to Okayama on a business trip. It is possible to adjust the time until the transfer or set the transfer for the next day, allowing users to make more effective use of their time at the transfer point. Such services are not offered by conventional transportation services, including express buses, and even if they were feasible, they were latent. For this reason, previous users felt some frustration that they had come so close to their parents' homes but were unable to return home, but it seems that they gave up on the idea due to regulatory considerations and common sense. The express bus system of this embodiment can realize a new service that provides connecting routes that allow passengers to travel to areas farther than their destination before arriving at their destination, thereby resolving potential issues with conventional transportation services.

[0030] This section explains route searches based on search criteria limited to bus stop names. Stop-based route search is similar to the area-based route search described above. For this reason, we will omit the explanation of the parts that are common to area-based route search, and will only provide an explanation that will allow you to understand stop-based route search.

[0031] In a route search based on bus stops, the user operates the user terminal 2 to specify the departure point and destination by bus stops. For example, if there is a bus stop called "Tokyo Station" in Tokyo, and there are bus stops called "Okayama Interchange" and "Okayama Station" in Okayama, and there are routes "Tokyo Station → Okayama Interchange" and "Tokyo Station → Okayama Station," you can specify "Tokyo Station" as the departure point and "Okayama Interchange" or "Okayama Station" as the destination.

[0032] For this reason, in the route information, the names of each bus stop and the area name are stored in association with each other. For example, since there are bus stops called "OCAT" and "Umeda Tower" in "Osaka," the route information stores "Osaka" (area name) in association with "OCAT" and "Umeda Tower" (stop name). Similarly, since there are stops called "Okayama Station" and "Okayama Interchange" in "Okayama," in the route information, "Okayama" (area name), "Okayama Interchange" (stop name), and "Okayama" are stored in association with each other. Similarly, since there are bus stops called "Kobe Sannomiya" and "Kobe Station" in "Kobe," the route information stores "Kobe" (area name) in association with "Kobe Sannomiya" and "Kobe Station" (stop names). It is assumed that "Tokyo" only has a stop called "Tokyo Station," and "Hiroshima" only has a stop called "Hiroshima Station." For this reason, "Tokyo" (area name) and "Tokyo Station" (stop name), and "Hiroshima" (area name) and "Hiroshima Station" (stop name) are linked and stored.

[0033] In addition, in the route information, it is assumed that there are stop-based routes "Tokyo Station → Umeda Tower" and "Tokyo Station → OCAT" corresponding to "Tokyo → Osaka" (area name). Similarly, it is assumed that there are stop-based routes "OCAT → Okayama Station" and "OCAT → Okayama Interchange" (stop name) corresponding to "Osaka → Okayama" (area name). Similarly, it is assumed that there is a stop-based route "OCAT → Hiroshima Station" (stop name) corresponding to "Osaka → Hiroshima" (area name). Similarly, it is assumed that there are stop-based routes "Tokyo Station → Kobe Sannomiya" and "Tokyo Station → Kobe Station" (stop name) corresponding to "Tokyo → Kobe" (area name). Similarly, it is assumed that there are stop-based routes "Kobe Station → Okayama Interchange" and "Kobe Station → Okayama Station" (stop name) corresponding to "Kobe → Okayama" (area name). Similarly, it is assumed that there are stop-based routes "Tokyo Station → Okayama Interchange" and "Tokyo Station → Okayama Station" (stop name) corresponding to "Tokyo → Okayama" (area name).

[0034] Under these assumptions, when a route search is executed using the search condition "Tokyo Station → Okayama Station," the same processing as the route search based on the area name described above is executed. The "first rule" is interpreted as "a rule that excludes a route if the stop is the same as the last stop of the extracted route." In addition, the "second rule" is interpreted and applied as "a rule that extracts an extracted route as an available route if the last stop of the extracted route is the same as the destination, and terminates the route search at that point." As a result, the transfer routes "Tokyo Station → OCAT" → "OCAT → Okayama Station" (A1 → A3 → A5 in Figure 6), "Tokyo Station → OCAT" → "OCAT → Hiroshima Station" → "Hiroshima Station → Okayama Station" (A1 → A3 → A6 → A8 in Figure 6), and "Tokyo Station → Kobe Station" → "Kobe Station → Okayama Station" (B1 → B3 → B5 in Figure 6), as well as the direct route "Tokyo Station → Okayama Station" (C1 → C3 in Figure 6), are extracted as available routes.

[0035] The display control means 13 is a function for causing the information output by the server 1 to be displayed on the user terminal 2. Specifically, the information transmitted by the server 1 can be displayed on the display unit 205 (on the web browser) using a web browser provided in the user terminal 2. The display control means 13 can, for example, display information on available routes extracted by the extraction means 12 on the user terminal 2. In this case, the server 1 (communication unit 104) transmits information on the extracted available routes to the user terminal 2. The user terminal 2 displays the information about the available routes sent from the server 1 on the display unit 205 (see FIG. 10).

[0036] The reservation means 14 executes reservation processing for available routes in response to operations on the user terminal 2. The reservation means 14 can execute reservation processing for a plurality of routes that make up a connecting route in a batch in response to an operation of the user terminal 2. This "collective reservation processing" is performed in cooperation with multiple reservation servers 3 that are each responsible for the reservation processing of multiple routes. Specifically, server 1 works in conjunction with reservation server 3A, which has traditionally been responsible for processing reservations for the "Tokyo Station → OCAT" route, and reservation server 3B, which has traditionally been responsible for processing reservations for the "OCAT → Okayama Station" route. For reservation processing for the "Tokyo Station → OCAT" route, server 1 sends reservation request information to reservation server 3A, and for reservation processing for the "OCAT → Okayama Station" route, it sends reservation request information to reservation server 3B. When reservation server 3A receives reservation request information for the "Tokyo Station → OCAT" route, it executes reservation processing for the "Tokyo Station → OCAT" route, and when reservation server 3B receives reservation request information for the "OCAT → Okayama Station" route, it executes reservation processing for the "OCAT → Okayama Station" route. That is, the server 1 transmits reservation request information to the reservation server 3 that handles reservation processing for the target route, and requests the reservation processing, and the reservation processing is then executed by the reservation server 3. Of course, reservations for direct routes can also be processed. In this case, the server 1 may transmit reservation request information to the reservation server 3 that is responsible for reservation processing for direct routes, and request the reservation processing.

[0037] The payment means 15 executes payment processing in response to the operation of the user terminal 2. The payment means 15 can execute payment processing for multiple reserved routes in a lump in response to an operation of the user terminal 2. This "lump-sum payment processing" is realized by the cooperation between the server 1 and the payment server 4. This is because the payment server 4 is, for example, a payment processing device managed and operated by a credit company. Therefore, server 1 receives information necessary for payment (user's name, amount, card number, expiration date, security code, etc.) from user terminal 2, and sends payment request information including that information to payment server 4 to request payment processing, and payment processing is then executed by payment server 4. The express bus system of this embodiment is equipped with one payment server 4, but if there is a payment system for each credit company, cooperation with each payment server 4 equipped in each payment system will be necessary. For example, if only credit card A can be used to settle (pay) the fare for express bus A or the first route (first fare) and the settlement process can be performed by settlement server 4A, and only credit card B can be used to settle (pay) the fare for express bus B or the second route (second fare) and the settlement process can be performed by settlement server 4B, server 1 will send settlement request information to settlement server 4A for the settlement process for the first fare, and will send settlement request information to payment server 4B for the payment process for the second fare.

[0038] The reservation change means 16 executes reservation change processing in response to an operation on the user terminal 2. The reservation change means 16 can execute reservation change processing for multiple reserved routes in a batch in response to an operation on the user terminal 2. The reservation cancellation means 17 can execute a reservation cancellation process in response to an operation on the user terminal 2. The reservation cancellation means 17 can execute cancellation processing for multiple reserved routes in a batch in response to an operation on the user terminal 2. The reservation change means 16 and the reservation cancellation means 17 will be described in detail later (FIGS. 17 and 18).

[0039] The privilege granting means 18 grants privileges such as fare discounts and points to users of the connecting route. In particular, the benefit granting means 18 can grant a larger benefit to a user of a transit route with a second number of transfers, which is greater than the first number, than to a user of a transit route with a first number of transfers, when using the transit route. Specifically, the discount rate may be set higher the more transfers there are, such as X% for one transfer, Y% (≧X%) for two transfers, and Z% (≧Y%) for three transfers. The discount amount may vary depending on the situation at the time of reservation (for example, the discount rate may be higher during off-season than during peak season, or the discount rate may be higher when there are many vacant seats). A special connecting route may be given a higher discount rate than a normal connecting route, in which case the longer the overlapping distance between the preceding route and the following route, the higher the discount rate may be. In addition, the discount amount can be set by combining other factors such as the distance of the route, the time of use, the cumulative number of transfers including past transfers, etc. The administrator can also set any discount amount or discount rate. This will make it easier to use connecting routes at low cost, and will increase the value of express buses through an increase in users, etc.

[0040] The functions of the reservation server 3 will not be described in detail here, as they utilize a known express bus reservation system. The functions of the payment server 4 will not be described in detail because it utilizes a known payment system such as credit card payment.

[0041] (Processing Procedure) A specific processing procedure (high-speed bus processing method) in the high-speed bus system will now be described. Specifically, we will explain "route search," "reservation and payment," "reservation change," and "reservation cancellation" in order.

[0042] (Route search) The route search process will now be described. FIG. 8 is a sequence chart showing the procedure for route search. As shown in the figure, in the route search process, first, search condition information is input (S101). The search condition information is input by the user operating the user terminal 2. FIG. 9 is a diagram showing an example of a route search screen displayed on the user terminal 2 (display unit 205). The route search screen is a web screen managed by the server 1, and can be displayed by inputting a predetermined URL (Uniform Resource Locator) into the web browser of the user terminal 2. On the route search screen, the user enters the search criteria information required for route search. For example, the departure point, destination, and departure date are input as search conditions (d1 to d3 in FIG. 9). The departure point and destination can be displayed, for example, in a pull-down menu, allowing the user to input the name of a region by selecting it, or, once a region is selected, to input the name of a bus stop in that region by selecting it (d1, d2 in FIG. 9). The departure point and destination can also be entered by selecting (clicking or tapping) the stop mark displayed on the map (d5 in Figure 9) (d4 in Figure 9). The departure date can be entered via the calendar linked to the icon or directly into the departure date field (d3 in Figure 9). In this processing procedure, it is assumed that the departure point "Tokyo Station," the destination "Okayama Station," and the departure date "February 1, 2024" are entered as search conditions (Figure 9). The departure date does not have to be entered at this stage, but may be entered immediately before making the reservation, for example. Other information (for example, departure time, arrival date, arrival time, stopovers, whether or not there is a connection, number of people, etc.) may also be entered as search conditions. The user terminal 2 (communication unit 206) transmits the input search condition information (place of departure, destination, and departure date) to the server 1.

[0043] When the server 1 (extraction means 12) receives the search condition information transmitted from the user terminal 2, it executes a route search (S102). In this example, the route search is performed by the extraction means 12 extracting available routes based on the departure point "Tokyo Station" and the destination "Okayama Station." The "departure date" is information required at the time of reservation, and is therefore stored in the server 1. As a result of the route search, four available routes are detected (extracted): (1) "Tokyo Station → OCAT" → "OCAT → Okayama Station," (2) "Tokyo Station → OCAT" → "OCAT → Hiroshima Station" → "Hiroshima Station → Okayama Station," (3) "Tokyo Station → Kobe Station" → "Kobe Station → Okayama Station," and (4) "Tokyo Station → Okayama Station." (1) to (3) are connecting routes, and (4) is a direct route. The explanation of route search has already been given, so it will be omitted here. The server 1 transmits the search result information of the route search to the user terminal 2 (S103). Specifically, the information on the available routes (1) to (4) above is transmitted.

[0044] When the user terminal 2 receives the search result information transmitted from the server 1, it displays the search result on the display unit 205 (S104). FIG. 10 is a diagram showing an example of a search result screen displayed on the display unit 205 of the user terminal 2. As shown in FIG. As shown in the figure, the search result screen displays information on the available routes (1) to (4) described above (d11). In other words, four available routes are displayed for selection: (1) "Tokyo Station → OCAT" → "OCAT → Okayama Station," (2) "Tokyo Station → OCAT" → "OCAT → Hiroshima Station" → "Hiroshima Station → Okayama Station," (3) "Tokyo Station → Kobe Station" → "Kobe Station → Okayama Station," and (4) "Tokyo Station → Okayama Station."

[0045] Next, route selection is performed (S105). Specifically, on the user terminal 2, the user selects a desired route from among routes (1) to (4) displayed on the search result screen (FIG. 10). In this processing procedure, it is assumed that (1) the transfer route "Tokyo Station → OCAT" (first line) → "OCAT → Okayama Station" (second line) has been selected. The user terminal 2 transmits information about the selected route to the server 1.

[0046] Next, when the server 1 receives the information on the connecting route transmitted from the user terminal 2, it transmits flight confirmation information to each reservation server 3 (S106). Specifically, flight confirmation information including the first route information and departure date is sent to the reservation server 3A, and flight confirmation information including the second route information and departure date is sent to the reservation server 3B. This is because reservation server 3A has traditionally been responsible for the operation management of route 1, "Tokyo Station → OCAT," and reservation server 3B has traditionally been responsible for the operation management of route 2, "OCAT → Okayama Station." In other words, since server 1 does not perform flight management, it requests flight confirmation from reservation server 3, which does manage flights. The "departure date" to be included in the flight confirmation information is the departure date received in S101 and stored in the server 1. Note that this "departure date" is not limited to the information received in S101, and may be, for example, the departure date input and transmitted on the user terminal 2 side when selecting the route in S105. It is preferable that the departure time of the second route is later than the arrival time of the first route and is within a predetermined time from the arrival time. Therefore, after receiving flight information for the first route from the reservation server 3A, the server 1 includes the arrival time for the first route included in the flight information in flight confirmation information and transmits it to the reservation server 3B (not shown). In addition, grouping may be set taking into account the arrival time of the first route and the departure time of the second route.

[0047] When each reservation server 3 receives flight confirmation information from the server 1, it searches for flight information (available departure and arrival times, fares, and seat availability) for each route and transmits it to the server 1. The reservation server 3A searches for flight information related to the first route and sends the flight information as the search result to the server 1 (S107), and the reservation server 3B searches for flight information related to the second route and sends the flight information as the search result to the server 1 (S108). In this processing procedure, the flight information for the first route is searched for as "2024 / 2 / 1_22:10-06:44_7,800 yen_6 seats remaining," and the flight information for the second route is searched for as "2024 / 2 / 2_09:30-12:30_2,900 yen_2 seats remaining" and "2024 / 2 / 2_10:30-13:30_3,000 yen_5 seats remaining." You can also set or limit the number of flights that are returned as search results. Searching for flight information is a well-known function provided in conventional reservation systems, and therefore a detailed description thereof will be omitted.

[0048] Next, the server 1 transmits flight information about all routes to the user terminal 2 (S109). Specifically, the server 1 transmits to the user terminal 2 the flight information regarding the first route and the flight information regarding the second route received from the reservation servers 3A and 3B. That is, the flight information for the first route is "2024 / 2 / 1_22:10-06:44_7,800 yen_6 seats remaining," and the flight information for the second route is "2024 / 2 / 2_09:30-12:30_2,900 yen_2 seats remaining" and "2024 / 2 / 2_10:30-13:30_3,000 yen_5 seats remaining."

[0049] The user terminal 2 displays the flight information received from the server 1 on the display unit 205 (S110). That is, the flight information for the first route is displayed as "2024 / 2 / 1_22:10-06:44_7,800 yen_6 seats remaining", and the flight information for the second route is displayed as "2024 / 2 / 2_09:30-12:30_2,900 yen_2 seats remaining" and "2024 / 2 / 2_10:30-13:30_3,000 yen_5 seats remaining". FIG. 11 is a diagram showing an example of the flight candidate display / selection screen. As shown in the figure, the flight candidate display / selection screen displays flight candidate information for the first flight (d21) and also displays flight candidate information for the second flight (d22). Specifically, the following flight candidate information is displayed: Flight 1_Tokyo → Osaka, Boarding date_Monday, February 1, 2024, Section_Tokyo Station → OCAT, Flight candidate 1_22:10 → 6:44, Fare_7,800 yen, Remaining seats_6 (d21); Flight 2_Osaka → Okayama, Boarding date_Monday, February 2, 2024, Section_OCAT → Okayama Station, Flight candidate 1_9:30 → 12:30, Fare_2,900 yen, Remaining seats_2; and Flight candidate 2_10:30 → 13:30, Fare_3,000 yen, Remaining seats_5 (d22).

[0050] (Reservations and payments) The reservation and payment processing procedures will now be described. FIG. 12 is a sequence chart showing the reservation and payment processing procedure. As shown in the figure, in the reservation process, first, flight selection is performed (S201). Specifically, the user selects the desired flight from among the flight candidates displayed on the flight candidate display / selection screen (Fig. 11). As shown in Figure 11, the flight candidate display / selection screen has check boxes for each flight candidate that can be used to select the flight candidate, so users can select their desired flight by selecting the check box for the flight candidate. In this processing procedure, the first flight selected is flight candidate 1, which departs from Tokyo Station at 22:10 and arrives at OCAT at 6:44, and the second flight selected is flight candidate 2, which departs from OCAT at 10:30 and arrives at Okayama Station at 13:30 (Figure 11). The user terminal 2 transmits the selected flight information (boarding flight information) to the server 1. Specifically, the boarding information is transmitted as [Tokyo Station → OCAT_2024 / 2 / 1_22:10-06:44] and [OCAT → Okayama Station_2024 / 2 / 2_10:30-13:30].

[0051] When the server 1 receives the flight information from the user terminal 2, it calculates the discount amount (S202). This is because certain discounts (transfer discounts) are applied to transfer routes as a transfer benefit. Transfer discounts can be set so that the more transfers there are, the greater the discount amount. For example, if the discount rate for one transfer is X%, for two transfers it is Y% (≧X%), and for three transfers it is Z% (≧Y%), the discount amount or fare is calculated by multiplying the fare by the discount rate according to the number of transfers. It is also possible to apply different discount rates and amounts during off-peak and peak seasons, or to apply discount rates and amounts based on the number of available seats. Passengers on special transfer routes may be eligible for higher discount rates and amounts than those on regular transfer routes. In this processing procedure, a discount of 200 yen is applied to the standard fee of 10,800 yen, which is made up of 7,800 yen for the first shipment and 3,000 yen for the second shipment, resulting in a net fee of 10,600 yen. The server 1 transmits fee information such as the standard fee, the discount amount, and the deduction amount to the user terminal 2 (S203).

[0052] When the user terminal 2 receives the fee information from the server 1, it displays the fee information on the display unit 205 (S204). FIG. 13 shows an example of a fee information display screen displayed on the user terminal 2 (display unit 205). As shown in the figure, the fee information display screen can display the standard fee, discount amount, and deduction fee (d33). In this processing procedure, the standard fee of 10,800 yen, the discount amount of 200 yen, and the net fee of 10,600 yen are displayed. The fare information display screen can display the standard fare for the first flight (7,800 yen) (d31) or the standard fare for the second flight (3,000 yen) (d32).

[0053] Next, a reservation is made at the user terminal 2 (S205). Specifically, by selecting the "Proceed to reservation" button displayed on the price information display screen, the screen will move to the reservation screen. FIG. 14 is a diagram showing an example of the reservation screen. As shown in FIG. 14, the reservation screen has an input field for the user's personal information (such as name and contact information) (d41). In this processing procedure, it is assumed that "Name: Yamada Taro" and "Email address: yamada@bus.com" are entered (when making a reservation without logging in). You can also make a reservation by logging in. For example, by selecting the SNS login button (d42) displayed on the reservation screen, you can automatically log in via SNS integration and make a reservation request. When the reservation application is completed, the user terminal 2 transmits the reservation information to the server 1. In this processing procedure, personal information (name, contact information, etc.) and flight information ([Tokyo Station → OCAT_2024 / 2 / 1_22:10-06:44], [OCAT → Okayama Station_2024 / 2 / 2_10:30-13:30]) are sent.

[0054] When the server 1 receives the reservation information transmitted from the user terminal 2, it transmits reservation request information to the reservation server 3 (S206, S208). Specifically, reservation request information regarding the first route ("Tokyo Station → OCAT") is sent to reservation server 3A, and reservation request information regarding the second route ("OCAT → Okayama Station") is sent to reservation server 3B. This is because reservation server 3A has traditionally been responsible for processing reservations for the first route, "Tokyo Station → OCAT," and reservation server 3B has traditionally been responsible for processing reservations for the second route, "OCAT → Okayama Station." That is, since the server 1 is not currently processing reservations, it sends reservation request information to the reservation server 3, which has traditionally been responsible for reservation processing, to request the server 1 to process the reservations.

[0055] When the reservation server 3A receives the reservation request information from the server 1, it executes reservation processing for the first route (S207). When the reservation server 3A completes the reservation process, it transmits to the server 1 a reservation number indicating the reservation result. When the reservation server 3B receives the reservation request information from the server 1, it executes reservation processing for the second route (S209). When the reservation server 3B completes the reservation process, it transmits to the server 1 a reservation number indicating the reservation result. This will complete the reservation for the following flights: [Tokyo Station → OCAT_2024 / 2 / 1_22:10-06:44] and [OCAT → Okayama Station_2024 / 2 / 2_10:30-13:30].

[0056] In other words, the reservation process for the first route can be performed by a reservation server 3A (first device) operated by a first operator, and the reservation process for the second route can be performed by a reservation server 3B (second device) operated by a second operator different from the first operator.The reservation means 14 causes the reservation process for the first route to be performed by the reservation server 3A (first device) and the reservation process for the second route to be performed by the reservation server 3B (second device), thereby making it possible to perform the reservation process for a connecting route consisting of the first route and the second route in one go.

[0057] When the server 1 receives the reservation result from each reservation server 3, it transmits the reservation information and the reservation management number to the user terminal 2 (S210). The reservation management number is managed by the server 1. The reservation management number may be, for example, a number that combines the reservation number received from the reservation server 3A and the reservation number received from the reservation server 3B, or a newly assigned number may be managed in association with the reservation number.

[0058] When the user terminal 2 receives the reservation result (reservation management number) transmitted from the server 1, it displays the reservation result (reservation management number) on the display unit 205 (S211). FIG. 15 is a diagram showing an example of the reservation result screen. As shown in the figure, the reservation result screen displays the reservation management number "123456" indicating the reservation result on the user terminal 2 (display unit 205) (d51). This allows the user to know that the reservation has been completed.

[0059] Next, the payment information is entered into the user terminal 2 (S212). Payment information can be entered via the payment execution screen. FIG. 16 is a diagram showing an example of the payment execution screen. The payment execution screen can be displayed by selecting the "Proceed to payment" button on the reservation result screen (Figure 15). As shown in the figure, the payment execution screen displays the fee (d61) as payment information and provides an input field (d62) for credit card information (card number, expiration date, security code). The user's name can also be added to the payment information. The user enters the necessary payment information in the input fields. In this processing procedure, it is assumed that the following payment information has been entered: "Card number: 1234-5678-9021, expiration date: 2026 / 5 / 2, security code: ***" (Figure 16). The user terminal 2 transmits the entered payment information (including the fee) to the server 1.

[0060] When the server 1 receives the payment information transmitted from the user terminal 2, it transmits payment request information including the payment information to the payment server 4 (S213).

[0061] When the payment server 4 receives the payment request information transmitted from the server 1, it executes the payment process based on the payment information (S214). This will result in a credit card payment of 10,600 yen. That is, the payment means 15 executes the payment process in succession to the reservation process. The payment server 4 transmits the payment result to the server 1.

[0062] When the server 1 receives the payment result transmitted from the payment server 4, it transmits the payment result to the user terminal 2 (S215). When the user terminal 2 receives the payment result transmitted from the server 1, it displays the payment result on the display unit 205 (S216). This allows the user to know that the payment has been completed.

[0063] In this way, in the express bus system of this embodiment, reservations and payments for express buses can be made in a single operation.

[0064] (Reservation change) The procedure for changing a reservation will now be described. FIG. 17 is a sequence chart showing the procedure for changing a reservation. As shown in the figure, reservation changes can be made while the reservation information received from the server 1 is displayed on the display unit 205. For example, the reservation result screen (Figure 15) that displays the reservation information received from Server 1 (boarding information for the first reserved flight [Tokyo Station → OCAT_2024 / 2 / 1_22:10-06:44] and the second flight [OCAT → Okayama Station_2024 / 2 / 2_10:30-13:30]) can also be used as Reservation Change Screen 1. That is, in changing a reservation, first, the reservation change screen 1 is displayed on the display unit 205 of the user terminal 2 (S301).

[0065] Next, reservation change operation 1 is performed (S302). Specifically, reservation change operation 1 is an operation to specify the original flight information (i.e., the old flight information), and if the flight information for the first and second flights is displayed on reservation change screen 1, one or both of them can be selected as the flight to be changed. In this processing procedure, it is assumed that the second flight ([OCAT → Okayama Station_2024 / 2 / 2_10:30-13:30]) is selected. The user terminal 2 transmits the original flight information to the server 1.

[0066] When the server 1 receives the original flight information transmitted from the user terminal 2, it transmits the original flight information to the corresponding reservation server 3 (S303). In this processing procedure, the original flight information is sent to the reservation server 3B that is in charge of the reservation processing for the "OCAT → Okayama Station" route.

[0067] When the reservation server 3B receives the original flight information from the server 1, it transmits the candidate flight information to the server 1 (S304). Specifically, the reservation server 3B performs a new flight search based on the departure and arrival points and departure date of the flight to be changed that are included in the original flight information, and sends the search results to the server 1 as flight information for the flight to be changed. In this processing procedure, "2024 / 2 / 2_09:30-12:30_2,900 yen_2 seats remaining" and "2024 / 2 / 2_10:30-13:30_3,000 yen_5 seats remaining" are detected and sent as flight information for changes.

[0068] When the server 1 receives the flight information transmitted from the reservation server 3B, it transmits the flight information to the user terminal 2 (S305).

[0069] When the user terminal 2 receives the flight information transmitted from the server 1, it displays the flight information on the display unit 205 (S306). The user terminal 2 can display flight information by using the flight candidate display / selection screen (FIG. 11) as a reservation change screen 2 as well.

[0070] Next, reservation change operation 2 is performed (S307). Specifically, reservation change operation 2 is an operation to specify the destination flight information (i.e., new flight information). For example, if two flight options are displayed on reservation change screen 2, one or both of them can be selected. In this processing procedure, it is assumed that of flight candidate 1 "2024 / 2 / 2_9:30-12:30" and flight candidate 2 "2024 / 2 / 2_10:30-13:30", flight candidate 1 is selected as the changed destination flight information. The user terminal 2 transmits the changed destination information to the server 1.

[0071] When the server 1 receives the changed destination information transmitted from the user terminal 2, it calculates the discount amount (S308). The calculation of the discount amount is the same as in S202, so the explanation will be omitted. The server 1 transmits to the user terminal 2 fee information such as the standard fee, discount amount, and deduction fee. Specifically, fee information such as a standard fee of 10,700 yen, a discount amount of 200 yen, and a net fee of 10,500 yen is transmitted.

[0072] When the user terminal 2 receives the fee information transmitted from the server 1, it displays the fee information on the display unit 205 (S309). The fee information is displayed on the fee information display screen (Fig. 13). However, the net fee will be changed to "10,500 yen" (d33).

[0073] Next, a reservation is made at the user terminal 2 (S310). Specifically, the "Proceed to reservation" button on the price information display screen (Fig. 13) is selected. In response to this, the user terminal 2 transmits the change information to the server 1. The change information includes information on the destination of the change and information on the fee.

[0074] When the server 1 receives the change information transmitted from the user terminal 2, it transmits the change information to the reservation server 3B (S311). When the reservation server 3B receives the change information sent from the server 1, it executes reservation change processing (S312). Specifically, the source flight information "2024 / 2 / 2_9:30-12:30" is changed to the destination flight information "2024 / 2 / 2_10:30-13:30." This executes the reservation change. The reservation server 3B transmits the result of the change to the server 1.

[0075] When the server 1 receives the change result from the reservation server 3B, it transmits the payment request information (including the fee information) to the payment server 4 (S313). The payment request information is received from the user terminal 2 in S212 and the stored payment information is used, and the fee is 10,500 yen.

[0076] Upon receiving the payment request information transmitted from the server 1, the payment server 4 executes the payment process (S314). This will result in a credit card payment of 10,500 yen. The payment server 4 transmits the payment result to the server 1.

[0077] When the server 1 receives the payment result transmitted from the payment server 4, it transmits the change result including the change content to the user terminal 2 (S315). When the user terminal 2 receives the change result transmitted from the server 1, it displays the change result on the display unit 205 (S316). The change result is not shown in the drawing.

[0078] (Reservation cancellation) The procedure for canceling a reservation will now be described. FIG. 18 is a sequence chart showing the procedure for canceling a reservation. As shown in the figure, reservation cancellation can be performed in a state where reservation information received from the server 1 is displayed on the display unit 205. For example, a reservation can be canceled when a screen (reservation cancellation screen) with a "Cancel reservation" button added is displayed on the reservation result screen (Figure 15) that displays the reservation information received from Server 1 (boarding information for the reserved first flight [Tokyo Station → OCAT_2024 / 2 / 1_22:10-06:44] and second flight [OCAT → Okayama Station_2024 / 2 / 2_10:30-13:30]). That is, in canceling a reservation, first, a reservation cancellation screen (not shown) is displayed on the display unit 205 of the user terminal 2 (S401).

[0079] Next, the reservation cancellation operation is performed (S402). Specifically, the "cancel reservation button" is selected. In response to the reservation cancellation operation, the user terminal 2 transmits cancellation information to the server 1.

[0080] When the server 1 receives the cancellation information sent from the user terminal 2, it calculates the fee (S403). Next, the server 1 transmits the cancellation information to the reservation server 3A (S404) and also transmits the cancellation information to the reservation server 3B (S406). When the reservation server 3A receives the cancellation information sent from the server 1, it executes the reservation cancellation process (S405). The reservation server 3A sends the cancellation result to the server 1. When the reservation server 3B receives the cancellation information transmitted from the server 1, it executes the reservation cancellation process (S407). The reservation server 3B transmits the cancellation result to the server 1.

[0081] When the server 1 receives the cancellation results from the reservation servers 3A and 3B, it transmits payment request information to the payment server 4 (S408). The payment request information is the payment information received from the user terminal 2 in S212 and stored therein, and the fee is the fee calculated in S403.

[0082] Upon receiving the payment request information transmitted from the server 1, the payment server 4 executes the payment process (S409). This allows the fee to be paid by credit card. The payment server 4 transmits the payment result to the server 1.

[0083] When the server 1 receives the settlement result transmitted from the settlement server 4, it transmits the cancellation result including the cancellation details to the user terminal 2 (S410). When the user terminal 2 receives the cancellation result transmitted from the server 1, it displays the cancellation result on the display unit 205 (S411). The cancellation result is not shown in the drawing.

[0084] In this way, in the express bus system of this embodiment, express bus reservations can be canceled all at once. In other words, if you make a reservation for a connecting route and then want to cancel that reservation, in the past you would have had to access multiple counters and go through the reservation cancellation procedure individually at each one, but with the bus system of this embodiment, you can complete the procedure all at once.

[0085] (Recommendation information display) The display process of the recommendation information will be described. The express bus system of this embodiment is designed to provide various recommendation information to express bus users. Specifically, the server 1 acquires and stores route search and reservation history information for each member when the member user is logged in, and generates recommended information (recommendation information) that may be of interest to the member through analysis of the history information, and notifies the member of this information at the appropriate time via the user terminal 2. In particular, for members who have booked a connecting route, recommended information is displayed on the user terminal 2 via a web browser while logged in, and recommended information is sent to a pre-registered email address while not logged in.

[0086] FIG. 19 is a diagram showing an example of a recommendation display screen. Figure 19 shows the recommendation information that will be sent from Server 1 to Yamada's email address between the time of booking and the departure date when member Yamada reserves a connecting route with a departure date of February 1, 2024 and a boarding and transfer point of "Osaka." The recommended information shown in the figure suggests that Yamada has booked a connecting route and that the recommended information corresponds to the time when Yamada will transfer at the connecting point. Specifically, there are "recommended events" (d71), "recommended gourmet food" (d72), and "recommended spots" (d73). The "recommended events" information is recommended information that corresponds not only to the transfer location but also to the transfer period. The same applies to information on "recommended gourmet food" and "recommended spots." In particular, the "recommended spots" information reflects the results of Server 1's recognition or analysis, such as the fact that the arrival time at the transfer point is early in the morning and the departure time is the night before, and therefore the user is likely to be sleep-deprived.

[0087] Recommendation information can also be generated in association with conditions such as before, during, and after using the express bus. An example of recommendation information "before using the express bus" is to have the server 1 generate information encouraging members to make reservations for the express bus by pairing recommended spots etc. with the nearest bus stop, and notify the user terminal 2 by e-mail etc. An example of recommendation information "while using an express bus" is to have the server 1 generate optimal recommendation information for a member who has reserved an express bus before or during boarding, and notify the user terminal 2 at the appropriate time by e-mail or the like. In more detail, the user's current location can be identified from the time and the GPS information of the user terminal 2, and various information according to the current location (for example, while traveling near Mt. Fuji, videos and website information about Mt. Fuji, etc.) is sent to the user terminal 2. An example of recommendation information "after using an express bus" is to have the server 1 generate recommendation information (for example, a message from a popular mascot character such as "Please use this again") that will encourage members who have just used an express bus to make their next reservation, and notify the user terminal 2 via chat or the like.

[0088] Another example of display on the user terminal 2 will be described. FIG. 20 is a diagram showing another display example (part 1) of the search result screen for a route search. As shown in the figure, the user can select the display order of the route search results (d81). Specifically, the user can select either "travel time" or "fare," and if "travel time" is selected, flight information is displayed in order of shortest travel time, and if "fare" is selected, flight information is displayed in order of cheapest fare. Furthermore, you can narrow down the flight information by selecting either "with transfer" or "without transfer." For example, users who prefer or accept transfers can select "with transfers," while users who do not prefer or accept transfers can select "without transfers."

[0089] FIG. 21 is a diagram showing another display example (part 2) of the search result screen for a route search. As shown in the figure, it is also possible to select either "highest number of transfers" or "lowest number of transfers" and display the flight information in the selected order (d82). Such a display control function is controlled by the server 1. For example, if "in order of most number of transfers" is selected, the display control means 13 of the server 1 can display information on flights with the most number of transfers at the top. That is, the display control means 13 causes the user terminal 2 to display a connecting route with a second number of transfers, which is greater than the first number, higher than a connecting route with a first number of transfers.

[0090] FIG. 22 is a diagram showing another display example (part 3) of the search result screen for a route search. As shown in the figure, the transfer discount amount may be displayed. Specifically, the transfer discount (d83) is displayed for transfer routes, and the transfer discount amount is not displayed for direct routes. Furthermore, the transfer discount for a transfer route with many transfers can be greater than the transfer discount for a transfer route with few transfers. In other words, a relatively large discount amount will be applied to a transfer route with a large number of transfers and displayed.

[0091] This will enable the display to cater to users who prefer to transfer, or who want to use express buses at a lower fare by increasing the number of transfers. Previously, the order in which flights were displayed was not rearranged according to the number of transfers. Even if such a thing were to happen, there is a preconceived notion that "transfers = inconvenience," so it was not anticipated that the number of transfers would be displayed in descending order. According to the express bus system of this embodiment, the convenience of transfers is improved, eliminating the idea that "transfers = inconvenience." In addition, the display modes shown in Figures 20 to 22 can further improve convenience for users who want to actively use transfers.

[0092] As described above, the express bus system of this embodiment is an express bus system equipped with a user terminal 2 carried by an express bus user, and comprises: a storage means 11 for storing information on existing express bus route information; an extraction means 12 for extracting available routes that are routes that can be used by the user from the route information based on information input by the user terminal 2; a display control means 13 for displaying information on the extracted available routes on the user terminal 2; and a reservation means 14 capable of executing reservation processing for the available routes in response to operation of the user terminal 2, wherein the extraction means 12 is capable of extracting a transfer route that involves transfers between multiple routes including a first route and a second route as the available route, and the reservation means 14 is capable of executing reservation processing for multiple routes that make up the transfer route all at once in response to operation of the user terminal 2. In other words, the reservation process for a connecting route is executed in one batch in response to operations via a single website, and furthermore, following the reservation process, the payment process is executed in a series and batch. This will make reservations and payment procedures easier, and will allow connecting routes to be offered as a highly useful express bus service, similar to a series of long-distance buses. Furthermore, the express bus system of this embodiment requires cooperation and collaboration between bus operators, and through such cooperation and collaboration, the bus business as a whole can flourish. It will also help to resolve the actual vehicle mileage restrictions and the so-called 2024 problem that bus operators face. Furthermore, in areas lacking direct routes or other means of transportation such as rail and air travel, express bus services with transfers can be introduced as a new means of transportation. Furthermore, the express bus system of this embodiment can propose new modes of travel and trips. In contrast to this, conventionally, there has been the cumbersome procedure involved in transferring, but the express bus system of the present invention, by being provided with the above-mentioned configuration, can solve such conventional problems. In other words, in the past, even if you were making a transfer, you had to make reservations at multiple counters, but with the express bus system of this embodiment, all reservations can be processed together, and payments can be made all at once, and changes and cancellations can also be processed together.

[0093] Although the preferred embodiments of the present invention have been described above, it goes without saying that the present invention is not limited to the above-described embodiments, and various modifications can be made within the scope of the present invention. For example, the configuration of the system is not limited to the above-described embodiment, and part or all of the configuration of one device may be provided in another device. Specifically, the express bus processing program of the present invention is mainly provided in the server 1, but some of the programs provided in the server 1 may also be provided in external devices including the user terminal 2, the reservation server 3, and the payment server 4. Furthermore, some or all of the information stored in the storage means 11 of the server 1 may be stored in another device, which may be connected to the server 1 so as to be able to communicate with the server 1. Furthermore, the server 1 may have some of the functions of the reservation server 3 and the payment server 4. Furthermore, part or all of the functions of one of the reservation server 3 and the payment server 4 may be provided by the other. Furthermore, the server 1 and one or some of the reservation servers 3 may be devices operated by the same business operator.

[0094] For the sake of convenience, the special transfer routes have been described based on area names, but they can also be realized based on bus stops. In this case, the area names can be replaced with bus stop names. Furthermore, the server 1 may manage flight information (including seat availability and fares) managed by the reservation server 3. In this case, the server 1 does not transmit route information (S106 in FIG. 8, etc.) or reservation request information (S206, S208 in FIG. 12, etc.), and the server 1 can essentially perform the reservation process itself.

[0095] Furthermore, although the above-described embodiment is a system relating to transfers on express buses, the present invention can be expanded to include systems relating to transfers between other means of transportation, such as airplanes and bullet trains, in addition to express buses. [Explanation of symbols]

[0096] 1: Server, 101: Control unit, 102: Memory, 103: Storage, 104: Communication unit, 11: Storage means, 12: Extraction means, 13: Display control means, 14: Reservation means, 15: Payment means, 16: Reservation change means, 17: Reservation cancellation means, 18: Benefit granting means, 2: User terminal, 201: Control unit, 202: Memory, 203: Storage, 204: Operation unit, 205: Display unit, 206: Communication unit, 3: Reservation system (reservation server), 4: Payment system (payment server), 9: Internet

Claims

1. In a highway bus system equipped with user terminals carried by highway bus users, a storage means for storing information on existing express bus routes; an extraction means for extracting from the route information an available route that is a route that can be used by the user based on information input by the user terminal; a display control means for displaying the extracted information on the available routes on the user terminal; a reservation means for executing a reservation process for the available route in response to an operation of the user terminal; The extraction means A transit route involving transfers between a plurality of routes including a first route and a second route can be extracted as the available route; The reservation means In response to the operation of the user terminal, reservation processing for a plurality of routes constituting the transfer route can be executed in a lump. A high-speed bus system characterized by:

2. the reservation process for the first route can be executed by a first device operated by a first operator; the reservation process for the second route can be executed by a second device operated by a second operator different from the first operator; The reservation means By causing the first device to execute the reservation process for the first route and the second device to execute the reservation process for the second route, the reservation process for the connecting route consisting of the first route and the second route can be executed collectively.

2. The express bus system according to claim 1.

3. The extraction means The transfer route having a specific number of transfers or less can be extracted as the available route.

2. The express bus system according to claim 1.

4. The extraction means The connecting route in which the distance from the departure point to the connecting point is greater than the distance from the departure point to the destination can be extracted as the available route.

2. The express bus system according to claim 1.

5. a reward granting means for granting a reward to a user of the transfer route; The benefit granting means A larger benefit is given to a user of the transit route with a second number of transfers, which is greater than the first number, than to a user of the transit route with a first number of transfers.

2. The express bus system according to claim 1.

6. The display control means The transit route having a second number of transfers, which is greater than the first number, can be displayed higher on the user terminal than the transit route having a first number of transfers.

2. The express bus system according to claim 1.

7. The display control means Displaying recommended information regarding transfers on the user terminal 2. The express bus system according to claim 1.

8. a payment means capable of executing a payment process in response to an operation of the user terminal; The payment means is The payment process can be executed in series following the reservation process.

2. The express bus system according to claim 1.

9. a reservation cancellation means for canceling a reservation in response to an operation of the user terminal; The reservation cancellation means In response to the operation of the user terminal, cancellation processing for multiple reserved routes can be performed at once.

2. The express bus system according to claim 1.

10. In a highway bus processing method using a user terminal carried by a highway bus user, a storage step of storing existing express bus route information; an extraction step of extracting from the route information an available route that is a route that the user can use based on information input by the user terminal; a display control step of displaying the extracted information on the available routes on the user terminal; a reservation step capable of executing a reservation process for the available route in response to an operation of the user terminal, The extraction step comprises: extracting, as the available route, a connecting route involving a transfer between a plurality of routes including a first route and a second route; The reservation step includes: Execute reservation processing for a plurality of routes constituting the transfer route in a batch in response to operation of the user terminal. A high-speed bus processing method comprising:

11. A computer connected to a user terminal carried by a highway bus user, a storage means for storing information on existing express bus routes; an extraction means for extracting from the route information an available route that is a route that can be used by the user based on information input by the user terminal; a display control means for displaying the extracted information on the available routes on the user terminal; functioning as a reservation means capable of executing a reservation process for the available route in response to an operation of the user terminal; The extraction means A transit route involving transfers between a plurality of routes including a first route and a second route can be extracted as the available route; The reservation means In response to the operation of the user terminal, reservation processing for a plurality of routes constituting the transfer route can be executed in a lump. A high-speed bus processing program characterized by:

Images