You searched for subject:(Simulated annealing). Showing records 1 – 30 of 426 total matches.
1. Crews, Matthew. A comparison of single runs versus multistart for simulated annealing and threshold accepting.
▼ Simulated Annealing and Threshold Accepting are two stochastic search algorithms that have been successfully used on a variety of complex and difficult problem sets. Due to their stochastic nature they are not guaranteed to produce the same result for each run. This means that these techniques actually produce a distribution of solutions which are based on the input parameters and the problem instance. Most research in the area of Simulated Annealing and Threshold Accepting focuses on the single run performance of these algorithms and does not consider sampling multiple runs and taking the best result, known as multisampling. Previous work that has looked at multisampling did not explore a variety of settings or problem instances which has left gaps in the understanding of the multisampling performance of Simulated Annealing and Threshold Accepting. This work examines the use of single runs and multisampling on four instances of the Traveling Salesman Problem. A systematic exploration is done of the variables which affect the performance of these two heuristics. A pairwise analysis is then performed to identify if there are cases where it is advantageous to employ a multistart method instead of a single run. The conclusion is that in a majority of cases a single run outperforms the multistart method but there are cases in which the multistart method outperforms single runs. Advisors/Committee Members: Kim, David (advisor), Lu, Guanyi (committee member).
Crews, Matthew. "A comparison of single runs versus multistart for simulated annealing and threshold accepting." 2014. Masters Thesis, Oregon State University. Accessed April 26, 2019. http://hdl.handle.net/1957/50660.
Crews, Matthew. "A comparison of single runs versus multistart for simulated annealing and threshold accepting." 2014. Web. 26 Apr 2019.
Crews M. A comparison of single runs versus multistart for simulated annealing and threshold accepting. [Internet] [Masters thesis]. Oregon State University; 2014. [cited 2019 Apr 26]. Available from: http://hdl.handle.net/1957/50660.
2. Misiewicz, Marcin M. Reduced-Complexity User and Data-Stream Scheduling for Multiuser MIMO Downlink.
▼ We consider the scheduling problem in multiuser multiple-input multiple-output (MIMO) systems with successive zero-forcing precoding and coordinated transmit-receive processing. Focusing specifically on the problem of user and data stream scheduling, we allow variable number of data streams per user. Optimal scheduling employing exhaustive search for a constant number of streams per user is already combinatorially complex, and is further compounded by allowing for a variable number of streams per user. We consider a suboptimal metaheuristic scheduling algorithm based on simulated annealing, an algorithm which has shown to provide quick and relatively good solutions to combinatorial optimization problems. We introduce various parameters and examine their impact on the performance of the algorithm. Simulated annealing is shown to offer comparable results at a fraction of the computational cost of the exhaustive search. Our contributions to this area are emphasized in the conclusion and future areas of work are discussed.
Misiewicz, Marcin M. "Reduced-Complexity User and Data-Stream Scheduling for Multiuser MIMO Downlink." 2013. Masters Thesis, University of Alberta. Accessed April 26, 2019. https://era.library.ualberta.ca/files/c247ds37c.
Misiewicz, Marcin M. "Reduced-Complexity User and Data-Stream Scheduling for Multiuser MIMO Downlink." 2013. Web. 26 Apr 2019.
Misiewicz MM. Reduced-Complexity User and Data-Stream Scheduling for Multiuser MIMO Downlink. [Internet] [Masters thesis]. University of Alberta; 2013. [cited 2019 Apr 26]. Available from: https://era.library.ualberta.ca/files/c247ds37c.
3. Walsh, Peter Anthony. Combinatorial optimization in VLSI physical design.
▼ Simulated Annealing is a general purpose combinatorial optimization technique which has been applied to many problems in VLSI design. In essence, simulated annealing is Monte Carlo iterative improvement with the ability to conditionally accept uphill moves. The notion of a cooling schedule is common to all simulated annealing implementations. A cooling schedule can be thought of as simulated annealing's control mechanisms. Experiential work has been done on estimating the cost of an optimal solution to some combinatorial optimization problem instances. Such an estimate can be used to determine termination criteria for general purpose optimization techniques such as iterative improvement or simulated annealing. We have extended this idea and designed a complete simulated annealing general cooling schedule based on the cost of an optimal solution to a problem instance. We call the resultant schedule an extended goal-directed general cooling schedule. One of the major problems with simulated annealing is its long computation times. This problem can be addressed by first using a fast heuristic to find a good initial configuration and then applying simulated annealing. This approach is called Simulated Sintering. To exploit the potential of simulated sintering one needs an appropriate general cooling schedule. The extended goal-directed cooling schedule is equally applicable to simulated annealing and simulated sintering. To date, no one cooling schedule has proven suitable for all optimization problem instances. In our view, no such cooling schedule exits. Consequently, we have attempted to identify the type of problem best suited to optimization by simulated annealing and simulated sintering using the extended goal-directed schedule. We have applied the extended goal-directed schedule to standard-cell placement and floorplanning problems using both simulated annealing and simulated sintering. Within this context, we have compared the performance of the extended goal-directed schedule to other published schedules. Our results indicate that in terms of layout quality, the extended goal-directed schedule performs as well or better than the other schedules. In this dissertation, we have developed a new general cooling schedule. Our evaluation of the extended goal-directed schedule suggests that it is a useful research contribution in the area of simulated annealing algorithms. Advisors/Committee Members: Miller, D.M. (supervisor).
Walsh, Peter Anthony. "Combinatorial optimization in VLSI physical design." 2018. Thesis, University of Victoria. Accessed April 26, 2019. https://dspace.library.uvic.ca//handle/1828/9608.
Walsh, Peter Anthony. "Combinatorial optimization in VLSI physical design." 2018. Web. 26 Apr 2019.
Walsh PA. Combinatorial optimization in VLSI physical design. [Internet] [Thesis]. University of Victoria; 2018. [cited 2019 Apr 26]. Available from: https://dspace.library.uvic.ca//handle/1828/9608.
4. Thamilselvan R. Integration of metaheuristic algorithms for job shop scheduling;.
R, Thamilselvan. "Integration of metaheuristic algorithms for job shop scheduling;." 2014. Thesis, Anna University. Accessed April 26, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/24563.
R, Thamilselvan. "Integration of metaheuristic algorithms for job shop scheduling;." 2014. Web. 26 Apr 2019.
R T. Integration of metaheuristic algorithms for job shop scheduling;. [Internet] [Thesis]. Anna University; 2014. [cited 2019 Apr 26]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/24563.
5. Subramanian M. A study on process characteristics of CNC end milling process For al7075 t6 aluminium alloy;.
M, Subramanian. "A study on process characteristics of CNC end milling process For al7075 t6 aluminium alloy;." 2015. Thesis, Anna University. Accessed April 26, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/38600.
M, Subramanian. "A study on process characteristics of CNC end milling process For al7075 t6 aluminium alloy;." 2015. Web. 26 Apr 2019.
M S. A study on process characteristics of CNC end milling process For al7075 t6 aluminium alloy;. [Internet] [Thesis]. Anna University; 2015. [cited 2019 Apr 26]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/38600.
6. Mutnuri, Keertana. Channel adaptive process resilient ultra low-power transmitter design with simulated-annealing based self-discovery.
Mutnuri, Keertana. "Channel adaptive process resilient ultra low-power transmitter design with simulated-annealing based self-discovery." 2014. Masters Thesis, Georgia Tech. Accessed April 26, 2019. http://hdl.handle.net/1853/53402.
Mutnuri, Keertana. "Channel adaptive process resilient ultra low-power transmitter design with simulated-annealing based self-discovery." 2014. Web. 26 Apr 2019.
Mutnuri K. Channel adaptive process resilient ultra low-power transmitter design with simulated-annealing based self-discovery. [Internet] [Masters thesis]. Georgia Tech; 2014. [cited 2019 Apr 26]. Available from: http://hdl.handle.net/1853/53402.
7. Gunnels, John A. A comparison of simulated annealing and genetic algorithms for the genome mapping problems.
▼ The data used for the construction of genome maps is imperfect, therefore the mapping of a physically linear structure must take place in a very uneven feature space. As the number of genes to be ordered grows, it appears to be impractical to use exhaustive search techniques to find the optimal mapping. In this paper we compare genetic algorithms and simulated annealing, two methods that are widely believed to be well-suited to non-smooth feature spaces, and find that the genetic algorithm approach yields superior results. Here we present performance profiles of comparable implementations of both genetic algorithms and simulated annealing. We have translated the problem to a form comparable to the shortest-path problem and found that the ability of a genetic algorithm to combine different partial solutions seems to be responsible for its superiority over the simulated annealing method. This is because in the genome mapping problem, as in the Traveling Salesman Problem, good solutions tend to be rather sparse and because optimal subtours tend to be components of nearly optimal tours. Advisors/Committee Members: Cull, Paul (advisor).
Gunnels, John A. "A comparison of simulated annealing and genetic algorithms for the genome mapping problems." 1993. Masters Thesis, Oregon State University. Accessed April 26, 2019. http://hdl.handle.net/1957/36599.
Gunnels, John A. "A comparison of simulated annealing and genetic algorithms for the genome mapping problems." 1993. Web. 26 Apr 2019.
Gunnels JA. A comparison of simulated annealing and genetic algorithms for the genome mapping problems. [Internet] [Masters thesis]. Oregon State University; 1993. [cited 2019 Apr 26]. Available from: http://hdl.handle.net/1957/36599.
8. Vorwerk, Kristofer. On the Use of Directed Moves for Placement in VLSI CAD.
▼ Search-based placement methods have long been used for placing integrated circuits targeting the field programmable gate array (FPGA) and standard cell design styles. Such methods offer the potential for high-quality solutions but often come at the cost of long run-times compared to alternative methods. This dissertation examines strategies for enhancing local search heuristics – and in particular, simulated annealing – through the application of directed moves. These moves help to guide a search-based optimizer by focusing efforts on states which are most likely to yield productive improvement, effectively pruning the size of the search space. The engineering theory and implementation details of directed moves are discussed in the context of both field programmable gate array and standard cell designs. This work explores the ways in which such moves can be used to improve the quality of FPGA placements, improve the robustness of floorplan repair and legalization methods for mixed-size standard cell designs, and enhance the quality of detailed placement for standard cell circuits. The analysis presented herein confirms the validity and efficacy of directed moves, and supports the use of such heuristics within various optimization frameworks.
Vorwerk, Kristofer. "On the Use of Directed Moves for Placement in VLSI CAD." 2009. Thesis, University of Waterloo. Accessed April 26, 2019. http://hdl.handle.net/10012/4528.
Vorwerk, Kristofer. "On the Use of Directed Moves for Placement in VLSI CAD." 2009. Web. 26 Apr 2019.
Vorwerk K. On the Use of Directed Moves for Placement in VLSI CAD. [Internet] [Thesis]. University of Waterloo; 2009. [cited 2019 Apr 26]. Available from: http://hdl.handle.net/10012/4528.
9. Kwon, Tae-Jung. Development and Evaluation of Models and Algorithms for Locating RWIS Stations.
Kwon, Tae-Jung. "Development and Evaluation of Models and Algorithms for Locating RWIS Stations." 2015. Thesis, University of Waterloo. Accessed April 26, 2019. http://hdl.handle.net/10012/10056.
Kwon, Tae-Jung. "Development and Evaluation of Models and Algorithms for Locating RWIS Stations." 2015. Web. 26 Apr 2019.
Kwon T. Development and Evaluation of Models and Algorithms for Locating RWIS Stations. [Internet] [Thesis]. University of Waterloo; 2015. [cited 2019 Apr 26]. Available from: http://hdl.handle.net/10012/10056.
10. Campaigne, Wesley. Frozen-State Hierarchical Annealing.
▼ There is significant interest in the synthesis of discrete-state random fields, particularly those possessing structure over a wide range of scales. However, given a model on some finest, pixellated scale, it is computationally very difficult to synthesize both large and small-scale structures, motivating research into hierarchical methods. This thesis proposes a frozen-state approach to hierarchical modelling, in which simulated annealing is performed on each scale, constrained by the state estimates at the parent scale. The approach leads significant advantages in both modelling flexibility and computational complexity. In particular, a complex structure can be realized with very simple, local, scale-dependent models, and by constraining the domain to be annealed at finer scales to only the uncertain portions of coarser scales, the approach leads to huge improvements in computational complexity. Results are shown for synthesis problems in porous media.
Campaigne, Wesley. "Frozen-State Hierarchical Annealing." 2012. Thesis, University of Waterloo. Accessed April 26, 2019. http://hdl.handle.net/10012/6810.
Campaigne, Wesley. "Frozen-State Hierarchical Annealing." 2012. Web. 26 Apr 2019.
Campaigne W. Frozen-State Hierarchical Annealing. [Internet] [Thesis]. University of Waterloo; 2012. [cited 2019 Apr 26]. Available from: http://hdl.handle.net/10012/6810.
11. Montalva Subirats, José Miguel. Optimización multiobjetivo de la distribución en planta de procesos industriales. Estudio de objetivos.
▼ En el proceso de diseño e las construcciones industriales, es de vital importancia conocer cual es la ubicación óptima de las diferentes áras de trabajo que conforman un proceso de fabricación, así como de las instalaciones y servicios auxiliares. El problema de distribución en planta (Facilities Layout Problem, FLP) integra a todas las actividades industriales y se ha convertido desde los años 60 en uno de los problemas clásicos de optimización combinatoria, en el que trabajan multiutd de investigadores a nivel internacional. Hasta los años 90, el enfoque que se realizaba del problema era básicamente un enfoque monobjetivo, en el que se primaba fundamentalmente la minimización del coste de transporte de material o personas entre las diferentes áreas productivas o de servicios. Para ello se han venido empleando diferentes técnicas de optimización heurística, que persiguen minimizar el tiempo de cálculo y facilitar la búsqueda de mínimos, aunque sean locales, pues el espacio de soluciones es tan grande, que es difícil garantizar la existencia de un mínimo global del problema. No obstante, el criterio de coste no es el único que se debe considerar en este tipo de planteamientos, pues existen otra serie de indicadores que son de vital importancia, para garantizar que la solución propuesta tiene un nivel de desarrollo tecnológico con la aparición de equipos y programas informáticos más desarrollados, han prosperado las aproximaciones multiobjetivos al problema de distribución en planta. Entre los objetivos principales del presente trabajo se encuentran; la realización de un estado del arte de los indicadores que se han empleado en la bibliografía para la resolución en planta, obteniendo un conjunto de indicadores independientes y suficientes que puedan ser empleados en la obtención de distribuciones en planta óptimas. Se investigará si es necesario definir algún nuevo indicador que cubra los objetivos fundamentales de la distribución en planta establecidos por distintos autores. Una vez seleccionados los indicadores se propone una técnica de optimización multiobjetivo basada en un algoritmo de recocido simulado (Simulated Annealing). Finalmente se presentan los resultados de los experimentos realizados, empleando la técnica de optimización multiobjetivo propuesta, sobre un problema ampliamente utilizado en la bibliografía, el propuesto por Armour y Buffa de 20 actividades. Se obtienen las fronteras de Pareto para diferentes bicriterios, introduciendo puntos que completan las existentes hasta la actualidad, estudiando la posibilidad de extender la optimización a 3 indicadores. Advisors/Committee Members: HOSPITALER PEREZ, ANTONIO (advisor).
Montalva Subirats, José Miguel. "Optimización multiobjetivo de la distribución en planta de procesos industriales. Estudio de objetivos. " 2011. Doctoral Dissertation, Universitat Politècnica de València. Accessed April 26, 2019. http://hdl.handle.net/10251/11147.
Montalva Subirats, José Miguel. "Optimización multiobjetivo de la distribución en planta de procesos industriales. Estudio de objetivos. " 2011. Web. 26 Apr 2019.
Montalva Subirats JM. Optimización multiobjetivo de la distribución en planta de procesos industriales. Estudio de objetivos. [Internet] [Doctoral dissertation]. Universitat Politècnica de València; 2011. [cited 2019 Apr 26]. Available from: http://hdl.handle.net/10251/11147.
12. Manshouri, Reza. Edge Ratchet and Simulated Annealing to Improve RF Score of the Supertree of Life.
▼ Constructing the Supertree of Life can provide crucially valuable knowledge to address many critical contemporary challenges such as fighting diseases, improving global agriculture, and protecting ecosystems to name a few. However, building such a tree is among the most complicated and challenging scientific problems. In the case of biological data, the true species tree is not available. Hence, the accuracy of the supertree is usually evaluated based on its similarity to the given source input trees. In this work, we aim at improving the accuracy of the supertree in terms of its cumulative Robinson Foulds (RF) distance to the source trees. This problem is NP-hard. Therefore, we have to resort to heuristic algorithms. We have two main contributions in this work. First, we propose a new technique, Edge Ratchet, which is used in a hill-climbing based algorithm to deal with local optimum problem. Second, we develop a Simulated Annealing algorithm to minimize total RF distance of the supertree to the source trees. Our results demonstrate that these two algorithms are able to improve the accuracy of the best existing supertree algorithms with regard to RF distance. Advisors/Committee Members: Williams, Tiffani L (advisor), Welch, Jennifer (advisor), Mateos, Mariana (advisor).
Manshouri, Reza. "Edge Ratchet and Simulated Annealing to Improve RF Score of the Supertree of Life." 2017. Masters Thesis, Texas A&M University. Accessed April 26, 2019. http://hdl.handle.net/1969.1/169652.
Manshouri, Reza. "Edge Ratchet and Simulated Annealing to Improve RF Score of the Supertree of Life." 2017. Web. 26 Apr 2019.
Manshouri R. Edge Ratchet and Simulated Annealing to Improve RF Score of the Supertree of Life. [Internet] [Masters thesis]. Texas A&M University; 2017. [cited 2019 Apr 26]. Available from: http://hdl.handle.net/1969.1/169652.
13. Aguasvivas Manzano, Sarah. Performance and Parsimony in Training Deep Neural Networks.
▼ It is known that machine learning owes multiple achievements to deep learning. However, do we know for certain when we need deeper models? Did deep learning improve artificial intelligence through the use of techniques other than what the multilayer perceptron (MLP) requires? This work is a careful effort to explore the definition of deep learning by formulating the following question: "When does deep learning help and when does it hurt?." In the search for an Occam's Razor-inspired analysis, this work performs multiple experiments on the MLP in order to illustrate when a shallow network is sufficient and when it is not and what metrics can be extracted from the raw data set in order to estimate the needed model complexity before training. A secondary purpose for this thesis is to attempt to overcome the limitations of the back propagation (BP) algorithm by using a derivative-free technique called Simulated Annealing (SA) in order to test the claims that this existing heuristic method is capable of outperforming BP in performance and plasticity. Regarding the model parsimony question, the results show that, among the metrics tested, the percentage variance in the first principal component (PCA-1%) influenced the classification performance of the MLP in the following way: The higher PCA-1% was, the shallower the MLP needed to be in order to avoid over-complicating the learning model for non-image data sets. On the other hand, Simulated Annealing achieved performances similar to an average back propagation performance for a MSE tolerance of about 4 times the tolerances needed in back propagation. However, the number of required iterations for an exploratory search like this were determined to be unpredictable and very large for lower tolerances. Moreover, the performance shown by SA was not as consistent as that of BP. Advisors/Committee Members: Lyle N. Long, Thesis Advisor.
Aguasvivas Manzano, Sarah. "Performance and Parsimony in Training Deep Neural Networks." 2017. Thesis, Penn State University. Accessed April 26, 2019. https://etda.libraries.psu.edu/catalog/13814sia5396.
Aguasvivas Manzano, Sarah. "Performance and Parsimony in Training Deep Neural Networks." 2017. Web. 26 Apr 2019.
Aguasvivas Manzano S. Performance and Parsimony in Training Deep Neural Networks. [Internet] [Thesis]. Penn State University; 2017. [cited 2019 Apr 26]. Available from: https://etda.libraries.psu.edu/catalog/13814sia5396.
14. Klein, Raymond W. Projection and clustering by simulated annealing.
Klein, Raymond W. "Projection and clustering by simulated annealing." 1987. Masters Thesis, Michigan State University. Accessed April 26, 2019. http://etd.lib.msu.edu/islandora/object/etd:19128.
Klein, Raymond W. "Projection and clustering by simulated annealing." 1987. Web. 26 Apr 2019.
Klein RW. Projection and clustering by simulated annealing. [Internet] [Masters thesis]. Michigan State University; 1987. [cited 2019 Apr 26]. Available from: http://etd.lib.msu.edu/islandora/object/etd:19128.
15. Barnes II, Robert Otto. Concurrency Optimization for Integrative Network Analysis.
▼ Virginia Tech\'s Computational Bioinformatics and Bio-imaging Laboratory (CBIL) is exploring integrative network analysis techniques to identify subnetworks or genetic pathways that contribute to various cancers. Chen et. al. developed a bagging Markov random field (BMRF)-based approach which examines gene expression data with prior biological information to reliably identify significant genes and proteins. Using random resampling with replacement (bootstrapping or bagging) is essential to confident results but is computationally demanding as multiple iterations of the network identification (by simulated annealing) is required. The MATLAB implementation is computationally demanding, employs limited concurrency, and thus time prohibitive. Using strong software development discipline we optimize BMRF using algorithmic, compiler, and concurrency techniques (including Nvidia GPUs) to alleviate the wall clock time needed for analysis of large-scale genomic data. Particularly, we decompose the BMRF algorithm into functional blocks, implement the algorithm in C/C++ and further explore the C/C++ implementation with concurrency optimization. Experiments are conducted with simulation and real data to demonstrate that a significant speedup of BMRF can be achieved by exploiting concurrency opportunities. We believe that the experience gained by this research shall help pave the way for us to develop computationally efficient algorithms leveraging concurrency, enabling researchers to efficiently analyze larger-scale data sets essential for furthering cancer research. Advisors/Committee Members: Xuan, Jianhua (committeechair), Kriz, Ronald D. (committee member), Wang, Yue J. (committee member).
Barnes II, Robert Otto. "Concurrency Optimization for Integrative Network Analysis." 2013. Masters Thesis, Virginia Tech. Accessed April 26, 2019. http://hdl.handle.net/10919/23220.
Barnes II, Robert Otto. "Concurrency Optimization for Integrative Network Analysis." 2013. Web. 26 Apr 2019.
Barnes II RO. Concurrency Optimization for Integrative Network Analysis. [Internet] [Masters thesis]. Virginia Tech; 2013. [cited 2019 Apr 26]. Available from: http://hdl.handle.net/10919/23220.
16. Ladislau , Manuel Moraton Claver. Logística operacional do dispositivo naval da Marinha de Guerra Angolana.
A presente dissertação de mestrado enquadra-se no âmbito dos Sistemas de Apoio à Decisão para a otimização dos Pontos de Apoio Logísticos Avançados que servem de armazéns de mercadorias para os navios da esquadra da Marinha de Guerra de Angolana. Foram recolhidos dados reais das facilidades de transporte de mercadorias em Angola, pedidos de transferências de material em Portugal e modelados através de métodos meta-heurísticos. O principal objetivo da dissertação consiste em minimizar os custos e as demoras de fornecimento dos materiais necessários para garantir o funcionamento dos armazéns da Marinha de Guerra de Angolana. Tratando-se dum problema de programação não-linear, aplicaram-se os métodos do Algoritmo Genético e Simulated Annealing para obter o menor valor da solução. O menor valor da solução é obtido a partir dum processo de simulação através na ferramenta informática Matlab, onde o utilizador poderá alterar os valores de entrada consoante o grau de importância das variáveis de decisão (custo e demora). Os resultados obtidos em ambos métodos variaram significativamente consoante as alterações feitas pelo decisor durante o processo de simulação para 60 meses. Estes resultados apontaram o Simulated Annealing como melhor método heurístico para a resolução de problemas de esfera idêntica.
This dissertation deals with a type of Decision Support Systems for the optimization of Points Advanced Logistic Support serving warehouse goods for ships of the squadron of the Navy of Angolan. Data were collected from actual freight facilities in Mozambique, requests for material transfers in Portugal and modeled by meta-heuristic methods. The main objective of the dissertation is to minimize costs and delays in the provision of materials necessary to ensure the functioning of the warehouses of the Navy of Angolan. For this case there is a problem of nonlinear programming, we applied the methods of genetic algorithm and simulated annealing to obtain the lowest value of the solution. The lowest value of the solution is obtained from a process through simulation in Matlab software tool, where the user can change the input values depending on the degree of importance of decision variables (cost and delay). The results obtained by both methods varied significantly depending on the changes made by the decision maker during simulation process for 60 months. Those results show that the Simulated Annealing heuristic as the best method for solving problems similar sphere.
Advisors/Committee Members: Martins, João José Maia.
Ladislau , Manuel Moraton Claver. "Logística operacional do dispositivo naval da Marinha de Guerra Angolana." 2013. Thesis, RCAAP. Accessed April 26, 2019. https://www.rcaap.pt/detail.jsp?id=oai:comum.rcaap.pt:10400.26/12593.
Ladislau , Manuel Moraton Claver. "Logística operacional do dispositivo naval da Marinha de Guerra Angolana." 2013. Web. 26 Apr 2019.
Ladislau MMC. Logística operacional do dispositivo naval da Marinha de Guerra Angolana. [Internet] [Thesis]. RCAAP; 2013. [cited 2019 Apr 26]. Available from: https://www.rcaap.pt/detail.jsp?id=oai:comum.rcaap.pt:10400.26/12593.
17. Silva, Kayo Gonçalves e. Análise de escalabilidade de uma implementação paralela do simulated annealing acoplado .
▼ This paper analyzes the performance of a parallel implementation of Coupled Simulated Annealing (CSA) for the unconstrained optimization of continuous variables problems. Parallel processing is an efficient form of information processing with emphasis on exploration of simultaneous events in the execution of software. It arises primarily due to high computational performance demands, and the difficulty in increasing the speed of a single processing core. Despite multicore processors being easily found nowadays, several algorithms are not yet suitable for running on parallel architectures. The algorithm is characterized by a group of Simulated Annealing (SA) optimizers working together on refining the solution. Each SA optimizer runs on a single thread executed by different processors. In the analysis of parallel performance and scalability, these metrics were investigated: the execution time; the speedup of the algorithm with respect to increasing the number of processors; and the efficient use of processing elements with respect to the increasing size of the treated problem. Furthermore, the quality of the final solution was verified. For the study, this paper proposes a parallel version of CSA and its equivalent serial version. Both algorithms were analysed on 14 benchmark functions. For each of these functions, the CSA is evaluated using 2-24 optimizers. The results obtained are shown and discussed observing the analysis of the metrics. The conclusions of the paper characterize the CSA as a good parallel algorithm, both in the quality of the solutions and the parallel scalability and parallel efficiency Advisors/Committee Members: Souza, Samuel Xavier de (advisor), CPF:82838607472 (advisor), http://lattes.cnpq.br/9892239670106361 (advisor), Aloise, Daniel (advisor), CPF:03553729406 (advisor), http://lattes.cnpq.br/5093210888872414 (advisor).
Silva, Kayo Gonçalves e. "Análise de escalabilidade de uma implementação paralela do simulated annealing acoplado ." 2013. Masters Thesis, Universidade do Rio Grande do Norte. Accessed April 26, 2019. http://repositorio.ufrn.br/handle/123456789/15471.
Silva, Kayo Gonçalves e. "Análise de escalabilidade de uma implementação paralela do simulated annealing acoplado ." 2013. Web. 26 Apr 2019.
Silva KGe. Análise de escalabilidade de uma implementação paralela do simulated annealing acoplado . [Internet] [Masters thesis]. Universidade do Rio Grande do Norte; 2013. [cited 2019 Apr 26]. Available from: http://repositorio.ufrn.br/handle/123456789/15471.
18. Silva, Kayo Gonçalves e. Análise de escalabilidade de uma implementação paralela do simulated annealing acoplado .
Silva, Kayo Gonçalves e. "Análise de escalabilidade de uma implementação paralela do simulated annealing acoplado ." 2013. Thesis, Universidade do Rio Grande do Norte. Accessed April 26, 2019. http://repositorio.ufrn.br/handle/123456789/15471.
Silva KGe. Análise de escalabilidade de uma implementação paralela do simulated annealing acoplado . [Internet] [Thesis]. Universidade do Rio Grande do Norte; 2013. [cited 2019 Apr 26]. Available from: http://repositorio.ufrn.br/handle/123456789/15471.
19. Aly , Mussa Hosten. Localização dos pontos de apoio logístico avançados recorrendo a meta-heuristicas.
A presente dissertação enquadra-se na linha de investigação em Sistemas de Apoio à Decisão, procurando otimizar os Pontos de Apoio Logístico Avançados (PALA), que servem de armazéns de mercadorias para os navios da esquadra da Marinha de Guerra de Moçambique. O principal objetivo da dissertação é de minimizar os custos e demoras no fornecimento de materiais necessários para garantir a operacionalidade da Marinha de Guerra de Moçambique. As informações pertinentes foram recolhidas nas instalações logísticas em Moçambique e de requisições de material por unidades navais da Marinha Portuguesa. Para resolver o que é, essencialmente, um problema de otimização combinatória, foram aplicados os métodos do algoritmo genético e Simulated Annealing. Para o efeito, uma ferramenta de suporte de decisão foi desenvolvida na linguagem MATLAB, OPALAM, que permite ao usuário escolher o grau de importância dos dois critérios de otimalidade, custo e demora. Os resultados obtidos por ambos os métodos variaram significativamente dependendo das alterações feitas pelo decisor durante o processo de simulação para 60 meses, embora se tenha verificado que o Simulated Annealing parece lidar da melhor forma com o problema.
This dissertation is part of the research line on Decision Support Systems, seeking to optimize the Advanced Logistic Support Points (PALA) that serve as stores of goods to the ships of the squadron of the Navy of Mozambique. The main objective of the research is to minimize costs and delays in the provision of materials needed to ensure the operability of the Navy of Mozambique. The relevant information was collected from actual freight facilities in Mozambique and from material requisitions by naval units of the Portuguese Navy. To solve what is, essentially, a combinatorial optimization problem, we applied the methods of genetic algorithm and simulated annealing. For this purpose, a decision support tool was developed in the MATLAB language, OPALAM that allows the user to choose the degree of importance of the two optimality criteria, cost and delay. The results obtained by both methods varied significantly depending on the changes made by the decision-maker during the simulation process for 60 months, but simulated annealing seemed to be better able to cope with the problem on hand.
Subjects/Keywords: Logística, Transporte, Multicritérios de tomada de decisão, Algoritmo Genético, Simulated Annealing.; Logistics, Transportation, Multicriteria Decision-making, Genetic Algorithm, Simulated Annealing.
Aly , Mussa Hosten. "Localização dos pontos de apoio logístico avançados recorrendo a meta-heuristicas." 2013. Thesis, RCAAP. Accessed April 26, 2019. https://www.rcaap.pt/detail.jsp?id=oai:comum.rcaap.pt:10400.26/12603.
Aly , Mussa Hosten. "Localização dos pontos de apoio logístico avançados recorrendo a meta-heuristicas." 2013. Web. 26 Apr 2019.
Aly MH. Localização dos pontos de apoio logístico avançados recorrendo a meta-heuristicas. [Internet] [Thesis]. RCAAP; 2013. [cited 2019 Apr 26]. Available from: https://www.rcaap.pt/detail.jsp?id=oai:comum.rcaap.pt:10400.26/12603.
20. Äng, Oscar. Planering av stränggjutningsproduktion : En heruistisk metod.
Detta arbete syftar till att undersöka om det är möjligt att med en heuristisk metod skapa giltiga lösningar till ett problem vid planering av stränggjutningsproduktion på SSAB. Planeringsproblemet uppstår när stål av olika sorter ska gjutas under samma dag. Beroende på i vilken ordning olika kundordrar av stål gjuts uppstår spill av olika storlek. Detta spill ska minimeras och tidigare arbete har genomförts på detta problem och resulterat i en matematisk modell för att skapa lösningar till problemet. Det tar i praktiken lång tid att hitta bra lösningar med modellen och frågeställningen är om det går att göra detta med en heuristisk metod för att kunna generera bra lösningar snabbare. Med inspiration från Variable Neighbourhood Search, Simulated Annealing och tabusökning har heuristiker skapats, implementerats och utvärderats mot den matematiska modellen. En av heuristikerna presterar bättre än den matematiska modellen gör på 10 minuter. Matematiska modellens resultat efter 60 minuter körtid är bättre än den utvecklade heuristiken, men resultaten är nära varandra. Körtiden för heuristiken tar signifikant mindre tid än 10 minuter.
This study aims to investigate if it is possible to use a heuristic method to create feasible solution in a Cast Batching Problem at SSAB. The problem occurs when different kinds of steel should be cast during the same day. Depending on which order the groups of different steel is placed different amounts of waste is produced, the goal is to minimize this waste. Earlier work has been done on this problem and resulted in a mathematical model to create feasible solutions to this problem. In practice the time it takes to create good solutions are long and the question is if it is possible to use a heuristic method to generate good solutions in a shorter amount of time. Drawing upon inspiration from metaheuristics such as Variable Neighbourhood Search, Simualted Annealing and Tabu Search multiple heuristics have been created, implemented and evaluated against the mathematical model. One of the heuristics perform better than the mathematical model does in 10 minutes. The result from the mathematical model after 60 minutes is slightly better than the heuristic, but the results are similar. With regards to running time the heuristic takes considerably less time than 10 minutes.
Äng, Oscar. "Planering av stränggjutningsproduktion : En heruistisk metod." 2017. Thesis, Linköping UniversityLinköping University. Accessed April 26, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-136271.
Äng, Oscar. "Planering av stränggjutningsproduktion : En heruistisk metod." 2017. Web. 26 Apr 2019.
Äng O. Planering av stränggjutningsproduktion : En heruistisk metod. [Internet] [Thesis]. Linköping UniversityLinköping University; 2017. [cited 2019 Apr 26]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-136271.
21. Wu, Zujian. A generic approach to behaviour-driven biochemical model construction.
▼ Modelling of biochemical systems has received considerable attention over the last decade from bioengineering, biochemistry, computer science, and mathematics. This thesis investigates the applications of computational techniques to computational systems biology, for the construction of biochemical models in terms of topology and kinetic rates. Due to the complexity of biochemical systems, it is natural to construct models representing the biochemical systems incrementally in a piecewise manner. Syntax and semantics of two patterns are defined for the instantiation of components which are extendable, reusable and fundamental building blocks for models composition. We propose and implement a set of genetic operators and composition rules to tackle issues of piecewise composing models from scratch. Quantitative Petri nets are evolved by the genetic operators, and evolutionary process of modelling are guided by the composition rules. Metaheuristic algorithms are widely applied in BioModel Engineering to support intelligent and heuristic analysis of biochemical systems in terms of structure and kinetic rates. We illustrate parameters of biochemical models based on Biochemical Systems Theory, and then the topology and kinetic rates of the models are manipulated by employing evolution strategy and simulated annealing respectively. A new hybrid modelling framework is proposed and implemented for the models construction. Two heuristic algorithms are performed on two embedded layers in the hybrid framework: an outer layer for topology mutation and an inner layer for rates optimization. Moreover, variants of the hybrid piecewise modelling framework are investigated. Regarding flexibility of these variants, various combinations of evolutionary operators, evaluation criteria and design principles can be taken into account. We examine performance of five sets of the variants on specific aspects of modelling. The comparison of variants is not to explicitly show that one variant clearly outperforms the others, but it provides an indication of considering important features for various aspects of the modelling. Because of the very heavy computational demands, the process of modelling is paralleled by employing a grid environment, GridGain. Application of the GridGain and heuristic algorithms to analyze biological processes can support modelling of biochemical systems in a computational manner, which can also benefit mathematical modelling in computer science and bioengineering. We apply our proposed modelling framework to model biochemical systems in a hybrid piecewise manner. Modelling variants of the framework are comparatively studied on specific aims of modelling. Simulation results show that our modelling framework can compose synthetic models exhibiting similar species behaviour, generate models with alternative topologies and obtain general knowledge about key modelling features.
Wu, Zujian. "A generic approach to behaviour-driven biochemical model construction." 2012. Doctoral Dissertation, Brunel University. Accessed April 26, 2019. http://bura.brunel.ac.uk/handle/2438/7413 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.571793.
Wu, Zujian. "A generic approach to behaviour-driven biochemical model construction." 2012. Web. 26 Apr 2019.
Wu Z. A generic approach to behaviour-driven biochemical model construction. [Internet] [Doctoral dissertation]. Brunel University; 2012. [cited 2019 Apr 26]. Available from: http://bura.brunel.ac.uk/handle/2438/7413 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.571793.
22. Belaidi, Hadjira. Optimal control and strategy of autonomous mobile robot 2D/3D simulation.
Belaidi, Hadjira. "Optimal control and strategy of autonomous mobile robot 2D/3D simulation." 2009. Thesis, Université M'Hamed Bougara Boumerdès. Accessed April 26, 2019. http://dlibrary.univ-boumerdes.dz:8080123456789/1623.
Belaidi, Hadjira. "Optimal control and strategy of autonomous mobile robot 2D/3D simulation." 2009. Web. 26 Apr 2019.
Belaidi H. Optimal control and strategy of autonomous mobile robot 2D/3D simulation. [Internet] [Thesis]. Université M'Hamed Bougara Boumerdès; 2009. [cited 2019 Apr 26]. Available from: http://dlibrary.univ-boumerdes.dz:8080123456789/1623.
23. Souza, Juliano da Silva de, 1984-. Uma aplicação simulated annealing em problemas de corte de estoque .
▼ Resumo: Neste trabalho é apresentada uma nova abordagem da heurística Simulated Annealing, no que se refere a geração de soluções na vizinhança de uma solução factível, para encontrar a solução ótima de uma formulação de programação linear inteira para o Problema de Corte de Estoque Unidimensional. O desempenho do novo algoritmo é comparado à metodologia publicada em A simulated annealing heuristic for the one-dimensional cutting stock problem apresentada em . Os resultados dos experimentos computacionais indicam que essa nova abordagem, fornece soluções muito melhores em relação ao valor objetivo em tempo equivalente de execução. Além disso, uma comparação qualitativa é feita com o solver CPLEX. Para os experimentos numéricos utiliza-se o gerador de problemas CUTGEN1: A problem generator for the Standard One-dimensional Cutting Stock Problem, proposto em , o qual fornece um gerador de classes de problemas de acordo com os critérios de tamanho dos itens finais e demandas. Finalmente, são reportados resultados dos experimentos computacionais baseados na metodologia apresentada em  no artigo Guidelines for Designing and Reporting on Computational Experiments with Heuristic Methods; Abstract: This work presents a new approach to heuristic Simulated Annealing, in refers to the generation of solutions in the neighborhood of a feasible solution, to _nd the solution an optimal integer linear programming formulation for the Cutting Stock Problem One-dimensional. The performance of the new algorithm is compared to the methodology published in A simulated annealing heuristic for the one-dimensional cutting stock problem presented in . The results of computational experiments indicate that this new approach provides much better solutions in relation to the objective value time equivalent execution. In addition, a qualitative comparison is made to the CPLEX solver. For the numerical experiments we use the generator of problems CUTGEN1: A problem generator for the Standard One-dimensional Cutting Stock Problem, in , which provides a generator classes of problems according to criteria size and demands of end items. Finally, results of experiments are reported computer-based method presented in  by article Guidelines for Designing and Reporting on Computational Experiments with Heuristic Methods Advisors/Committee Members: Moretti, Antonio Carlos, 1958- (advisor), Torezzan, Cristiano (committee member), Neto, Luiz Leduino de Salles (committee member).
Souza, Juliano da Silva de, 1984-. "Uma aplicação simulated annealing em problemas de corte de estoque ." 2012. Thesis, Universidade Estadual de Campinas. Accessed April 26, 2019. http://repositorio.unicamp.br/jspui/handle/REPOSIP/306142.
Souza, Juliano da Silva de, 1984-. "Uma aplicação simulated annealing em problemas de corte de estoque ." 2012. Web. 26 Apr 2019.
Souza, Juliano da Silva de 1. Uma aplicação simulated annealing em problemas de corte de estoque . [Internet] [Thesis]. Universidade Estadual de Campinas; 2012. [cited 2019 Apr 26]. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/306142.
24. Yang, Junjun. Seafloor Topography Estimation from Gravity Gradients.
▼ Inferring seafloor topography from gravity anomaly currently is the dominant method to obtain a global view of the oceans. This study deals with the methods of inferring this topography from gravity gradients, which is more sensitive to topography at short wavelengths than gravity anomaly. Two methods, one in the spectral domain and the other in the spatial domain, were developed and tested using vertical gravity gradients derived from satellite altimetry.The spectral domain method is based on the linear approximation to the Parker's infinite series, which is for the convenience of inversion the admittance that relates topography and gravity gradient. Only 15-160 km wavelength topography was estimated from the vertical gravity gradient, for which the inversion was stable. The long wavelengths were obtained by low-pass filtering existing bathymetric depths, and the wavelengths shorter than 15 km were omitted. This method was tested in a 2°×2° area in the West Pacific Ocean centered at (21° N, 157° E). There, the seafloor topography estimation has a root mean square error of ±268 m.Through a numerical test, it was found that the nonlinear terrain effect was not negligible in rugged areas. Algorithmic analysis through the coherency showed that estimation accuracy at high frequencies cannot be improved by refining the resolution of gravity gradients, due to the linear approximation.To remove the linear approximation in the modeled relationship between gravity gradients and topography, the simulated annealing, a global optimization technique that can process nonlinear inverse problems, was used to estimate the seafloor topography parameters in a forward model by minimizing the difference between the observed and forward-computed vertical gravity gradients. Careful treatments like conducting truncation error analysis, and padding the vicinity of the study area with a known topography model, were required for successful estimation. A numerical test for the same study area generated an estimation with root mean square error of ±236 m. This improves the results from the spectral domain method by 12%. Compared with the global topography model version 18 as released by the Scripps Institution of Oceanography, the estimation accuracy is improved by 22% over the study area.The simulated annealing approach developed in this study may be used to update the global seafloor model, especially in rugged areas. Besides, this approach has no restrictions on data distribution, as required in Parker's infinite series model, thus enabling the use of data from an airborne gravity gradiometer, whose resolution is high but flight trajectory may be irregular. This method is developed under uniform density assumption. Therefore, its performance at places of complex sub-surface geology would be poor, in general. Advisors/Committee Members: Jekeli, Christopher (Advisor).
Yang, Junjun. "Seafloor Topography Estimation from Gravity Gradients." 2017. Doctoral Dissertation, The Ohio State University. Accessed April 26, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1512048462472145.
Yang, Junjun. "Seafloor Topography Estimation from Gravity Gradients." 2017. Web. 26 Apr 2019.
Yang J. Seafloor Topography Estimation from Gravity Gradients. [Internet] [Doctoral dissertation]. The Ohio State University; 2017. [cited 2019 Apr 26]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1512048462472145.
25. Aysha, V. Document Image Segmentation and Compression using Artificial Neural Networks and Evolutionary Methods.
Aysha, V. "Document Image Segmentation and Compression using Artificial Neural Networks and Evolutionary Methods." 2013. Thesis, Cochin University of Science and Technology. Accessed April 26, 2019. http://dyuthi.cusat.ac.in/purl/3679.
Aysha, V. "Document Image Segmentation and Compression using Artificial Neural Networks and Evolutionary Methods." 2013. Web. 26 Apr 2019.
Aysha V. Document Image Segmentation and Compression using Artificial Neural Networks and Evolutionary Methods. [Internet] [Thesis]. Cochin University of Science and Technology; 2013. [cited 2019 Apr 26]. Available from: http://dyuthi.cusat.ac.in/purl/3679.
26. Leite, Joao Paulo de Barros. Parallel adaptive search techniques for structural optimization.
Leite, Joao Paulo de Barros. "Parallel adaptive search techniques for structural optimization." 1996. Doctoral Dissertation, Heriot-Watt University. Accessed April 26, 2019. http://hdl.handle.net/10399/1242.
Leite, Joao Paulo de Barros. "Parallel adaptive search techniques for structural optimization." 1996. Web. 26 Apr 2019.
Leite JPdB. Parallel adaptive search techniques for structural optimization. [Internet] [Doctoral dissertation]. Heriot-Watt University; 1996. [cited 2019 Apr 26]. Available from: http://hdl.handle.net/10399/1242.
27. Barker, Daniel. Simulated annealing in the search for phylogenetic trees.
▼ I investigate use of the simulated annealing heuristic to seek phylogenetic trees judged optimal according to the principle of parsimony. I begin by looking into the central data structure in phylogenetic research, the tree. I discuss why it is usually necessary to employ a heuristic, rather than an exact method, when seeking parsimonious trees. I summarise different heuristic approaches. I explain how to use the program LVB, written to use simulated annealing in the search for parsimonious trees. I use LVB, with different combinations of values for parameters controlling the annealing search, to re-analyse two DNA sequence data matrices, one of 50 objects and one of 365 objects. Equations to estimate suitable control parameters, on the basis of desired run time and quality of result, are fitted to data obtained by these analyses. Future directions of research are discussed.
Barker, Daniel. "Simulated annealing in the search for phylogenetic trees." 1999. Doctoral Dissertation, University of Edinburgh. Accessed April 26, 2019. http://hdl.handle.net/1842/10734.
Barker, Daniel. "Simulated annealing in the search for phylogenetic trees." 1999. Web. 26 Apr 2019.
Barker D. Simulated annealing in the search for phylogenetic trees. [Internet] [Doctoral dissertation]. University of Edinburgh; 1999. [cited 2019 Apr 26]. Available from: http://hdl.handle.net/1842/10734.
28. Sato, André Kubagawa. Proposta de algoritmo para a determinação da região livre de colisão e sua aplicação na solução de leiautes bidimensionais irregulares com recozimento simulado.
O problema de empacotamento consiste em arranjar um conjunto de itens em um contêiner, a fim de maximizar sua utilização. Este campo de estudos tem impacto em diversas indústrias, incluindo as indústrias têxtil, moveleira e naval. Neste trabalho, dois problemas de empacotamento de itens irregulares são estudados. O primeiro, chamado primal, é o caso em que os itens possuem rotação livre e o contêiner de dimensões fixas pode ser representado por um polígono qualquer, podendo ser não convexo. O segundo problema, denominado dual, consiste em posicionar os itens, que possuem apenas algumas orientações possíveis, em um contêiner retangular em que uma das dimensões é considerada infinita. Assim, o objetivo é obter o menor contêiner, variando a dimensão não fixa, no qual todos os itens podem ser posicionados sem sobreposição. Em ambos problemas, a solução é representada por uma lista ordenada de itens e uma regra de posicionamento é aplicada para se obter o leiaute. Neste caso, sobreposições não são permitidas. Para se garantir leiautes factíveis (sem sobreposição), é adotado o conceito de região livre de colisão. A região livre de colisão representa todas as translações possíveis para inserir um novo item em um contêiner com itens já posicionados. A região livre de colisão é obtida através de operações Booleanas envolvendo polígonos de obstrução e de posicionamento interno. Devido às propriedades dos conceitos envolvidos, o cálculo da região livre de colisão deve ser feito utilizando operações Booleanas não regularizadas. Um novo algoritmo de operação Booleana não regularizada de união e subtração é desenvolvido a partir da implementação de um algoritmo de operações Booleanas regularizadas. Um algoritmo de recozimento simulado é utilizado para controlar a posição, o ângulo (ou orientação) e a seqüência dos itens. Cada item só pode ser posicionado no vértice da região livre de colisão. Com a finalidade de melhorar o desempenho computacional do algoritmo, um método de paralelização do cálculo da região livre de colisão é proposto. Para comparação, são adotados dois algoritmos seriais. Através dos resultados, é possível afirmar que o algoritmo primal foi capaz de resolver problemas do tipo quebra-cabeça, incluindo contêineres convexos e com furos. O algoritmo apresentou melhora significativa no desempenho quando comparado com trabalhos anteriores. Para o caso dual foi proposto um algoritmo de dois níveis, em que o externo controla o comprimento do contêiner e o interno é semelhante ao primal. Este algoritmo foi testado com problemas existentes na literatura e apresentou soluções competitivas, obtendo alguns leiautes mais compactos. A paralelização apresentou ganho de desempenho apenas nos problemas com grande número de itens. Foi constatado que o custo computacional de operações Booleanas não regularizadas é fortemente dependente do número de vértices e intersecções dos polígonos de entrada da operação.
Advisors/Committee Members: Tsuzuki, Marcos de Sales Guerra.
Sato, André Kubagawa. "Proposta de algoritmo para a determinação da região livre de colisão e sua aplicação na solução de leiautes bidimensionais irregulares com recozimento simulado." 2011. Masters Thesis, University of São Paulo. Accessed April 26, 2019. http://www.teses.usp.br/teses/disponiveis/3/3152/tde-28022011-151901/ ;.
Sato, André Kubagawa. "Proposta de algoritmo para a determinação da região livre de colisão e sua aplicação na solução de leiautes bidimensionais irregulares com recozimento simulado." 2011. Web. 26 Apr 2019.
Sato AK. Proposta de algoritmo para a determinação da região livre de colisão e sua aplicação na solução de leiautes bidimensionais irregulares com recozimento simulado. [Internet] [Masters thesis]. University of São Paulo; 2011. [cited 2019 Apr 26]. Available from: http://www.teses.usp.br/teses/disponiveis/3/3152/tde-28022011-151901/ ;.
29. Machado, Enéas Souza. Utilização da metaheurística do recozimento simulado na otimização do planejamento de sistemas regionais de tratamento de efluentes e sua expansão da capacidade.
O presente trabalho discorre sobre o uso da metaheurística do Recozimento Simulado (Simulated Annealing) na otimização do planejamento de sistemas regionais de tratamento de efluentes e na sua expansão da capacidade. O primeiro modelo desenvolvido trata da otimização espacial de um sistema regional: dadas fontes de efluentes e locais potenciais para instalação de estações de tratamento, o modelo busca a configuração regional de menor custo. O modelo é composto de duas fases: a primeira é um modelo hidráulico que valida a rede proposta através da solução da equação universal de perda de cargas e uma otimização por Recozimento, visto haver inúmeras soluções, já que a rede pode ter qualquer sentido de fluxo. Esta otimização hidráulica visa minimizar o bombeamento do sistema. A segunda fase compreende a otimização do sistema regional, onde novas configurações e/ou alterações de diâmetros são testadas. Esta segunda otimização também é resolvida via Recozimento com o intuito de minimizar o custo do sistema. O segundo modelo trata da expansão da capacidade do sistema: o período de planejamento é dividido em duas etapas. O Recozimento é aplicado nas duas etapas. Soluções propostas para a segunda etapa são passo a passo testadas para a primeira etapa, de modo que o resultado espelhe uma otimização de todo o período. O uso intenso do Recozimento e de simulações na obtenção de soluções iniciais e candidatas leva a um tempo de processamento bastante elevado, especialmente no caso do Modelo Dinâmico. Os modelos foram testados em uma bacia exemplo obtida da literatura e também na bacia do rio Barigui, na Região Metropolitana de Curitiba. Foram desenvolvidas funções de custo para interceptores, estações elevatórias e estações de tratamento de efluentes com base em dados de obras efetuadas na Região Metropolitana de Curitiba. O uso da metaheurística do Recozimento Simulado provou ser um caminho interessante para a otimização de sistemas regionais tais como de tratamento de efluentes. Estudos adicionais são necessários no sentido de se obter um modelo hidráulico de maior eficiência computacional, um número maior de testes com os parâmetros do Recozimento e funções de custo mais abrangentes, especialmente quanto a custos de operação e manutenção.
Advisors/Committee Members: Cunha, Maria da Conceição Morais de Oliveira, Porto, Monica Ferreira do Amaral.
Machado, Enéas Souza. "Utilização da metaheurística do recozimento simulado na otimização do planejamento de sistemas regionais de tratamento de efluentes e sua expansão da capacidade." 2009. Doctoral Dissertation, University of São Paulo. Accessed April 26, 2019. http://www.teses.usp.br/teses/disponiveis/3/3147/tde-14092009-142616/ ;.
Machado, Enéas Souza. "Utilização da metaheurística do recozimento simulado na otimização do planejamento de sistemas regionais de tratamento de efluentes e sua expansão da capacidade." 2009. Web. 26 Apr 2019.
Machado ES. Utilização da metaheurística do recozimento simulado na otimização do planejamento de sistemas regionais de tratamento de efluentes e sua expansão da capacidade. [Internet] [Doctoral dissertation]. University of São Paulo; 2009. [cited 2019 Apr 26]. Available from: http://www.teses.usp.br/teses/disponiveis/3/3147/tde-14092009-142616/ ;.
30. Martins, Thiago de Castro. Estudo do recozimento simulado e do polígono de obstrução aplicados ao problema de empacotamento rotacional de polígonos irregulares não-convexos em recipientes fechados.
Este trabalho trata da proposta de um processo de otimização para o problema do posicionamento rotacional e translacional de formas irregulares em recipientes de dimensões fixas baseado em heurísticas probabilísticas sem o uso de penalização externa. Para tanto, é empregado o polígono de obstrução, acoplado a uma heurística baseada no Recozimento Simulado. O comportamento discreto da função custo em problemas com recipientes de dimensões limitadas foi mitigado através de uma heurística de \"desempate\", que busca diferenciar soluções com valores idênticos através de uma estimativa de quão próxima está uma determinada solução de conseguir encaixar uma forma não-encaixada em seu leiaute. A comparação de resultados deste trabalho com resultados publicados na literatura comprova a validade da abordagem aqui adotada.
This work deals with the proposal of an optimization process for the packing problem with free translations and rotations of irregular shapes on containers with limited dimensions based on probabilistic heuristics without use of extern penalty techniques. For such, the no-fit polygon is used, coupled with an heuristic based on Simulated Annealing. The discrete behavior of the objective function in problems with limited containers is mitigated by a \"tie breakerḧeuristic that sorts solutions with identical values by estimating how close a given solution is of fitting an unplaced shape on its layout. The comparison of these work\'s results with results published on the literature validates the approach here adopted.
Martins, Thiago de Castro. "Estudo do recozimento simulado e do polígono de obstrução aplicados ao problema de empacotamento rotacional de polígonos irregulares não-convexos em recipientes fechados." 2007. Doctoral Dissertation, University of São Paulo. Accessed April 26, 2019. http://www.teses.usp.br/teses/disponiveis/3/3132/tde-07082007-165358/ ;.
Martins, Thiago de Castro. "Estudo do recozimento simulado e do polígono de obstrução aplicados ao problema de empacotamento rotacional de polígonos irregulares não-convexos em recipientes fechados." 2007. Web. 26 Apr 2019.
Martins TdC. Estudo do recozimento simulado e do polígono de obstrução aplicados ao problema de empacotamento rotacional de polígonos irregulares não-convexos em recipientes fechados. [Internet] [Doctoral dissertation]. University of São Paulo; 2007. [cited 2019 Apr 26]. Available from: http://www.teses.usp.br/teses/disponiveis/3/3132/tde-07082007-165358/ ;.