CN109871990B

CN109871990B - Parking space allocation method considering shortest flow time for transferring passengers

Info

Publication number: CN109871990B
Application number: CN201910089999.4A
Authority: CN
Inventors: 张则强; 刘思璐; 管超; 李云鹏; 蒋晋; 程文明
Original assignee: Southwest Jiaotong University
Current assignee: Southwest Jiaotong University
Priority date: 2019-01-30
Filing date: 2019-01-30
Publication date: 2020-10-23
Anticipated expiration: 2039-01-30
Also published as: CN109871990A

Abstract

The invention discloses a method for allocating parking spaces by considering the shortest flow time of transit passengers, which comprises the following steps: acquiring flight information and parking place information; secondly, classifying the parking places with different attributes, matching the attributes of airplanes of different flights, and converting the functional attributes of the flights and the parking places into 0/1 variables; (III) establishing a mathematical optimization distribution model; and (IV) solving by adopting an intelligent algorithm combined with heuristic rules to obtain a feasible scheme. Therefore, the method for allocating the parking places by considering the shortest flow time of the transit passengers has simple process, and the allocation scheme is closer to the airport working site by considering the actual conditions of flight-parking place allocation, the shortest flow time of the transit passengers and the like, thereby not only effectively improving the rationality of airport resource scheduling, but also reflecting the guarantee level of one airport to a certain extent and improving the satisfaction degree of the transit passengers.

Description

Parking space allocation method considering shortest flow time for transferring passengers

Technical Field

The invention relates to the technical field of ground control of aviation airports, in particular to an aircraft parking space allocation technology, and particularly relates to an aircraft parking space allocation method considering the shortest flow time of transit passengers.

Background

Due to the rapid development of the travel industry, the passenger flow of the airlines in the airport in the existing station buildings in different degrees of saturation states around the world occurs, so that part of flights can only stop at the temporary parking apron. According to the '2017 civil aviation industry development statistical bulletin' issued by the national aviation administration in 5 months in 2017, the continuous increase of the civil aviation traffic and the number of flights in China reflects the rapid development of the civil aviation industry, and simultaneously brings great challenges to the resource scheduling and flight guarantee service of airports in China.

To cope with future developments, most airlines will add satellite halls. However, after the satellite hall is introduced, although the pressure of insufficient parking positions of the original station building can be relieved, the satellite hall has certain negative effects on the flight connection of the transit passengers. Along with the development of market economy, the passenger boarding satisfaction also becomes a key factor for the decision-making of the airplane stop allocation of the airline company, but the field of aeroboarding does not enter deep research.

Currently, few evaluation methods for the influence of a newly added satellite hall on transit passengers in an airport are available, and only some evaluation methods for flight ground operation guarantee efficiency are mainly based on a civil aviation flight normal statistical method, wherein the evaluation indexes are only two: the flight is normal and the airport is released normally, the evaluation means can not accurately reflect the real guarantee level of each airline company at one airport, and can not evaluate the condition of transit passengers. At present, most of the work of aircraft stand allocation research of airlines is based on the personal experience of scheduling personnel, and allocation is carried out in a manual sequencing mode through simple computer assistance, and the influence of transit passengers is not taken as the standard for evaluating reasonable allocation of airport stand resources.

Disclosure of Invention

The invention mainly aims to provide a method for allocating the parking spaces by considering the shortest flow time of transit passengers, so as to solve the technical problem that the insufficient pressure of the parking spaces of the original station building is difficult to relieve in the prior art.

In order to achieve the above object, the present invention provides a method for assigning parking spaces in consideration of the shortest time for transit of passengers. The method for allocating the parking space considering the shortest flow time for transferring passengers comprises the following steps:

acquiring flight information and parking place information;

secondly, classifying the parking places with different attributes, matching the attributes of airplanes of different flights, and converting the functional attributes of the flights and the parking places into 0/1 variables;

(III) establishing a mathematical optimization distribution model;

the mathematical optimization distribution model comprises a first model for minimizing the total number of fixed parking positions of unallocated flights and a second model for evaluating the influence of a newly-added satellite hall of an airport on transit passengers by the shortest flow time of the transit passengers;

and (IV) solving by adopting an intelligent algorithm combined with heuristic rules to obtain a feasible scheme.

Therefore, the method for allocating the parking places by considering the shortest flow time of the transit passengers has simple process, and the allocation scheme is closer to the airport working site by considering the actual conditions of flight-parking place allocation, the shortest flow time of the transit passengers and the like, thereby not only effectively improving the rationality of airport resource scheduling, but also reflecting the guarantee level of one airport to a certain extent and improving the satisfaction degree of the transit passengers.

The invention is further described with reference to the following figures and detailed description. Additional aspects and advantages of the invention will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of the invention.

Drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, are included to assist in understanding the invention, and are included to explain the invention and their equivalents and not limit it unduly. In the drawings:

FIG. 1 is a flow chart of the steps of the heuristic algorithm of the present invention.

Fig. 2 is a schematic diagram of a parking space allocation scheme according to an embodiment of the present invention.

Detailed Description

The invention will be described more fully hereinafter with reference to the accompanying drawings. Those skilled in the art will be able to implement the invention based on these teachings. Before the present invention is described in detail with reference to the accompanying drawings, it is to be noted that:

the technical solutions and features provided in the present invention in the respective sections including the following description may be combined with each other without conflict.

Moreover, the embodiments of the present invention described in the following description are generally only some embodiments of the present invention, and not all embodiments. Therefore, all other embodiments obtained by a person of ordinary skill in the art based on the embodiments of the present invention without any creative effort shall fall within the protection scope of the present invention.

With respect to terms and units in the present invention. The terms "comprising," "having," and any variations thereof in the description and claims of this invention and the related sections are intended to cover non-exclusive inclusions.

The relevant terms are explained as follows:

the flight connection time is the departure time of the next flight-the arrival time of the previous flight.

Airplane transition record number: recording number for airplane transition

An online airport: a departure airport code for a transition airplane;

offline airport: a code to reach an airport;

area: in the embodiment of the patent, 7 different areas are provided, namely North of Hall T, Center, South, North of Hall S, South, Center and East;

the invention relates to a method for allocating parking spaces in consideration of the shortest flow time for transferring passengers, which comprises the following steps:

acquiring flight information and parking place information;

the flight information includes: an airplane transition record number, an arrival date, an arrival time, an arrival flight, an arrival type (domestic flight or international flight), an airplane model, a departure date, a departure time, a departure flight, a departure type (domestic flight or international flight), an online airport and an offline airport;

the stand information includes: parking lot number, terminal hall, area, arrival type, departure type, body category (wide body machine or narrow body machine).

And invalid information in the information is removed, and the validity of the subsequent information is further ensured.

when the parking places with different attributes are classified, the flights are sequenced from morning to evening according to the arrival time.

According to the actual situation of the airport, the type and the number of the airport parking spaces are known, and the departure and landing time, the model number and the flight type of the airport flight are known. The main contents of matching include: (1) the size of the airplane type is matched with that of the parking space, if the large airplane stops at the large parking space, the small airplane stops at the small parking space; (2) and matching the stand with the flight, such as whether the stand executes domestic flights, international flights or domestic and international flights simultaneously.

In the 0/1 variable, a 1 indicates a match and a 0 indicates a mismatch, reflecting the relationship of the flight, flight stand and traveler.

(III) establishing a mathematical optimization distribution model;

the mathematical optimization allocation model comprises a first model for minimizing the total number of fixed parking positions of unallocated flights and a second model for evaluating the influence of a newly-added satellite hall of an airport on transit passengers in the shortest process time of the transit passengers.

Specifically, the model is established by adopting the following steps:

1. determining basic assumption conditions

(1) Assuming that all flights arrive and depart on time;

(2) assuming that passengers can transfer between the terminal building T and the satellite hall S without waiting, the passengers can take a rapid transit line at any time, and the time for one-pass rapid transit is fixed;

(3) overall planning and distribution of all parking spaces of the terminal building T and the satellite hall S;

(4) the arrival and departure of each aircraft transition must be distributed to the same parking lot for carrying out, and the processes of overhaul, maintenance and the like in the process cannot be moved to other places;

(5) the functional attribute of each stand is given in advance and cannot be changed, the attribute of the airplane must be completely consistent with the attribute of the stand to stop, otherwise, the stand must be replaced;

(6) passengers who fail to transfer still need to consider the shortest transfer flow time;

(7) the interval time of neutral gear distributed between two airplanes in the same parking place is more than or equal to 45 minutes;

(8) and the airport is additionally provided with a simple temporary parking space for the airplane which cannot be allocated with the fixed parking space to park. Assuming that the number of temporary machine positions is unlimited.

(9) If the passenger fails to transfer, the transfer time of the passenger is prolonged to 6 hours.

The functions of terminal building T and satellite hall S are not exactly the same. The terminal building T has complete functions of an international airport terminal, including taking off, landing, entering and exiting and waiting. The satellite hall S is used for relieving the operating pressure of an airport and lacks an entry and exit function, so if a passenger gets off the satellite hall or leaves the satellite hall but needs to handle entry and exit, the passenger needs to take a shortcut to handle the satellite hall T, the shortcut can rapidly and reciprocally transport domestic and international passengers, the passenger does not need to wait when taking the satellite hall and can get off the bus at any time, and the one-way trip needs 8 minutes.

A stop of an aircraft at a stand is usually identified by a pair of flights (an arrival flight and a departure flight, also called a "transition"). The assignment of a flight-stop is to assign such a pair to the appropriate stop, with a stop at a stop being indicated by a pair. A so-called transit traveler is a traveler who takes a flight from an arriving flight to a departure flight carried out by the same or a different airplane.

2. Defining variables and parameters as shown in Table 1

TABLE 1

3. Establishing a mathematical optimization model

The first model is:

the second model is as follows:

4. establishing constraints as shown in Table 2

TABLE 2

In table 2, equations (3) to (6) represent the entry and exit of two flights of different airplanes to verify the correctness of the input data; the formula (7) indicates that each airplane must be completely distributed and can be distributed to only one stand; equations (8) to (10) constrain the sequential flight relationships of the airplanes assigned to different stands, which are determined by the arrival/departure flight data of each airplane; equation (11) limits S together with the minimum objective function equation_kA variable; the formulas (12) and (13) show that the wide-body machine can only fall on the wide-body stand, and the short-body machine can only fall on the narrow-body stand;

and

the variables are determined by equations (14) to (22); equations (23) to (28) represent the value ranges of binary variables.

The method mainly comprises the following steps: and randomly distributing the airplane to a fixed parking place, if the functional attributes of the airplane and the fixed parking place are matched with each other, such as domestic/international, arrival/takeoff, wide-body airplane/narrow-body airplane and the like, using the parking place, if the functional attributes are not matched with each other, matching the airplane with the next parking place, and if the functional attributes are not matched with the fixed parking place all the time, stopping the airplane on a temporary parking apron, thereby obtaining the optimal value through cyclic distribution.

When the attributes of wide-narrow machines, arrival take-off, departure and entry are matched for different flight airplanes, the stop positions of the previously allocated flights are preferentially selected, so that the occupation of new stop positions is reduced.

After the distribution schemes of the airplanes in different stand positions are determined, the flights in the airplane need to be subjected to time sequencing, and the requirement can be met as long as the difference between the departure time of the airplane distributed to the same stand position and the arrival time of the airplane in the previous shift is ensured to be 45 minutes. The method comprises the following specific steps:

1. determining encoding and decoding representations of solutions

Defining the aircraft number as N ═ X₁,X₂...,X_n]Number of stand is [ X ]₁,X₂...,X_m]。

2. Flow for writing heuristic algorithm

Running a heuristic algorithm program in Matlab2016b software, wherein the specific implementation steps of the heuristic algorithm are shown in FIG. 1 and comprise the following steps:

step 1: initializing an algorithm, the number n of airplanes, the number m of parking positions, the cycle number MG and an objective function value f;

step 2: ordering solutions of all flights from morning to evening according to arrival time;

step 3: let k equal to 1;

step 4: randomly sequencing the m parking positions to obtain a parking position sequence Temp;

step 5: let i equal to 1;

step 6: let j equal 1;

step 7: performing attribute matching on the ith flight and the jth stand, if the matching is successful, executing Step9, otherwise executing Step 8;

step 8: j is equal to j +1, if j is equal to or less than m, Step7 is executed, otherwise, Step13 is executed;

step 9: judging whether the jth stand has already distributed flights, if so, comparing the time interval between the arrival time of the ith flight and the departure time of the previous flight in the stand if the time interval is more than or equal to T_minIf yes, let Assign (i, j) equal to 1, execute Step 10; otherwise, return to Step 8;

step 10: if i is equal to i +1, returning to Step6 if i is equal to or less than n, otherwise, executing Step 11;

step 11: calculating an objective function value, updating f, then enabling k to be k +1, if k is less than or equal to MG, returning to Step4, otherwise, executing Step 12;

step 12: if k is larger than MG, the algorithm is terminated and the optimal solution is returned;

step 13: if the aircraft is not assigned to a fixed stand, the flight is assigned to a temporary apron (the assigned temporary apron is considered preferentially), and whether the time interval between the arrival time of the flight and the departure time of the previous flight in the stand is greater than or equal to T or not is compared_minIf yes, distributing the temporary parking apron, and otherwise, starting a new temporary parking apron.

Specifically, the objective function value is a factor of 1, the total number of assigned fixed parking spaces, and a factor of 2, the minimum transit time of the transit passenger.

Specifically, the first model is omitted, the numerical value obtained by calculating the second model is the optimal value of the second model, and the reciprocal of the optimal value of the second model is the coefficient 2; neglecting the second model, calculating a numerical value obtained by the first model to be the optimal value of the first model, wherein the reciprocal of the optimal value of the first model is a coefficient 1;

the beneficial effects of the present invention will be described below by taking n-20 (aircraft number) and m-32 as examples.

The raw data information for the 20 airplane counts is shown in table 3.

TABLE 3

In Table 3, 19-Jan-18 indicates: year 2018, month 1, day 19; d represents a domestic flight; i represents an international flight; the same applies below. The raw data for the 32 stands are shown in table 4.

TABLE 4

Number of boarding gate	Terminal hall	Region(s)	Type of arrival	Type of departure	Body type
						T1	T	North	I	I	N
T2	T	North	I	I	W
						T3	T	North	I	I	W
T4	T	North	I	I	W
						T5	T	North	I	D,I	W
T6	T	North	D,I	D,I	W
						T7	T	North	D,I	D,I	N
T8	T	North	D,I	D	N
						T9	T	North	D,I	D	N
T10	T	Center	D	D	N
						T11	T	Center	D	D	N
T12	T	Center	D	D	N
						T13	T	Center	D	D	N
T14	T	Center	D	D	N
						T15	T	Center	D	D	N
T16	T	Center	D	D	N
						T17	T	Center	D	D	N
T18	T	Center	D	D	N
						T19	T	Center	D	D	N
T20	T	South	D	D,I	N
						T21	T	South	D	D,I	N
T22	T	South	D,I	D,I	N
						T23	T	South	D,I	D,I	W
T24	T	South	D,I	D,I	W
						T25	T	South	D,I	I	W
T26	T	South	I	I	W
						T27	T	South	I	I	W
T28	T	South	I	I	W
						S1	S	North	D	D	N
S2	S	Center	D	D	N
						S3	S	South	D	D	N
S4	S	East	I	I	W

In table 4, W represents a wide body machine; n represents a narrow body machine. The same applies below.

The data obtained by the arrangement in the step (I) and the step (II) are as follows:

tables 5 and 6, which were obtained by collating the raw data of 20 aircraft numbers, show:

TABLE 5

TABLE 6

The data obtained by collating the raw data of 32 stand are shown in table 7.

TABLE 7

In tables 5 to 7, 0 indicates a mismatch, and 1 indicates a match.

In the step (III), the optimal value of the first model is 9, and the optimal value of the second model is 525.

In the step (IV): let the number of cycles MG be 100, factor

Coefficient of performance

T_minAnd (4) when the time of the shortest flow of the transit passenger is 45min and the time of the shortest flow of the transit passenger is 225min, operating the heuristic algorithm flow shown in the figure 1, and obtaining the parking space allocation scheme shown in the figure 2.

As can be seen from FIG. 2, the aircraft numbered 1 in tables 5-6 is assigned the aircraft position numbered 2 in Table 7, the aircraft numbered 8 in tables 5-6 is assigned the aircraft position numbered 5 in Table 7, the aircraft numbered 3, 10, 18 in tables 5-6 is assigned the aircraft position numbered 9 in Table 7, the aircraft numbered 6, 11, 17 in tables 5-6 is assigned the aircraft position numbered 12 in Table 7, the aircraft numbered 5 in tables 5-6 is assigned the aircraft position numbered 18 in Table 7, the aircraft numbered 2, 12, 14, 19 in tables 5-6 is assigned the aircraft position numbered 20 in Table 7, the aircraft numbered 4, 13, 15, 20 in tables 5-6 is assigned the aircraft position numbered 22 in Table 7, and the aircraft numbered 7 in tables 5-6 is assigned the aircraft position numbered 28 in Table 7. Therefore, the data in the tables 5-7 are processed by adopting the method for allocating the parking places considering the shortest flow time of the passengers, so that only 8 fixed parking places are allocated, the temporary parking places are not adopted, the satellite hall S is not used, and the resources are saved to the maximum extent. 1.31825396825397.

The contents of the present invention have been explained above. Those skilled in the art will be able to implement the invention based on these teachings. All other embodiments, which can be derived by a person skilled in the art from the above description without inventive step, shall fall within the scope of protection of the present invention.

Claims

1. The method for allocating the parking space considering the shortest flow time of the transit passengers comprises the following steps:

acquiring flight information and parking place information;

(III) establishing a mathematical optimization distribution model;

the first model is:

the second model is as follows:

wherein: t is a terminal building; s is a satellite hall; k is the number of the stand; m is the number of all parking positions of the terminal building and the satellite hall; s_kIndicating whether the k-th stand has the plane to take off or land, if so, S_k1, otherwise 0; i. j is the aircraft number; n is the number of airplanes having landing and taking-off tasks in the terminal building and the satellite hall; i is_ijIndicating that if the arriving flight of the ith aircraft is the departure flight of the jth aircraft, then I_ij1, otherwise 0; f. of_ijRepresenting the number of passenger transportations between the ith airplane and the jth airplane; p1_ d_iIndicating whether the ith aircraft arriving at the airport is a domestic flight; p2_ d_jWhether the jth airplane taking off from the airport is a domestic flight;

whether the ith airplane and the jth airplane are in the same aviation building or not is represented;

indicating whether the ith airplane and the jth airplane are in the same satellite hall;

indicating whether the ith airplane is in the satellite hall and the jth airplane is in the aviation building or not, or whether the ith airplane is in the aviation building and the jth airplane is in the satellite hall or not; n is the number set of the aircraft, N ═ 1]；P2_i_jIndicating whether the jth aircraft departing from the airport is an international flight; p1_ i_iIndicating whether the ith aircraft arriving at the airport is an international flight;

(IV) solving by adopting an intelligent algorithm combined with heuristic rules to obtain a feasible scheme, wherein the feasible scheme comprises the following steps:

step 1: initializing an algorithm, the number n of airplanes, the number m of parking positions, the cycle number MG and an initialization objective function value f;

step 3: let k equal to 1;

step 5: let i equal to 1;

step 6: let j equal 1;

step 13: if the airplane is not allocated to the fixed stand, the flight is allocated to the temporary apron, and whether the time interval between the arrival time of the flight and the departure time of the previous flight in the stand is greater than or equal to T or not is compared_minIf yes, distributing the temporary parking apron, and otherwise, starting a new temporary parking apron;

the value of the objective function

2. The method of claim 1, wherein the method further comprises the steps of:

the flight information includes: the method comprises the following steps of (1) carrying out airplane transition record number, arrival date and arrival time, arrival flight, arrival type, airplane model, departure date, departure time, departure flight, departure type, online airport and offline airport;

the stand information includes: number of parking space, terminal hall, area, arrival type, departure type, and body type.

3. The method of claim 1, wherein the method further comprises the steps of: step (three) was run under the following assumptions:

(1) all flights arrive and depart on time;

(2) passengers can transfer between the terminal building and the satellite hall without waiting, can take rapid transit lines at any time, and the one-way rapid transit time is fixed;

(3) overall planning and distribution of all parking spaces of the terminal building and the satellite hall;

(4) the arrival and departure of each aircraft transition must be distributed to the same parking lot for maintenance, and the maintenance process cannot be moved to other places;

(8) the airport is provided with a temporary parking space for the airplane which cannot be allocated with the fixed parking space to park, and the number of the temporary parking spaces is not limited;

4. The method of claim 1, wherein the method further comprises the steps of: two flight requirements for different aircraft are satisfied:

wherein i is an airplane number; n is the number of airplanes having landing and taking-off tasks in the terminal building and the satellite hall; k is the number of the stand; m is the number of all parking positions of the terminal building and the satellite hall; p1_ i_iIndicating whether the ith aircraft arriving at the airport is an international flight; p1_ d_iIndicating whether the ith aircraft arriving at the airport is a domestic flight; p2_ i_iIndicating whether the ith aircraft departing from the airport is an international flight; p2_ d_iWhether the ith aircraft taking off from the airport is a domestic flight; t1_ i_kIf the aircraft landing at the kth stand is an international flight, T1_ i_k1, otherwise 0; t1_ d_kIf the aircraft landing at the kth stand is a domestic flight, T1_ d_k1, otherwise 0; t2_ i_kIndicating whether the aircraft taking off at the kth stand is an international flight, if so, T2_ i_k1, otherwise 0; t2_ d_kIndicating whether the aircraft taking off at the kth stand is a domestic flight or not, if so, T2_ d_kOtherwise, it is 0.

5. The method of claim 1, wherein the method further comprises the steps of: all aircraft must be allocated in their entirety and each aircraft can be allocated to only one stand.

6. The method of claim 1, wherein the method further comprises the steps of: the sequential flight relationship of the airplanes distributed to different parking positions needs to meet the following requirements:

wherein i and j are aircraft numbers; n is the number of airplanes having landing and taking-off tasks in the terminal building and the satellite hall; k is the number of the stand; m is a stop number set, and M is [1](ii) a m is the number of all parking positions of the terminal building and the satellite hall;

means that if the ith, jth aircraft is each assigned to the kth stand and aircraft i is disposed in front of aircraft j, then

Otherwise, the value is 0;

means that if the ith, jth aircraft are each assigned to the kth stand and aircraft j is disposed in front of aircraft i, then

Otherwise, the value is 0;

indicates if the ith aircraft is assigned to the kth stand

Otherwise, the value is 0;

indicates that if the jth aircraft is assigned to the kth stand

Otherwise, the value is 0; b_iRepresenting the takeoff time of the ith aircraft; a is_jRepresenting the arrival time of the jth airplane;

n denotes the number set of the aircraft, N ═ 1]。

7. The method of claim 1, wherein the method further comprises the steps of: s_kIt should satisfy:

wherein i and j are aircraft numbers; n is the number of airplanes having landing and taking-off tasks in the terminal building and the satellite hall; y is_i ^kIndicates that Y is assigned to the kth stand if the ith aircraft is assigned to the kth stand_i ^k1, otherwise 0; m is the number of all parking positions of the terminal building and the satellite hall; s_kIndicating whether the k-th stand has the plane to take off or land, if so, S_k1, otherwise 0; k is the number of the stand; m is a stop number set, and M is [1]。

8. The method of claim 1, wherein the method further comprises the steps of: the wide-body machine can only fall on the wide-body stand, and the short-body machine can only fall on the narrow-body stand.