Research Article

Cost-Effective Flight Sequencing and Gate Assignment Considering Transfer Time under Pandemic Conditions

Table 1

Notations.

VariablesDescriptionsUnits

Arrival time of flight ihh:mm
CTotal cost$/cycle
Minimized total cost$/cycle
Supplier cost$/cycle
User cost$/cycle
Dwell time of flight imin
Departure time of flight ihh:mm
Transfer distance between gates k and THm
GSet of available gates
Number of gates
i,jIndex of flights
KNumber of serversServers
k,lIndex of gates
NSet of connecting flights
nNumber of flightsFlights
OArrival time of the first flight in a batchhh:mm
PTotal transfer demandpass
Number of transfer passengers of flight ipass
Transfer demand from flight i to j and pij=pmij+psijpass
Number of passengers who missed connecting from flight i to jpass
Number of connecting passengers from flight i to jpass
Average service rate per service channelpass/min
Arrival ratepass/min
Service ratepass/min
Transfer claim timemin
Queue dissipation timemin
Queue formation timemin
Queuing delaymin
Flight safety checkup timemin
Elapsed time from O to the arrival time of flight imin
Elapsed time from O to the departure time of flight imin
Walking speedm/min
Mean walking speedm/min
Unit dwelling cost of flight i$/min
Penalty per passenger who missed a connection$/pass
Value of transfer walking time$/pass-min
Unit cost of gate k$/min
Value of wait time$/pass-min
Transfer time from the gate of flight i to the gate of flight jmin
Wait time of passenger from flight i at the gate of flight jmin
Binary variable; Xki = 1 if flight i docks at gate k; otherwise, 0