by Xu Haoyu. / Thesis submitted in: July 2003. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (leaves 89-95). / Abstracts in English and Chinese. / Acknowledgement --- p.i / Abstract --- p.ii / 摘要 --- p.iii / Contents --- p.iv / List of Abbreviations --- p.vii / List of Tables --- p.viii / List of Figures --- p.ix / Chapter Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Background --- p.2 / Chapter 1.1.1 --- Routing --- p.2 / Chapter 1.1.2 --- Ant Colony Optimization --- p.6 / Chapter 1.2 --- Research Statement --- p.8 / Chapter 1.3 --- Main Contributions --- p.10 / Chapter 1.4 --- Thesis Organization --- p.11 / Chapter Chapter 2 --- Ant Colony Optimization Routing --- p.12 / Chapter 2.1 --- ACO Routing Algorithms --- p.13 / Chapter 2.1.1 --- ACO Routing Algorithms in Circuit-Switched Networks --- p.13 / Chapter 2.1.2 --- ACO Routing Approaches in Packet-Switched Networks --- p.16 / Chapter 2.2 --- ACO Routing and Traditional Routing Algorithms --- p.23 / Chapter 2.3 --- ACO Routing and Optimal Routing Algorithms --- p.26 / Chapter Chapter 3 --- Reactive Ant Colony Optimization --- p.31 / Chapter 3.1 --- Problem Model --- p.31 / Chapter 3.2 --- RACO Routing Approach --- p.35 / Chapter 3.2.1. --- Node and Probabilistic Routing Table --- p.36 / Chapter 3.2.2. --- Ants --- p.38 / Chapter 3.2.3 --- Detailed Description of RACO routing approach --- p.43 / Chapter Chapter 4 --- Simulation Results --- p.45 / Chapter 4.1 --- Experiment Design --- p.45 / Chapter 4.1.1 --- Topology --- p.46 / Chapter 4.1.2 --- Network Layers --- p.48 / Chapter 4.2 --- Results --- p.50 / Chapter 4.2.1 --- NSFNET --- p.50 / Chapter 4.2.2 --- ARPANET --- p.52 / Chapter 4.3 --- Discussion --- p.53 / Chapter Chapter 5 --- Convergence Analysis --- p.58 / Chapter 5.1. --- Related Work --- p.59 / Chapter 5.2 --- "Two-Node, Two-Path Model" --- p.61 / Chapter 5.3 --- The Recursive Pheromone Values --- p.64 / Chapter 5.4 --- Pheromone Convergence --- p.70 / Chapter 5.5 --- General Models --- p.81 / Chapter 5.5.1 --- "Two - Node, N - Path Model" --- p.81 / Chapter 5.5.2 --- "M- Node, N(i.j) - Path Model" --- p.83 / Chapter 5.6. --- Conclusion and Discussion --- p.84 / Chapter Chapter 6 --- Conclusion and Future Work --- p.86 / Chapter 6.1 --- Conclusion --- p.86 / Chapter 6.2 --- Future Work --- p.87 / Reference --- p.89 / Appendices --- p.96 / "Appendix 1 The Detailed Form of P = f1（a,b) and Q = f2（a,b)" --- p.96 / "Appendix 2 To Validate Whether f1（a,b) in the Domain of (0,1)" --- p.102

Sun Weng Hong. / Thesis submitted in: October 2002. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2003. / Includes bibliographical references (leaves 116-121). / Abstracts in English and Chinese. / Chapter 1. --- Introduction --- p.7 / Chapter 2. --- Ant Colony Optimization (ACO) --- p.9 / Chapter 2.1 --- ACO vs. Traditional Routing --- p.10 / Chapter 2.1.1 --- Routing information --- p.10 / Chapter 2.1.2 --- Routing overhead --- p.12 / Chapter 2.1.3 --- Adaptivity and Stagnation --- p.14 / Chapter 2.2 --- Approaches to Mitigate Stagnation --- p.15 / Chapter 2.2.1 --- Pheromone control --- p.15 / Chapter 2.2.1.1 --- Evaporation: --- p.15 / Chapter 2.2.1.2 --- Aging: --- p.16 / Chapter 2.2.1.3 --- Limiting and smoothing pheromone: --- p.17 / Chapter 2.2.2 --- Pheromone-Heuristic Control --- p.18 / Chapter 2.2.3 --- Privileged Pheromone Laying --- p.19 / Chapter 2.2.4 --- Critique and Comparison --- p.21 / Chapter 2.2.4.1 --- Aging --- p.22 / Chapter 2.2.4.2 --- Limiting pheromone --- p.22 / Chapter 2.2.4.3 --- Pheromone smoothing --- p.23 / Chapter 2.2.4.4 --- Evaporation --- p.25 / Chapter 2.2.4.5 --- Privileged Pheromone Laying --- p.25 / Chapter 2.2.4.6 --- Pheromone-heuristic control --- p.26 / Chapter 2.3 --- ACO in Routing and Load Balancing --- p.27 / Chapter 2.3.1 --- Ant-based Control and Its Ramifications --- p.27 / Chapter 2.3.2 --- AntNet and Its Extensions --- p.35 / Chapter 2.3.3 --- ASGA and SynthECA --- p.40 / Chapter 3. --- Multiple Ant Colony Optimization (MACO) --- p.45 / Chapter 4. --- MACO vs. ACO --- p.51 / Chapter 4.1 --- Analysis of MACO vs. ACO --- p.53 / Chapter 5. --- Applying MACO in Load Balancing --- p.89 / Chapter 5.1 --- Applying MACO in Load-balancing --- p.89 / Chapter 5.2 --- Problem Formulation --- p.91 / Chapter 5.3 --- Types of ant in MACO --- p.93 / Chapter 5.3.1 --- Allocator. --- p.94 / Chapter 5.3.2 --- Destagnator. --- p.95 / Chapter 5.3.3 --- Deallocator. --- p.100 / Chapter 5.4 --- Global Algorithm --- p.100 / Chapter 5.5 --- Discussion of the number of ant colonies --- p.103 / Chapter 6. --- Experimental Results --- p.105 / Chapter 7. --- Conclusion --- p.114 / Chapter 8. --- References --- p.116 / Appendix A. Ants in MACO --- p.122 / Appendix B. Ants in SACO. --- p.123

Maintenance of power plants is aimed at extending the life and reducing the risk of sudden breakdown of power generating units. Traditionally, power generating units have been scheduled for maintenance in periods to ensure that the demand of the system is fully met and the reliability of the system is maximized. However, in a deregulated power industry, the pressure of maintaining generating units is also driven by the potential revenue received by participating in the electricity market. Ideally, hydropower generating units are required to operate during periods when electricity prices are high and to be able to be taken offline for maintenance when the price is low. Therefore, determination of the optimum time periods for maintenance of generating units in a power system has become an important task from both a system reliability and an economic point of view. Due to the extremely large number of potential maintenance schedules, a systematic approach is required to ensure that optimal or near-optimal maintenance schedules are obtained within an acceptable timeframe. Metaheustics are high-level algorithmic frameworks that aim to solve combinatorial optimisation problems with a large search space in a reasonable computational run time. Inspired by the foraging behavior of ant colonies, Ant Colony Optimisation (ACO) is a relatively new metaheuristic for combinatorial optimisation. The application of ACO to a number of different applications has provided encouraging results when applied to scheduling, including the job-shop, flow-shop, machine tardiness and resource-constrained project scheduling problems. In this thesis, a formulation is developed that enables ACO to be applied to the generalized power plant maintenance scheduling optimisation (PPMSO) problem. The formulation caters for all constraints generally encountered as part of real-world PPMSO problems, including system demands and reliability levels, precedence rules between maintenance tasks, public holidays and minimum outage durations in the case of shortening of maintenance tasks. As part of the formulation, a new heuristic and a new local search strategy have been developed. The new ACO-PPMSO formulation has been tested extensively on two benchmark PPMSO problems from the literature, including a 21-unit and a 22-unit problem. It was found that the ACOPPMSO formulation resulted in significant improvements in performance for both case studies compared with the results obtained in previous studies. In addition, the new heuristic formulation was found to be useful in finding maintenance schedules that result in more evenly spread reserve capacity and resource allocations. When tested using a modified version of the 21-unit and the 22-unit problems, the new local search strategy specifically designed for duration shortening was found to be effective in searching locally for maintenance schedules that require minimal shortening of outage duration. The ACO-PPMSO formulation was also successfully able to cater for all constraints as specified in both original and the modified versions of the two benchmark case studies. In order to further test the ACO-PPMSO formulation developed, it was first applied to a scaled-down version of the Hydro Tasmania hydropower system (five power stations) and then to the full system (55 generating units). As part of the studies, the ACO-PPMSO formulation was linked with the simulation model used by Hydro Tasmania to assess the impact of various maintenance schedules on the total energy in storage of the system at the end of the planning horizon, the total thermal generation, the total number of days where the reliability level is not met, as well as the total unserved energy throughout the planning horizon. A number of constraints were considered, including the anticipated system demands, a 30% capacity reliability level, the minimum and maximum durations between related maintenance tasks, the precedence constraints and the minimum outage duration of each task in the case of shortening of maintenance tasks. The maintenance schedule was optimised for the maximum end-of-horizon total energy in storage, the minimum thermal generation and the minimum total outage durations shortened and deferred, under 77 different inflow conditions. The optimal maintenance schedule obtained compared favourably with that obtained by Hydro Tasmania over many years based on experience. Specifically, the ACO-PPMSO schedule results in higher end-of-horizon total energy in storage and satisfies both hard and soft constraints, which overall equates to over $0.5 million dollars of savings when compared to the schedule obtained using the practitioners’ experience and engineering judgment. The ACO-PPMSO algorithm was also shown to be a useful decision-making tool for scheduling maintenance under different circumstances when tested with four scenarios commonly encountered in practical maintenance scheduling problems. In conclusion, the ACO-PPMSO formulation developed, tested and applied as part of this thesis research provides a powerful and flexible means of obtaining optimal or near-optimal maintenance schedules for power plants. / http://proxy.library.adelaide.edu.au/login?url= http://library.adelaide.edu.au/cgi-bin/Pwebrecon.cgi?BBID=1294672 / Thesis (Ph.D.) -- University of Adelaide, School of Civil and Environmental Engineering, 2007

Orientadores: Antonio Carlos Moretti, Luis Leduino de Salles Neto / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Computação Cientifica / Made available in DSpace on 2018-08-15T18:13:59Z (GMT). No. of bitstreams: 1 Marciniuk_FernandaLedo_M.pdf: 1221484 bytes, checksum: b1408936331c027b4c3cc1129bc0105a (MD5) Previous issue date: 2010 / Resumo: O problema de corte de estoque ordenado, um problema relativamente novo na literatura, e uma adaptação do problema de corte de estoque tradicional onde algumas restrições quanto a limitação do numero de ordens de produção em processamento são adicionadas. Esta dissertação tem como objetivo estudar uma nova abordagem deste problema utilizando uma aplicação da metaheurística colônia de formigas. Esta metaheurística utiliza os princípios de auto-organização de uma população de formigas visando a resolução de problemas de otimização combinatorial / Abstract: The Ordered Cutting Stock Problem (OCSP), a relatively recent problem in technical literarture, is a variant of the more well-known Cutting Stock Problem (CSP). This variant includes some new constraints in the mathematical formulation, regarding the number of production orders being processed simultaneously. This work studies a new approach to solve the OCSP, applying the Ant Colony Optimization (ACO) metaheurisitic. This metaheuristic is based in the self-organizing principles that govern ant population's behaviour, solving combinatorial optimization problems / Mestrado / Pesquisa Operacional / Mestre em Matemática Aplicada