Team 2053 rate. If the plane cannot "process"them quickly enough, they queue in the jet-bridge without adverse effects. Additionally, the interior of our planes are generally assumed to be regular and symmetric with all rows All planes fly at maximum capacity and all passengers are present at the time their respective zone is called, which they follow obediently. Empty disobedient ngers can be thought of as equivalent and at worst can be accounted by adding a time overhead once they board the plane. We confine our recommendations and analysis to methods that do not overly alter the status quo. Change is bad, particularly for the airline dustry in this already turmoil-laden time. We will analyze ticketless methods for comparison but seek to find the best boarding method for tick- eted contexts, since this will be useful for the many airlines that refuse to abandon assigned seats. We further will only consider zone-based board- ing calls, assuming that is too heavy-handed and logistically impossible to require passengers to line up in any verifiable order Additional assumptions are made to simplify analysis for individual section nese assumptions will be discussed at the appropriate locations 5 Motivation and Subproblems With the large number of complexities involved in the airplane boarding pro- cess, we begin by analyzing the problem in small, idealized parts. We begin by examining an ideal, best case algorithm that simplifies many issues in its analysis. By looking at the simplifications necessary to make this analysis,w get a better idea of the underlying problems or key issues in the process. In o econd and third sections we rigorously analyze facets of the boarding process to gain insights into the nature of the problem. Ultimately the knowledge we gain will motivate the set of boarding schemes best suited to solving the airplane boarding problem and the factors we will compare in our simulation model 5.1 Best-Case Boarding Algorithm Consider for a moment the case in which all possible variables involving pas- senger boarding could be controlled. Under these circumstances how would it be possible to schedule the boarding of the plane in an optimal manner? After consideration we determined that the best way of boarding a plane with these conditions would be to use a modified version of outside to inside method. pas enger are first ordered by the following set of criteria in descending order of Individual location in row: Window has highest priority, aisle has leastTeam 2053 6 of 30 rate. If the plane cannot “process” them quickly enough, they queue in the jet-bridge without adverse effects. Additionally, the interior of our planes are generally assumed to be regular and symmetric with all rows equally-sized. • All planes fly at maximum capacity and all passengers are present at the time their respective zone is called, which they follow obediently. Empty seats would only speed up the process. Late passengers or disobedient passengers can be thought of as equivalent and at worst can be accounted for by adding a time overhead once they board the plane. • We confine our recommendations and analysis to methods that do not overly alter the status quo. Change is bad, particularly for the airline industry in this already turmoil-laden time. We will analyze ticketless methods for comparison but seek to find the best boarding method for tick￾eted contexts, since this will be useful for the many airlines that refuse to abandon assigned seats. We further will only consider zone-based board￾ing calls, assuming that is too heavy-handed and logistically impossible to require passengers to line up in any verifiable order. Additional assumptions are made to simplify analysis for individual sections. These assumptions will be discussed at the appropriate locations. 5 Motivation and Subproblems With the large number of complexities involved in the airplane boarding pro￾cess, we begin by analyzing the problem in small, idealized parts. We begin by examining an ideal, best case algorithm that simplifies many issues in its analysis. By looking at the simplifications necessary to make this analysis, we get a better idea of the underlying problems or key issues in the process. In the second and third sections we rigorously analyze facets of the boarding process to gain insights into the nature of the problem. Ultimately the knowledge we gain will motivate the set of boarding schemes best suited to solving the airplane boarding problem and the factors we will compare in our simulation model. 5.1 Best-Case Boarding Algorithm Consider for a moment the case in which all possible variables involving pas￾senger boarding could be controlled. Under these circumstances how would it be possible to schedule the boarding of the plane in an optimal manner? After consideration we determined that the best way of boarding a plane with these conditions would be to use a modified version of outside to inside method. Pas￾senger are first ordered by the following set of criteria in descending order of priority: • Individual location in row: Window has highest priority, aisle has least 6