پایان نامه تلفیق الگوریتم رقابت استعماری و انتخاب سریع زمان آماد سازی در حل مسأله برنامه ریزی توالی هواپیما ها

فهرست:

مقدمه طرح پیشنهادی.................................................................................................................................... 1

 1-1- مقدمه...................................................................................................................................................... 2

 1-2- طرح موضوع............................................................................................................................................. 4

 1-3- مفروضات، محدودیت­ها........................................................................................................................... 6

 1-4- اهداف تحقیق........................................................................................................................................... 8

 1-5- جنبه­ی جدید بودن و نوآوری................................................................................................................. 9

 1-6- نتایج حاصل از تحقیق............................................................................................................................. 9

 1-7- ساختار پایان­نامه.................................................................................................................................. 10

2- مروری بر کارهای گذشته.................................................................................................................... 11

 2-1- مقدمه.................................................................................................................................................. 12

 2-2- توالی فرود هواپیما.............................................................................................................................. 12

 2-3- تخصیص ورودی مسافری................................................................................................................... 15

 2-4- پیشینه تحقیق.................................................................................................................................... 17

 2-5- مدل برنامه­ریزی خطی برنامه............................................................................................................ 21

3- روش پیشنهادی.................................................................................................................................... 25

 3-1- راه­کار پیشنهادی................................................................................................................................. 26

 3-2- الگوریتم تکاملی.................................................................................................................................. 26

 3-2-1- مقدمه............................................................................................................................................. 26

 3-2-2- علت استفاده از الگوریتم‌های تکاملی........................................................................................... 29

 3-2-3- انواع الگوریتم‌های تکاملی............................................................................................................. 29

 3-3- الگوریتم رقابت استعماری.................................................................................................................. 32

 3-3-1- شکل­دهی امپراطوری اولیه............................................................................................................ 34

 3-3-2- مدل‌سازی سیاست جذب............................................................................................................. 38

 3-3-3- جابجایی موقعیت مستعمره و امپرالیسست................................................................................. 41

 3-3-4- قدرت کل یک امپراطوری.............................................................................................................. 42

 3-3-5- رقابت استعماری............................................................................................................................ 43

 3-3-6- سقوط امپراطوری­های ضعیف....................................................................................................... 46

 3-3-7- همگرایی........................................................................................................................................ 46

 3-4- الگوریتم رقابت استعماری اصلاحی................................................................................................... 48

 3-5- الگوریتم‌های ترکیبی بکار رفته.......................................................................................................... 51

4- ارزیابی سیستم..................................................................................................................................... 53

 4-1- مقدمه.................................................................................................................................................. 54

 4-2- مدل‌سازی روش پیشنهادی............................................................................................................... 55

 4-3- ارزیابی راه­کار پیشنهادی.................................................................................................................... 56

 4-4- مسائل مورد مقایسه............................................................................................................................ 59

 4-4-1- مقایسه نتایج پروازهای ورودی و خروجی به تعداد 15.............................................................. 59

 4-4-2- مقایسه نتایج پروازهای ورودی و خروجی به تعداد 20.............................................................. 61

 4-4-3- مقایسه نتایج پروازهای ورودی و خروجی به تعداد 25.............................................................. 62

5- نتیجه­گیری و ارائه پیشنهاد‌ها........................................................................................................... 64

 5-1- جنبه نوآوری....................................................................................................................................... 65

 5-2- نتیجه مقایسه نتایج........................................................................................................................... 65

 5-3- پیشنهاد‌ها........................................................................................................................................... 66

6- مراجع...................................................................................................................................................... 67

منبع:

David Gianazza,Kevin Guittet. (2009).selection and evaluation of air traffic complexity metrics.

 Nils Boysen, Malte Fliedner. (2011). Scheduling aircraft landings to balance workload of ground staff. Computers & Industrial Engineering 60,206-217

David Gianazza, Jean-Marc Alliot Géraud Granger. (2012).Optimal combinations of Air Traffic Control sectors using classical and stochastic methods

M.A.Christodoulou and C.Kontogeorgou. (2008). A novel algorithm for collision avoidance in commercial aircraft using neural networks and non-linear programming. 16th Mediterranean Conference on Control and Automation Congress Centre, 25-27

Gustafsolveling, Senay Solak, John-Paul B. Clarke, Ellis L.Johnson. (2011).Scheduling of runway operations for reduced environmental impact.Transportation ResearchPartD

Marcella Samà, Andrea D’Ariano, Dario Pacciarelli. (2013). Rolling Horizon Approach for Aircraft Scheduling in the Terminal Control Area of Busy Airports. Social and Behavioral Sciences80.531 – 552

Marcella Samà, Andrea D’Ariano, Dario Pacciarelli. (2012). Optimal aircraft traffic flow management at a terminal control area during disturbances

Gulsah Hancerliogullari, Ghaith Rabadi, Ameer H. Al-Salem,Mohamed Kharbeche. (2013) Greedy algorithms and metaheuristics for a multiple runway combined arrival-departure aircraft sequencing problem. Journal of Air Transport Management 32, 39-48

Zheng Lei, Zhang Jun, Zhu Yanbo. (2009).Affinity Propagation Clustering Classification Method For Aircraft In Arrival And Departure Sequencing

Salvatore Capri, Matteo Ignaccolo, (2004), Genetic algorithms for solving the aircraft-sequencing problem:the introduction of departures into the dynamic model, Journal of Air Transport Management 10 (2004) 345–351

Bennell, J. A. Mesgarpour, M. Potts, C. N. (2011). Airport runway scheduling, OR:Quartterly Journal of Operations Research, 9(2), 115-138

Dear, R. G. (1976). The dynamic scheduling of aircraft in the near terminal area. MIT Flight TransportationLaboratory Report R76-9, MIT, Cambridge, MA, USA.

Psaraftis, H. N. (1980). Dynamic programming approach for sequencing group of identified jobs, Operations Research, 28, 1347-1359.

Bianco, L. Rinaldi, G. & Sassano, A. (1987). A combinatorial optimization approach to aircraft sequencing problem. Flow Control of Congested Networks. NATO AS I series, 38, 323-339.

Bianco, L. Dell'Olmo, P. & Giordani, S. (1997). Scheduling models and algorithms for TMA traffic management. Modeling and Simulation in Air Traffic Management. Springer, 139-167.

Beasley, J. E. Krishnamoorthy, M. Sharaiha, Y. M. Abramson, D. (2000). Scheduling aircraft landings-the static case, Transportation Science, 34(2), 180-197.

Wen, M. Larsen, J. Clausen, J. (2005). An exact algorithm for Aircraft Landing Problem, Technical University of Denmark.

Gupta, G. Malik, W. and Jung, Y. C. (2009). A mixed integer linear program for airport departure scheduling, 9th AIAA Aviation Technology, Integration, andOperations Conference (ATIO). AIAA, Hilton Head, South Carolina.

Sherali, H. D. Ghoniem, A. Baik, H. Trani, A. A. and (2012). Enhanced formulations for a combined arrival-departure aircraft sequencing problem, Manuscript, Grado Department of Industrial and Systems Engineering (0118). Virginia Polytechnic Institute and State University, 250 Durham Hall, Blacksburg, VA 24061.

Dear, R. G. & Sherif,Y.S. (1989). The dynamic scheduling of aircraft in high density terminal areas. Microelectrons Reliability, 29, 743–749.

Dear, R. G. and Y. S. Sherif (1991). An algorithm for computer assisted sequencing and scheduling of terminal area operations, Transportation Research, 25A:129-139.

Yu, S. P. Cao, X. B. Zhang, J. (2011). A real-time schedule method for aircraft landing scheduling problem based on cellular automaton, Applied Soft Computing Journal.

Beasley, J. E. Krishnamoorthy, M. Sharaiha, Y. M. Abramson, D. (2000). Scheduling aircraft landings-the static case, Transportation Science, 34(2), 180-197.

Beasley, J. J. Sonander and P. Havelock (2001). Scheduling aircraft landings at London Heathrow using a population heuristic, Journal of the Operational Research Society, 52, 483-493

Hu, X. B. and Chen, W. H. (2005). Genetic algorithm based on receding horizon control for arrival sequencing and scheduling, Eng. Appl. Artif. Intell. 18(5), 633–642.

Hu, X. B. and Paolo, E. D. (2008). Binary-representation-based genetic algorithm for aircraft arrival sequencing and scheduling, IEEE Transactions on Intelligent Transportation System, 9(2), 301–310

Liu, Y. H. (2010). A genetic local search algorithm with a threshold accepting mechanism for solving with a threshold accepting mechanism for solving the runway dependent aircraft landing problem, Optimization Letters,5(2), 229-245.

Atkin, J.A.D. Burke, E.K. Greenwood, J.S. and Reeson, D. (2007). Hybrid metaheuristics to aid runway scheduling at London Heathrow Airport, Transportation Science, 41 (1), 90-106

Atkin, J.A.D. Burke, E.K. Greenwood, J.S. and Reeson, D. (2008). A meta-heuristic approach to departure scheduling at London Heathrow airport, Computer Aided Systems of Public Transport.

Lee, Y. H. & Pinedo, M. (1997). Theory and methodology: Scheduling jobs on parallel machines with sequence-dependent setup times. European Journal of Operational Research,100,464-474.

Pfund, M. Fowler, J. W. Gadkari, A. & Chen, Y. (2008). Scheduling jobs on parallel machines with setup times and ready times, Computers and Industrial Engineering, 54, 764–782.

Chen, J. F, (2009). Scheduling on unrelated parallel machines with sequence- and machine-dependent setup times and due-date constraints. International Journal of Advanced Manufacturing Technologies, 44, 1204-1212

Lin, S. W. Lu, C. C.Ying, K. C. (2011). Minimization of total tardiness on unrelated parallel machines with sequence-and machine-dependent setup times under due date constraints. International Journal of Advanced Manufacturing Technologies, 53, 353-361.

Salvatore Capri, Matteo Ignaccolo, (2004), Genetic algorithms for solving the aircraft-sequencing problem:the introduction of departures into the dynamic model, Journal of Air Transport Management 10 (2004) 345–351

Xiao-Bing Hu, Ezequiel Di Paolo, )2009( An efficient genetic algorithm with uniform crossover for air traffic control, Computers & Operations Research, Volume 36, Issue 1, Pages 245-259, ISSN 0305-0548

[36] Al-Rifaia, M، H. Rossetti, M. (2007), "An efficient heuristic optimization algorithm for a two-echelon (R, Q) inventory system ".Int. J. Production Economics, 109, 195–213

Atashpaz-Gargari, E. Lucas, C. (2007), "Imperialist Competitive Algorithm: An algorithm for optimization inspired by imperialistic competition", IEEE Congress on Evolutionary Computation, Singapore.

Majid Yousefikhoshbakht, Farzad didehvar, Farhad Rahmati, (2012) Application a Modified Imperialist Competitive Algorithm for Solving the Traveling Salesman Problem Young Researchers Club, Hamedan Branch, Islamic Azad University,Hamedan, Iran, College of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran

Rabadi, G. Hancerliogullari, G. Kharbeche, M. Al-Salem, A. (2012). Meta-heuristics for Aircraft Arrival and Departure Scheduling on Multiple Runways

Ghoniem, A. Farhadi, F. (2012). Multiple-runway aircraft sequencing problems: Enhanced formulations and accelerated column generation Approach, Manuscript, Isenberg School of Management, University of Massachusetts, Amherst, USA.