Дисертації з теми "Pole assignment Mathematical models"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-21 дисертацій для дослідження на тему "Pole assignment Mathematical models".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
譚熙嘉 and Hei-Ka Patrick Tam. "Optimization approaches to robust pole assignment in control system design." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1998. http://hub.hku.hk/bib/B3123933X.
Повний текст джерелаFung, Wen-chi Sylvia, and 馮韻芝. "Calibration and validation of transit network assignment models." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2005. http://hub.hku.hk/bib/B34624211.
Повний текст джерела張詠敏 and Wing-man Cheung. "Dynamic traffic assignment for congested highway network." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2001. http://hub.hku.hk/bib/B42575886.
Повний текст джерелаAbdelghany, Ahmed F. "Dynamic micro-assignment of travel demand with activity/trip chains." Full text (PDF) from UMI/Dissertation Abstracts International Access restricted to users with UT Austin EID, 2001. http://wwwlib.umi.com/cr/utexas/fullcit?p3023538.
Повний текст джерелаWu, Mingqin, and 吴明琴. "Essays on job assignment and social security." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2011. http://hub.hku.hk/bib/B46090873.
Повний текст джерелаJiang, Yu, and 姜宇. "Reliability-based transit assignment : formulations, solution methods, and network design applications." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2014. http://hdl.handle.net/10722/207991.
Повний текст джерелаWong, Tse-chiu, and 黃資超. "An iterative genetic algorithm-based approach to machine assignment problems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2004. http://hub.hku.hk/bib/B3035710x.
Повний текст джерелаWang, Yinhua. "Fleet assignment, eulerian subtours and extended steiner trees." Diss., Georgia Institute of Technology, 1995. http://hdl.handle.net/1853/24922.
Повний текст джерелаErnst, Wolfgang F. "The economic rationale for stochastic urban transport models and travel behaviour : a mathematical programming approach to quantitative analysis with Perth data." UWA Business School, 2003. http://theses.library.uwa.edu.au/adt-WU2005.0004.
Повний текст джерелаLloyd, Evan Robert. "A model for the economic analysis of road projects in an urban network with interrelated incremental traffic assignment method." University of Western Australia. Economics Discipline Group, 2005. http://theses.library.uwa.edu.au/adt-WU2005.0083.
Повний текст джерелаAl-Malik, Mohammed Saleh. "An investigation and development of a combined traffic signal control-traffic assignment model." Diss., Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/21425.
Повний текст джерелаHwang, Kuo-Ping. "Applying heuristic traffic assignment in natural disaster evacuation: a decision support system." Diss., Virginia Polytechnic Institute and State University, 1986. http://hdl.handle.net/10919/54455.
Повний текст джерелаPh. D.
Ak, Aykagan. "Berth and quay crane scheduling problems, models and solution methods /." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/26652.
Повний текст джерелаCommittee Chair: Erera, Alan L.; Committee Member: Ergun, Ozlem; Committee Member: Savelsbergh, Martin; Committee Member: Tetali, Prasad; Committee Member: White III, Chelsea C.. Part of the SMARTech Electronic Thesis and Dissertation Collection.
Smalley, Hannah Kolberg. "Optimization methods for physician scheduling." Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/50124.
Повний текст джерелаPhokomela, Prince Lerato. "Non-linear integer programming fleet assignment model." Thesis, 2016. http://hdl.handle.net/10539/22330.
Повний текст джерелаGiven a flight schedule with fixed departure times and cost, solving the fleet assignment problem assists airlines to find the minimum cost or maximum revenue assignment of aircraft types to flights. The result is that each flight is covered exactly once by an aircraft and the assignment can be flown using the available number of aircraft of each fleet type. This research proposes a novel, non-linear integer programming fleet assignment model which differs from the linear time-space multi-commodity network fleet assignment model which is commonly used in industry. The performance of the proposed model with respect to the amount of time it takes to create a flight schedule is measured. Similarly, the performance of the time-space multicommodity fleet assignment model is also measured. The objective function from both mathematical models is then compared and results reported. Due to the non-linearity of the proposed model, a genetic algorithm (GA) is used to find a solution. The time taken by the GA is slow. The objective function value, however, is the same as that obtained using the time-space multi-commodity network flow model. The proposed mathematical model has advantages in that the solution is easier to interpret. It also simultaneously solves fleet assignment as well as individual aircraft routing. The result may therefore aid in integrating more airline planning decisions such as maintenance routing.
MT2017
Abdelghany, Khaled Faissal Said 1970. "Stochastic dynamic traffic assignment for intermodal transportation networks with consistent information supply strategies." 2001. http://hdl.handle.net/2152/10461.
Повний текст джерела"Goal programming approach for channel assignment formulation and schemes." 2005. http://library.cuhk.edu.hk/record=b5892633.
Повний текст джерелаThesis (M.Phil.)--Chinese University of Hong Kong, 2005.
Includes bibliographical references (leaves 70-74).
Abstracts in English and Chinese.
Abstract --- p.i
Acknowledgement --- p.iii
Preface --- p.x
Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- Multiple Access --- p.1
Chapter 1.1.1 --- Time Division Multiple Access --- p.2
Chapter 1.1.2 --- Frequency Division Multiple Access --- p.3
Chapter 1.1.3 --- Code Division Multiple Access --- p.3
Chapter 1.1.4 --- Hybrid Multiple Access Scheme --- p.4
Chapter 1.2 --- Goal Programming --- p.5
Chapter 2 --- Previous Works in Channel Assignment --- p.10
Chapter 2.1 --- Voice Service Network --- p.10
Chapter 2.2 --- Data Network --- p.11
Chapter 2.2.1 --- Throughput Optimization --- p.13
Chapter 2.2.2 --- Channel Assignment Schemes with QoS Consideration --- p.14
Chapter 3 --- General Channel Assignment Scheme --- p.16
Chapter 3.1 --- Baseline Model --- p.17
Chapter 3.2 --- Goal Ranking --- p.22
Chapter 3.3 --- Model Transformation --- p.22
Chapter 3.4 --- Proposed Algorithms --- p.23
Chapter 3.4.1 --- Channel Swapping Algorithm --- p.24
Chapter 3.4.2 --- Best-First-Assign Algorithm --- p.26
Chapter 4 --- Special Case Algorithms --- p.28
Chapter 4.1 --- Single Order of Selection Diversity --- p.28
Chapter 4.1.1 --- System Model --- p.29
Chapter 4.1.2 --- Proposed Algorithm --- p.30
Chapter 4.1.3 --- Extension of Algorithm --- p.31
Chapter 4.2 --- Single Channel Assignment --- p.32
Chapter 4.2.1 --- System Model --- p.33
Chapter 4.2.2 --- Proposed Algorithms --- p.34
Chapter 5 --- Performance Evaluation --- p.37
Chapter 5.1 --- General Channel Assignment and Single Channel Assignment --- p.37
Chapter 5.1.1 --- System Model --- p.38
Chapter 5.1.2 --- Lower Bound of Weighted Sum of Unsatisfactory Function --- p.40
Chapter 5.1.3 --- Performance Evaluation I --- p.41
Chapter 5.1.4 --- Discussion --- p.44
Chapter 5.1.5 --- Performance Evaluation II --- p.44
Chapter 5.2 --- Single Order of Selection Diversity Algorithm --- p.47
Chapter 5.2.1 --- System Model --- p.47
Chapter 5.2.2 --- Performance Evaluation I --- p.49
Chapter 5.2.3 --- Performance Evaluation II --- p.53
Chapter 6 --- Conclusion and Future Works --- p.58
Chapter 6.1 --- Conclusion --- p.58
Chapter 6.2 --- Future Works --- p.60
Chapter 6.2.1 --- Multi-cell Channel Assignment --- p.60
Chapter 6.2.2 --- Theoretical Studies --- p.62
Chapter 6.2.3 --- Adaptive Algorithms --- p.62
Chapter 6.2.4 --- Assignment of Non-orthogonal Channels --- p.63
Chapter A --- Proof of Proposition 3.1 --- p.64
Chapter B --- Proof of Proposition 4.1 --- p.66
Chapter C --- Assignment Problem --- p.68
Bibliography --- p.74
"An improved tabu search for airport gate assignment." 2009. http://library.cuhk.edu.hk/record=b5896584.
Повний текст джерелаThesis (M.Phil.)--Chinese University of Hong Kong, 2009.
Includes bibliographical references (p. 115-118).
Abstract also in Chinese.
Chapter 1 --- Introduction --- p.9
Chapter 1.1 --- The Gate Assignment Problem --- p.9
Chapter 1.2 --- Contributions --- p.10
Chapter 1.3 --- Formulation of Gate Assignment Problem --- p.11
Chapter 1.4 --- Organization of Thesis --- p.13
Chapter 2 --- Literature Review --- p.15
Chapter 2.1 --- Introduction --- p.15
Chapter 2.2 --- Formulations of Gate Assignment Problems --- p.15
Chapter 2.2.1 --- Static Gate Assignment Model --- p.16
Chapter 2.2.1.1 --- Total Passenger Walking Distance --- p.17
Chapter 2.2.1.2 --- Waiting Time --- p.20
Chapter 2.2.1.3 --- Unassigned Flights --- p.21
Chapter 2.2.2 --- Stochastic and Robust Gate Assignment Model --- p.22
Chapter 2.2.2.1 --- Idle Time --- p.22
Chapter 2.2.2.2 --- Buffer Time --- p.23
Chapter 2.2.2.3 --- Flight Delays --- p.23
Chapter 2.2.2.4 --- Gate Conflicts --- p.24
Chapter 2.3 --- Solution Methodologies --- p.25
Chapter 2.3.1 --- Expert System Approaches --- p.25
Chapter 2.3.2 --- Optimization --- p.27
Chapter 2.3.2.1 --- Exact Methods --- p.27
Chapter 2.3.2.2 --- Heuristic Approaches --- p.28
Chapter 2.3.2.3 --- Meta-Heuristics Approaches --- p.29
Chapter 2.3.2.4 --- Tabu Search and Path Relinking --- p.31
Chapter 2.4 --- Current Practice of Gate Assignment Problems --- p.32
Chapter 2.5 --- Summary --- p.32
Chapter 3 --- Tabu Search --- p.34
Chapter 3.1 --- Introduction --- p.34
Chapter 3.2 --- Mathematical Model --- p.34
Chapter 3.3 --- Principles of Tabu Search --- p.36
Chapter 3.4 --- Neighborhood Structures --- p.38
Chapter 3.4.1 --- Insert Move --- p.38
Chapter 3.4.2 --- Exchange Move --- p.39
Chapter 3.5 --- Short Term Memory Structure --- p.41
Chapter 3.6 --- Aspiration Criterion --- p.42
Chapter 3.7 --- Intensification and Diversification Strategies --- p.43
Chapter 3.8 --- Tabu Search Framework --- p.45
Chapter 3.8.1 --- Initial Solution --- p.45
Chapter 3.8.2 --- Tabu Search Algorithm --- p.46
Chapter 3.9 --- Computational Studies --- p.52
Chapter 3.9.1 --- Parameters Tuning --- p.52
Chapter 3.9.1.1 --- Fine-tuning a Tabu Search Algorithm with Statistical Tests --- p.53
Chapter 3.9.1.2 --- Tabu Tenure --- p.54
Chapter 3.9.1.3 --- Move Selection Strategies --- p.56
Chapter 3.9.1.4 --- Frequency of Exchange Moves --- p.59
Chapter 3.9.2 --- Comparison the Fine-tuned TS with original TS --- p.62
Chapter 3.10 --- Conclusions --- p.63
Chapter 4 --- Path Relinking --- p.65
Chapter 4.1 --- Introduction --- p.65
Chapter 4.2 --- Principles of Path Relinking --- p.65
Chapter 4.2.1 --- Example of Path Relinking --- p.66
Chapter 4.3 --- Reference Set --- p.68
Chapter 4.3.1 --- Two-Reference-Set Implementation --- p.71
Chapter 4.3.1.1 --- Random Exchange Gate Move --- p.72
Chapter 4.4 --- Initial and Guiding Solution --- p.73
Chapter 4.5 --- Path-Building Process --- p.74
Chapter 4.6 --- Tabu Search Framework with Path Relinking --- p.78
Chapter 4.6.1 --- Computational Complexities --- p.82
Chapter 4.7 --- Computational Studies --- p.82
Chapter 4.7.1 --- Best Configuration for Path Relinking --- p.83
Chapter 4.7.1.1 --- Reference Set Strategies and Initial and Guiding Criteria --- p.83
Chapter 4.7.1.2 --- Frequency of Path Relinking --- p.86
Chapter 4.7.1.3 --- Size of Volatile Reference Set --- p.87
Chapter 4.7.1.4 --- Size of Non-volatile Reference Set --- p.89
Chapter 4.7.2 --- Comparisons with Other Algorithms --- p.94
Chapter 5 --- Case Study --- p.98
Chapter 5.1 --- Introduction --- p.98
Chapter 5.2 --- Airport Background --- p.98
Chapter 5.2.1 --- Layout of ICN --- p.98
Chapter 5.3 --- Data Preparation --- p.99
Chapter 5.3.1 --- Passenger Data --- p.103
Chapter 5.4 --- Computational Studies --- p.104
Chapter 5.4.1 --- Experiments without Airline Preference --- p.104
Chapter 5.4.2 --- Experiments with Airline Preference --- p.106
Chapter 5.4.2.1 --- Formulation --- p.106
Chapter 5.4.2.2 --- Results --- p.108
Chapter 5.5 --- Conclusion --- p.111
Chapter 6 --- Conclusion --- p.112
Chapter 6.1 --- Summary of Achievement --- p.112
Chapter 6.2 --- Future Developments --- p.113
Bibliography --- p.115
Appendix --- p.119
Chapter 1. --- Friedman´ةs Test --- p.119
Chapter 2. --- Wilcoxon's Signed Rank Test for Paired Observation --- p.120
Chapter 3. --- Hybrid Simulated Annealing with Tabu Search Approach --- p.121
Chapter 4. --- Arrival Flight Data of Incheon International Airport --- p.122
Chapter 5. --- Departure Flight Data of Incheon International Airport --- p.139
Unnikrishnan, Avinash 1980. "Equilibrium models accounting for uncertainty and information provision in transportation networks." 2008. http://hdl.handle.net/2152/17916.
Повний текст джерелаtext
Karoonsoontawong, Ampol. "Robustness approach to the integrated network design problem, signal optimization and dynamic traffic assignment problem." Thesis, 2006. http://hdl.handle.net/2152/2902.
Повний текст джерелаBloy, Leslie Arthur Keith. "An investigation into Braess' paradox." Thesis, 2007. http://hdl.handle.net/10500/2195.
Повний текст джерелаDecision Sciences
M.Sc.