The Optimizing of the Passenger Throughput at an Airport Security Checkpoint

In order to increase checkpoint throughput and reduce variance in waiting time, the current security process of an airport in the United States has been taken as an example. Depending on the survey data, we use the queuing model to review airport security checkpoints and staffing and to identify potential bottlenecks which disrupt passenger throughput. And the method of improving the traffic volume and reducing the waiting time is deduced by the mathematical formula. The influence of the cultural difference of the passenger security process is analyzed by sensitivity. Based on the security optimization model, the security system is put forward to a certain extent to adapt to different cultural differences. The model takes into account the impact of parameter changes on the airport security process.

1. Introduction

In recent years, the number of air travelers is in explosive growth  , and airport security checkpoints are critical component in protecting airports and passengers from terrorist threats. But there is a tension between desires to maximize security while minimizing inconvenience to passengers, and the U.S. Transportation Security Agency (TSA) has come under sharp criticism for extremely long lines. Passengers have become more dissatisfied with the security screening process about the longer time they wait to be screened  . And it is unclear that short waiting times also make unexplained and unpredicted long lines at other airports      .

1.1. The Questions We Face

In order to alleviate the tension between airport security checkpoints and passengers, we developed several models to figure out the possible bottlenecks of airport security check process based on the current US security process, which is shown in Figure 1  .

1.2. Our Approach

In order to determine the possible bottlenecks of scattered traffic flow from the review of the airport security check point and staff, we need to divide security checkpoint into three small queuing systems according to the A, B, C area based on the US security process which is shown in Figure 1, and analyze the bottleneck of airport security inspection by using the queuing theory based on the data for passengers through security process in the table  .

First, we analyze the current security process of the zone A where passengers arrived at the security gate and waited in line to check their identity cards and registration documents.

The Zone A (Document Check) has two types of entries: one is Pre-Check Entrance and the other is Regular-Check Entrance.

1.3. Theoretical Knowledge

Assuming that the airport security system is in accord with the standard queuing theory model M/M/c/∞/∞, the operating parameters of the queuing system are as follows:

The probability of the system that is idle:

${P}_{0}={\left[\underset{k=0}{\overset{c-1}{\sum }}\frac{1}{k!}{\left(\frac{\lambda }{\mu }\right)}^{k}+\frac{1}{c!}\cdot \frac{1}{1-\rho }\cdot {\left(\frac{\lambda }{\mu }\right)}^{c}\right]}^{-1}$ (1-1)

Figure 1. Illustration of the TSA Security Screening Process.

Average queue length:

${L}_{q}=\frac{{\left(c\rho \right)}^{c}\rho }{c!{\left(1-\rho \right)}^{2}}{P}_{0}$ (1-2)

The number of customer in the queuing system:

${L}_{s}={L}_{q}+\frac{\lambda }{\mu }$ (1-3)

Average waiting time:

${W}_{q}=\frac{{L}_{q}}{\lambda }$ (1-4)

Average time the passenger spent in the queuing system:

${W}_{s}=\frac{{L}_{s}}{\lambda }$ (1-5)

Assuming $c$ is the number of security channel at airport, $\beta$ is the ratio of Pre-Check and Regular-Check channels, the number of Pre-Check Entrance is:

${C}_{1}=\frac{\beta }{1+\beta }c$ (1-6)

The number of Regular-Check Entrance is:

${C}_{2}=\frac{1}{1+\beta }c$ (1-7)

・ For Zone A: Pre-Check Entrance

According to the equation in the standard queuing model M/M/c/∞/∞, the corresponding indexes of the Pre-check Entrance queuing system in Zone A are derived as follows:

The Probability of Pre-Check Entrance system being in idle state in Zone A:

${P}_{0}={\left[\underset{k=0}{\overset{\frac{c}{1+\beta }-1}{\sum }}\frac{1}{k!}{\left(\frac{\lambda }{\mu }\right)}^{k}+\left(\frac{1+\beta }{c}\right)!\text{\hspace{0.17em}}\cdot \frac{1}{1-\rho }\cdot {\left(\frac{\lambda }{\mu }\right)}^{\frac{c}{1+\beta }}\right]}^{-1}$ (1-8)

Average queue length in Pre-Check Entrance service system:

${L}_{q}=\frac{{\left(\frac{c\rho }{1+\beta }\right)}^{\frac{c}{1+\beta }}\cdot \rho }{\left(\frac{c}{1+\beta }\right)!{\left(1-\rho \right)}^{2}}{P}_{0}=\frac{{\left(\frac{c\rho }{1+\beta }\right)}^{\frac{c}{1+\beta }}\cdot \rho }{\left(\frac{c}{1+\beta }\right)!{\left(1-\rho \right)}^{2}}\cdot {\left[\underset{k=0}{\overset{\frac{c}{1+\beta }-1}{\sum }}\frac{1}{k!}{\left(\frac{\lambda }{\mu }\right)}^{k}+\left(\frac{1+\beta }{c}\right)!\text{\hspace{0.17em}}\cdot \frac{1}{1-\rho }\cdot {\left(\frac{\lambda }{\mu }\right)}^{\frac{c}{1+\beta }}\right]}^{-1}$ (1-9)

The number of customers in Pre-Check Entrance service system:

$\begin{array}{l}{L}_{s}={L}_{q}+\frac{\lambda }{\mu }=\frac{{\left(\frac{c\rho }{1+\beta }\right)}^{\frac{c}{1+\beta }}\cdot \rho }{\left(\frac{c}{1+\beta }\right)!{\left(1-\rho \right)}^{2}}\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\cdot {\left[\underset{k=0}{\overset{\frac{c}{1+\beta }-1}{\sum }}\frac{1}{k!}{\left(\frac{\lambda }{\mu }\right)}^{k}+\left(\frac{1+\beta }{c}\right)!\text{\hspace{0.17em}}\cdot \frac{1}{1-\rho }\cdot {\left(\frac{\lambda }{\mu }\right)}^{\frac{c}{1+\beta }}\right]}^{-1}+\frac{\lambda }{\mu }\end{array}$ (1-10)

Average waiting time in Pre-Check Entrance service system is:

$\begin{array}{l}{W}_{q}=\frac{{L}_{q}}{\lambda }=\frac{{\left(\frac{c\rho }{1+\beta }\right)}^{\frac{c}{1+\beta }}\cdot \rho }{\left(\frac{c}{1+\beta }\right)!{\left(1-\rho \right)}^{2}\lambda }\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\cdot {\left[\underset{k=0}{\overset{\frac{c}{1+\beta }-1}{\sum }}\frac{1}{k!}{\left(\frac{\lambda }{\mu }\right)}^{k}+\left(\frac{1+\beta }{c}\right)!\text{\hspace{0.17em}}\cdot \frac{1}{1-\rho }\cdot {\left(\frac{\lambda }{\mu }\right)}^{\frac{c}{1+\beta }}\right]}^{-1}\end{array}$ (1-11)

Average time spent in the Pre-Check Entrance queuing system:

$\begin{array}{l}{W}_{s}=\frac{{L}_{s}}{\lambda }=\frac{{\left(\frac{c\rho }{1+\beta }\right)}^{\frac{c}{1+\beta }}\cdot \rho }{\left(\frac{c}{1+\beta }\right)!{\left(1-\rho \right)}^{2}\lambda }\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\cdot {\left[\underset{k=0}{\overset{\frac{c}{1+\beta }-1}{\sum }}\frac{1}{k!}{\left(\frac{\lambda }{\mu }\right)}^{k}+\left(\frac{1+\beta }{c}\right)!\text{\hspace{0.17em}}\cdot \frac{1}{1-\rho }\cdot {\left(\frac{\lambda }{\mu }\right)}^{\frac{c}{1+\beta }}\right]}^{-1}+\frac{1}{\mu }\end{array}$ (1-12)

The same indicators of Regular-Check Entrance service system can be obtained in Zone A.

According to the equation in the standard queuing model M/M/c/∞/∞, the corresponding indexes of the Regular-Check Entrance queuing system in Zone A are derived as follows:

The Probability of Regular-Check Entrance system being in idle state in Zone A is:

${P}_{0}={\left[\underset{k=0}{\overset{\frac{\beta c}{1+\beta }-1}{\sum }}\frac{1}{k!}{\left(\frac{\lambda }{\mu }\right)}^{k}+\left(\frac{1+\beta }{c\beta }\right)!\text{\hspace{0.17em}}\cdot \frac{1}{1-\rho }\cdot {\left(\frac{\lambda }{\mu }\right)}^{\frac{c\beta }{1+\beta }}\right]}^{-1}$ (1-13)

Average queue length in Pre-Check Entrance service system is:

$\begin{array}{l}{L}_{q}=\frac{{\left(\frac{c\rho \beta }{1+\beta }\right)}^{\frac{c\beta }{1+\beta }}\cdot \rho }{\left(\frac{c\beta }{1+\beta }\right)!{\left(1-\rho \right)}^{2}}{P}_{0}=\frac{{\left(\frac{c\rho \beta }{1+\beta }\right)}^{\frac{c\beta }{1+\beta }}\cdot \rho }{\left(\frac{c\beta }{1+\beta }\right)!{\left(1-\rho \right)}^{2}}\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\cdot {\left[\underset{k=0}{\overset{\frac{c\beta }{1+\beta }-1}{\sum }}\frac{1}{k!}{\left(\frac{\lambda }{\mu }\right)}^{k}+\left(\frac{1+\beta }{c\beta }\right)!\text{\hspace{0.17em}}\cdot \frac{1}{1-\rho }\cdot {\left(\frac{\lambda }{\mu }\right)}^{\frac{c\beta }{1+\beta }}\right]}^{-1}\end{array}$ (1-14)

The number of customers in Pre-Check Entrance service system:

${L}_{s}={L}_{q}+\frac{\lambda }{\mu }=\frac{{\left(\frac{c\rho \beta }{1+\beta }\right)}^{\frac{c\beta }{1+\beta }}\cdot \rho }{\left(\frac{c\beta }{1+\beta }\right)!{\left(1-\rho \right)}^{2}}\cdot {\left[\underset{k=0}{\overset{\frac{c\beta }{1+\beta }-1}{\sum }}\frac{1}{k!}{\left(\frac{\lambda }{\mu }\right)}^{k}+\left(\frac{1+\beta }{c\beta }\right)!\text{\hspace{0.17em}}\cdot \frac{1}{1-\rho }\cdot {\left(\frac{\lambda }{\mu }\right)}^{\frac{c\beta }{1+\beta }}\right]}^{-1}+\frac{\lambda }{\mu }$ (1-15)

Average waiting time in Pre-Check Entrance service system is:

$\begin{array}{l}{W}_{q}=\frac{{L}_{q}}{\lambda }=\frac{{\left(\frac{c\rho \beta }{1+\beta }\right)}^{\frac{c\beta }{1+\beta }}\cdot \rho }{\left(\frac{c\beta }{1+\beta }\right)!{\left(1-\rho \right)}^{2}\lambda }\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\cdot {\left[\underset{k=0}{\overset{\frac{c\beta }{1+\beta }-1}{\sum }}\frac{1}{k!}{\left(\frac{\lambda }{\mu }\right)}^{k}+\left(\frac{1+\beta }{c\beta }\right)!\text{\hspace{0.17em}}\cdot \frac{1}{1-\rho }\cdot {\left(\frac{\lambda }{\mu }\right)}^{\frac{c\beta }{1+\beta }}\right]}^{-1}\end{array}$ (1-16)

Average time the passenger spent in the Pre-Check Entrance queuing system:

$\begin{array}{l}{W}_{s}=\frac{{L}_{s}}{\lambda }=\frac{{\left(\frac{c\rho \beta }{1+\beta }\right)}^{\frac{c\beta }{1+\beta }}\cdot \rho }{\left(\frac{c\beta }{1+\beta }\right)!{\left(1-\rho \right)}^{2}\lambda }\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\cdot {\left[\underset{k=0}{\overset{\frac{c\beta }{1+\beta }-1}{\sum }}\frac{1}{k!}{\left(\frac{\lambda }{\mu }\right)}^{k}+\left(\frac{1+\beta }{c\beta }\right)!\text{\hspace{0.17em}}\cdot \frac{1}{1-\rho }\cdot {\left(\frac{\lambda }{\mu }\right)}^{\frac{c\beta }{1+\beta }}\right]}^{-1}+\frac{1}{\mu }\end{array}$ (1-17)

System service strength $\rho$ :

$\rho =\frac{\lambda }{c\mu }$ (1-18)

Substituting Equation (1-18) into Equation (1-19):

$\begin{array}{l}{W}_{s}=\frac{{L}_{s}}{\lambda }=\frac{{\left(\frac{\lambda \beta }{\left(1+\beta \right)\mu }\right)}^{\frac{c\beta }{1+\beta }}\cdot c\mu }{\left(\frac{c\beta }{1+\beta }\right)!{\left(c\mu -\lambda \right)}^{2}}\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\cdot {\left[\underset{k=0}{\overset{\frac{c\beta }{1+\beta }-1}{\sum }}\frac{1}{k!}{\left(\frac{\lambda }{\mu }\right)}^{k}+\left(\frac{1+\beta }{c\beta }\right)!\text{\hspace{0.17em}}\cdot \frac{c\mu }{c\mu -\lambda }\cdot {\left(\frac{\lambda }{\mu }\right)}^{\frac{c\beta }{1+\beta }}\right]}^{-1}+\frac{1}{\mu }\end{array}$ (1-19)

The variables in Equation (1-19) are $c$ , $\mu$ and $\beta$ , $\lambda$ is a constant.

1.4. Parameters Calculation

Analyzing the relative information of Pre-Check Entrance in Zone A:

a) Nearly 45% of passengers register for a project called a pre-screening for a reliable passenger  .

b) These passengers need to pay $85 for background checks and are eligible for a five-year separate inspection process; Pre-Check passengers and their baggage pass the same inspection process with Regular-Check which just make some improvements in the speed of the design compared to the Regular-Check process. c) Pre-Check passengers need to remove electronic and medical equipment and fluids for inspection without removing shoes, belts, thin jackets, or removing the computer from the bag. Set ${\lambda }_{A1}$ as the average arrival rate of Pre-Check customers, ${\mu }_{A1}$ as the average service rate of the customer, ${\rho }_{A1}$ as the service intensity; ${\lambda }_{A2}$ as the average arrival rate of Pre-Check customers, ${\mu }_{A2}$ as the average service rate of the customer, ${\rho }_{A2}$ as the service intensity; ・ For Pre-Check Entrance: The average arrival time of the customer: (second/person) $523.80/57=9.19\text{\hspace{0.17em}}\text{s}/\text{p}$ (1-20) Average customer arrival rate: (person/hour) ${\lambda }_{A1}=57/523.80=0.11\text{\hspace{0.17em}}\text{p}/\text{s}=396\text{\hspace{0.17em}}\text{p}/\text{h}$ (1-21) Average customer service times: $97/9=10.78\text{\hspace{0.17em}}\text{s}/\text{p}$ (1-22) Average customer service rate: ${\mu }_{A1}=9/97=0.09\text{\hspace{0.17em}}\text{p}/\text{s}=324\text{\hspace{0.17em}}\text{p}/\text{h}$ (1-23) ・ For Regular-Check Entrance: The average time of arrival of the customer: $596.10/46=12.96\text{\hspace{0.17em}}\text{s}/\text{p}$ (1-24) The average customer arrival rate: ${\lambda }_{A2}=47/596.10=0.08\text{\hspace{0.17em}}\text{p}/\text{s}=288\text{\hspace{0.17em}}\text{p}/\text{h}$ (1-25) Average customer service times: $99.5/7=14.21\text{\hspace{0.17em}}\text{s}/\text{p}$ (1-26) Average customer service rate: ${\mu }_{A2}=7/99.5=0.07\text{\hspace{0.17em}}\text{p}/\text{s}=252\text{\hspace{0.17em}}\text{p}/\text{h}$ (1-27) Assumed that the arrival time interval of Pre-Check customers obeys Poisson distribution, which can be obtained C1 = 1, C2 = 3 from Figure 1: Illustration of the TSA Security Screening Process. According to the M/M/C model, we can see that the Pre-Check queuing system in accord with the standard M/M/1 model: ${\rho }_{A1}=\frac{{\lambda }_{A1}}{{C}_{1}{\mu }_{A1}}=\frac{396}{324}=1.22>1$ (1-28) Pre-Check Entrance queue will be discharged to infinite, Pre-Check personnel in TSA will be 100% busy. Similarly, according to the M/M/C model, we can see that the regular-check queuing system accord with the standard M/M/c model: ${\rho }_{A2}=\frac{{\lambda }_{A2}}{{C}_{2}{\mu }_{A2}}=\frac{288}{3×252}=0.38<1$ (1-29) And the probability that the TSA personnel in Regular-Check in idle state can be obtained by Equation (1-11): ${P}_{0}={\left[\underset{k=0}{\overset{c-1}{\sum }}\frac{1}{k!}{\left(\frac{\lambda }{\mu }\right)}^{k}+\frac{1}{c!}\cdot \frac{1}{1-{\rho }_{A2}}\cdot {\left(\frac{\lambda }{\mu }\right)}^{c}\right]}^{-1}$ (1-30) So ${P}_{0}=0.31$ , that is Regular-Check in the TSA staff will be 69% of the time in the busy state, 31% of the time in the idle state. The operation indexes of regular-check system are as follows: Average queue length: ${L}_{q}=\frac{{\left(c{\rho }_{A2}\right)}^{c}{\rho }_{A2}}{c!{\left(1-{\rho }_{A2}\right)}^{2}}{P}_{0}=\frac{{\left(3×0.38\right)}^{3}×0.38}{3!{\left(1-0.38\right)}^{2}}×0.31=0.08\text{\hspace{0.17em}}\text{Person}$ (1-31) Average Captain: ${L}_{s}={L}_{q}+\frac{\lambda }{\mu }=1.22\text{\hspace{0.17em}}\text{Person}$ (1-32) Average waiting time: ${W}_{q}=\frac{{L}_{q}}{\lambda }=\frac{0.08}{0.08}=1\text{\hspace{0.17em}}\text{Second}$ (1-33) Average length of stay: ${W}_{s}=\frac{{L}_{s}}{\lambda }=\frac{1.22}{0.08}=15.25\text{\hspace{0.17em}}\text{Second}$ (1-34) ・ In Zone B: Baggage and Body Screening queuing system Set ${\lambda }_{B}$ as the average arrival rate of Pre-Check customers, ${\mu }_{B}$ as the average service rate of the customer, ${\rho }_{B}$ as the service intensity; Take the average customer arrival rate of customers into the security system as the average customer arrival rate of Zone B, which can be got by sum the average customer arrival rate of Pre-Check Entrance and the average customer arrival rate of Regular-Check Entrance；Since baggage check and body check are carried out simultaneously in Zone B, it is necessary to use the maximum value between these two time as the customer service time of B queuing system. Because the time of baggage check is longer than body check, the mean of the time to get scanned property in Zone B is approximated as the average service rate of the B queuing system ${\mu }_{B}$ . The average arrival rate of customers in Pre-Check Entrance ${\lambda }_{A1}$ and the average arrival rate of customers in Regular-Check Entrance ${\lambda }_{A2}$ can be used to obtain the average customer arrival rate of Zone B: ${\lambda }_{B}={\lambda }_{A1}+{\lambda }_{A2}=676\text{\hspace{0.17em}}\text{p}/\text{h}$ (1-35) among them ${\lambda }_{A1}=396\text{\hspace{0.17em}}\text{p}/\text{h},\text{\hspace{0.17em}}{\lambda }_{A2}=280\text{\hspace{0.17em}}\text{p}/\text{h}$ (1-36) This can be calculated customer Baggage-Check in Zone B Average service time: $830/29=28.62\text{\hspace{0.17em}}\text{s}/\text{p}$ (1-37) Average service rate: ${\mu }_{B}=29/830=0.03\text{\hspace{0.17em}}\text{p}/\text{s}=108\text{\hspace{0.17em}}\text{p}/\text{h}$ (1-38) Assumed Zone B: Baggage and Body Screening time accord with Poisson distribution, the number of devices can be seen from Figure 1 $c=4$ . According to the M/M/C model, we can see that the queuing system in Zone B accord with the standard M/M/4 model: ${\rho }_{B}=\frac{{\lambda }_{B}}{c{\mu }_{B}}=\frac{880}{4×108}=2.04>1$ (1-39) Pre-Check Entrance queue will be discharged to infinite, Pre-Check personnel in TSA will be 100% of the time in busy state. 1.5. Conclusion 1) In actual life, the proportion of Pre-Check Entrance and Regular-Check Entrance is smaller, so the number of Pre-Check Entrance cannot meet the needs of customers, which leads to the phenomenon of infinite queuing; 2) Under the assumption that the A Zone queuing system meets the standards of the M/M/c queuing model, the service personnel working strength calculation shows that security personnel of SAT Pre-Check queuing system will have been busy. According to queuing theory model (1 - 9) can be seen that the average arrival rate of customers and the average service rate are fixed. In order to reduce service strength can only through changing the number of C, that is, increasing the number of security personnel can solve the bottlenecks of the service system. 3) In the Zone B, from the Equation (1-39) can be seen, to solve the problem of infinite queue need to increase the value of $c$ and ${\mu }_{B}$ , that is, it need to increase the number of devices or reduce the average service time of the package inspection. 2. Methods to Improve Passenger Throughput and Reduce Variance in Wait Time 2.1. The Questions We Face Two or more potential modifications to the current process must be built to improve passenger throughput and reduce variance in wait time. And the model must reflect the influence of the change of parameters on the airport security check process. 2.2. Our Approach a) The method to increase passenger throughput in the security check service system is equal to reduce the time of customer stay in the system or increase the number $c$ of security channels, analyze the relationship between ${W}_{s}$ and other variables; b) The method to reduce variance in wait time is equal to reduce the average time of customer stay in the Pre-Check Entrance service system and Regular- Check Entrance service system in Zone A, and reduce the average time of Baggage Screening and Body Screening in Zone B. 2.3. Solving Process 1) Analysis of the relationship between ${W}_{s}$ and the variable $c$ For the analysis of the change regularity of ${W}_{s}$ with variable $c$ , we take $\beta$ , $\mu$ as constant. By the Little equation, analysis of the change regularity of ${W}_{s}$ with variable $c$ is equivalent to the analysis of the changing rules of ${L}_{s}$ in Equation (1-3) with the variable $c$ . Firstly, analysis variation of ${P}_{0}$ with variable $c$ , the specific analysis process is as follows: Let ${P}^{\prime }\left(c\right)={\left[{P}_{0}\left(c\right)\right]}^{-1}=\underset{k=0}{\overset{c-1}{\sum }}\frac{1}{k!}{\left(\frac{\lambda }{\mu }\right)}^{k}+\frac{1}{c!}\cdot \frac{1}{1-\rho }\cdot {\left(\frac{\lambda }{\mu }\right)}^{c}$ (2-1) Then, $\begin{array}{c}{P}^{\prime }\left(c+1\right)-{P}^{\prime }\left(c\right)=\underset{k=0}{\overset{c}{\sum }}\frac{1}{k!}{\left(\frac{\lambda }{\mu }\right)}^{k}+\frac{1}{\left(c+1\right)!}\cdot \frac{1}{1-\rho }\cdot {\left(\frac{\lambda }{\mu }\right)}^{c+1}\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}-\underset{k=0}{\overset{c-1}{\sum }}\frac{1}{k!}{\left(\frac{\lambda }{\mu }\right)}^{k}+\frac{1}{c!}\cdot \frac{1}{1-\rho }\cdot {\left(\frac{\lambda }{\mu }\right)}^{c}\\ =\frac{1}{c!}{\left(\frac{\lambda }{\mu }\right)}^{c}+\frac{1}{1-\rho }\cdot {\left(\frac{\lambda }{\mu }\right)}^{c}\left[\frac{1}{\left(c+1\right)!}\frac{\lambda }{\mu }-\frac{1}{c!}\right]\\ =\frac{1}{c!}{\left(\frac{\lambda }{\mu }\right)}^{c}+\frac{1}{1-\rho }\cdot {\left(\frac{\lambda }{\mu }\right)}^{c}\cdot \frac{1}{c!}\cdot \left(\frac{\lambda }{c\mu }-1\right)\\ =\frac{1}{c!}{\left(\frac{\lambda }{\mu }\right)}^{c}\left[1+\frac{1}{1-\rho }\left(\frac{\lambda }{c\mu }-1\right)\right]\\ =0\end{array}$ (2-2) That is, ${P}^{\prime }\left(c+1\right)={P}^{\prime }\left(c\right)$ (2-3) Therefore, it can be seen that the value of ${P}_{0}$ has nothing to do with $c$ . Secondly, let $Q\left(c\right)=\frac{{\left(c\rho \right)}^{c}\rho }{c!{\left(1-\rho \right)}^{2}}=\frac{{\left(\frac{\lambda }{\mu }\right)}^{c}}{c!{\left(1-\frac{\lambda }{c\mu }\right)}^{2}}$ (2-4) Then, $Q\left(c+1\right)=\frac{{\left(\frac{\lambda }{\mu }\right)}^{c+1}}{\left(c+1\right)!{\left(1-\frac{\lambda }{\left(c+1\right)\mu }\right)}^{2}}$ (2-5) Then, $\frac{Q\left(c\right)}{Q\left(c+1\right)}=\frac{\frac{{\left(\frac{\lambda }{\mu }\right)}^{c}}{c!{\left(1-\frac{\lambda }{c\mu }\right)}^{2}}}{\frac{{\left(\frac{\lambda }{\mu }\right)}^{c+1}}{\left(c+1\right)!{\left(1-\frac{\lambda }{\left(c+1\right)\mu }\right)}^{2}}}=\frac{\mu }{\lambda }\cdot \frac{{c}^{2}}{c+1}\cdot {\left[\frac{\left(c+1\right)\mu -\lambda }{c\mu -\lambda }\right]}^{2}$ (2-6) ・ Discussion and analysis a) when $c=1$ , the average arrival rate of customers in Pre-Check Entrance is: ${\lambda }_{A1}=0.11\text{\hspace{0.17em}}\text{p}/\text{s}$ (one person per second, p/s),the average customer service rate is: ${\mu }_{A1}=0.09\text{\hspace{0.17em}}\text{p}/\text{s}$ , take them into Equation (2-6), we got $\frac{Q\left(c\right)}{Q\left(c+1\right)}=5.01>1$ b) when $c>1$ , for $\left(c+1\right)\mu -\lambda >c\mu -\lambda$ , then ${\left[\frac{\left(c+1\right)\mu -\lambda }{c\mu -\lambda }\right]}^{2}>1$ , therefore, $\frac{Q\left(c\right)}{Q\left(c+1\right)}>\frac{\mu }{\lambda }\cdot \frac{{c}^{2}}{c+1}$ , obviously, we can see Equation (2-7) is a monotonically increasing function, $\frac{{c}^{2}}{c+1}=\frac{1}{\frac{1}{c}+\frac{1}{{c}^{2}}}$ (2-7) As a result, when $c=2$ , we can get the minimize value 4/3, then $\frac{Q\left(c\right)}{Q\left(c+1\right)}\ge \frac{Q\left(2\right)}{Q\left(2+1\right)}>\frac{\mu }{\lambda }\cdot \frac{4}{3}\cdot 1$ . The average arrival rate of customers in Pre-Check Entrance is: ${\lambda }_{A1}=0.11\text{\hspace{0.17em}}\text{p}/\text{s}$ ; The average customer service rate is: ${\mu }_{A1}=0.09\text{\hspace{0.17em}}\text{p}/\text{s}$ ; We can get, $\frac{Q\left(c\right)}{Q\left(c+1\right)}>1$ . ・ Conclusion Since $Q\left(c\right)$ is a monotonically decreasing function, it can be seen that the value of ${P}_{0}$ has nothing to do with $c$ . Therefore, ${L}_{q}$ is monotone decreasing function with variable $c$ . Additionally, ${W}_{s}=\frac{{L}_{q}}{\lambda }+\frac{1}{\mu }$ (2-8) Then we can get ${W}_{s}$ is monotone decreasing function with variable $c$ . Therefore, increasing the number of $c$ that the time of customers stay in the service system can be reduced, which can increase the passenger throughput in Pre-Check Entrance service system in Zone A. 2) Analysis of the relationship between ${W}_{q}$ and the variable c For ${W}_{q}=\frac{{L}_{q}}{\lambda }$ (2-9) We can get, ${W}_{q}$ is monotone decreasing function with variable $c$ . Therefore, increasing the number $c$ of TSA agents, the average waiting time of the customers in the system can be shortened. 3) Analysis of the relationship between ${W}_{s}$ and the variable $\mu$ For the analysis of the change regularity of ${W}_{s}$ with variable $\mu$ , take $\beta$ , $\lambda$ as one constant. By the Little equation, analysis of the change regularity of ${W}_{s}$ with variable $\mu$ is equivalent to the analysis of the changing rules of ${L}_{s}$ in Equation (2-3) with the variable $\mu$ . Firstly, analysis variation of ${P}_{0}$ with variable $\mu$ , the specific analysis process is as follows: a) when $c=1$ , it is satisfied the standard queuing theory model M/M/1/∞/∞, for the Little equation, ${W}_{s}=\frac{1}{\mu -\lambda }$ (2-10) We can get that ${W}_{s}$ is monotone decreasing function with variable $\mu$ . b) when $c>1$ , ${P}_{0}\left(\mu \right)={\left[\underset{k=0}{\overset{c-1}{\sum }}\frac{1}{k!}{\left(\frac{\lambda }{\mu }\right)}^{k}+\frac{1}{c!}\cdot \frac{1}{1-\rho }\cdot {\left(\frac{\lambda }{\mu }\right)}^{c}\right]}^{-1}$ (2-11) $Q\left(\mu \right)=\frac{{\left(c\rho \right)}^{c}\rho }{c!{\left(1-\rho \right)}^{2}}=\frac{{\left(\frac{\lambda }{\mu }\right)}^{c}\frac{\lambda }{c\mu }}{c!{\left(1-\frac{\lambda }{c\mu }\right)}^{2}}=\frac{{\lambda }^{c+1}}{c!c{\mu }^{c-1}{\left(\mu -\frac{\lambda }{c}\right)}^{2}}$ (2-12) Obviously, $Q\left(\mu \right)$ is a monotone decreasing function with respect to the variable $\mu$ . According to Equation (2-12), ${W}_{s}=\frac{Q\left(\mu \right)\cdot {P}_{0}\left(\mu \right)}{\lambda }+\frac{1}{\mu }$ (2-13) and $\begin{array}{c}{W}_{s}=\frac{Q\left(\mu \right)\cdot {P}_{0}\left(\mu \right)}{\lambda }+\frac{1}{\mu }\\ =\frac{{\left(c\rho \right)}^{c}\rho }{\underset{k=0}{\overset{c-1}{\sum }}\frac{c!}{k!}\cdot \left(1-\rho \right)\cdot \left(\frac{\lambda }{\mu }\right)+\left(1-\rho \right){\left(\frac{\lambda }{\mu }\right)}^{c}}+\frac{1}{\mu }\\ =\frac{1}{c}\cdot \frac{1}{\underset{k=0}{\overset{c-1}{\sum }}\frac{c!}{k!}\cdot {\left(1-\frac{\lambda }{c\mu }\right)}^{2}\cdot \left(\frac{\lambda }{c\mu }\right){\right)}^{k-c-1}+\left(1-\frac{\lambda }{c\mu }\right){\left(\frac{\lambda }{\mu }\right)}^{-1}}+\frac{1}{\mu }\end{array}$ (2-14) Let $\begin{array}{c}h\left(\mu \right)=\underset{k=0}{\overset{c-1}{\sum }}\frac{c!}{k!}\cdot {\left(1-\frac{\lambda }{c\mu }\right)}^{2}\cdot {\left(\frac{\lambda }{c\mu }\right)}^{k-c-1}+\left(1-\frac{\lambda }{c\mu }\right){\left(\frac{\lambda }{\mu }\right)}^{-1}\\ =\underset{k=0}{\overset{c-1}{\sum }}\frac{c!}{k!}\cdot {\left(1-\frac{\lambda }{c\mu }\right)}^{2}\cdot {\left(\frac{\lambda }{c\mu }\right)}^{k-c-1}+\left(\frac{\mu }{\lambda }-\frac{1}{c}\right)\end{array}$ (2-15) make ${\mu }^{\prime }>\mu$ , $\begin{array}{c}h\left({\mu }^{\prime }\right)-h\left(\mu \right)=\underset{k=0}{\overset{c-1}{\sum }}\frac{c!}{k!}\cdot {\left(1-\frac{\lambda }{c{\mu }^{\prime }}\right)}^{2}\cdot {\left(\frac{\lambda }{c{\mu }^{\prime }}\right)}^{k-c-1}+\left(\frac{{\mu }^{\prime }}{\lambda }-\frac{1}{c}\right)\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}-\underset{k=0}{\overset{c-1}{\sum }}\frac{c!}{k!}\cdot {\left(1-\frac{\lambda }{c\mu }\right)}^{2}\cdot {\left(\frac{\lambda }{c\mu }\right)}^{k-c-1}+\left(\frac{\mu }{\lambda }-\frac{1}{c}\right)\\ =c!\text{\hspace{0.17em}}\cdot {\lambda }^{k-c-1}\underset{k=0}{\overset{c-1}{\sum }}\frac{1}{k!}\left[{\left(1-\frac{\lambda }{c{\mu }^{\prime }}\right)}^{2}\cdot {\left(\frac{1}{c{\mu }^{\prime }}\right)}^{k-c-1}\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}-{\left(1-\frac{\lambda }{c\mu }\right)}^{2}\cdot {\left(\frac{1}{c\mu }\right)}^{k-c-1}\right]+\frac{{\mu }^{\prime }-\mu }{\lambda }\end{array}$ (2-16) for ${\mu }^{\prime }>\mu$ , so ${\mu }^{\prime }-\mu >0$ and $c!\text{\hspace{0.17em}}\cdot {\lambda }^{k-c-1}>0$ . Let $g\left(\mu \right)={\left(1-\frac{\lambda }{c\mu }\right)}^{2}\cdot {\left(\frac{1}{c\mu }\right)}^{k-c-1}$ (2-17) Then, $\frac{g\left({\mu }^{\prime }\right)}{g\left(\mu \right)}=\frac{{\left(1-\frac{\lambda }{c{\mu }^{\prime }}\right)}^{2}\cdot {\left(\frac{1}{c{\mu }^{\prime }}\right)}^{k-c-1}}{{\left(1-\frac{\lambda }{c\mu }\right)}^{2}\cdot {\left(\frac{1}{c\mu }\right)}^{k-c-1}}={\left(\frac{c{\mu }^{\prime }-\lambda }{c\mu -\lambda }\right)}^{2}\cdot {\left(\frac{\mu }{{\mu }^{\prime }}\right)}^{k-\left(c-1\right)}$ (2-18) Because, ${\mu }^{\prime }>\mu$ , $k\le c-1$ , so that, $c{\mu }^{\prime }-\lambda >c\mu -\lambda$ , then, $\frac{c{\mu }^{\prime }-\lambda }{c\mu -\lambda }>1$ and $\frac{\mu }{{\mu }^{\prime }}<1$ for $k-\left(c-1\right)\le 0$ , so that $\frac{g\left({\mu }^{\prime }\right)}{g\left(\mu \right)}>1$ , $h\left({\mu }^{\prime }\right)-h\left(\mu \right)>0$ , then we can get $h\left(\mu \right)$ is an increasing function, taking $h\left(\mu \right)$ to the equation ${W}_{s}$ ,we know that ${W}_{s}$ is a monotone decreasing function with respect to the variable $\mu$ . Which also means ${L}_{s}$ is a monotone decreasing function with respect to the variable $\mu$ . Therefore, reducing the average service time of the customer in the service system is equivalent to increasing the throughput of customers in Pre-Check Entrance service system in Zone A. 4) To analysis the relationship between ${W}_{q}$ and the variable $\mu$ in the similar way. For ${W}_{q}=\frac{{L}_{q}}{\lambda }$ (2-19) We can get ${W}_{q}$ is a monotone decreasing function with respect to the variable $\mu$ . Thus reducing $\mu$ is to reduce the average waiting time of the customer in the service system. 2.4. Conclusion ・ For Zone A:Regular-Check Entrance 1) In Regular-Check Entrance service system, increasing the number $c$ of SAT agents or reducing the average service time can reduce the time of customer stay in the service system, and increase the throughput of customers in Regular- Check Entrance service system. 2) For the average service time for customers in Pre-Check Entrance service system is less than the Regular-Check Entrance service system, we can increase the number $c$ of SAT agents or reducing the average service time in Regular- Check Entrance to reduce the waiting time variance between Pre-Check Entrance service system with Regular-Check Entrance service system. ・ For Zone B:Baggage and Body Screening According to equations of the standard queuing model M/M/c/∞/∞, the corresponding indexes of the Regular-Check Entrance queuing system in Zone B are derived as Equations (1-1)-(1-5); The following conclusions can be drawn: 1) For the Baggage and Body Screening service system in Zone B, It can be proved that ${W}_{s}$ and ${W}_{q}$ are monotone decreasing functions of variable c; increasing the number $c$ of their checkpoint equipment in Zone B can reduce the stay time of customers in the service system, which can increase the throughput of customers in Baggage and Body Screening service system in Zone B; 2) To reduce the average waiting time variance between Baggage Screening service system with Body Screening service system, we can increase the number $c$ of checkpoint equipment (or SAT agent) or reduce the average service time for each customer. 3) For the Baggage and Body Screening service system in Zone B, we take $c$ , $\lambda$ as a constant in Equations ((1-1), (1-2) and (1-5)), ${W}_{s}$ and ${W}_{q}$ are monotone decreasing functions about the variable $\mu$ ; in order to increase the throughput of customers in Baggage and Body Screening service system, we can reduce the average service time for customer. 3. The Influence of Culture Variance According to equations of the standard queuing model M/M/c/∞/∞, the corresponding indexes of the Regular-Check Entrance queuing system in Zone A and Zone B are calculated, we take parts of variables in Equation (1-19) as a constant which value are given in 1.4 Parameters Calculation, while analyzing the relationship between ${W}_{s}$ and variables $\mu$ and $\beta$ in different situation. Then we use Matlab soft to show the relationship between the average service rate $\mu$ of the customer and the average stay time of the customer in the security system in the case of changes in the number of security personnel and the relationship between the average stay time of passengers in the system ${W}_{s}$ and the ratio of pre- check and regular-check $\beta$ . Sensitivity Analysis Figure 2 shows the relationship between the average service rate μ of the customer and the average stay time of the customer in the security system in the case of changes in the number of security personnel. From the chart one, we can see that when the number of security personnel is a fixed value, customer average stay time in security system decreases with the increase of average customer service rate. When c increases, the average stay time decreased. When c increased from 4 to 8, the average customer staying time decreased obviously. However, when c increased from 8 to 12, the average staying time of the customers is basically unchanged. This can be seen: 1) The increase of average service rate is inversely proportional to the average stay time of customers, that is, the average service time of customers is proportional to the average stay time. Therefore, reducing the average service time of customers can significantly reduce the average stay time of customers in the system and increase the customer throughput of the airport. 2) When c is small, increasing the value of c can significantly reduce the service time of customers in the system; when c is large, the increase has little effect on stay time of customers. From a practical point of view, we can see that when the number of security personnel is little, security personnel has less free time. When the c reaches a certain value, the increase of the number of security personnel will cause redundant personnel, high security personnel idle rate, which result in cost loss to the airport. Figure 3 shows the relationship between the average stay time of passengers in the system ${W}_{s}$ and the ratio of pre-check and regular-check $\beta$ . As can be seen from the figure, $\beta$ and W is inversely proportional. So the passenger of regular- check security inspection mode into the channel of pre-check case can reduce the average stay time of customers in the security system effectively. Figure 2. Sensitivity analysis. Figure 3. Sensitivity analysis. From the above, we can see that the rate of ${W}_{s}$ decreases is faster when the $\beta$ is changed from 0 to 1; When ${W}_{s}$ changed from 1 to 3, the rate of decline slowed down. Therefore, when the $\beta$ reaches a certain value, increasing the proportion of pre-check security checks has little effect on the reduction of the average stay time of passenger in the system. From the actual situation, it has been able to meet the need of the number of customers which accept traveler’s check pre trust plan when the pre-check security channel is enough. At this point, the increase of pre-check security channel will cause the increase idle probability of pre-check security channel, which is not conducive to improving the airport customer throughput. 1) Consider the collective efficiency as the priority principle Queuing model with collective efficiency for priority consideration mainly aim to increase the number of passengers which is handled by security check. According to the conclusion of the second question, increasing the number of security equipment, the number of security personnel, and reduce equipment service time can meet the corresponding demand. 2) Consider private space as the priority principle The main difference between normal queuing model and the queuing model considering private space as priority principle is the distance between people is longer. Thus, increasing the customer walk distance is equivalent to increase the average queue length of customers in the system and the time customer through security checkpoint costs. From Equation (2-8) can be seen, ${W}_{s}$ is a monotonically increasing function of variable $\mu$ . Therefore, this is tantamount to reducing the passenger throughput. Specific response measures a) Increase the number of devices and security personnel b) Reduce service time of equipment c) Consider the individual efficiency as a priority principle Consider personal efficiency as priority principle equivalent to the customer use pre-check security mode more frequently. It can be seen that increasing the number of security personnel of pre-check security and security equipment and improves the proportion of pre-check channel can improve the efficiency of individual effectively according to the second question (the number of). The objective function (1) is to minimize the travel time, (2) is to minimize the number of death among all the refugees. Constraints (3) are the variable initialization. Constraints (4) ensues that all the refugees in the Middle East depart successfully. Constraints (5) determine the death in the flows of refugees. Constraints (6) (7) and (8) impose the refugees whose asylum requests are not be approved, and have to leave the current country to another available country. Constraints (9) restrict the total number of the refugees in Europe, and the number of the refugees crossing in current country, and refugees resettled are limited by Constraints (10) and (11). Constraints (12) define the scale of the refugees and constraints (13) ensure the range of parameters and variables. 4. Policy and Procedural Recommendations Several Recommendations 1) The encourage policy to Pre-check security check mode a) Popularize the knowledge of pre-check b) Reduce pre-check security costs c) Improve the proportion of pre-check channels 2) Increase the number of security equipment and service personnel, reduce security equipment service time 3) Reduce the length of service channel assess and weaknesses, and propose ideas for improvement (future work). 5. Strengths and Weaknesses 5.1. Strengths Each model is discussed by using scientific and accurate methods and the relationship between each parameter and each variable is obtained. This paper makes a sensitivity analysis of the customer’s stay time in the system, and discusses the influence of each variable on the ${W}_{s}$ and explained the reason of this effect from the practical point of view 5.2. Weaknesses We only consider the relationship between each parameter and the individual variable by setting other variables as fixed value. But in the actual situation, each variable is constantly changing, and they have a better combination to optimize the parameters. This paper has not discussed their combinatorial optimization, so that the conclusion is non-optimal and we need to strengthen the research of this aspect in the future work. 6. Conclusions In order to increase checkpoint throughput and reduce variance in waiting time, we divide the current process of a US airport security checkpoint into two phases: Zone A for Document Check by Pre-Check Entrance or Regular-Check Entrance, Zone B for Baggage and Body Screening. First, we analyze the type of the airport security process of the two phases, including the customer reach time interval distribution and service time distribution. Second, we check out the effect of a variable on objective function by set other variables to a fixed value. Through the test results, we can find the bottleneck of the security check process and take corresponding measures to improve the passenger throughput and reduce customer waiting time variance. Third, we discuss the effect of national cultural differences on the process of passages pass through checkpoint. And we give the corresponding suggestions to increase customer throughput to reduce the impact of cultural differences. Finally, we put forwards to strategies and measures that apply to the world in order to optimize airport security system process. Through the analysis of the airport security process, we can provide reference for the airport to improve customer throughput. We will further improve the paper to meet the actual security process better. Conflicts of Interest The authors declare no conflicts of interest. Cite this paper Mao, X. and Wu, Z. (2017) The Optimizing of the Passenger Throughput at an Airport Security Checkpoint. Open Journal of Applied Sciences, 7, 485-501. doi: 10.4236/ojapps.2017.79035.   Ma, J.J. (2016) Virtual Queuing in Civil Aviation Security System. Technology and In-novation, No. 19, 34-35.  Lee, A.J. and Jacobson, S.H. (2011) Optimizing the Aviation Checkpoint Process to En-hance Security and Expedite Screening. Wiley Encyclopedia of Operations Research and Management Science, John Wiley & Sons, Inc.  http://www.comap.com/undergraduate/contests/mcm/contests/2017/problems/  Zeng, J.J. (2009) Airport Security Settings and Optimization. Knowledge-Based Economy, No. 12, 173-174.  Cheng, J.Y. and Yang, X. (2016) Reflection on the Airport Security Management Mode in China. Chinese Public Security (Academic Edition), No. 2, 41-44.  Anonymous. Transportation Security Administration; TSA Announces$6.9 Million Award for New Checked Baggage Screening System at Wichita Mid-Continent Airport. Bioterrorism Week, 2009.  Anonymous. Morpho Detection’s Checked Bag EDS Meet ECAC Approval for Use by EU Airports. Manufacturing Close-Up, 2011. 