The research is a study of the efficiency and robustness of genetic algorithm to instances of both discrete and continuous global optimization problems. We developed genetic algorithm based heuristics to find the global minimum to problem instances considered. In the discrete category, we considered two instances of real-world space allocation problems that arose from an academic environment in a developing country. These are the university timetabling problem and hostel space allocation problem. University timetabling represents a difficult optimization problem and finding a high quality solution is a challenging task. Many approaches, based on instances from developed countries, have been reported in the literature. However, most developing countries are yet to appreciate the deployment of heuristics and metaheuristics in handling the timetabling problem. We therefore worked on an instance from a university in Nigeria to show the feasibility and efficiency of heuristic method to the timetabling problem. We adopt a simplified bottom up approach in which timetable are build around departments. Thus a small portion of real data was used for experimental testing purposes. As with similar baseline studies in literature, we employ genetic algorithm to solve this instance and show that efficient solutions that meet stated constraints can be obtained with the metaheuristics. This thesis further focuses on an instance of university space allocation problem, namely the hostel space allocation problem. This is a new instance of the space allocation problems that has not been studied by metaheuristic researchers to the best of our knowledge. The problem aims at the allocation of categories of students into available hostel space. This must be done without violating any hard constraints but satisfying as many soft constraints as possible and ensuring optimum space utilization. We identified some issues in the problem that helped to adapt metaheuristic approach to solve it. The problem is multi-stage and highly constrained. We first highlight an initial investigation based on genetic algorithm adapted to find a good solution within the search space of the hostel space allocation problem. Some ideas are introduced to increase the overall performance of initial results based on instance of the problem from our case study. Computational results obtained are reported to demonstrate the effectiveness of the solution approaches employed. Sensitivity analysis was conducted on the genetic algorithm for the two SAPs considered to determine the best parameter values that consistently give good solutions. We noted that the genetic algorithms perform well specially, when repair strategies are incorporated. This thesis pioneers the application of metaheuristics to solve the hostel space allocation problem. It provides a baseline study of the problem based on genetic algorithms with associated test data sets. We report the best known results for the test instances. It is a known fact that many real-life problems are formulated as global optimization problems with continuous variables. On the continuous global optimization category therefore, we focus on improving the efficiency and reliability of real coded genetic algorithm for solving unconstrained global optimization, mainly through hybridization with exploratory features. Hybridization has widely been recognized as one of the most attractive approach to solving unconstrained global optimization. Literatures have shown that hybridization helps component heuristics to taking advantage of their individual strengths while avoiding their weaknesses. We therefore derived three modified forms of real coded genetic algorithm by hybridizing the standard real-coded genetic algorithm with pattern search and vector projection. These are combined to form three new algorithms namely, RCGA-PS, RCGA-P, and RCGA-PS-P. The hybridization strategy used and results obtained are reported and compared with the standard real-coded genetic algorithm. Experimental studies show that all the modified algorithms perform better than the original algorithm.

Submitted by Luciana Ferreira (lucgeral@gmail.com) on 2018-03-23T13:35:29Z No. of bitstreams: 2 Dissertação - Marcelo Rigonatto - 2018.pdf: 3204439 bytes, checksum: e554d45453ad15fd687b365cf88d1f8e (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2018-03-23T14:49:25Z (GMT) No. of bitstreams: 2 Dissertação - Marcelo Rigonatto - 2018.pdf: 3204439 bytes, checksum: e554d45453ad15fd687b365cf88d1f8e (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Made available in DSpace on 2018-03-23T14:49:25Z (GMT). No. of bitstreams: 2 Dissertação - Marcelo Rigonatto - 2018.pdf: 3204439 bytes, checksum: e554d45453ad15fd687b365cf88d1f8e (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2018-03-06 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / This work presents a proposal to introduce the study of vectors in High School, in order to oer a broader and clearer possibility for some mathematical demonstrations, applications and their use in other elds, such as Physics, for example. Make some demonstrations of trigonometry, of analytical and at geometries more playful and understandable, is the objective of this approach, besides, of course, oer conditions to work with vectors already in High School, oering pre requisites for future studies in the areas of Exact Sciences. / Esse trabalho apresenta uma proposta de introdução ao estudo dos vetores no Ensino Médio, com o intuito de oferecer uma possibilidade mais ampla e clara para algumas demonstrações matemáticas, aplicações e seu uso em outros campos, como na Física, por exemplo. Tornar algumas demonstrações da trigonometria, das geometrias analítica e plana mais lúdicas e compreensíveis é o objetivo dessa abordagem além, é claro, de oferecer condições de trabalhar com vetores já no Ensino Médio, proporcionando pré requisitos para futuros estudos nas áreas das Ciências Exatas.

L’objet de ce travail est de proposer un modèle adapté pour la simulation du remplissage de moules qui réponde au meilleur compromis entre temps de calcul et précision des résultats. La difficulté est double. Il faut prendre en compte le phénomène de remplissage qui est un problème complexe à frontières libres et les spécificités liées au Verre : viscosité fortement thermodépendante et température de fusion élevée qui nécessite de prendre en compte le rayonnement. Le Chapitre I est consacrée à la partie écoulement du Verre liquide. La bibliothèque numérique Aquilon/Thétis, adaptée pour traiter ce type de problèmes et les couplages thermique air/verre/parois, a été utilisée (Méthode V.O.F pour le suivi de l’interface, méthodes de type Lagrangien augmenté/Projection vectorielle pour le couplage Vitesse-Pression). Pour l’aspect radiatif, différentes approches sont proposées : conductivité radiative équivalente (Chapitre II), méthode explicite directe pour la validation (Chapitre III) et méthode d’harmoniques sphériques ou méthode PN (Chapitre IV). Dans le Chapitre V, la méthode PN retenue est validée dans des cas simples et est appliquée ensuite à des cas avec couplage convectif en géométries complexes et obstacles semi-transparents (1D, 2D et 3D, 2D axi-symétrique et milieu non gris). Une version P1 modifiée est présentée. Les résultats sont assez proches de ceux donnés par la méthode P3 avec des temps de calcul modestes. L’intérêt de ce modèle est qu’il est facilement intégrable dans des codes numériques existants : une seule équation différentielle du second ordre stationnaire à résoudre en 3D / The aim of this study is to propose an adapted model for the simulation of mould filling that must be a compromise solution between computational time and results accuracy. The double difficulty is to take into account the filling phenomenon that is a complex problem due to the presence of free boundaries and to the Glass specificities: viscosity that is highly thermal dependant and high melting temperature that requires taking into account radiation effects. Chapter I is devoted to the melting Glass flow. The numerical libraries Aquilon/Thétis, adapted for solving such type of problems and the thermal coupling between Air/Glass/Walls, has been used. (V.O.F method for front tracking, Augmented Lagrangian/Vector Projection methods for solving Pressure/Velocity coupling). For radiative aspect, different approaches are proposed: equivalent radiative conductivity (Chapter II), direct explicit method for validation (Chapter III) and spherical harmonics method or PN method (Chapter IV). In the Chapter V, the selected PN method is validated through simple cases and is then applied in other cases with convective coupling in complex geometries including semi-transparent inclusions (1D, 2D and 3D, 2D axi-symmetric and non grey medium). A P1 modified version is presented. The results are close to those given by P3 method but with reduced computational time. The main interest of this model is that it can be easily implemented in existing numerical codes: a single stationary second order partial differential equation to solve in 3D