# The Research on Ticket Fare Optimization for China’s High-Speed Train

Authors: Jinzi Zheng; Jun Liu
Journal: Mathematical Problems in Engineering
 (2016)

---

## Abstract

With the constant deepening of the railway reform in China, the competition between railway passenger transportation and other modes of passenger transportation has been getting fiercer. In this situation, the existing unitary and changeless fare structure gradually becomes the prevention of railway revenue increase and railway system development. This paper examines a new method for ticket fare optimization strategy based on the revenue management theory. On the premise that only one fare grade can be offered for each OD at the same time, this paper addresses the questions of how to determine the number of fare grades and the price of each fare grade. First, on the basis of piecewise pricing strategy, we build a ticket fare optimization model. After transforming this model to a convex program, we solve the original problem by finding the Kuhn-Tucker (K-T) point of the convex program. Finally, we verify the proposed method by real data of Beijing-Shanghai HSR line. The calculating result shows that our pricing strategy can not only increase the revenue, but also play a part in regulating the existing demand and stimulating potential demand.


---

## Body

## 1. Introduction

With the constant deepening of the railway reform in China, railway passenger transportation has been involved in fiercer competition with airline and highway transportation. In the environment of market economy, the primary goal of railway sector is not only to realize passengers’ transportation demand, but also to get as much revenue as possible. However, in the past several decades, what we have been applying is the unitary and changeless fare structure, of which the ticket fare rate is the same all over the country and for all kinds of passengers. Statistical data provided for 2014 by the Beijing-Shanghai High-Speed Railway Company shows that 13 percent of the trains had a load factor less than 65 percent, which means there exists large potential of revenue in railway passenger transportation. It is hard for the railway to sustain the position as before if we do not make any transition to adapt to the new situation. Since 2012, the Shanghai-Nanjing, Shanghai-Hangzhou, Beijing-Shanghai, and Beijing-Guangzhou high-speed railways have tried to discount off-season ticket fares. One characteristic of these preference strategies is that the timing and discount level are the same for all the ODs of a specific train. This unitary discount strategy is easy to be implemented but cannot accommodate to diversified demand characteristics (such as demand density and demand valuation) of various ODs in different time.Revenue management, which has been applied to air transportation for years, has successfully increased the revenue of air transportation by providing proper customers with proper prices and effective capacity control strategies. General and detailed discussion of revenue management can be seen in Weatherford and Bodily [1], McGill and Van Ryzin [2], Bitran and Caldentey [3], and Elmaghraby and Keskinocak [4]. Since railway passenger transportation has many characters in common with air transportation, we are confident that revenue management can also bring benefit to railway if being utilized properly. Armstrong and Meissner [5] analyzed the similarities and differences between airline and railway passenger transportation and gave an overview of the existing research results on railway revenue management.A number of previous works have examined the aspects of the problem of price-based revenue management, which is aimed at increasing profits by dynamically setting optimal pricing strategies [6]. Dynamic pricing has already been successfully applied in many industries such as airline, hotel, and car rental. Kincaid and Darling [7] laid the foundation for the study of multigrade price, building two optimization models to generate the optimal prices of each time from the aspects of whether the price is announced. Chatwin [8] researched how to choose the optimal prices from a given price set according to the current inventory. Gallego and Ryzin [9] analyzed the structural characteristics of optimal price for a single product, proving that the optimal solution of the deterministic problem is the upper bound of the stochastic problem. On this basis, Gallego and Van Ryzin [10] found the upper bound of the optimal expected revenue by analyzing the deterministic version of the problem for multiple products. Pricing belongs to a tactical problem. On the practical level, methods are needed to dynamically decide the optimal timing of price changes. For a unique price change allowed to be either higher or lower, Feng and Gallego [11] put forward a control strategy based on a time threshold that depends on the number of unsold items.In China, research on dynamic pricing started late because the ticket price has traditionally remained changeless. From the practical point of view, Shi [12] translated the optimal solution to a feasible approximate optimal solution. Zhang [13] applied maximum concave envelope theory to determine the optimal fare discount for each OD of a train. With the application of dynamic game theory, Zhang et al. [14] established a dynamic pricing model between HSR and air transportation. Yao et al. [15] analyzed the pricing strategy for HSR in Wuhan-Guangzhou corridor with the consideration of the competition between passenger rail transportation and other transport modes. Bingyi [16] developed dynamic programming model to deal with the HSR revenue optimization problem with multitrain, multisegment, and multiclass, by considering passengers choice behavior.Our paper studies the ticket fare optimization method for single high-speed train, aiming at optimizing the revenue of the train. A train service is represented as a linear network with stations as nodes and arcs that connect OD station pairs served. We propose a method to determine the number of fare grades according to the regularity of passenger arrival and the optimal prices that meet the demand of each OD. A demand driven fare is allowed to fluctuate within a certain range, either upward or downward, around the standard fare.This paper proceeds as follows. Section2.1 is a fine description of optimization model. Section 2.2 makes use of Lagrange Multiplier and Karush-Kuhn-Tucker (KKT) conditions to solve the previous model. Section 3 shows an experimental study for verifying the proposed method.


## 2. Model and Algorithm

We will firstly provide in this section the basic terminologies and notations necessary for modeling. After that, the model and algorithm of ticket fare optimization problem are put forward.


### 2.1. The Notations and Model

We define the “product” in our study as origin-destination (OD) transportation service offered by a passenger train, which containsM
+
1 stops including the starting and terminal stations and M sections between each two stations. The product in our model is denoted by i
j
=
i
j
:
j
>
i
;
i
=
1
,
…
,
M
;
j
=
2
,
…
,
M
+
1, referring to the OD transportation service from station i to station j. All the products produced by a passenger train are stored in a sequence according to the incremental order of j and i, I
J
=
12
,
…
,
1
M
+
1
,
23
,
…
,
M
M
+
1. After numbering all the products in I
J from left to right, we can get a new product sequence indexed by the serial number, b
=
b
1
,
…
,
b
N, and N
=
M
M
+
1
/
2. The section, which is a basic element to make up OD, is deemed as the resource of product, denoted as m
=
1
,
…
,
M.By analyzing the historical ticket-sale data, we found the demand density for a certain OD product varies with time regularly in ticket-sale period. As we deem, the passenger ticket-purchasing behavior is influenced by various factors, the details on which will be discussed in Section3.1. For a certain product, the external factors such as travel distance, alternative product, and departure time are fixed; thus the difference of ticket-purchasing pattern by time is mainly determined by the passengers’ valuations. As is usually done in airline revenue management, we assume that passengers with low valuation arrive earlier and those with high valuation arrive later. Based on the third-degree price discrimination, profit could be increased by providing different customers with corresponding prices. Therefore, the idea of floating pricing strategy proposed here is to set prices separately by product, and for a certain product the price is adjusted according to the change of passenger arrival pattern.We firstly divide the ticket-sale period into several subperiods according to the statistical regularity of passenger arrival process of the product we concern and then set the price in each subperiod. For an OD product, the ticket-sale period is divided intoK subperiods; the k
t
h one is denoted byt
k. The time duration of subperiodt
k of productnisl
n
t
k. In this research, we make the following hypotheses: (1) the passenger transportation market is an imperfect competition market and the demand of a certain product changes with its price; (2) we only consider myopic passengers who buy tickets as soon as the offered price is less than their willingness to pay, in contrast to the strategic passengers who will optimize their purchase behavior by predicting the price strategies; (3) for simplification, we assume there is only one class of seats on the train. Thus, the demand density of product n in subperiod t
k can be expressed as the function of t
k and current price p
n
t
k, denoted as λ
n
t
k
,
p
n
t
k. We control demand density instead of price in this model for the convenient description of capacity constraint. The price of product is denoted as the inverse function of demand function, p
t
,
λ. To ensure the price is feasible, we define a feasible price set P. The decision variables in the model are demand densities of each product in each subperiod, λ
=
λ
1
t
1
,
…
,
λ
1
t
K
,
λ
2
t
1
,
…
,
λ
N
t
K where λ
∈
Λ (Λ
=
λ
t
,
p
:
p
∈
P).In our problem, the initial inventory is expressed as a vectorx
=
x
1
,
…
,
x
M
T
∈
T
+
M
(
T
+ is the set of positive integers), where x
m is the initial inventory of resource m, representing the number of available seats of this section. In addition, we define a 0-1 variable a
m
n to denote the relationship between product n and resource m; that is, if product n occupies resource m, a
m
n
=
1; else a
m
n
=
0. The preallocation plan is a peculiarity of railway passenger organization in China, which is to set the range of application for all seats ahead of the ticket-sale period. In our model, y
n is used to denote the maximum capacity of product n produced by the preallocation plan, which is another important capacity constraint.The total revenue of the train we concern is as below:(1)
R
λ
,
t
=
∑
n
=
1
N
∑
k
=
1
K
l
n
t
k
·
λ
n
t
k
·
p
n
λ
n
t
k
.The optimal price strategy is the onep
∗  (λ
∗ in this model) that will maximize the total revenue R
∗
λ
∗
,
t
=
max
λ
∈
Λ
⁡
R
λ
,
t.As stated above, we take into consideration two kinds of capacity constraints: one is the “resource capacity constraint”, which ensures the capacity of any resource cannot be exceeded; the other is the “product capacity constraint” produced by preallocation plan. These constraints are expressed as (2) and (3), respectively:(2)
∑
n
=
1
N
∑
k
=
1
K
l
n
t
k
·
λ
n
t
k
·
a
m
n
≤
x
m
∀
m
∈
1
,
M
,
(3)
∑
k
=
1
K
l
n
t
k
·
λ
n
t
k
≤
y
n
∀
n
∈
1
,
N
.


### 2.2. The Algorithm

The revenue rate functionr
λ
=
λ
p
λ is continuous, bounded, and concave [10]. As the product of real number and concave function and the sum of several concave functions are both concave, it is easy to deduce that the objective function R
λ
,
t is concave too. Therefore, the nonlinear programming problem we propose can be solved using Lagrange Multiplier and KKT conditions. According to the requirement of KKT condition, we introduce a new objective function f
λ
,
t which is the opposite of R
λ
,
t. Then the initial problem can be rewritten as follows:(4)
f
λ
,
t
=
-
R
λ
,
t
=
-
∑
n
=
1
N
∑
k
=
1
K
l
n
t
k
·
λ
n
t
k
·
p
n
λ
n
t
k
,
g
m
λ
,
t
=
x
m
-
∑
n
=
1
N
∑
k
=
1
K
l
n
t
k
·
λ
n
t
k
·
a
m
n
≥
0
∀
m
∈
1
,
M
,
h
n
λ
,
t
=
y
n
-
∑
k
=
1
K
l
n
t
k
·
λ
n
t
k
≥
0
∀
n
∈
1
,
N
.The gradient of the objective function and constraint functions can be gained by taking the derivation:(5)
∇
f
λ
=
-
l
1
t
1
p
1
λ
1
t
1
,
…
,
l
1
t
K
p
1
λ
1
t
K
,
l
2
t
1
p
2
λ
2
t
1
,
…
,
l
N
t
K
p
N
λ
N
t
K
T
,
∇
g
m
λ
=
-
l
1
t
1
a
m
1
,
…
,
l
1
t
K
a
m
1
,
l
2
t
1
a
m
2
,
…
,
l
N
t
K
a
m
N
T
∀
m
∈
1
,
M
,
∇
h
n
λ
=
-
0
,
…
,
0
︸
n
-
1
K
,
l
1
t
1
λ
1
t
1
,
…
,
l
1
t
K
λ
1
t
K
,
0
,
…
,
0
︸
N
-
n
K
T
∀
n
∈
1
,
N
.Supposing thatλ
∗ is the optimal solution of the initial nonlinear programming problem (see (1)–(3)), and the derivation ∇
g
m
λ
∗
m
=
1,2
,
…
,
M and ∇
h
n
λ
∗
n
=
1,2
,
…
,
N are linearly independent, by introducing Lagrange multipliers μ
∗
=
μ
1
∗
,
μ
2
∗
,
…
,
μ
M
∗
T and ρ
∗
=
ρ
1
∗
,
ρ
2
∗
,
…
,
ρ
N
∗
T, we can have (6)
∇
f
λ
∗
-
∑
m
=
1
M
μ
m
∗
∇
g
m
λ
∗
-
∑
n
=
1
N
ρ
n
∗
∇
h
n
λ
∗
=
0
,
μ
m
∗
g
m
λ
∗
=
0
,
m
=
1,2
,
…
,
M
,
ρ
n
∗
h
n
λ
∗
=
0
,
n
=
1,2
,
…
,
N
,
μ
m
∗
≥
0
,
m
=
1,2
,
…
,
M
,
ρ
n
∗
≥
0
,
n
=
1,2
,
…
,
N
.By solving the above equations set we can get the optimal solutionλ
∗ and also the optimal price of each product in each subperiod.


## 2.1. The Notations and Model

We define the “product” in our study as origin-destination (OD) transportation service offered by a passenger train, which containsM
+
1 stops including the starting and terminal stations and M sections between each two stations. The product in our model is denoted by i
j
=
i
j
:
j
>
i
;
i
=
1
,
…
,
M
;
j
=
2
,
…
,
M
+
1, referring to the OD transportation service from station i to station j. All the products produced by a passenger train are stored in a sequence according to the incremental order of j and i, I
J
=
12
,
…
,
1
M
+
1
,
23
,
…
,
M
M
+
1. After numbering all the products in I
J from left to right, we can get a new product sequence indexed by the serial number, b
=
b
1
,
…
,
b
N, and N
=
M
M
+
1
/
2. The section, which is a basic element to make up OD, is deemed as the resource of product, denoted as m
=
1
,
…
,
M.By analyzing the historical ticket-sale data, we found the demand density for a certain OD product varies with time regularly in ticket-sale period. As we deem, the passenger ticket-purchasing behavior is influenced by various factors, the details on which will be discussed in Section3.1. For a certain product, the external factors such as travel distance, alternative product, and departure time are fixed; thus the difference of ticket-purchasing pattern by time is mainly determined by the passengers’ valuations. As is usually done in airline revenue management, we assume that passengers with low valuation arrive earlier and those with high valuation arrive later. Based on the third-degree price discrimination, profit could be increased by providing different customers with corresponding prices. Therefore, the idea of floating pricing strategy proposed here is to set prices separately by product, and for a certain product the price is adjusted according to the change of passenger arrival pattern.We firstly divide the ticket-sale period into several subperiods according to the statistical regularity of passenger arrival process of the product we concern and then set the price in each subperiod. For an OD product, the ticket-sale period is divided intoK subperiods; the k
t
h one is denoted byt
k. The time duration of subperiodt
k of productnisl
n
t
k. In this research, we make the following hypotheses: (1) the passenger transportation market is an imperfect competition market and the demand of a certain product changes with its price; (2) we only consider myopic passengers who buy tickets as soon as the offered price is less than their willingness to pay, in contrast to the strategic passengers who will optimize their purchase behavior by predicting the price strategies; (3) for simplification, we assume there is only one class of seats on the train. Thus, the demand density of product n in subperiod t
k can be expressed as the function of t
k and current price p
n
t
k, denoted as λ
n
t
k
,
p
n
t
k. We control demand density instead of price in this model for the convenient description of capacity constraint. The price of product is denoted as the inverse function of demand function, p
t
,
λ. To ensure the price is feasible, we define a feasible price set P. The decision variables in the model are demand densities of each product in each subperiod, λ
=
λ
1
t
1
,
…
,
λ
1
t
K
,
λ
2
t
1
,
…
,
λ
N
t
K where λ
∈
Λ (Λ
=
λ
t
,
p
:
p
∈
P).In our problem, the initial inventory is expressed as a vectorx
=
x
1
,
…
,
x
M
T
∈
T
+
M
(
T
+ is the set of positive integers), where x
m is the initial inventory of resource m, representing the number of available seats of this section. In addition, we define a 0-1 variable a
m
n to denote the relationship between product n and resource m; that is, if product n occupies resource m, a
m
n
=
1; else a
m
n
=
0. The preallocation plan is a peculiarity of railway passenger organization in China, which is to set the range of application for all seats ahead of the ticket-sale period. In our model, y
n is used to denote the maximum capacity of product n produced by the preallocation plan, which is another important capacity constraint.The total revenue of the train we concern is as below:(1)
R
λ
,
t
=
∑
n
=
1
N
∑
k
=
1
K
l
n
t
k
·
λ
n
t
k
·
p
n
λ
n
t
k
.The optimal price strategy is the onep
∗  (λ
∗ in this model) that will maximize the total revenue R
∗
λ
∗
,
t
=
max
λ
∈
Λ
⁡
R
λ
,
t.As stated above, we take into consideration two kinds of capacity constraints: one is the “resource capacity constraint”, which ensures the capacity of any resource cannot be exceeded; the other is the “product capacity constraint” produced by preallocation plan. These constraints are expressed as (2) and (3), respectively:(2)
∑
n
=
1
N
∑
k
=
1
K
l
n
t
k
·
λ
n
t
k
·
a
m
n
≤
x
m
∀
m
∈
1
,
M
,
(3)
∑
k
=
1
K
l
n
t
k
·
λ
n
t
k
≤
y
n
∀
n
∈
1
,
N
.


## 2.2. The Algorithm

The revenue rate functionr
λ
=
λ
p
λ is continuous, bounded, and concave [10]. As the product of real number and concave function and the sum of several concave functions are both concave, it is easy to deduce that the objective function R
λ
,
t is concave too. Therefore, the nonlinear programming problem we propose can be solved using Lagrange Multiplier and KKT conditions. According to the requirement of KKT condition, we introduce a new objective function f
λ
,
t which is the opposite of R
λ
,
t. Then the initial problem can be rewritten as follows:(4)
f
λ
,
t
=
-
R
λ
,
t
=
-
∑
n
=
1
N
∑
k
=
1
K
l
n
t
k
·
λ
n
t
k
·
p
n
λ
n
t
k
,
g
m
λ
,
t
=
x
m
-
∑
n
=
1
N
∑
k
=
1
K
l
n
t
k
·
λ
n
t
k
·
a
m
n
≥
0
∀
m
∈
1
,
M
,
h
n
λ
,
t
=
y
n
-
∑
k
=
1
K
l
n
t
k
·
λ
n
t
k
≥
0
∀
n
∈
1
,
N
.The gradient of the objective function and constraint functions can be gained by taking the derivation:(5)
∇
f
λ
=
-
l
1
t
1
p
1
λ
1
t
1
,
…
,
l
1
t
K
p
1
λ
1
t
K
,
l
2
t
1
p
2
λ
2
t
1
,
…
,
l
N
t
K
p
N
λ
N
t
K
T
,
∇
g
m
λ
=
-
l
1
t
1
a
m
1
,
…
,
l
1
t
K
a
m
1
,
l
2
t
1
a
m
2
,
…
,
l
N
t
K
a
m
N
T
∀
m
∈
1
,
M
,
∇
h
n
λ
=
-
0
,
…
,
0
︸
n
-
1
K
,
l
1
t
1
λ
1
t
1
,
…
,
l
1
t
K
λ
1
t
K
,
0
,
…
,
0
︸
N
-
n
K
T
∀
n
∈
1
,
N
.Supposing thatλ
∗ is the optimal solution of the initial nonlinear programming problem (see (1)–(3)), and the derivation ∇
g
m
λ
∗
m
=
1,2
,
…
,
M and ∇
h
n
λ
∗
n
=
1,2
,
…
,
N are linearly independent, by introducing Lagrange multipliers μ
∗
=
μ
1
∗
,
μ
2
∗
,
…
,
μ
M
∗
T and ρ
∗
=
ρ
1
∗
,
ρ
2
∗
,
…
,
ρ
N
∗
T, we can have (6)
∇
f
λ
∗
-
∑
m
=
1
M
μ
m
∗
∇
g
m
λ
∗
-
∑
n
=
1
N
ρ
n
∗
∇
h
n
λ
∗
=
0
,
μ
m
∗
g
m
λ
∗
=
0
,
m
=
1,2
,
…
,
M
,
ρ
n
∗
h
n
λ
∗
=
0
,
n
=
1,2
,
…
,
N
,
μ
m
∗
≥
0
,
m
=
1,2
,
…
,
M
,
ρ
n
∗
≥
0
,
n
=
1,2
,
…
,
N
.By solving the above equations set we can get the optimal solutionλ
∗ and also the optimal price of each product in each subperiod.


## 3. Case Study

In this case study, we select two high-speed trains of Beijing-Shanghai High-Speed Railway G1 and G3, which have many things in common with each other in operation properties. Both of G1 and G3 trains depart from Beijing South station, stop once at Nanjing South station, and terminate at Shanghai Hongqiao station. The distance of Beijing-Nanjing product is 1023 km, Beijing-Shanghai product 1318 km, and Nanjing-Shanghai product 295 km. The single difference between these two trains is that G1 departs at 9:00 am and G3 at 2:00 pm.


### 3.1. Passenger Arrival Regularity

Passenger arrival regularity is the basis of segmenting the ticket-selling period. We apply the ticket-sale data in 2012 (the data of December is not included for the lack of data in this month) as the sample to analyze these two trains’ passenger arrival regularity by product and show the statistical results in Figure1, of which each point represents the percentage of tickets sold in that day to the total amount of tickets sold in the entire period for the product.Figure 1
Passenger arrival regularity for G1 and G3 by product.In the figure, Day 1 is the first day of ticket-sale period, and Day 10 is the departure day. From Figure1 we can see the passenger arrival regularity of Beijing-Nanjing product and that of Beijing-Shanghai product are similar to each other: from Day 1 to Day 8 the percentage of tickets sold per day stays low (15% at most) and increases gradually; in Day 9 the percentage abruptly increases, and the ticket-sale rate per unit time peaks in Day 10 (dividing the amount of tickets sold in Day 10 by the actual selling time). The passenger arrival regularity of Nanjing-Shanghai product is special: in the first 9 days, the daily ticket-sale percent is very low and the climbing speed is low too; in Day 10 the percent is the biggest and much bigger than those of the first 9 days. From the above statistical results, we can conclude that passenger arrival regularity is affected by the following factors.(1) Travel Distance. The longer the travel distance is, the earlier passengers tend to purchase tickets. Usually for the short-distance travel, such as from Nanjing to Shanghai, passengers are inclined to purchase tickets just on the day of departure. As is shown in Figure 1, the percentage of passengers purchasing tickets in the earlier stage is the highest for Beijing-Shanghai product and lowest for Nanjing-Shanghai product.To support this viewpoint, we did a data statistics using the historical ticket data for the Beijing-Shanghai High-Speed Railway during the period March 1, 2013, to March 13, 2014. For a certain trainw, let d
s
w
,
k denote hourly demand density of its OD pair k on day s. The total booking horizon is S days; then the ratio of demand density on day s is y
s
w
,
k
=
d
s
w
,
k
/
∑
s
=
1
S
d
s
w
,
k
×
100
%. Averaging the value y
s
w
,
k of all the trains yields the daily demand density ratio of OD pair k on day s, which is denoted as y
s
k. Figure 2 shows the relationship between daily demand density ratio and the length of the OD arc. The correlation between these is positive before day 18, not significant on day 19, and negative on the departure day.Figure 2
Correlation between demand density ratio and length of OD.From the figure, it appears that the daily demand density ratio (y%) and the length of OD pair (1000x) have a linear relationship. A linear regression equation was developed to test this hypothesis, which is y
^
=
a
^
+
b
^
x. Table 1 shows the regression analysis results, with the confidence coefficient 95%.Table 1
Regression analysis results.
Day 1
Day 2
Day 3
Day 4
Day 5
Day 6
Day 7
a
0.0104
−0.0301
−0.1274
−0.0980
−0.0631
0.0156
0.0304
b
4.8397
0.8391
1.1323
0.9584
0.8424
1.0130
0.5160
R square
0.5645
0.8033
0.7561
0.7957
0.8152
0.6057
0.5474
AdjustedR
0.5373
0.7910
0.7408
0.7829
0.8036
0.5811
0.5191
P value
0.0003
0.0044
0.0069
0.0060
0.0027
0.0001
0.0004
Day 8
Day 9
Day 10
Day 11
Day 12
Day 13
Day 14
a
0.0297
0.0140
0.0346
0.1787
0.0630
0.1806
0.2385
b
0.8806
1.0221
1.1746
1.1391
1.4461
2.0868
1.8605
R square
0.7947
0.8240
0.7948
0.7938
0.8120
0.7486
0.9067
AdjustedR
0.7819
0.8130
0.7820
0.7810
0.8002
0.7329
0.9009
P value
0.0062
0.0018
0.0062
0.0065
0.0031
0.0088
0.0001
Day 15
Day 16
Day 17
Day 18
Day 19
Day 20
a
0.4403
0.8665
1.4321
3.0828
13.2832
80.4182
b
2.7153
3.2379
4.7170
6.9677
8.4014
−45.7899
R square
0.8598
0.8280
0.8392
0.8115
0.5056
0.8178
AdjustedR
0.8511
0.8172
0.8291
0.7998
0.4747
0.8064
P value
0.0011
0.0015
0.0032
0.0031
0.0009
0.0024The regression analysis results are revealing. TheP value is less than 0.05 for all days. The R-Square value is greater than 0.7 on days except for 1, 6, 7, and 19. Thus, there is a weaker linear relation between demand density ratio and OD length for these four days, though a fairly strong linear relation for the other days. The results also reveal some passenger arrival trends. Not considering other factors, passengers with long-distance journeys tend to purchase tickets early in the booking horizon, whereas short-distance journey passengers purchase tickets later. The slope of x on the departure day is much greater than for other days, illustrating that the shorter the journey is, the more passengers are willing to purchase tickets just before departure.(2) The Amount of Alternative Products. The other factor influencing passenger behavior is the number of trains that serve the same OD. We term these services alternative products. The more the alternative products exist, the later passengers purchase tickets. This conjecture can be realistic because if there are enough alternative products, passengers do not have to buy tickets in advance for the sake of tickets being not enough, and instead they will purchase tickets after everything of the travel is settled down.To examine this, we selected two similar length pairs of ODs and used their ticket data to analyze the relationship between demand density ratio and amount of alternative products. Figure3 compares the demand density ratio curves for itineraries of these two OD pairs. The booking horizon of the ticket data we used in this examination is 20 days. Since the curves for days 1 to 9 are basically the same, the figure shows only the curves from days 10 to 20. Figure 3(a) represents the Nanjing South-Shanghai Hongqiao itinerary, where the length is 295 km and there are 44 alternative products, and the Tianjin West-Jinan West itinerary (301 km and 4 alternate products). Figure 3(b) reflects the Jinan West-Shanghai Hongqiao (912 km and 42 alternate products) and Tianjin West-Nanjing South (918 km and 4 alternate products) itineraries.Figure 3
Relationship between demand density ratio and amount of alternative products.
(a)
(b)In both Figures3(a) and 3(b), before day 19 the curve of the OD with more alternative products lies above that of the OD with fewer products. On day 20, the reverse is true. We conclude that, for ODs with similar length, passengers purchase tickets earlier when there are fewer alternative products.(3) The Purpose of the Trip. We can see from the statistical result of “Beijing-Shanghai High-Speed Railway demand questionnaire” (carried out by Beijing-Shanghai High-Speed Railway Company in 2012) that business travelers usually purchase tickets 1-2 days ahead of departure day, while the passengers traveling for tour, visiting friends, and migrant work tend to purchase tickets more than 3 days in advance. Thus it is convincing to assume that customers who are more price-sensitive arrive earlier and the less price-sensitive customers arrive later, which has already been commonly adopted by airline revenue management.(4) The Train Departure Time. From Figure 1 we can see that in the earlier stage of ticket-sale period G1 curve is above G3 curve most of the time and only in the last day G1 curve is below G3 curve, which means that G1 passengers tend to purchase tickets earlier than G3 passengers. From this comparison we cannot arbitrarily make the conclusion that the earlier the departure time is, the earlier passengers purchase tickets. But the departure time of the train indeed has some influence on passenger behavior, which still needs more intensive study.


### 3.2. The Segmentation of Ticket-Sale Period

The passenger arrival regularity varies from train to train, even from section to section for a certain train, for the passenger behavior is influenced a lot by the train operation properties such as departure time and travel time. Therefore, the segmentation of ticket-sale period should be treated differently by each train and by each section for a given train.The experience of Britain and France railway shows that too many price classes may cause the revenue management lose efficacy [17–19]. Thus in accordance with the statistical passenger arrival regularity, we plan to set two price classes for each product and divide the ticket-sale period into two subperiods; that is, for the product of Beijing-Nanjing and Beijing-Shanghai transportation service from the first day to 8th day is number 1 subperiod and from 9th day to 10th day is number 2 subperiod; as regards Nanjing-Shanghai product, the first day to 9th day belong to number 1 subperiod, and 10th day itself is number 2 subperiod.


### 3.3. The Analysis of Computation Result

We take G3 train as an example here to examine our ticket fare optimization method. According to the modeling approach discussed in Section2.1, G3 train can be described as a network shown in Figure 4.Figure 4
The network of G3 train.For the network in Figure2, a relation matrix of resource and product is created: (7)
a
m
n
=
a
11
a
12
a
13
a
21
a
22
a
23
=
1
1
0
0
1
1
.The vehicle model of G3 train is CRH380BL, of which the personnel quota is 1005. Thus, the resource capacity in our model isx
1
=
x
2
=
1005. As to the preallocation plan, we do not take standing-room ticket and overbooking into consideration. The product capacity in this case is set fixed; that is, y
1
=
y
3
=
405, y
2
=
600. The ticket-sale period of G3 train is divided as discussed in Section 3.2. However, the 10th day is departure day, for which the actual ticket-sale time is not a whole day. The durations of each product in each subperiod for calculation in the case are shown in Table 1. As discussed above, the passengers arriving in the first subperiod are more price-sensitive than passengers arriving in the second subperiod. Thus we set the value of ϵ
0 higher for the first subperiod and lower for the second, which can also be seen in Table 2.Table 2
Reference price strategy and the revenue.
Product
Price (yuan)
Price elasticity of demand
⁢Demand density
⁢Duration (day)
p
0
ϵ
0
1
ϵ
0
2
λ
0
1
λ
0
2
l
1
l
2
Beijing-Nanjing
443.5
1.3
1.1
24
113
8
1.583
Beijing-Shanghai
553
1.3
1.1
45
148
8
1.583
Nanjing-Shanghai
134.5
1.3
1.1
7
290
9
0.583
Passenger traffic
1197
Revenue (yuan)
524,337A common demand function of a product can describe the quantitative relation between product demand and its impact factors, for example, product attributes (such as price) or marketing variables (such as advertising, brand name, and competitor’s prices). From the consideration of research emphasis, we just focus on how the demand changes with product price without considering other impact factors. The Log-linear demand function is adopted in our study, which is popular in econometric studies and has several desirable theoretical and practical properties [20]. For example, the demand is always nonnegative so we can treat price unconstrained in the model. Besides that, the Log-linear function can be translated into a linear form by taking the log of the function; thus it can be estimated using linear regression. The demand-price function we use is as below:(8)
λ
p
=
λ
0
e
-
ϵ
0
p
/
p
0
-
1
.In function (8), p
0 is interpreted as a reference price, λ
0 is the demand rate (the number of tickets sold per day) at the reference price, and ϵ
0 is the absolute value of price elasticity of demand at the reference price. The negative sign in front of ϵ
0 means the demand and price are antidependent. This Log-linear demand function has a unique inverse, which is the price function:(9)
p
λ
=
ϵ
0
-
1
ln
⁡
λ
0
λ
+
1
p
0
.Matlab R2014a is applied for implementing our algorithm. The calculation results including resulting prices, demand densities, and the revenue to be gained using this price strategy are shown in Table3.Table 3
Calculation results for the case.
Product
Price (yuan)
⁢Demand density
p
1
p
2
λ
1
λ
2
Beijing-Nanjing
390.9
447.1
28
112
Beijing-Shanghai
525.5
599.2
48
135
Nanjing-Shanghai
108.5
122.5
9
320
Passenger traffic
1267
Revenue (yuan)
528,331In Table3, p
1 and p
2 represent the price of each product in the first and the second subperiod, respectively. λ
1 and λ
2 are the relevant demand density at new price in these two subperiods. From the solution we can see that, for a certain product, the price in the first subperiod is lower than that in the second subperiod, which just accords with the core idea of revenue management that to provide proper price for proper customer. Compared with the original pricing strategy, our floating pricing strategy can increase the revenue of the train by 0.76%, which is ¥3994. Right now there are 284 trains operated on Beijing-Shanghai High-Speed Railway per day. The total revenue will have a huge increase of about one million yuan even if each train’s revenue just increases by ¥3994. Our example also exhibits the demand densities of all the three products in subperiod 1 increase, and those in the subperiod 2 decrease compared with the demand densities under reference price, which proves our floating price strategy also plays a part in regulating demand.


## 3.1. Passenger Arrival Regularity

Passenger arrival regularity is the basis of segmenting the ticket-selling period. We apply the ticket-sale data in 2012 (the data of December is not included for the lack of data in this month) as the sample to analyze these two trains’ passenger arrival regularity by product and show the statistical results in Figure1, of which each point represents the percentage of tickets sold in that day to the total amount of tickets sold in the entire period for the product.Figure 1
Passenger arrival regularity for G1 and G3 by product.In the figure, Day 1 is the first day of ticket-sale period, and Day 10 is the departure day. From Figure1 we can see the passenger arrival regularity of Beijing-Nanjing product and that of Beijing-Shanghai product are similar to each other: from Day 1 to Day 8 the percentage of tickets sold per day stays low (15% at most) and increases gradually; in Day 9 the percentage abruptly increases, and the ticket-sale rate per unit time peaks in Day 10 (dividing the amount of tickets sold in Day 10 by the actual selling time). The passenger arrival regularity of Nanjing-Shanghai product is special: in the first 9 days, the daily ticket-sale percent is very low and the climbing speed is low too; in Day 10 the percent is the biggest and much bigger than those of the first 9 days. From the above statistical results, we can conclude that passenger arrival regularity is affected by the following factors.(1) Travel Distance. The longer the travel distance is, the earlier passengers tend to purchase tickets. Usually for the short-distance travel, such as from Nanjing to Shanghai, passengers are inclined to purchase tickets just on the day of departure. As is shown in Figure 1, the percentage of passengers purchasing tickets in the earlier stage is the highest for Beijing-Shanghai product and lowest for Nanjing-Shanghai product.To support this viewpoint, we did a data statistics using the historical ticket data for the Beijing-Shanghai High-Speed Railway during the period March 1, 2013, to March 13, 2014. For a certain trainw, let d
s
w
,
k denote hourly demand density of its OD pair k on day s. The total booking horizon is S days; then the ratio of demand density on day s is y
s
w
,
k
=
d
s
w
,
k
/
∑
s
=
1
S
d
s
w
,
k
×
100
%. Averaging the value y
s
w
,
k of all the trains yields the daily demand density ratio of OD pair k on day s, which is denoted as y
s
k. Figure 2 shows the relationship between daily demand density ratio and the length of the OD arc. The correlation between these is positive before day 18, not significant on day 19, and negative on the departure day.Figure 2
Correlation between demand density ratio and length of OD.From the figure, it appears that the daily demand density ratio (y%) and the length of OD pair (1000x) have a linear relationship. A linear regression equation was developed to test this hypothesis, which is y
^
=
a
^
+
b
^
x. Table 1 shows the regression analysis results, with the confidence coefficient 95%.Table 1
Regression analysis results.
Day 1
Day 2
Day 3
Day 4
Day 5
Day 6
Day 7
a
0.0104
−0.0301
−0.1274
−0.0980
−0.0631
0.0156
0.0304
b
4.8397
0.8391
1.1323
0.9584
0.8424
1.0130
0.5160
R square
0.5645
0.8033
0.7561
0.7957
0.8152
0.6057
0.5474
AdjustedR
0.5373
0.7910
0.7408
0.7829
0.8036
0.5811
0.5191
P value
0.0003
0.0044
0.0069
0.0060
0.0027
0.0001
0.0004
Day 8
Day 9
Day 10
Day 11
Day 12
Day 13
Day 14
a
0.0297
0.0140
0.0346
0.1787
0.0630
0.1806
0.2385
b
0.8806
1.0221
1.1746
1.1391
1.4461
2.0868
1.8605
R square
0.7947
0.8240
0.7948
0.7938
0.8120
0.7486
0.9067
AdjustedR
0.7819
0.8130
0.7820
0.7810
0.8002
0.7329
0.9009
P value
0.0062
0.0018
0.0062
0.0065
0.0031
0.0088
0.0001
Day 15
Day 16
Day 17
Day 18
Day 19
Day 20
a
0.4403
0.8665
1.4321
3.0828
13.2832
80.4182
b
2.7153
3.2379
4.7170
6.9677
8.4014
−45.7899
R square
0.8598
0.8280
0.8392
0.8115
0.5056
0.8178
AdjustedR
0.8511
0.8172
0.8291
0.7998
0.4747
0.8064
P value
0.0011
0.0015
0.0032
0.0031
0.0009
0.0024The regression analysis results are revealing. TheP value is less than 0.05 for all days. The R-Square value is greater than 0.7 on days except for 1, 6, 7, and 19. Thus, there is a weaker linear relation between demand density ratio and OD length for these four days, though a fairly strong linear relation for the other days. The results also reveal some passenger arrival trends. Not considering other factors, passengers with long-distance journeys tend to purchase tickets early in the booking horizon, whereas short-distance journey passengers purchase tickets later. The slope of x on the departure day is much greater than for other days, illustrating that the shorter the journey is, the more passengers are willing to purchase tickets just before departure.(2) The Amount of Alternative Products. The other factor influencing passenger behavior is the number of trains that serve the same OD. We term these services alternative products. The more the alternative products exist, the later passengers purchase tickets. This conjecture can be realistic because if there are enough alternative products, passengers do not have to buy tickets in advance for the sake of tickets being not enough, and instead they will purchase tickets after everything of the travel is settled down.To examine this, we selected two similar length pairs of ODs and used their ticket data to analyze the relationship between demand density ratio and amount of alternative products. Figure3 compares the demand density ratio curves for itineraries of these two OD pairs. The booking horizon of the ticket data we used in this examination is 20 days. Since the curves for days 1 to 9 are basically the same, the figure shows only the curves from days 10 to 20. Figure 3(a) represents the Nanjing South-Shanghai Hongqiao itinerary, where the length is 295 km and there are 44 alternative products, and the Tianjin West-Jinan West itinerary (301 km and 4 alternate products). Figure 3(b) reflects the Jinan West-Shanghai Hongqiao (912 km and 42 alternate products) and Tianjin West-Nanjing South (918 km and 4 alternate products) itineraries.Figure 3
Relationship between demand density ratio and amount of alternative products.
(a)
(b)In both Figures3(a) and 3(b), before day 19 the curve of the OD with more alternative products lies above that of the OD with fewer products. On day 20, the reverse is true. We conclude that, for ODs with similar length, passengers purchase tickets earlier when there are fewer alternative products.(3) The Purpose of the Trip. We can see from the statistical result of “Beijing-Shanghai High-Speed Railway demand questionnaire” (carried out by Beijing-Shanghai High-Speed Railway Company in 2012) that business travelers usually purchase tickets 1-2 days ahead of departure day, while the passengers traveling for tour, visiting friends, and migrant work tend to purchase tickets more than 3 days in advance. Thus it is convincing to assume that customers who are more price-sensitive arrive earlier and the less price-sensitive customers arrive later, which has already been commonly adopted by airline revenue management.(4) The Train Departure Time. From Figure 1 we can see that in the earlier stage of ticket-sale period G1 curve is above G3 curve most of the time and only in the last day G1 curve is below G3 curve, which means that G1 passengers tend to purchase tickets earlier than G3 passengers. From this comparison we cannot arbitrarily make the conclusion that the earlier the departure time is, the earlier passengers purchase tickets. But the departure time of the train indeed has some influence on passenger behavior, which still needs more intensive study.


## 3.2. The Segmentation of Ticket-Sale Period

The passenger arrival regularity varies from train to train, even from section to section for a certain train, for the passenger behavior is influenced a lot by the train operation properties such as departure time and travel time. Therefore, the segmentation of ticket-sale period should be treated differently by each train and by each section for a given train.The experience of Britain and France railway shows that too many price classes may cause the revenue management lose efficacy [17–19]. Thus in accordance with the statistical passenger arrival regularity, we plan to set two price classes for each product and divide the ticket-sale period into two subperiods; that is, for the product of Beijing-Nanjing and Beijing-Shanghai transportation service from the first day to 8th day is number 1 subperiod and from 9th day to 10th day is number 2 subperiod; as regards Nanjing-Shanghai product, the first day to 9th day belong to number 1 subperiod, and 10th day itself is number 2 subperiod.


## 3.3. The Analysis of Computation Result

We take G3 train as an example here to examine our ticket fare optimization method. According to the modeling approach discussed in Section2.1, G3 train can be described as a network shown in Figure 4.Figure 4
The network of G3 train.For the network in Figure2, a relation matrix of resource and product is created: (7)
a
m
n
=
a
11
a
12
a
13
a
21
a
22
a
23
=
1
1
0
0
1
1
.The vehicle model of G3 train is CRH380BL, of which the personnel quota is 1005. Thus, the resource capacity in our model isx
1
=
x
2
=
1005. As to the preallocation plan, we do not take standing-room ticket and overbooking into consideration. The product capacity in this case is set fixed; that is, y
1
=
y
3
=
405, y
2
=
600. The ticket-sale period of G3 train is divided as discussed in Section 3.2. However, the 10th day is departure day, for which the actual ticket-sale time is not a whole day. The durations of each product in each subperiod for calculation in the case are shown in Table 1. As discussed above, the passengers arriving in the first subperiod are more price-sensitive than passengers arriving in the second subperiod. Thus we set the value of ϵ
0 higher for the first subperiod and lower for the second, which can also be seen in Table 2.Table 2
Reference price strategy and the revenue.
Product
Price (yuan)
Price elasticity of demand
⁢Demand density
⁢Duration (day)
p
0
ϵ
0
1
ϵ
0
2
λ
0
1
λ
0
2
l
1
l
2
Beijing-Nanjing
443.5
1.3
1.1
24
113
8
1.583
Beijing-Shanghai
553
1.3
1.1
45
148
8
1.583
Nanjing-Shanghai
134.5
1.3
1.1
7
290
9
0.583
Passenger traffic
1197
Revenue (yuan)
524,337A common demand function of a product can describe the quantitative relation between product demand and its impact factors, for example, product attributes (such as price) or marketing variables (such as advertising, brand name, and competitor’s prices). From the consideration of research emphasis, we just focus on how the demand changes with product price without considering other impact factors. The Log-linear demand function is adopted in our study, which is popular in econometric studies and has several desirable theoretical and practical properties [20]. For example, the demand is always nonnegative so we can treat price unconstrained in the model. Besides that, the Log-linear function can be translated into a linear form by taking the log of the function; thus it can be estimated using linear regression. The demand-price function we use is as below:(8)
λ
p
=
λ
0
e
-
ϵ
0
p
/
p
0
-
1
.In function (8), p
0 is interpreted as a reference price, λ
0 is the demand rate (the number of tickets sold per day) at the reference price, and ϵ
0 is the absolute value of price elasticity of demand at the reference price. The negative sign in front of ϵ
0 means the demand and price are antidependent. This Log-linear demand function has a unique inverse, which is the price function:(9)
p
λ
=
ϵ
0
-
1
ln
⁡
λ
0
λ
+
1
p
0
.Matlab R2014a is applied for implementing our algorithm. The calculation results including resulting prices, demand densities, and the revenue to be gained using this price strategy are shown in Table3.Table 3
Calculation results for the case.
Product
Price (yuan)
⁢Demand density
p
1
p
2
λ
1
λ
2
Beijing-Nanjing
390.9
447.1
28
112
Beijing-Shanghai
525.5
599.2
48
135
Nanjing-Shanghai
108.5
122.5
9
320
Passenger traffic
1267
Revenue (yuan)
528,331In Table3, p
1 and p
2 represent the price of each product in the first and the second subperiod, respectively. λ
1 and λ
2 are the relevant demand density at new price in these two subperiods. From the solution we can see that, for a certain product, the price in the first subperiod is lower than that in the second subperiod, which just accords with the core idea of revenue management that to provide proper price for proper customer. Compared with the original pricing strategy, our floating pricing strategy can increase the revenue of the train by 0.76%, which is ¥3994. Right now there are 284 trains operated on Beijing-Shanghai High-Speed Railway per day. The total revenue will have a huge increase of about one million yuan even if each train’s revenue just increases by ¥3994. Our example also exhibits the demand densities of all the three products in subperiod 1 increase, and those in the subperiod 2 decrease compared with the demand densities under reference price, which proves our floating price strategy also plays a part in regulating demand.


## 4. Conclusion

We have shown how to optimize ticket fare for single high-speed train. Compared with the trial of Beijing-Shanghai High-Speed Railway Company, our proposal price strategy sets prices separately by OD and time period. An optimization model and corresponding algorithm were designed to solve the multiple fare issue. The difference between our model and other relevant ones is that it takes product capacity constraint into consideration. In the end, an experimental study is carried out to verify the method proposed previously. We take the ticket-sale data of G3 train in 2012 as an example. The case results show that our pricing strategy can not only increase the train revenue but also regulate the existing demand and stimulate the potential demand.There are certainly many possible directions for future research in this area. We will next expand our study to multiple trains, considering the passengers’ choice behavior among these train services. Another research direction is to dynamically determine when to open each fare grade based on the available seats left and time left.



---

*Source: 5073053-2016-08-23.xml*