Seat reservation device, seat reservation program, seat reservation method, and seat reservation system

IN607185BActive Publication Date: 2026-10-27MITSUBISHI ELECTRIC CORP
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
IN202447040899
Authority / Receiving Office
IN · IN
Patent Type
Patents
Current Assignee / Owner
Filing Date
2024-05-27
Publication Date
2026-10-27
Estimated Expiration
2042-01-27

AI Technical Summary

Technical Problem

Existing seat reservation systems for transportation systems like railways and buses face inefficiencies due to exponential calculation time increases with the number of passengers, making batch-based seat arrangement decisions cumbersome and time-consuming.

Method used

A seat reservation device and system that uses decision variables independent of individual passengers, aggregating reservations into groups and using pre-defined seating patterns to optimize seat arrangements, reducing the computational burden and enabling efficient batch processing.

Benefits of technology

This approach allows for rapid determination of optimal seat arrangements without increasing calculation time, even with a large number of reservations, by using decision variables that do not depend on the number of passengers, thus improving operational efficiency.

✦ Generated by Eureka AI based on patent content.
Patent Text Reader

Abstract

A seat reservation device (100) is provided with: a pattern extraction unit (103) that extracts, from a consecutive seating pattern candidate group (240A) comprising a plurality of consecutive seating patterns, a plurality of the consecutive seating patterns as a consecutive seating pattern group on the basis of train reservation information (210) and train carriage information (220); a reservation aggregation unit (104) that aggregates, from the reservation information (210), the number of each set having the same boarding section and number of people who made a reservation at the same time, and generates an aggregate result as aggregate information (250); a problem generation unit (105) for generating, on the basis of the carriage information (220), an evaluation index designated as a pointer of an objective function, the consecutive seating pattern group (240B) and the aggregate information (250), an optimization problem (260) which is for the seating arrangement of reserved passengers and includes a constraint condition, the objective function, and a decision variable that does not depend on the number of reservations; a solution unit (106) for solving the optimization problem (260) and determining a seating arrangement (270) for the reserved passengers; and an output unit (107) for outputting the seating arrangement (270).
Need to check novelty before this filing date? Find Prior Art

Description

Seat reservation device, seat reservation program, seat reservation method, and seat reservation system

[0001] The present disclosure relates to a seat reservation device, a seat reservation program, a seat reservation method, and a seat reservation system.

[0002] For transportation services such as trains and express buses where seats are reserved by passengers, a method of determining seating arrangements in batches is being considered in order to improve operator profits and passenger satisfaction. The reason for this is that the conventional method of determining seats one by one may result in undesirable seating arrangements depending on subsequent reservations. Batch determination, in which seating arrangements are determined all at once after a certain number of reservations have accumulated, may be able to solve the problem of undesirable seating arrangements.

[0003] For transportation systems with multiple travel sections, such as trains and express buses, the number of possible seating arrangements is enormous, making it difficult to determine an appropriate seating arrangement. Patent Document 1 uses a method for batch-wise determination of seating arrangements for existing reservations using a mathematical optimization problem, under the condition that seats are not confirmed until immediately before departure. Patent Document 1 uses a 0 / 1 variable to indicate whether or not to assign individual passengers to each seat, and considers various constraints, such as (1) passengers in reservations for multiple people are adjacent to each other, and (2) two or more passengers are not assigned to the same seat in the same section.

[0004] In the patent document 1, the seating arrangement indication is a user-provided configuration.

[0005] Japanese Patent Application Publication No. 11-328278

[0006] The mathematical optimization problem in Patent Document 1 is an 01 integer programming problem in combinatorial optimization problems, and therefore requires a long calculation time. Generally, in 01 integer programming problems, the calculation time increases exponentially with the number of 01 variables. In contrast, in the formulation in Patent Document 1, the number of 01 variables is defined as the product of the number of passengers and the number of seats, so the number of 01 variables increases in proportion to the number of passengers. Therefore, in Patent Document 1, the calculation time increases as the number of passengers increases. Furthermore, in order to consider the adjacent placement of passengers in a multi-person reservation as a constraint, Patent Document 1 requires information on which reservation each passenger is associated with. Therefore, in Patent Document 1, it is necessary to set the 01 variables for each passenger.

[0007] The present disclosure aims to provide a device that suppresses an increase in calculation time for an optimization problem that accompanies an increase in the number of reservations by setting decision variables that are not dependent on individual passengers.

[0008] The seat reservation device according to the present disclosure comprises: a pattern extraction unit that extracts a plurality of adjacent seating patterns as a group of adjacent seating patterns from a group of adjacent seating pattern candidates that are set for each number of passenger groups and that are arranged so that passengers of the same passenger group are seated adjacently, based on: reservation information, which is information indicating a reservation for a target means of transport, including a boarding section for said means of transport and a number of simultaneous reservations as a unit of the number of reservations, and including a plurality of records of reservations for the same operation schedule of said means of transport; transportation information, which includes the seat installation status of said means of transport and the stop locations of said means of transport on the same operation schedule; a reservation aggregation unit that aggregates the number of groups that have the same boarding section and the same number of simultaneous reservations from said reservation information, and generates the aggregation results as aggregate information; and a problem generation unit that generates an optimization problem for seating arrangements of reserved passengers, including a decision variable that is independent of the number of reservations, a constraint, and an objective function, based on said transportation information, an evaluation index specified as an objective function guideline, said group of adjacent seating patterns, and said aggregate information. The system includes a solution unit that solves the optimization problem and determines the seating arrangement of booked passengers, and an output unit that outputs the seating arrangement.

[0009] The seat reservation device of the present disclosure generates an optimization function for seating arrangements that uses decision variables that are independent of the number of reserved passengers. Therefore, even if the number of reservations for a transportation facility increases, it is possible to determine seating arrangements in a batch processing manner without increasing the size of the optimization problem.

[0010] FIG. 1 is a diagram of the first embodiment, showing a system configuration of a seat reservation system 1000. FIG. 2 is a diagram of the first embodiment, showing a functional block diagram of a seat reservation device 100. FIG. 3 is a diagram of the first embodiment, showing reservation information 210. FIG. 4 is a diagram of the first embodiment, showing vehicle information 220. FIG. 5 is a diagram of the first embodiment, showing evaluation index information 230. FIG. 6 is a diagram of the first embodiment, showing details of the storage unit 102. FIG. 7 is a flowchart showing the operation of the input receiving unit 101. FIG. 8 is a flowchart showing the operation of the seat arrangement determination process. FIG. 9 is a diagram of the first embodiment, showing a group of consecutive seating patterns 240B extracted by the pattern extraction unit 103. FIG. 10 is a conceptual diagram showing a situation in which the group of consecutive seating patterns 240B is extracted from the group of consecutive seating pattern candidates 240A. FIG. 11 is a diagram of the first embodiment, showing A section o,d,t FIG. 10 is a diagram of a second embodiment showing reservation information 210. FIG. 11 is a diagram of a fourth embodiment showing a hardware configuration of the seat reservation device 100. FIG. 12 is a diagram of a fourth embodiment showing another hardware configuration of the seat reservation device 100.

[0011] In the description of the embodiments and drawings, the same and corresponding elements are denoted by the same reference numerals. The description of elements denoted by the same reference numerals will be omitted or simplified as appropriate. In the following embodiments, the word "unit" may be read as "circuit," "step," "procedure," "process," or "circuitry" as appropriate.

[0012] First Embodiment In the first embodiment, the "distributed allocation" described in Fig. 5 is used as the evaluation index 232. In the first embodiment, a case where the seating arrangement of a train is determined will be described, taking a railway as an example of transportation.

[0013] 1 is a system configuration diagram of a seat reservation system 1000 including a seat reservation device 100. The seat reservation system 1000 includes the seat reservation device 100, an input terminal 300, and an output terminal 400.

[0014] <Seat reservation device 100> The seat reservation device 100 determines a seat layout 270 for a train reservation. Information such as reservation information 210, vehicle information 220, and evaluation index information 230 is input to the seat reservation device 100 from an input terminal 300. The seat reservation device 100 outputs the seat layout 270 to an output terminal 400.

[0015] <Input terminal 300> The input terminal 300 is a terminal device used by a railway operations staff member to operate the seat reservation device 100. The input terminal 300 is a computer such as a tablet terminal or a smartphone. The input terminal 300 is not limited to a portable computer such as a tablet terminal or a smartphone. The seat reservation device 100 may also serve as the input terminal 300. Furthermore, there may be multiple input terminals 300.

[0016] <Output terminal 400> The output terminal 400 is a terminal device for outputting the processing contents of the seat reservation device 100 to a railway operations officer. For example, the output terminal 400 is a display. The input terminal 300 may also serve as the output terminal 400. Furthermore, there may be multiple output terminals 400.

[0017] The seat reservation device 100 is applied as a component of a seat reservation server 200 .

[0018] 2 is a functional block diagram of the seat reservation device 100. The seat reservation device 100 includes an input reception unit 101, a memory unit 102, a pattern extraction unit 103, a reservation compilation unit 104, a problem generation unit 105, a solution-finding unit 106, and an output unit 107. The input reception unit 101 receives information such as reservation information 210, vehicle information 220, and evaluation index information 230 from an input terminal 300.

[0019] <Reservation Information 210> Fig. 3 shows the reservation information 210. As shown in Fig. 3, the reservation information 210 includes multiple records as information on existing reservations, each record consisting of a boarding station, a disembarking station, and the number of simultaneous reservations. Furthermore, a record of a reservation for two people boarding at station A and disembarking at station B is treated as {A, B, 2}. Note that additional information such as an ID for identifying the record may be added to the reservation information 210. Fig. 3 shows a case where an ID is added.

[0020] <Car Information 220> Fig. 4 shows car information 220. The car information 220 includes, as train information, seat configuration information such as the number of cars 221 of the train, the number of seat rows per car 222, and the number of seats per row 223. The car information 220 also includes information on intermediate stations 224 where the train stops. In the case of Fig. 4, for the first car, the number of rows 222 per car is 16, and the number of seats per row 223 is 4. The stations where the train stops are Station A, Station B, Station C, Station D, and Station E.

[0021] <Evaluation Index Information 230> Fig. 5 shows the evaluation index information 230. The evaluation index information 230 includes an index ID 231 and an evaluation index 232 as evaluation indexes of the objective function when determining the seating arrangement. The items of the index ID 231 and the evaluation index 232 are defined in advance in the storage unit 102. The index ID 231 corresponding to the evaluation index 232 to be used is provided to the input receiving unit 101. Additional information such as an explanation 233 for the evaluation index 232 may be added to the evaluation index information 230. In Fig. 5, the explanation 233 has been added.

[0022] The storage unit 102 stores information necessary for the operation of the seat reservation device 100. Note that the storage unit 102 does not necessarily have to be installed in the seat reservation device 100. As long as the seat reservation device 100 can exchange information with the storage unit 102, the storage unit 102 may be located anywhere. For example, the storage unit 102 may be installed in a cloud and configured to communicate with the seat reservation device 100.

[0023] <Memory Unit 102> Fig. 6 shows details of the memory unit 102. The memory unit 102 stores reservation information 210, vehicle information 220, evaluation index information 230, a group of seating connection pattern candidates 240A, a group of seating connection patterns 240B, tally information 250, an optimization problem 260, and seat arrangement 270. (1) The reservation information 210 and vehicle information 220 are information received by the input receiving unit 101. (2) The evaluation index information 230 is predefined and stored in the memory unit 102. In the evaluation index information 230, an index ID 231A received by the input receiving unit 101 corresponds to an evaluation index 232 of the corresponding index ID. (3) The group of seating connection pattern candidates 240A consists of a plurality of seating connection patterns. The group of seating connection pattern candidates 240A is prestored in the memory unit 102. The seating conjunction pattern group 240B is a group consisting of a plurality of seating conjunction patterns extracted from the seating conjunction pattern candidate group 240A by the pattern extraction unit 103. The seating conjunction pattern group 240B is information stored in the memory unit 102 by the pattern extraction unit 103. (4) The tabulated information 250 is information generated by the reservation tabulation unit 104 and stored in the memory unit 102 by the reservation tabulation unit 104. (5) The optimization problem 260 is information generated by the problem generation unit 105 and stored in the memory unit 102 by the reservation tabulation unit 104.

[0024] <Pattern Extraction Unit 103> Based on the reservation information 210 and vehicle information 220 stored in storage unit 102, pattern extraction unit 103 extracts seating arrangement pattern group 240B corresponding to reservation information 210 and vehicle information 220 from seating arrangement pattern candidate group 240A predefined in storage unit 102. Pattern extraction unit 103 stores extracted seating arrangement pattern group 240B in storage unit 102. A specific acquisition method will be described later.

[0025] <Reservation tallying unit 104> The reservation tallying unit 104 tally the number of combinations of boarding station, disembarking station, and number of simultaneous reservations based on the reservation information 210, and stores the tallying result in the storage unit 102 as tallying information 250. A specific tallying method will be described later.

[0026] <Problem Generator 105> The problem generator 105 generates an optimization problem 260 based on the vehicle information 220, the evaluation index information 230, the seating combination pattern group 240B, and the compilation information 250, and stores the optimization problem 260 in the storage unit 102. A specific generation method will be described later.

[0027] <Solution Finding Unit 106> The solution finding unit 106 determines and generates a seating arrangement 270 by solving the optimization problem 260 generated by the problem generating unit 105. A specific method for determining the seating arrangement 270 will be described later.

[0028] <Output Unit 107 > The output unit 107 outputs the seating arrangement 270 to the output terminal 400 .

[0029] **Explanation of Operation*** Fig. 7 shows the operation of the input receiving unit 101. Fig. 8 shows the operation of the seat arrangement determination process. The operation of the seat reservation device 100 will be described with reference to Figs. 7 and 8.

[0030] The operation of the input receiving unit 101 when receiving input will be described with reference to FIG.

[0031] <Step S101> In step S101, the input receiving unit 101 receives the reservation information 210, the vehicle information 220, and the index ID 231A as input information.

[0032] <Step S102> In step S102, the input receiving unit 101 stores the reservation information 210, the vehicle information 220, and the index ID 231A in the storage unit 102. The input receiving unit 101 associates the index ID 231A with a record having the same index ID 231 in the evaluation index information 230. In the subsequent step S203, the problem generator 105 generates an optimization problem 260 using the evaluation index of this record.

[0033] The operation of the seating arrangement determination process will be described with reference to FIG.

[0034] <Step S201> In step S201, the pattern extraction unit 103 extracts a seating conjunction pattern group 240B consisting of multiple seating conjunction patterns corresponding to the reservation information 210 and the vehicle information 220 from the seating conjunction pattern candidate group 240A in the storage unit 102, based on the reservation information 210 and the vehicle information 220 in the storage unit 102. The reservation information 210 is information indicating a reservation for a target transportation facility. As shown in FIG. 3, the reservation information 210 includes a boarding section for the transportation facility and the number of simultaneous reservations, which is a unit of the number of reservations, and includes multiple records of reservations for the same transportation facility operation schedule. In the first embodiment, the transportation facility is a train. The rows for each ID in FIG. 3 are reservation records. In FIG. 3, the boarding station and the disembarking station indicate the boarding section. Furthermore, the number of simultaneous reservations in FIG. 3 is a unit of reservations for the same transportation facility operation schedule. A reservation for the same operation schedule means a reservation for the operation schedule of train T, which departs from station A at 12:00 on January 1, 2022 and arrives at station Z at 15:00 on January 1, 2022. A first operation schedule for train T, which departs from station A at 12:00 on January 1, 2022 and arrives at station Z at 15:00 on January 1, 2022, and a second operation schedule for train T, which departs from station A at 12:00 on January 2, 2022 and arrives at station Z at 15:00 on January 2, 2022, are different operation schedules. A single reservation is a reservation for multiple people in the same group. Note that a reservation for multiple people may be treated as a reservation for one or more people. Vehicle information 220 is information including the seat installation status of the train and the stop locations where the train will stop on the same operation schedule. In the vehicle information 220 of Fig. 4, the arrangement of seats on a train corresponds to the number of cars 221, the number of rows 222, and the number of seats per row 223. The stopping locations at which the train stops correspond to the intermediate stations 224 at which the train stops. First, the pattern extraction unit 103 extracts the maximum number of simultaneous reservations from the reservation information 210. Next, the pattern extraction unit 103 extracts the number of seats per row 223 from the vehicle information 220. Thereafter, based on the maximum number of simultaneous reservations and the number of seats per row 223, the pattern extraction unit 103 extracts a seating arrangement pattern group 240B from the seating arrangement pattern candidate group 240A, which is made up of a plurality of seating arrangement patterns corresponding to the maximum value and the number of seats 223.

[0035] <Connected seating pattern group 240B> Figure 9 shows connected seating pattern group 240B extracted by pattern extraction unit 103 from connected seating pattern candidate group 240A. Connected seating pattern group 240B is the extraction result, while connected seating pattern candidate group 240A from which it was extracted consists of multiple connected seating patterns set for each number of passengers in a passenger group and arranged so that passengers in the same passenger group sit together. Figure 10 is a conceptual diagram showing how connected seating pattern group 240B is extracted from connected seating pattern candidate group 240A. Figure 9 shows connected seating pattern group 240B when the maximum number of simultaneous reservations in reservation information 210 (Figure 3) is four and the number of seats per row 223 in vehicle information 220 is four. Connected seating pattern group 240B is a set of connected seating patterns that define, for each row with four seats, which seats in that row and subsequent rows to which reserved passengers should be assigned. FIG. 9 shows that when the maximum number of simultaneous reservations is 4 and the number of seats 223 is 4, the following consecutive seating patterns are extracted for reservations for one to four people. For reservations for one person, four consecutive seating patterns (1) to (4) are extracted. For reservations for two people, two consecutive seating patterns (1) and (2) are extracted. For reservations for three people, eight consecutive seating patterns (1) to (8) are extracted. For reservations for four people, two consecutive seating patterns (1) and (2) are extracted. The hatched squares in FIG. 9 represent seats to be assigned in each consecutive seating pattern. The squares without hatching represent seats that are not assigned in that consecutive seating pattern. The consecutive seating patterns are: A pattern p,n,s Here, the subscripts have the following meanings: p represents the consecutive seating pattern; n represents the number of the row counting from the row; and s represents the seat within the row. In Figure 9, the 16 consecutive seating patterns are numbered p=1 to p=16. The meanings of n and s are shown in (1) for single-person reservations. A pattern p,n,s has a value of either 1 or 0. pattern p,n,s = 1 indicates that a person is assigned to the seat s. pattern p,n,s = 0 indicates that no person is assigned to that seat s. patternp,n,s means whether to allocate the sth seat in the nth row in the seating pattern p. pattern p,n,s is as follows: A pattern 1,1,1 = 1, A pattern 1,1,2 = 0. Note that the seating arrangement pattern group 240B in FIG. 9 is an example. In other words, the seating arrangement pattern candidate group 240A from which the seating arrangement pattern group 240B is extracted can be defined arbitrarily. The seating arrangement such as four seats in one row in FIG. 9 is an example. The pattern extraction unit 103 stores the seating arrangement pattern group 240B extracted from the seating arrangement pattern candidate group 240A in the storage unit 102.

[0036] <Step S202> In step S202, the reservation counting unit 104 counts the number of groups with the same boarding section and the same number of simultaneous reservations from the reservation information 210, and generates the counted result as counted information 250. The reservation counting unit 104 counts the number of identical groups of {boarding station, disembarking station, number of simultaneous reservations} based on the reservation information 210 of FIG. 3, and generates the counted information 250. Specifically, the numbers of different groups are counted in the following manner: 15 groups of 2-person reservations boarding at station A and disembarking at station B, 30 groups of 2-person reservations boarding at station A and disembarking at station C, 20 groups of 3-person reservations boarding at station A and disembarking at station C. The above counts of 15 groups, 30 groups, and 20 groups may be expressed as follows: {A, B, 2} = 15, {A, C, 2} = 30, {A, C, 3} = 20. The total of {A, B, 2}=15, {A, C, 2}=30, and {A, C, 3}=20 constitutes the total information 250. The reservation totaling unit 104 stores the generated total information 250 in the storage unit 102.

[0037] <Step S203> In step S203, the problem generator 105 generates an optimization problem for seating arrangements for booked passengers, including a decision variable that is independent of the number of reservations, constraints, and an objective function, based on the vehicle information 220, the evaluation index 232, the seating arrangement pattern group 240B, and the aggregate information 250. The vehicle information 220 is transportation information. The evaluation index 232 is an evaluation index specified by the index ID 231A as a guideline for the objective function. The evaluation index and the objective function have the following relationship. That is, the evaluation index is an index that evaluates the quality of the seating arrangement. The objective function is a specific function that represents the evaluation index. The problem generator 105 generates a decision variable that expresses whether or not a seat is assigned to a booked passenger in units of each seating arrangement pattern in the seating arrangement pattern group 240B. This is explained in detail below. The problem generation unit 105 generates an optimization problem 260 including (1) decision variables, (2) constraints, and (3) an objective function based on (1) vehicle information 220, (2) evaluation index 232 specified by index ID 231A, (3) seating arrangement pattern group 240B, and (4) summary information 250 stored in the memory unit 102.

[0038] <Constraints> The problem generator 105 generates, as a constraint, an overlap constraint (1.1) that restricts two or more reservations from being assigned to the same travel section for each seat. The problem generator 105 also generates, as a constraint, a reservation number constraint (1.2) that indicates that the total number of reservations that can be assigned for a combination of a travel section and the number of simultaneous reservations is the same as the aggregated value in the aggregate information 250. Constraints that must be generated include the overlap constraint (1.1) and the reservation number constraint (1.2). The overlap constraint (1.1) is a constraint that indicates that two or more reservations cannot be assigned to the same travel section for each seat. The overlap constraint (1.1) is expressed by the following equation 1. In equation 1, o,d,p,v,c is used as a decision variable.

[0039]

[0040] In Formula 1, P g represents the group of consecutive seating patterns 240B.g = {1, ..., V} is a set of vehicles, C g = {1, ..., C} is a set of columns, S g = {1, ..., S} is the set of seats in a row, T g = {1, ..., T} represents a set of boarding sections. In each set, V is the number of cars, C is the number of rows, S is the number of seats per row, and T is the number of boarding sections (the number of intermediate stations where the train stops - 1). V, C, S, and T are determined from the vehicle information 220.

[0041] FIG. 11 shows A section o,d,t Shows. A section o,d,t is a constant that indicates whether or not the riding section t is included in the riding section from riding section o to riding section d. If riding section t is included, A section o,d,t has a value of 1, and if not included, a value of 0. section o,d,t is also determined from the vehicle information 220.

[0042] The N in min(c, N) in Equation 1 indicates the maximum number of occupied rows in all connected seating patterns in connected seating pattern group 240B. In FIG. 9, N=2. The left side of Equation 1 represents the total number of reservations that can be assigned to each seat and boarding section. The left side must be 1 or less.

[0043] <Reservation number constraint> The reservation number constraint (1.2) is a constraint condition that stipulates that the total number that can be allocated for reservations corresponding to a set of {boarding station, alighting station, number of simultaneous reservations} is the same as the aggregate value obtained from the aggregate information 250. For example, suppose there are 15 sets of reservations boarding at station A and alighting at station B, with two simultaneous reservations. In other words, {A, B, 2} = 15. In this case, a constraint is defined that the total number of patterns (1) and (2) for two-person reservations in Figure 9 that can be allocated must be 15. The condition of the reservation number constraint (1.2) is expressed by the following equation 2.

[0044]

[0045] In Equation 2, I is the maximum number of simultaneous reservations i (MAX). (i) is a set of consecutive seating patterns for reservations of i people. (i) is defined by the group of consecutive seating patterns 240B. i,o,d is the total number of reservations made by i passengers in the section starting from section o and ending at section d. i,o,d is defined in the summary information 250.

[0046] In the first embodiment, the specified evaluation index is a distributed allocation, which defines that the fewer adjacent seats between different reservations, the better. The problem generator 105 generates an objective function that minimizes adjacent seats between different reservations according to the distributed allocation of the evaluation index. A specific example of the objective function when "distributed allocation" with index ID = 1 is selected by inputting index ID 231A in the evaluation index information 230 in FIG. 5 is described below. In this distributed allocation, as described in the description 233 of the evaluation index information 230, the objective function is to minimize the number of adjacent passengers with different reservations and the number of adjacent travel sections. Specifically, for each seat and travel section, an auxiliary variable is assumed that is 1 if the seat and travel section are assigned and the seat is assigned to the adjacent seat on the right in the direction of travel in the travel section, and 0 otherwise. An evaluation index is set so that the sum of the auxiliary variables is minimized. This auxiliary variable is 1 if adjacent passengers have the same reservation, regardless of the seating arrangement, and can be considered a fixed value. Therefore, the sum of these auxiliary variables increases as the number of adjacent passengers with different reservations and the number of adjacent travel sections increase. The optimization problem generated by the problem generator 105 is stored in the memory 102 as optimization problem 260.

[0047] <Step S204> In step S204, the solution unit 106 solves the optimization problem 260 stored in the storage unit 102, and determines the seat arrangement 270 of the booked passengers corresponding to the reservation information 210. As a specific method for solving the optimization problem 260, any existing technology such as a general-purpose integer programming solver can be used.

[0048] ***Effects of the First Embodiment*** The seat reservation device 100 determines whether to allocate seats for a group of people, so that passengers are guaranteed to be adjacent to each other in reservations for multiple people, and does not require information about which reservation each passenger is linked to, as in Patent Document 1. That is, the O1 variable x in the embodiment o,d,p,v,c is independent of the number of passengers. Therefore, even if the number of passenger reservations increases, the scale of the optimization problem does not increase, and batch-wise seating arrangement determination calculations that distribute different reservations among existing reservations can be realized. The seat reservation device 100 sets the O1 variable not for each individual passenger but for each reservation attribute (number of simultaneous reservations), thereby keeping the number of O1 variables constant regardless of the number of passengers. This makes it possible to suppress increases in the calculation time for the optimization problem.

[0049] Embodiment 2. Embodiment 2 will be described below. In Embodiment 2, in addition to reservations for multiple passengers, seating arrangement 270 is determined taking into consideration whether a single passenger reserves a window seat, an aisle seat, or no seat reservation. As in Embodiment 1, a passenger group in reservation information 210 may consist of one or more passengers, as shown in FIG. 3. Each record in FIG. 3 corresponds to a passenger group. Furthermore, candidate seating patterns 240A include multiple seating patterns corresponding to a single passenger group. This is the single-person reservation in FIG. 9. Differences from Embodiment 1 include: (1) reservation information 210, (2) reservation compilation unit 104, (3) step S202, and (4) step S203. Only the differences from Embodiment 1 will be described.

[0050] Regarding "(1) Reservation information 210," the reservation information 210 includes a one-person reservation record indicating a reservation for one person with a simultaneous reservation number of one person and a designated type of one of a window seat, an aisle seat, or no designated seat. ID=001, ID=003, ID=004, and ID=005 in FIG. 12 (described later) are one-person reservation records.

[0051] Regarding "(2) Reservation tallying unit 104" and "(3) Step S202", the reservation tallying unit 104 tally the number of single-person reservations for each combination of the same designated type and travel section from the reservation information 210, and generate tally information 250 including the tallying results for single-person reservations.

[0052] For "(4) Step S203," the problem generator 105 generates a constraint condition of Equation 3, described below, which indicates that the total number of allocable single-occupancy reservations is equal to the sum of the aggregate values ​​in the aggregate information for window seat designation, aisle seat designation, and no designation. The problem generator 105 also generates a constraint condition of Equation 4, described below, which indicates that the number of seating arrangements corresponding to window seat designation that are allocated will not fall below the aggregate value for window seat designation, and that the number of seating arrangements corresponding to aisle seat designation that are allocated will not fall below the aggregate value for aisle seat designation. The problem generator 105 generates Equation 3 and Equation 4 based on the vehicle information 220, the evaluation index information 230, the seating arrangement pattern group 240B, and the aggregate information 250. A specific description will be given below.

[0053] 12 shows reservation information 210 according to the second embodiment. The reservation information 210 has, as reservation record items, items for boarding station, disembarking station, number of simultaneous reservations, and designated type for single-person reservations. The designated type is either window seat designated, aisle seat designated, or no designation. For example, a single-person reservation with a window seat designated, boarding at station A and disembarking at station B, is treated as a set of {A, B, 1, window seat}. Designations for window seat, aisle seat, and no designation are only possible for single-person reservations.

[0054] <Step S202> In step S202, the reservation tallying unit 104 tally the number of pairs of {boarding station, disembarking station, number of simultaneous reservations} based on the reservation information 210 and generates tally information 250. Specifically, as in step S202 in the first embodiment, for reservations for multiple people, the number of pairs is tallyed up, such as: {A, B, 2} = 15, {A, C, 2} = 30, {A, C, 3} = 20. For reservations for one person, the reservation tallying unit 104 tallys up separately, in the same way as for reservations for multiple people, the number of pairs of reservations for which a window seat, an aisle seat, or neither is specified. Specifically, in FIG. 12 , the number of pairs of reservations for one person is tallyed up, such as: {A, B, 1, window seat} = 2, {A, C, 1, aisle seat} = 1, {B, C, 1, no specification} = 1.

[0055] <Step S203> In order to consider whether a single person can specify a window seat or an aisle seat for a single-person reservation, a constraint for single-person reservations is added to the reservation quantity constraint in step S203. Specifically, the problem generator 105 generates a constraint for the number of reservations for single people in the format that the total number of single-person reservations that can be allocated at the boarding station and disembarking station is equal to the sum of the aggregate values ​​of those specifying a window seat, those specifying an aisle seat, and those specifying neither. This constraint is expressed by the following equation 3.

[0056]

[0057] In equation 3, for the number of people making a reservation, i, 1w represents a reservation for one person with a window seat, 1a represents a reservation for one person with an aisle seat, and 1 represents a reservation for one person without a seat. (1) =P (1w) ∪P (1a) and P (1w) and P (1a) In Figure 9, the window and aisle seats are shown in (2) for a one-person reservation. (1w) corresponds to (1) and (2) of the single person reservation in Figure 9. (1a) corresponds to (3) and (4) for a single person reservation. (1) corresponds to (1), (2), (3), and (4) for a single person reservation.

[0058] For single-person reservations that allow type specification, the following constraints (1) and (2) are further added. (1) The number of consecutive seating patterns corresponding to window seats to be assigned must not be less than the total number of reservations specifying window seats. (2) The number of consecutive seating patterns corresponding to aisle seats to be assigned must not be less than the total number of reservations specifying aisle seats. These constraints (1) and (2) are expressed by Equation 4. The problem generator 105 generates the constraint of Equation 4.

[0059]

[0060] Assume that the total number of single-person reservations specifying a window seat is 5, the total number of single-person reservations specifying an aisle seat is 7, and the total number of single-person reservations specifying neither a window seat nor an aisle seat is 8. The total number of single-person reservations is 20. These 20 reservations are assigned as either a window seat or an aisle seat adjacent pattern. Here, under the constraints of Equation 4, seats are assigned as follows: The number of reservations assigned as a window seat adjacent pattern is 5, and the number of reservations assigned as an aisle seat adjacent pattern is 7. Therefore, a seating arrangement that is consistent with the aggregate information 250 can be determined.

[0061] ***Effects of Embodiment 2*** According to the configuration of Embodiment 2, even when taking into consideration a window seat preference for a single-person reservation and an aisle seat preference for a single-person reservation, it is possible to set decision variables that are independent of the number of passengers. This makes it possible to realize batch-based calculations for determining seating arrangements that distribute different reservations among existing reservations without increasing the problem scale even if the number of passengers increases.

[0062] Third Embodiment A third embodiment will be described below. In the third embodiment, "securing vacant seats" in the evaluation index information 230 in Fig. 5 is the evaluation index. An index ID 2 is input to the seat reservation device 100, and the seat reservation device 100 determines the seating arrangement of the train based on "securing vacant seats." Securing vacant seats is an evaluation index that defines that the greater the number of vacant seats, the better. In accordance with the vacant seat reservation evaluation index, the problem generator 105 generates an objective function that reduces vacant seats at the front of the train and increases the number of acceptable reservations by reserving vacant seats at the rear of the train in the direction of travel in the section from the start point of the train's movement to the end point of its movement for the same operation schedule.

[0063] The third embodiment differs from the first embodiment in the objective function generated in step S203. Only the differences from the first embodiment will be described.

[0064] A specific example of an objective function when "securing an empty seat" is specified as the evaluation index 232 by the index ID 231A in the evaluation index information 230 is described below. When "securing an empty seat" is specified as the evaluation index, the problem generator 105 may generate an objective function that maximizes the number of empty rows in all travel sections from the start point to the end point of the train, and that assigns a greater weight to rows further back in the train's travel direction. Specifically, the problem generator 105 assumes an auxiliary variable for each row that is 0 if there is at least one reserved seat in any travel section, and 1 if there is no reserved seat. The problem generator 105 then generates an objective function that maximizes the sum of the products of the row numbers and the auxiliary variables.

[0065] The reason for generating such an objective function is that by reserving many long-distance vacant seats at the rear, there will be fewer vacant seats at the front, making it possible to accept more reservations.

[0066] ***Effect of the Third Embodiment*** 01 variable x in the third embodiment o,d,p,v,cis independent of the number of passengers. Therefore, even when the evaluation index is "securing available seats," it is possible to realize batch seating arrangement calculations that secure many available seats over long distances for existing reservations without increasing the scale of the optimization problem even if the number of passengers increases.

[0067] In addition, various evaluation indices can be considered depending on the intended layout, such as dispersing different passengers or equalizing the density of each vehicle, but the seat reservation device 100 of embodiments 1 to 3 does not depend on the content of the evaluation indices.

[0068] The first to third embodiments have been described above. Two or more of these embodiments may be combined and implemented. Alternatively, one of the multiple technical features included in one embodiment may be partially implemented. Alternatively, technical features included in each embodiment may be partially combined and implemented.

[0069] Embodiment 4. <Hardware configuration of seat reservation device 100> In embodiment 4, the hardware configuration of the seat reservation device 100 in embodiments 1 to 3 will be described. Fig. 13 shows the hardware configuration of the seat reservation device 100. The hardware configuration of the seat reservation device 100 will be described with reference to Fig. 13.

[0070] The seat reservation device 100 is a computer. The seat reservation device 100 includes a processor 110. In addition to the processor 110, the seat reservation device 100 includes multiple pieces of hardware. The multiple pieces of hardware are a main memory device 120, an auxiliary memory device 130, an input interface 140, an output interface 150, and a communication interface 160. The processor 110 is connected to the other hardware via a signal line 170 and controls the other hardware.

[0071] The seat reservation device 100 includes, as functional elements, an input reception unit 101, a pattern extraction unit 103, a reservation tallying unit 104, a problem generation unit 105, a solution-finding unit 106, and an output unit 107. The functions of the input reception unit 101, the pattern extraction unit 103, the reservation tallying unit 104, the problem generation unit 105, the solution-finding unit 106, and the output unit 107 are realized by a seat reservation program 131.

[0072] The processor 110 is a device that executes the seat reservation program 131. When the processor 110 executes the seat reservation program 131, the functions of the input reception unit 101, the pattern extraction unit 103, the reservation tallying unit 104, the problem generation unit 105, the solution finding unit 106, and the output unit 107 are realized. The processor 110 is an IC (Integrated Circuit) that performs arithmetic processing. Specific examples of the processor 110 are a CPU (Central Processing Unit), a DSP (Digital Signal Processor), and a GPU (Graphics Processing Unit).

[0073] The main memory device 120 is a storage device. Specific examples of the main memory device 120 include an SRAM (Static Random Access Memory) and a DRAM (Dynamic Random Access Memory). The main memory device 120 stores the results of calculations performed by the processor 110.

[0074] The auxiliary storage device 130 is a storage device that stores data in a nonvolatile manner. A specific example of the auxiliary storage device 130 is a hard disk drive (HDD). The auxiliary storage device 130 may also be a portable recording medium. Examples of portable recording media include a Secure Digital (SD) (registered trademark) memory card, a NAND flash, a flexible disk, an optical disk, a compact disk, a Blu-ray (registered trademark) disk, and a digital versatile disk (DVD). The auxiliary storage device 130 stores a seat reservation program 131. The auxiliary storage device 130 also stores reservation information 210, vehicle information 220, evaluation index information 230, a group of seating connection pattern candidates 240A, a group of seating connection patterns 240B, aggregate information 250, an optimization problem 260, and a seating arrangement 270. The auxiliary storage device 130 implements the memory unit 102. The function of the auxiliary storage device 130 may be provided by a cloud server.

[0075] The input interface 140 is a port through which data is input from each device. In FIG. 13 , an input device 141 is connected to the input interface 140. Various devices are connected to the output interface 150. The output interface 150 is a port through which data is output by the processor 110 to various devices. In FIG. 13 , a display device 151 is connected to the output interface 150. The communication interface 160 is a communication port through which the processor communicates with other devices. In FIG. 13 , a communication device 161 is connected to the communication interface 160.

[0076] The processor 110 loads the seat reservation program 131 from the auxiliary storage device 130 into the main storage device 120. The processor 110 reads the loaded seat reservation program 131 from the main storage device 120 and executes it. In addition to the seat reservation program 131, an OS (Operating System) is also stored in the main storage device 120. The processor 110 executes the seat reservation program 131 while executing the OS. The seat reservation device 100 may include multiple processors that replace the processor 110. These multiple processors share the execution of the seat reservation program 131. Each processor is a device that executes the seat reservation program 131, just like the processor 110. Data, information, signal values, and variable values ​​used, processed, or output by the seat reservation program 131 are stored in the main storage device 120, the auxiliary storage device 130, or a register or cache memory in the processor 110.

[0077] The seat reservation program 131 is a program that causes a computer to execute each process, procedure, or step of the input reception unit 101, pattern extraction unit 103, reservation aggregation unit 104, problem generation unit 105, solution-finding unit 106, and output unit 107, where "unit" is replaced with "process," "procedure," or "step."

[0078] The seat reservation method is a method performed by the seat reservation device 100, which is a computer, executing the seat reservation program 131. The seat reservation program 131 may be provided by being stored in a computer-readable recording medium, or may be provided as a program product.

[0079] The functions of the seat reservation device 100 described in FIG. 13 are realized by a seat reservation program 131. However, the functions of the seat reservation device 100 may also be realized by hardware. FIG. 14 shows a configuration in which the functions of the seat reservation device 100 are realized by hardware. The electronic circuit 90 in FIG. 14 is a dedicated electronic circuit that realizes the functions of the input reception unit 101, pattern extraction unit 103, reservation tallying unit 104, problem generation unit 105, solution finding unit 106, and output unit 107 of the seat reservation device 100. The electronic circuit 90 is connected to a signal line 91. Specifically, the electronic circuit 90 is a single circuit, a composite circuit, a programmed processor, a parallel programmed processor, a logic IC, a GA, an ASIC, or an FPGA. GA is an abbreviation for Gate Array. ASIC is an abbreviation for Application Specific Integrated Circuit. FPGA is an abbreviation for Field-Programmable Gate Array. The functions of the components of the seat reservation device 100 may be realized by a single electronic circuit, or may be distributed and realized by multiple electronic circuits. Also, some of the functions of the components of the seat reservation device 100 may be realized by electronic circuits, and the remaining functions may be realized by software.

[0080] Each of the CPU and the electronic circuit 101 is also called a processing circuitry. The functions of the input receiving unit 101, the memory unit 102, the pattern extraction unit 103, the reservation tallying unit 104, the problem generation unit 105, the solution-finding unit 106, and the output unit 107 of the seat reservation device 100 may be realized by the processing circuitry.

[0081] 90 Electronic circuit, 91 Signal line, 100 Seat reservation device, 101 Input reception unit, 102 Memory unit, 103 Pattern extraction unit, 104 Reservation counting unit, 105 Problem generation unit, 106 Solution unit, 107 Output unit, 110 Processor, 120 Main memory unit, 130 Auxiliary memory unit, 131 Seat reservation program, 140 Input interface, 150 Output interface, 160 Communication interface, 170 Signal line, 210 Reservation information, 220 Vehicle information, 230 Evaluation index information, 240A Seat connection pattern candidate group, 240B Seat connection pattern group, 250 Counting information, 260 Optimization problem, 270 Seat arrangement, 300 Input terminal, 400 Output terminal, 1000 Seat reservation system.

Claims

1. A pattern extraction unit extracts multiple adjacent seating patterns as a group of adjacent seating patterns from a group of adjacent seating pattern candidates, which are set for each number of passenger groups and which are arranged so that passengers of the same passenger group sit adjacently, based on: reservation information, which is information indicating reservations for a target transportation facility, including a boarding section for said transportation facility and the number of simultaneous reservations, which is one unit of the number of reservations, and which includes multiple records of reservations for the same transportation facility's operating schedule; transportation facility information, which includes the seat installation status of said transportation facility and the stop locations where said transportation facility stops on the same operating schedule; a reservation aggregation unit, which aggregates the number of groups with the same boarding section and the same number of simultaneous reservations from said reservation information, and generates the aggregation results as aggregate information; a problem generation unit, which generates an optimization problem for seating arrangements for reserved passengers, including a decision variable that is independent of the number of reservations, constraints, and an objective function, based on said transportation facility information, an evaluation index specified as a guideline for an objective function, said group of adjacent seating patterns, and said aggregate information; A seat reservation device comprising: a solution unit that solves the optimization problem and determines seat arrangements for reserved passengers; and an output unit that outputs the seat arrangements.

2. The seat reservation device according to claim 1, wherein the problem generation unit generates a decision variable that expresses whether or not a seat has been assigned to a reserved passenger in units of each adjacent seating pattern of the group of adjacent seating patterns.

3. A seat reservation device as described in claim 1 or claim 2, wherein the problem generation unit generates an overlap constraint that restricts two or more reservations from being assigned to the same boarding section for each seat, and a reservation number constraint that indicates that the total number of reservations that can be assigned for a combination of the boarding section and the number of people making simultaneous reservations is the same as the aggregate value of the aggregate information.

4. The passenger group consists of one or more passengers, the group of candidate seating patterns includes a plurality of seating patterns corresponding to one of the passenger groups, the reservation information includes a one-person reservation record indicating a one-person reservation in which the number of simultaneous reservations is one person and includes a designated type of one of a window seat designated, an aisle seat designated, or no designated seat, the reservation counting unit counts the number of one-person reservations for each group with the same designated type and the same boarding section from the reservation information, and generates counting information including the counting results of the one-person reservations, and the problem generation unit 4. The seat reservation device according to claim 1, wherein the device generates, based on the transportation information, the evaluation index, the group of seating patterns, and the aggregated information, a constraint condition indicating that the total number of allocable single-person reservations is equal to the sum of the aggregated values ​​in the aggregated information for the window side designation, the aisle side designation, and no designation, and a constraint condition indicating that the number of seating patterns corresponding to the window side designation to be allocated will not fall below the aggregated value for the window side designation and that the number of seating patterns corresponding to the aisle side designation to be allocated will not fall below the aggregated value for the aisle side designation.

5. A seat reservation device as described in any one of claims 1 to 4, wherein the specified evaluation index is a distribution that defines that the fewer adjacent seats between different reservations, the better, and the problem generation unit generates an objective function that minimizes the adjacent seats between different reservations in accordance with the distribution of the evaluation index.

6. A seat reservation device as described in any one of claims 1 to 4, wherein the specified evaluation index is seat reservation, which defines that the greater the number of vacant seats, the better, and the problem generation unit generates an objective function that reduces vacant seats at the front and increases acceptable reservations by reserving vacant seats at the rear of the transportation means' direction of travel in the section from the starting point of the transportation means' movement to the end point of the movement for the same operation schedule in accordance with the seat reservation as the evaluation index.

7. A computer performs a pattern extraction process to extract a plurality of adjacent seating patterns as a group of adjacent seating patterns from a group of adjacent seating pattern candidates, which are set for each number of passenger groups and which are arranged so that passengers of the same passenger group sit adjacently, based on: reservation information, which is information indicating reservations for a target transportation facility, including a boarding section for said transportation facility and the number of simultaneous reservations as a unit of the number of reservations, and which includes a plurality of records of reservations for the same transportation facility's operating schedule; and transportation facility information, which includes the seat installation status of said transportation facility and the stop locations of said transportation facility's stops on the same operating schedule; a reservation aggregation process to aggregate the number of groups with the same boarding section and the same number of simultaneous reservations from the reservation information, and generate the aggregation results as aggregate information; and a problem generation process to generate an optimization problem for seating arrangements for reserved passengers, including a decision variable independent of the number of reservations, constraints, and an objective function, based on said transportation facility information, an evaluation index specified as a guideline for an objective function, said group of adjacent seating patterns, and said aggregation information. a solution process for solving the optimization problem and determining seating arrangements for reserved passengers; and an output process for outputting the seating arrangements.

8. A computer: extracts a plurality of adjacent seating patterns as a group of adjacent seating patterns from a group of adjacent seating pattern candidates, which are set for each number of passenger groups and which are arranged so that passengers of the same passenger group sit adjacently, based on reservation information, which is information indicating reservations for the target transportation facility, including a boarding section for the transportation facility and the number of simultaneous reservations which is a unit of the number of reservations, and which includes a plurality of records of reservations for the same operation schedule of the transportation facility, and transportation facility information, which includes the seat installation status of the transportation facility and the stop locations where the transportation facility stops on the same operation schedule; tallying up the number of each group with the same boarding section and the same number of simultaneous reservations from the reservation information, and generating the tally results as aggregated information; problem generation processing, which generates an optimization problem for seating arrangements for reserved passengers, including a decision variable independent of the number of reservations, constraints, and an objective function, based on the transportation facility information, evaluation indexes specified as guidelines for the objective function, the group of adjacent seating patterns, and the aggregated information; solving the optimization problem and determining the seating arrangements for reserved passengers; A seat reservation method that outputs the seat arrangement.

9. A seat reservation system comprising an input terminal, a seat reservation device, and an output terminal, wherein the input terminal inputs designation information specifying an evaluation index, which is a guideline for an objective function, to the seat reservation device, and the seat reservation device is configured to extract a plurality of adjacent seating patterns as a group of adjacent seating patterns from a group of adjacent seating pattern candidates, which are set for each number of passenger groups and are arranged so that passengers of the same passenger group sit adjacently, based on reservation information, which is information indicating a reservation for a target means of transport, including a boarding section for the means of transport and the number of simultaneous reservations, which is one unit of the number of reservations, and which includes a plurality of records of reservations for the same operation schedule of the means of transport, and transportation information, which includes the seat installation status of the means of transport and the stopping positions of the means of transport on the same operation schedule; and a reservation aggregation section, which aggregates the number of groups with the same boarding section and the same number of simultaneous reservations from the reservation information, and generates the aggregation result as aggregate information. A seat reservation system comprising: a problem generation unit that generates an optimization problem for seating arrangements for reserved passengers, the optimization problem including decision variables independent of the number of reservations, constraints, and an objective function, based on the transportation information, the evaluation index, the group of seating combination patterns, and the aggregate information; a solution unit that solves the optimization problem and determines seating arrangements for reserved passengers; and an output unit that outputs the seating arrangements to the output terminal, wherein the output terminal displays the seating arrangements.