航空乘務(wù)員機(jī)型執(zhí)照規(guī)劃與簽派員生產(chǎn)規(guī)劃研究
發(fā)布時(shí)間：2018-08-16 08:24
【摘要】：近年來(lái),隨著國(guó)民經(jīng)濟(jì)的迅速發(fā)展及航空市場(chǎng)的逐步開放,航空運(yùn)輸量和飛行范圍日益擴(kuò)大,民航運(yùn)輸飛行安全管理的工作越來(lái)越重要。影響航空運(yùn)行安全的因素涉及飛行器/飛行輔助設(shè)備等硬件設(shè)備的可靠性技術(shù)因素、人員培訓(xùn)體制/各種規(guī)章和程序等人為因素、組織和管理因素等,但其中最關(guān)鍵的因素是：“人”。加強(qiáng)對(duì)“人”的管理,其關(guān)鍵在于對(duì)飛行安全鏈條上所涉及的關(guān)鍵技術(shù)人才的管理。航空公司飛行安全鏈條上涉及的主要運(yùn)行業(yè)務(wù)環(huán)節(jié)有飛行員、客艙服務(wù)、地面保障、機(jī)務(wù)工程和維修、運(yùn)行控制。本文以客艙服務(wù)及運(yùn)行控制部門的關(guān)鍵技術(shù)人才：客艙乘務(wù)員和飛行簽派員為研究對(duì)象,從安全角度出發(fā),研究客艙乘務(wù)員的機(jī)型執(zhí)照規(guī)劃問(wèn)題和飛行簽派員生產(chǎn)規(guī)劃相關(guān)的一系列問(wèn)題。本文的主要研究?jī)?nèi)容如下： 一、針對(duì)航空乘務(wù)員,分別基于生產(chǎn)保障度最大與乘務(wù)員人均收益均衡目標(biāo),在滿足生產(chǎn)任務(wù)需求、乘務(wù)員服務(wù)機(jī)型數(shù)量限制的條件下,研究乘務(wù)員機(jī)型執(zhí)照規(guī)劃問(wèn)題,確定每個(gè)機(jī)型執(zhí)照組合的乘務(wù)員人數(shù)。這里,機(jī)型執(zhí)照組合指乘務(wù)員持有的機(jī)型執(zhí)照種類的集合。本文將乘務(wù)員機(jī)型執(zhí)照規(guī)劃問(wèn)題分解為乘務(wù)員需求估計(jì)及乘務(wù)員機(jī)型執(zhí)照配置優(yōu)化兩個(gè)問(wèn)題,并主要研究乘務(wù)員機(jī)型執(zhí)照優(yōu)化配置問(wèn)題,該問(wèn)題細(xì)分為下面兩個(gè)研究?jī)?nèi)容： (1)生產(chǎn)保障度最大目標(biāo)下,乘務(wù)員服務(wù)機(jī)型數(shù)量限制的乘務(wù)員機(jī)型執(zhí)照配置優(yōu)化問(wèn)題。生產(chǎn)保障度是機(jī)型執(zhí)照方案對(duì)生產(chǎn)運(yùn)行保障度的評(píng)價(jià)指標(biāo),生產(chǎn)保障度越大,該機(jī)型執(zhí)照規(guī)劃方案越能應(yīng)對(duì)未來(lái)生產(chǎn)的波動(dòng)性。 (2)乘務(wù)員人均收益均衡目標(biāo)下,滿足生產(chǎn)保障度和乘務(wù)員服務(wù)機(jī)型數(shù)量限制約束的乘務(wù)員機(jī)型執(zhí)照配置優(yōu)化問(wèn)題。乘務(wù)員人均收益均衡是機(jī)型執(zhí)照方案對(duì)乘務(wù)員個(gè)人收益差異的影響指標(biāo)。 二、針對(duì)飛行簽派員,研究的主要內(nèi)容有： (1)對(duì)飛行簽派員的工作負(fù)荷進(jìn)行刻畫,得到簽派工作負(fù)荷的高峰時(shí)段、分析具有較高峰值負(fù)荷簽派席位處理的航班組成狀況,為合理分配航線提供支持。 (2)將簽派放行席位的工作勞動(dòng)強(qiáng)度用該席位單位時(shí)段的工作負(fù)荷來(lái)體現(xiàn),研究基于峰值負(fù)荷最小的簽派放行席位任務(wù)調(diào)度問(wèn)題,得到放行席位的峰值負(fù)荷最小的工作安排,為合理分配席位間的放行任務(wù)提供決策支持。 (3)給定簽派放行的的席位集合、放行任務(wù)集合和任務(wù)隨時(shí)間的工作負(fù)荷分布下,研究峰值負(fù)荷最小及總負(fù)荷量最小的雙目標(biāo)下的簽派放行席位間的任務(wù)分配問(wèn)題。 本文采用的方法和主要結(jié)論如下： 第一、在生產(chǎn)保障度目標(biāo)下的乘務(wù)員機(jī)型執(zhí)照配置優(yōu)化問(wèn)題中,本文提出一個(gè)解的構(gòu)造算法,該算法對(duì)某一類問(wèn)題可直接構(gòu)造出最優(yōu)解,對(duì)其他類問(wèn)題得到與最優(yōu)解差異最大為1/n0的可行解,這里n0是不同類型機(jī)型生產(chǎn)的需求人數(shù)的最小值。 第二、在生產(chǎn)保障度目標(biāo)最大,人均收益均衡的客艙乘務(wù)員機(jī)型執(zhí)照配置優(yōu)化問(wèn)題中,本文將問(wèn)題抽象為每個(gè)箱子裝相同數(shù)量的物品,但物品的種類各不相同的一維裝箱問(wèn)題,并提出一個(gè)基于LPT算法思想的貪婪算法,并得出k≤2,該算法給出最優(yōu)解；k2,最壞情況下的性能比為2-M-1的結(jié)論。這里,k是乘務(wù)員可持有的機(jī)型執(zhí)照數(shù)量,M是乘務(wù)員總?cè)藬?shù)。在k2下,又分析了k的具體取值對(duì)最壞情況性能比的影響。 第三、在基于峰值負(fù)荷最小的簽派放行席位任務(wù)調(diào)度的研究問(wèn)題中,本文中將問(wèn)題描述為有優(yōu)先序任務(wù)排序的單機(jī)排序問(wèn)題,每個(gè)任務(wù)都有一個(gè)到達(dá)時(shí)間,截止期限和處理時(shí)間,目標(biāo)是在不延誤完成任務(wù)的前提下,使機(jī)器的峰值負(fù)荷最小,并提出了一個(gè)有效算法,且證明出該算法給出的任務(wù)安排計(jì)劃是最優(yōu)安排。 第四、在簽派放行崗位間的任務(wù)分配問(wèn)題中,本中采用兩種VNS算法-VND和RVNS來(lái)解決這個(gè)問(wèn)題。在求解過(guò)程中,兩種領(lǐng)域選擇方式-插入和交換類型工作被定義并用在領(lǐng)域搜索算法中；Vazirani提出的修正的平行機(jī)調(diào)度啟發(fā)式算法被用來(lái)求解初始解。最后采用某航空公司的航班放行數(shù)據(jù)來(lái)評(píng)估我們算法的效能,案例的結(jié)果表明,VND與RVNS均能提供穩(wěn)定且較好的結(jié)果。 本文的主要?jiǎng)?chuàng)新點(diǎn)有,第一,首次對(duì)客艙乘務(wù)員機(jī)型執(zhí)照配置問(wèn)題進(jìn)行建模,并設(shè)計(jì)出有效算法(解構(gòu)造算法和基于LPT算法思想的貪婪算法)求解；第二,首次對(duì)飛行簽派員的任務(wù)配置問(wèn)題進(jìn)行建模,并設(shè)計(jì)最優(yōu)算法求解。
[Abstract]:In recent years, with the rapid development of the national economy and the gradual opening of the aviation market, the air traffic volume and flight range are expanding day by day, and the work of aviation safety management is becoming more and more important. All kinds of rules and procedures and other human factors, organization and management factors, but the most critical factor is "people". To strengthen the management of "people", the key lies in the management of key technical personnel involved in the flight safety chain. In this paper, the key technical personnel of cabin service and operation control department, cabin crew and flight dispatcher, are taken as the research object. From the safety point of view, the problems of cabin crew's model license planning and a series of problems related to flight dispatcher's production planning are studied. The main contents of the paper are as follows:
Firstly, based on the maximum degree of production security and the goal of balancing the per capita income of the flight attendants, this paper studies the problem of aircrew type licensing planning and determines the number of crew members for each type licensing combination under the conditions of meeting the production task requirements and limiting the number of crew service types. This paper divides the problem of crew licence planning into two parts: crew demand estimation and crew licence allocation optimization, and mainly studies the problem of crew licence allocation optimization.
(1) Optimizing the allocation of crew type licences with limited number of crew service aircraft under the maximum degree of production security. Production security is the evaluation index of production operation security for the scheme of crew type licences.
(2) Optimizing the allocation of crew type licences to meet the constraints of production security and the number of crew service aircraft under the goal of per capita income balance.
Two, for the flight dispatchers, the main contents of the study are:
(1) Characterize the workload of flight dispatchers, get the peak time of dispatching workload, and analyze the flight composition with high peak load dispatching seats, so as to provide support for the rational allocation of routes.
(2) The work intensity of the assigned and released seats is represented by the workload of the unit time interval of the seats. The task scheduling problem of the assigned and released seats based on the minimum peak load is studied, and the work schedule with the minimum peak load of the released seats is obtained, which provides decision support for the rational allocation of the released tasks between seats.
(3) Given the set of dispatched and released seats, the task allocation problem between dispatched and released seats with the minimum peak load and the minimum total load is studied.
The methods and main conclusions adopted in this paper are as follows:
Firstly, in order to solve the problem of crew licence allocation optimization under the objective of production security, this paper proposes a solution construction algorithm, which can directly construct the optimal solution for a certain type of problem, and obtain the feasible solution with the maximum difference of 1/n0 from the optimal solution for other types of problems. Here N0 is the minimum number of demand for different types of aircraft production. Value.
Secondly, in the problem of optimizing the licence allocation of cabin crew with the maximal production guarantee and balanced per capita income, this paper abstracts the problem into a one-dimensional packing problem in which each box contains the same number of items, but the types of items are different. A greedy algorithm based on LPT algorithm is proposed and K < 2 is obtained. The optimal solution is given; k2, the worst case performance ratio is 2-M-1. Here, K is the number of type licenses available to the crew, and M is the total number of crew members.
Thirdly, in the research of task scheduling for dispatch and release seats based on minimum peak load, this paper describes the problem as a single machine scheduling problem with priority task scheduling. Each task has an arrival time, deadline and processing time. The goal is to maximize the peak load of the machine without delay in completing the task. Small, and put forward an effective algorithm, and proved that the algorithm of the task scheduling plan is the best arrangement.
Fourthly, two VNS algorithms, VND and RVNS, are used to solve the task allocation problem between dispatch and release jobs. In the process of solving the problem, two kinds of domain selection methods, insertion and exchange type jobs, are defined and used in the domain search algorithm. The modified parallel machine scheduling heuristic algorithm proposed by Vazirani is used to solve the problem. Finally, we use the flight release data of an airline to evaluate the effectiveness of our algorithm. The results of a case show that both VND and RVNS can provide stable and good results.
The main innovations of this paper are as follows: firstly, for the first time, the problem of cabin crew licence allocation is modeled, and an efficient algorithm (solution construction algorithm and greedy algorithm based on LPT algorithm) is designed to solve it; secondly, the task allocation problem of flight dispatcher is modeled for the first time, and the optimal algorithm is designed to solve it.
【學(xué)位授予單位】：中國(guó)科學(xué)技術(shù)大學(xué)
【學(xué)位級(jí)別】：博士
【學(xué)位授予年份】：2012
【分類號(hào)】：F224;F562
本文編號(hào)：2185439
[Abstract]:In recent years, with the rapid development of the national economy and the gradual opening of the aviation market, the air traffic volume and flight range are expanding day by day, and the work of aviation safety management is becoming more and more important. All kinds of rules and procedures and other human factors, organization and management factors, but the most critical factor is "people". To strengthen the management of "people", the key lies in the management of key technical personnel involved in the flight safety chain. In this paper, the key technical personnel of cabin service and operation control department, cabin crew and flight dispatcher, are taken as the research object. From the safety point of view, the problems of cabin crew's model license planning and a series of problems related to flight dispatcher's production planning are studied. The main contents of the paper are as follows:
Firstly, based on the maximum degree of production security and the goal of balancing the per capita income of the flight attendants, this paper studies the problem of aircrew type licensing planning and determines the number of crew members for each type licensing combination under the conditions of meeting the production task requirements and limiting the number of crew service types. This paper divides the problem of crew licence planning into two parts: crew demand estimation and crew licence allocation optimization, and mainly studies the problem of crew licence allocation optimization.
(1) Optimizing the allocation of crew type licences with limited number of crew service aircraft under the maximum degree of production security. Production security is the evaluation index of production operation security for the scheme of crew type licences.
(2) Optimizing the allocation of crew type licences to meet the constraints of production security and the number of crew service aircraft under the goal of per capita income balance.
Two, for the flight dispatchers, the main contents of the study are:
(1) Characterize the workload of flight dispatchers, get the peak time of dispatching workload, and analyze the flight composition with high peak load dispatching seats, so as to provide support for the rational allocation of routes.
(2) The work intensity of the assigned and released seats is represented by the workload of the unit time interval of the seats. The task scheduling problem of the assigned and released seats based on the minimum peak load is studied, and the work schedule with the minimum peak load of the released seats is obtained, which provides decision support for the rational allocation of the released tasks between seats.
(3) Given the set of dispatched and released seats, the task allocation problem between dispatched and released seats with the minimum peak load and the minimum total load is studied.
The methods and main conclusions adopted in this paper are as follows:
Firstly, in order to solve the problem of crew licence allocation optimization under the objective of production security, this paper proposes a solution construction algorithm, which can directly construct the optimal solution for a certain type of problem, and obtain the feasible solution with the maximum difference of 1/n0 from the optimal solution for other types of problems. Here N0 is the minimum number of demand for different types of aircraft production. Value.
Secondly, in the problem of optimizing the licence allocation of cabin crew with the maximal production guarantee and balanced per capita income, this paper abstracts the problem into a one-dimensional packing problem in which each box contains the same number of items, but the types of items are different. A greedy algorithm based on LPT algorithm is proposed and K < 2 is obtained. The optimal solution is given; k2, the worst case performance ratio is 2-M-1. Here, K is the number of type licenses available to the crew, and M is the total number of crew members.
Thirdly, in the research of task scheduling for dispatch and release seats based on minimum peak load, this paper describes the problem as a single machine scheduling problem with priority task scheduling. Each task has an arrival time, deadline and processing time. The goal is to maximize the peak load of the machine without delay in completing the task. Small, and put forward an effective algorithm, and proved that the algorithm of the task scheduling plan is the best arrangement.
Fourthly, two VNS algorithms, VND and RVNS, are used to solve the task allocation problem between dispatch and release jobs. In the process of solving the problem, two kinds of domain selection methods, insertion and exchange type jobs, are defined and used in the domain search algorithm. The modified parallel machine scheduling heuristic algorithm proposed by Vazirani is used to solve the problem. Finally, we use the flight release data of an airline to evaluate the effectiveness of our algorithm. The results of a case show that both VND and RVNS can provide stable and good results.
The main innovations of this paper are as follows: firstly, for the first time, the problem of cabin crew licence allocation is modeled, and an efficient algorithm (solution construction algorithm and greedy algorithm based on LPT algorithm) is designed to solve it; secondly, the task allocation problem of flight dispatcher is modeled for the first time, and the optimal algorithm is designed to solve it.
【學(xué)位授予單位】：中國(guó)科學(xué)技術(shù)大學(xué)
【學(xué)位級(jí)別】：博士
【學(xué)位授予年份】：2012
【分類號(hào)】：F224;F562
【參考文獻(xiàn)】
相關(guān)期刊論文 前10條
1 滕鳳云;伍文鋼;;論如何加強(qiáng)企業(yè)“一專多能”人才培養(yǎng)[J];包鋼科技;2007年01期
2 付令;;談?wù)労炁蓡T的職業(yè)訓(xùn)練[J];港航論壇;2007年02期
3 高翠翠;朱麗娟;李春燕;;空中乘務(wù)員心理素質(zhì)測(cè)評(píng)量表的編制[J];中國(guó)健康心理學(xué)雜志;2009年06期
4 陳治懷;;空中交通管制環(huán)境中的工作負(fù)荷與能力估計(jì)[J];空中交通管理;2000年06期
5 李丹陽(yáng);;空中交通管制員工作負(fù)荷的隊(duì)列模型分析方法[J];空中交通管理;2007年12期
6 張學(xué)文;;基于管制員工作負(fù)荷的空域容量評(píng)估[J];空中交通管理;2008年11期
7 劉志森;航空公司的飛行簽派與運(yùn)行成本[J];中國(guó)民航飛行學(xué)院學(xué)報(bào);2001年01期
8 羅鳳娥;改進(jìn)和完善我國(guó)飛行簽派員培訓(xùn)體系[J];中國(guó)民航飛行學(xué)院學(xué)報(bào);2002年04期
9 謝春生;趙煜;韓紅蓉;;簽派工作中的人為因素分析[J];中國(guó)民航飛行學(xué)院學(xué)報(bào);2007年05期
10 戴維東;謝進(jìn)一;;完善飛行簽派員的培養(yǎng)和激勵(lì)機(jī)制[J];中國(guó)民用航空;2005年12期
相關(guān)碩士學(xué)位論文 前2條
1 饒?jiān)撇?航空公司乘務(wù)員排班系統(tǒng)的優(yōu)化算法研究及設(shè)計(jì)實(shí)現(xiàn)[D];電子科技大學(xué);2006年
2 陳雷廷;航空公司安全危機(jī)管理研究[D];貴州大學(xué);2008年
，本文編號(hào)：2185439
本文鏈接：http://sikaile.net/jingjilunwen/jtysjj/2185439.html
最近更新
教材專著
