JP2018151865A - Fare payment device, fare payment method and program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To automatically simply determine the necessity of payment on payment for transit using both a ticket and a commutation ticket permitted for arrival and departure at each station in specific metropolitan and urban areas.SOLUTION PART: A fare payment device 10 includes an original ticket information reading unit 104 that reads information of a commutation ticket, a dummy commutation ticket acquisition unit 13 that acquires a dummy commutation ticket for each railway route, the dummy commutation ticket being a virtual commutation ticket in which both stations at both ends of each railway route in specific metropolitan and urban areas are arrival and departure stations, and a specific metropolitan and urban area determination processing unit 152 that performs processing of whether payment is necessary or not in the case where the information read by the original ticket information reading unit 104 is combined with information of the dummy commutation ticket of each railway route.SELECTED DRAWING: Figure 1

Description

  The present invention relates to a fare settlement technique that performs settlement for a transfer that uses a combination of a ticket that is permitted to arrive and depart at each station in a specific area (a specific metropolitan city) and an original ticket such as a commuter pass.

  Patent Document 1 discloses the combined use of an SF (stored fair) card such as an IC card and a limited express train ticket that permits a boarding / departing ticket at each station in a specific area An automatic ticket gate that makes it possible is described. The automatic ticket gate described in Patent Document 1 determines the combined use of the SF card and the express train ticket, and in order to accurately collect the fare on the shortest route, the shortest route data for all stations. To keep.

  In addition, an automatic ticket gate equipped with a magnetic judgment library is currently in operation, but since this automatic ticket gate does not support judgment in a specific city, it falls within the range of a specific city. When the original ticket was used in combination, it was not possible to directly determine that the settlement amount would be 0 yen.

JP 2008-97429 A

  In the configuration of the automatic ticket checker described in Patent Document 1, there is a problem of an operation of updating data in response to future increase or decrease or change of a route or a station, and an increase in data amount.

  In addition, in an automatic ticket gate equipped with a magnetic judgment library, if you want to check whether a commuter pass is within the specified city area, all stations in the specified city area will be called arrival stations in sequence. There was a need to specify and attempt sequential settlement. However, it is difficult to say that it is a realistic determination method because it takes time to determine because there are many target stations. In addition, it is necessary to select the cheapest route that will be the cheapest when there is a dropout in the settlement with a transit ticket that uses both a ticket in and out of a specific city and a commuter pass. Since there is no automatic ticket gate to calculate, the response at the station window is based on the knowledge of station staff, which is inefficient.

  The present invention has been made in view of the above, and it is automatically determined whether or not payment is required at the time of payment in transit using a combination of a ticket that is permitted to arrive and depart at each station in a specified city and an original ticket (commuter pass, etc.). It is an object of the present invention to provide a fare settlement apparatus, a fare settlement method, and a program that enable easy and simple determination.

  The fare settlement apparatus according to the present invention reads the information of the original ticket in the fare settlement apparatus that performs settlement for a transfer that uses both the ticket and the original ticket that are permitted to arrive and depart at each station in the specified metropolitan city. A reading unit, a dummy commuter pass acquisition unit that acquires a dummy commuter pass, which is a virtual commuter pass having an end station located at both ends of each route in the specified city, for each route, and the reading unit And a determination processing unit that performs processing for determining whether or not payment is required when the information on the original ticket read in step 1 and the information on the dummy commuter pass for each route are combined.

  In addition, the fare settlement method according to the present invention is a fare settlement method in which settlement is performed for a transfer that uses both a ticket that is permitted to arrive and depart at each station in a specified metropolitan city and the original ticket. A dummy commuter pass obtaining step for obtaining, for each route, a dummy commuter pass that is a virtual commuter pass having an end station located at both ends of each route in the specified city area, A determination processing step for determining whether or not payment is required when the information on the original ticket read in the reading step and the information on the dummy commuter pass for each route are combined.

  In addition, the program according to the present invention is a program that allows a fare adjustment apparatus to perform payment for a transfer using a combination of a ticket that is permitted at each station in a specified metropolitan city and the original ticket. Reading means for reading, dummy commuter pass obtaining means for obtaining a dummy commuter pass, which is a virtual commuter pass having an end station located at both ends of each route in the specified city, for each route, and the reading The fare settlement apparatus is made to function as a determination processing section that performs a process for determining whether or not settlement is required when the information on the original ticket read by the section and the information on the dummy commuter pass on each route are combined.

  According to these inventions, at the time of determination in the specified metropolitan city, by performing the combination settlement with the original ticket using the dummy commuter pass that arrived at the end station of each route in the specified metropolitan city, It is determined whether the ticket is within the specified city area. When the combination payment with the dummy commuter pass is 0 yen (no payment is required), it can be determined that the original ticket is within the specified city area. Therefore, the station staff had no choice but to think about the cheapest route, but the cheapest fare can be automatically calculated by adjusting the other station.

  In addition, the fare settlement apparatus according to the present invention is a fare settlement apparatus provided with a determination processing unit that performs settlement for a transfer that uses both a ticket and an original ticket that are permitted to arrive and depart at each station in a specific metropolitan city. Reading section that reads information of original ticket and dummy commuter pass acquisition that acquires dummy commuter pass that is virtual commuter pass with terminal station located at both ends of each route in the specified metropolitan city for each route And a processing information set unit that inputs the information of the original ticket read by the reading unit and the information of the dummy commuter pass of each route to the determination processing unit. According to the present invention, it is possible to make a judgment within a specific metropolitan city by combining mounted judgment processing units.

  In addition, the present invention is characterized in that a settlement candidate station settlement processing unit for calculating the cheapest settlement amount from each terminal station of each route and the information of the original ticket is provided. According to this configuration, when the original ticket is outside the specified metropolitan city, the cheapest is the end station that is the boundary within the specified metropolitan city, so all the end stations are settled as installation stations. By calculating the amount of money, it is possible to obtain the settlement at the cheapest station as the settlement result.

  In addition, the present invention is characterized by comprising a storage unit for storing information on the dummy commuter pass in advance. According to this configuration, it is only necessary to read from the storage unit when necessary, and it is not necessary to create each time, so the burden of creation processing is reduced.

  According to the present invention, it is possible to automatically and easily determine whether or not payment is required at the time of payment in transit using a combination of a ticket that is permitted for arrival and departure at each station in a specific metropolitan city and an original ticket.

It is a functional block diagram which shows one Embodiment of the fare adjustment apparatus which concerns on this invention. It is a route map which shows an example of each route and each station which exist in a specific metropolitan city. It is a route map explaining the fare adjustment between the end station of each route in a specific metropolitan city, and the section station which can board by a commuter pass. It is a figure explaining the judgment method of the necessity of payment of a commuter pass and a dummy commuter pass. It is a flowchart explaining the procedure of a specific metropolitan city settlement process. It is a flowchart explaining the procedure of a payment candidate station payment process. It is a flowchart explaining the procedure of a specific metropolitan city area determination process.

  In FIG. 1, a fare settlement apparatus 10 is a window processing machine that is installed at a station window or a station staff passage and is mainly operated by a station staff. The fare settlement apparatus 10 includes a control unit 11 configured by a computer. A display unit 102, a storage unit 103, and an original ticket information reading unit 104 are connected to the control unit 11.

  The display unit 102 displays information such as routes and fares, and various processing instruction buttons. Although not shown, a touch panel is stacked on the screen of the display unit 102, and necessary instructions can be given. The storage unit 103 is a ROM, a control program storage unit 1031 that stores a control program that executes a fare adjustment process described later, a data type storage unit 1032 that stores various data necessary for the adjustment and determination process, and a specific specification described later A settlement determination program storage unit 1033 is provided for readable storage of a settlement determination program executed in the settlement determination work. The storage unit 103 has a work area including a RAM that temporarily stores processing information.

  The original ticket information reading unit 104 magnetically reads information written in a magnetic storage area on the surface of, for example, a magnetic ticket or a magnetic commuter pass. The original ticket information reading unit 104 may include a card information reader / writer function for reading information electronically written on a recording medium such as an IC card by contact or proximity communication. For example, a magnetic commuter pass records at least the routes on which it can be boarded, its section stations (stations at both ends), the valid boarding period, and the like. The original ticket may include a commuter ticket, a coupon ticket, a boarding ticket, and the like.

  The control unit 11 reads the program stored in the ROM of the storage unit 103 into the RAM and executes the program, so that the candidate station information acquisition unit 12, the dummy commuter pass acquisition unit 13, the processing information set unit 14, and the checkout determination process It functions as the unit 15.

  Here, the process which the fare adjustment apparatus 10 performs is demonstrated using FIGS. The fare settlement apparatus 10 is applied to settlement and determination processing in the case of transit using both a ticket permitted for arrival and departure at each station in a specified city and an original ticket (hereinafter referred to as a commuter pass). There are two types of usage: boarding with a commuter pass, boarding and getting off with a boarding ticket, and boarding with a boarding ticket and getting off with a commuter pass.

  Specified metropolitan city refers to the time when the trains in and around Sendai city, Tokyo city, Yokohama city (including some Kawasaki city), and more than 201km from the designated central station When using the JR line, it is said to be a system that calculates the fare based on the distance from the designated central station, regardless of which station (or which station) you ride in the city. When doing so, the same system is applied more than 101km from Tokyo Station.

  FIG. 2 is a route map showing an example of each route and each station existing in a specific city, and a virtual specific city SA and a plurality of routes R12 included in the specific city SA. R23, R34, R42 are shown. Each line R12, R23, R34, R42 includes a plurality of stations including the stations at both ends. Of the stations on each of the routes R12, R23, R34, and R42, stations that are boundaries with the specific metropolitan city SA are referred to as end stations S1, S2, S3, and S4. For example, there are five stations on the route R12, and the stations at both ends thereof are end stations S1 and S2.

  FIG. 3 is a route for explaining fare settlement (accumulation candidate station settlement processing described later) between the end stations of each route in the specified metropolitan area city SA and stations (section stations) where the commuter pass CP can be boarded. FIG. That is, FIG. 3 examines whether or not a fare is generated in a transit using a combination of a boarding ticket that is permitted to arrive and depart at each station in the specified metropolitan city SA and a commuter pass CP. In the present embodiment, the fare between a specific station in each route, here, the end stations S1, S2, S3, S4 of each route R12, R23, R34, R42 and the section station where the commuter pass CP can be boarded. Is calculated. More specifically, section CS1 between end station S1 and section station of commuter pass CP, section CS2 between end station S2 and section station of commuter pass CP, section station of end station S3 and commuter pass CP The fare in the section CS3, the section CS4 between the end station S4 and the section station of the commuter pass CP is calculated. When the section station of the commuter pass CP is outside the specific metropolitan city SA, the cheapest is the end station that becomes the boundary of the specific metropolitan city SA. Therefore, the settlement amount is obtained using all the end stations S1, S2, S3, S4 as candidate stations, and the settlement at the cheapest station is used as the settlement result.

  The candidate station information acquisition unit 12 acquires a candidate station for performing calculation for obtaining the lowest settlement result, and is a specific station among the stations of each route R12, R23, R34, R42, for example, The end stations S1, S2, S3, S4 are selected as candidate stations. The end stations S1, S2, S3, and S4 are the fare settlement device 10 for the settlement and determination process when transferring together with a commuter pass CP that is permitted to be used at each station in the specified metropolitan city SA. It may be created when a request occurs, or may be created in advance and stored in the data storage unit 1032 of the storage unit 103 and read out when necessary.

  Next, when the fare for each section CS1, CS2, CS3, CS4 is generated, that is, not 0 yen, the section station of the commuter pass CP is located outside the specific metropolitan city SA, as well as the specific city. It is also conceivable that the station is included inside the ward city SA except for the end stations S1, S2, S3, S4. Therefore, the latter case included in the inner side needs to be treated as being not required to be settled in distinction from the former case in the outer side. For this purpose, the process shown in FIG. 4 is performed.

  FIG. 4 is a diagram for explaining a method for determining whether or not payment is required for the commuter pass CP and the dummy commuter pass (specific city area determination process). In the example of FIG. 2 and FIG. 3, the dummy commuter pass is the end stations S1 and S2, S2 and S3, and S3 and S4 located at both ends of each route R12, R23, R34, R42 in the specified metropolitan city SA. , S4 and S2, each of which is a virtual commuter pass having a departure and arrival station, is used for the determination described later. Dummy commuter passes are prepared as dummy commuter passes A, B, C, D corresponding to the routes R12, R23, R34, R42. Therefore, if there is a matching station in any one of the dummy commuter passes, such as by comparing the section station of the commuter pass CP with the section stations of the dummy commuter passes A, B, C, D, Since the section station is connected to the specific metropolitan city SA, no settlement is required. As a method of collation, for example, for each station included in a section that can be boarded / exited with a commuter pass CP, the settlement process is performed one by one with each station including both ends of the set dummy commuter pass as an installed station. The presence or absence of a station with a settlement amount of 0 yen is detected.

  4, (A) to (D) correspond to processing stages, (A) is a process for determining the connection between the commuter pass CP and the dummy commuter pass A, and (B) is a commuter pass CP. (C) shows a process for judging the connection between the commuter pass CP and the dummy commuter pass C, and (D) shows that the process is unnecessary. In (C), it is determined that the commuter pass CP and the dummy commuter pass C are connected, that is, the section station of the commuter pass CP is a specific metropolitan city SA, so it is determined that no settlement is required. The process of (D) here is not performed as unnecessary.

  The dummy commuter pass acquisition unit 13 creates dummy commuter passes A, B, C, and D corresponding to the routes R12, R23, R34, and R42 in the specific metropolitan city SA. Dummy commuter pass A, B, C, D is the fare settlement device 10 and the settlement and determination process when transferring together using a commuter pass CP and a ticket that is permitted to arrive and depart at each station in the specified metropolitan city SA In this case, it may be created when the request is generated, or may be created in advance and stored in the data storage unit 1032 of the storage unit 103 and read out when necessary.

  The processing information set unit 14 creates candidate station information each time processing for each route is completed and inputs (sets) the information to the settlement determination processing unit 15 when executing the accumulation candidate station settlement process shown in FIG. . In addition, the processing information set unit 14 creates a dummy commuter pass every time the processing for each terminal station is completed, and inputs it to the checkout determination processing unit 15 (see FIG. 4). Set).

  The settlement determination processing unit 15 includes a settlement candidate station settlement processing unit 151 and a specific metropolitan city determination processing unit 152. The program for executing the settlement determination processing unit 15 is stored in advance in the settlement determination program storage unit 1033, for example, and is read during execution of the control program storage unit 1031 and input from the processing information set unit 14 Accepts information and executes processing.

  The settlement candidate station settlement processing unit 151 includes the end stations S1, S2, S3, S4 selected as candidate stations for the routes R12, R23, R34, and R42 selected by the candidate station information acquisition unit 12 and the commuter pass CP. A process of sequentially calculating the fare of each section CS1, CS2, CS3, CS4 between the section stations that can be boarded for each end station is performed.

  The specific metropolitan city determination processing unit 152 determines whether the commuter pass CP and the dummy commuter passes A, B, C, and D need to be settled when a fare is generated as a result of the fare calculation by the settlement candidate station settlement processing unit 151. The determination is made in order for each dummy commuter pass.

  With this calculation method, from FIG. 3 and FIG. 4, four patterns (dummy commuter passes A, B, C, D) for determination with dummy commuter passes and settlement comparison 4 stations (S1, S2, S2) at the end station. The final lowest price is obtained by the checkout determination process of up to 8 stations with S3 and S4). For example, in the case of seeking the lowest price in Tokyo Ward, if it is the current method, it will require a settlement comparison at all the current 76 stations. Settlement 11 pattern + settlement at end station 12 stations = maximum 23 stations can be settled to find the lowest price.

  Next, the specific city ward settlement process will be described with reference to FIGS. In the main flow of FIG. 5, firstly, a settlement candidate station settlement process is executed on each route (step S11), and it is determined whether or not the cheapest settlement information has been generated, that is, 0 yen (step S13). If the cheapest settlement information has been generated, the specific metropolitan city range determination process (step S15) is executed. If not, the process goes through step S15 and this flow is terminated. As a result, in response to a payment request from a passenger who has made a connection using both a ticket that is permitted to arrive and depart at each station in the specified metropolitan city and a commuter pass CP, the fare adjustment device 10 at the station staff counter performs a checkout process. Can be executed automatically, and can be processed quickly without relying on the knowledge and experience of station staff. If 0 yen is generated in the middle of the process, that is, for any candidate station, at this point, step S11 may be skipped, step S13 may be passed, and this flow may be immediately terminated. Moreover, the aspect which replaces and performs the process order of step S11 and step S15 may be sufficient.

  In the settlement candidate station settlement process shown in FIG. 6, first, a settlement candidate station is acquired (step S21). Next, the first candidate station is set (input) from among them (step S23), and the settlement process is executed between the set candidate station and the commuter pass CP (step S25).

  As a result of the settlement, it is determined whether or not settlement is required (step S27). If settlement has occurred, it is next determined whether or not settlement is possible, that is, whether or not they are located on different routes (step S29). . If payment is not possible, it is subsequently determined whether or not it is a payment process (first time) for the first candidate station (step S31). If it is the first time, the amount that is smaller than the initial value is updatedly written in the storage unit 103 as the lowest amount (step S33), and the process proceeds to step S39.

  On the other hand, if it is not the first time, the cheapest amount is compared with the current payment amount (step S35), and the current amount is smaller than or equal to the lowest amount written in the storage unit 103. (Yes in step S37), the current amount is updated and written (step S33), and the process proceeds to step S39. On the other hand, if the current amount is larger than the cheapest amount written in the storage unit 103, the process passes through step S33 and proceeds to step S39 to determine whether there is a next candidate station. If the next candidate station remains, the candidate station is set (step S41), the process returns to step S25, and the same processing is repeated. On the other hand, if the process is for the last candidate station, the process returns to the main flow.

  On the other hand, if it is determined in step S27 that no settlement is required, a settlement amount of 0 yen is set (step S43), and the lowest price written in the storage unit 103 is updated and written to 0 yen (step S45). ) Return to the main flow as it is. If it becomes impossible to pay in step S29, the process proceeds to step S39.

  In the specific metropolitan city range determination process shown in FIG. 7, first, a dummy commuter pass is obtained for each route in the specific metropolitan city (step S51). Next, the dummy commuter pass for the first route is set (input) (step S53), and the combination of the set dummy commuter pass and the commuter pass CP is input, and the settlement determination process is executed ( Step S55).

  Next, a determination is made as to whether or not settlement is required (the settlement amount is 0 yen) (step S57). If determination is not necessary, it is determined whether or not the next route remains (step S59). If the next route remains, a dummy commuter pass for that route is set (step S61), input is performed in combination with the set dummy commuter pass and commuter pass CP, and a determination process is executed ( Step S55). On the other hand, if the processing for all routes is completed in step S59, it is finally determined that the commuter pass CP is outside the specific metropolitan city SA, and this flow is terminated and the process returns to the main flow. To do.

  If it is determined in step S57 that no adjustment is required, it is determined that the city is within the specified city area SA, that is, 0 yen is adjusted, and this flow is terminated and the process returns to the main flow. The processing in steps S57 and S63 is completed when the need for settlement is generated on any route, and the processing for the remaining routes becomes unnecessary because the processing is finished.

DESCRIPTION OF SYMBOLS 10 Fare adjustment apparatus 11 Control part 103 Memory | storage part 104 Original ticket information reading part (reading part)
12 candidate station information acquisition unit 13 dummy commuter pass acquisition unit 14 processing information set unit 15 checkout determination processing unit (part of determination processing unit)
151 Settlement candidate station settlement processing unit 152 Specific metropolitan city determination processing unit (determination processing unit)
SA Specified metropolitan city R12, R23, R34, R41 Route S1, S2, S3, S4 End station CP commuter pass (original ticket)
CS1, CS2, CS3, CS4 section

Claims (6)

In the fare settlement device that performs settlement for connections that use both a ticket that is permitted to arrive and depart at each station in the specified metropolitan city and the original ticket,
A reading unit for reading the information of the original ticket;
A dummy commuter pass acquisition unit that acquires a dummy commuter pass for each route that is a virtual commuter pass with an end station located at both ends of each route in the specified metropolitan city;
A fare adjustment apparatus comprising: a determination processing unit that performs processing for determining whether or not adjustment is required when the information on the original ticket read by the reading unit and the information on the dummy commuter pass on each route are combined. The fare settlement apparatus according to claim 1, further comprising a settlement candidate station settlement processing unit that calculates a cheapest settlement amount from each terminal station of each route and information of the original ticket. The fare settlement apparatus according to claim 1, further comprising a storage unit that stores information on the dummy commuter pass in advance. In the fare adjustment method, where payment is made for connections that use both original tickets and tickets that are permitted to arrive and depart at each station in the specified metropolitan city,
A reading step of reading information of the original ticket;
A dummy commuter pass obtaining step for obtaining a dummy commuter pass for each route, which is a virtual commuter pass having an end station located at both ends of each route in the specific city,
A fare adjustment method comprising: a determination processing step for determining whether or not adjustment is required when the information on the original ticket read in the reading step and the information on the dummy commuter pass on each route are combined. In a program that uses a fare adjustment device to make payments for connections that use both original tickets and tickets that are permitted for departure and arrival at each station in the specified metropolitan city,
Reading means for reading the information of the original ticket;
Dummy commuter pass acquisition means for acquiring a dummy commuter pass for each route, which is a virtual commuter pass with the end stations located at both ends of each route in the specified metropolitan city, and
The program which makes the said fare adjustment apparatus function as a determination process part which performs the process of whether adjustment is unnecessary when combining the information of the said original ticket read with the said reading part, and the information of the said dummy commuter pass of each route. In the fare settlement device with a judgment processing unit that performs settlement for connections using both original tickets and tickets that are permitted to arrive and depart at each station in the specified metropolitan city,
A reading unit for reading the information of the original ticket;
A dummy commuter pass acquisition unit that acquires a dummy commuter pass for each route that is a virtual commuter pass with an end station located at both ends of each route in the specified metropolitan city;
A fare adjustment apparatus comprising: a processing information set unit configured to combine the information on the original ticket read by the reading unit and the information on the dummy commuter pass on each route and input the information to the determination processing unit.