The Bi-objective Periodic Closed Loop Network Design Problem

© 2019 Elsevier Ltd. This manuscript is made available under the terms of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International licence (CC BY-NC-ND 4.0). For further details please see: https://creativecommons.org/licenses/by-nc-nd/4.0/Reverse supply chains are becoming a crucial part of retail supply chains given the recent reforms in the consumers’ rights and the regulations by governments. This has motivated companies around the world to adopt zero-landfill goals and move towards circular economy to retain the product’s value during its whole life cycle. However, designing an efficient closed loop supply chain is a challenging undertaking as it presents a set of unique challenges, mainly owing to the need to handle pickups and deliveries at the same time and the necessity to meet the customer requirements within a certain time limit. In this paper, we model this problem as a bi-objective periodic location routing problem with simultaneous pickup and delivery as well as time windows and examine the performance of two procedures, namely NSGA-II and NRGA, to solve it. The goal is to find the best locations for a set of depots, allocation of customers to these depots, allocation of customers to service days and the optimal routes to be taken by a set of homogeneous vehicles to minimise the total cost and to minimise the overall violation from the customers’ defined time limits. Our results show that while there is not a significant difference between the two algorithms in terms of diversity and number of solutions generated, NSGA-II outperforms NRGA when it comes to spacing and runtime.Peer reviewedFinal Accepted Versio

Dimensionality Reduction of Quality Objectives for Web Services Design Modularization

With the increasing use of service-oriented Architecture (SOA) in new software development, there is a growing and urgent need to improve current practice in service-oriented design. To improve the design of Web services, the search for Web services interface modularization solutions deals, in general, with a large set of conflicting quality metrics. Deciding about which and how the quality metrics are used to evaluate generated solutions are always left to the designer. Some of these objectives could be correlated or conflicting. In this paper, we propose a dimensionality reduction approach based on Non-dominated Sorting Genetic Algorithm (NSGA-II) to address the Web services re-modularization problem. Our approach aims at finding the best-reduced set of objectives (e.g. quality metrics) that can generate near optimal Web services modularization solutions to fix quality issues in Web services interface. The algorithm starts with a large number of interface design quality metrics as objectives (e.g. coupling, cohesion, number of ports, number of port types, and number of antipatterns) that are reduced based on the nonlinear correlation information entropy (NCIE).The statistical analysis of our results, based on a set of 22 real world Web services provided by Amazon and Yahoo, confirms that our dimensionality reduction Web services interface modularization approach reduced significantly the number of objectives on several case studies to a minimum of 2 objectives and performed significantly better than the state-of-the-art modularization techniques in terms of generating well-designed Web services interface for users.Master of ScienceSoftware Engineering, College of Engineering & Computer ScienceUniversity of Michigan-Dearbornhttps://deepblue.lib.umich.edu/bitstream/2027.42/145687/1/Thesis Report_Hussein Skaf.pdfDescription of Thesis Report_Hussein Skaf.pdf : Thesi

Combining Simulation and Optimisation for Dimensioning Optimal Building Envelopes and HVAC Systems

Responding to the international calls for high energy performance buildings like nearly-zero energy buildings (nZEB), recent years have seen significant growth in energy-saving and energy-supply measures in the building sector. A detailed look at the possible combinations of measures indicates that there could be a huge number (possibly millions) of candidate designs. In exploring this number of designs, looking for optimal ones is an arduous multi-objective design task. Buildings are required to be not only energy-efficient but also economically feasible and environmentally sound while adhering to an ever-increasing demand for better indoor comfort levels. The current thesis introduces suitable methods and techniques that attempt to carry out time-efficient multivariate explorations and transparent multi-objective analysis for optimizing such complex building design problems. The thesis’s experiences can be considered as seeds for developing a generic simulation-based optimisation design tool for high-energy-performance buildings. Case studies are made to illustrate the effectiveness of the introduced methods and techniques. In all the studies, IDA-ICE is used for simulation and MATLAB is implemented for optimisation as well as supplementary calculations. A new program (IDA-ESBO) is used to simulate renewable energy source systems (RESs). Using detailed simulation programs was important to investigate the impact of the energy-saving measures (ESMs) and the RESs as well as their effects on the thermal and/or energy performance of the studied buildings. The case studies yielded many optimal design concepts (e.g., the type of heating/cooling (H/C) system is a key element to achieve environmentally friendly buildings with minimum life cycle cost. The cost-optimal implementations of ESMs and RESs depend significantly on the installed H/C system). On building regulations, comments are taken. For instance, in line with the cost-optimal methodology framework of the European Energy Performance of Buildings Directive (EPBD-recast 2010), our study showed that the Finnish building regulation D3-2012 specifies minimum energy performance requirements for dwellings, lower than the estimated cost-optimal level by more than 15%. The adaptive thermal comfort criteria of the Finnish Society of Indoor Air Quality (FiSIAQ-2008) are strict and do not allow for energy-efficient solutions in standard office buildings. The thesis shows that it is technically possible to speed up the optimisation resolution of the building and HVAC design problems and to reach an optimal or close-to-optimal solution set. A simulation-based optimisation approach with a suitable problem setup and resolution algorithm can efficiently explore the possible combinations of design options and support informative, optimal results for decision-makers.

Energy aware hybrid flow shop scheduling

Only if humanity acts quickly and resolutely can we limit global warming' conclude more than 25,000 academics with the statement of SCIENTISTS FOR FUTURE. The concern about global warming and the extinction of species has steadily increased in recent years

Intelligent Web Services Architecture Evolution Via An Automated Learning-Based Refactoring Framework

Architecture degradation can have fundamental impact on software quality and productivity, resulting in inability to support new features, increasing technical debt and leading to significant losses. While code-level refactoring is widely-studied and well supported by tools, architecture-level refactorings, such as repackaging to group related features into one component, or retrofitting files into patterns, remain to be expensive and risky. Serval domains, such as Web services, heavily depend on complex architectures to design and implement interface-level operations, provided by several companies such as FedEx, eBay, Google, Yahoo and PayPal, to the end-users. The objectives of this work are: (1) to advance our ability to support complex architecture refactoring by explicitly defining Web service anti-patterns at various levels of abstraction, (2) to enable complex refactorings by learning from user feedback and creating reusable/personalized refactoring strategies to augment intelligent designers’ interaction that will guide low-level refactoring automation with high-level abstractions, and (3) to enable intelligent architecture evolution by detecting, quantifying, prioritizing, fixing and predicting design technical debts. We proposed various approaches and tools based on intelligent computational search techniques for (a) predicting and detecting multi-level Web services antipatterns, (b) creating an interactive refactoring framework that integrates refactoring path recommendation, design-level human abstraction, and code-level refactoring automation with user feedback using interactive mutli-objective search, and (c) automatically learning reusable and personalized refactoring strategies for Web services by abstracting recurring refactoring patterns from Web service releases. Based on empirical validations performed on both large open source and industrial services from multiple providers (eBay, Amazon, FedEx and Yahoo), we found that the proposed approaches advance our understanding of the correlation and mutual impact between service antipatterns at different levels, revealing when, where and how architecture-level anti-patterns the quality of services. The interactive refactoring framework enables, based on several controlled experiments, human-based, domain-specific abstraction and high-level design to guide automated code-level atomic refactoring steps for services decompositions. The reusable refactoring strategy packages recurring refactoring activities into automatable units, improving refactoring path recommendation and further reducing time-consuming and error-prone human intervention.Ph.D.College of Engineering & Computer ScienceUniversity of Michigan-Dearbornhttps://deepblue.lib.umich.edu/bitstream/2027.42/142810/1/Wang Final Dissertation.pdfDescription of Wang Final Dissertation.pdf : Dissertatio

Search-Based Information Systems Migration: Case Studies on Refactoring Model Transformations

Information systems are built to last for decades; however, the reality suggests otherwise. Companies are often pushed to modernize their systems to reduce costs, meet new policies, improve the security, or to be more competitive. Model-driven engineering (MDE) approaches are used in several successful projects to migrate systems. MDE raises the level of abstraction for complex systems by relying on models as first-class entities. These models are maintained and transformed using model transformations (MT), which are expressed by means of transformation rules to transform models from source to target meta-models. The migration process for information systems may take years for large systems. Thus, many changes are going to be introduced to the transformations to reflect the new business requirements, fix bugs, or to meet the updated metamodels. Therefore, the quality of MT should be continually checked and improved during the evolution process to avoid future technical debts. Most MT programs are written as one large module due to the lack of refactoring/modularization and regression testing tools support. In object-oriented systems, composition and modularization are used to tackle the issues of maintainability and testability. Moreover, refactoring is used to improve the non-functional attributes of the software, making it easier and faster for developers to work and manipulate the code. Thus, we proposed an intelligent computational search approach to automatically modularize MT. Furthermore, we took inspiration from a well-defined quality assessment model for object-oriented design to propose a quality assessment model for MT in particular. The results showed a 45% improvement in the developer’s speed to detect or fix bugs, and developers made 40% less errors when performing a task with the optimized version. Since refactoring operations changes the transformation, it is important to apply regression testing to check their correctness and robustness. Thus, we proposed a multi-objective test case selection technique to find the best trade-off between coverage and computational cost. Results showed a drastic speed-up of the testing process while still showing a good testing performance. The survey with practitioners highlighted the need of such maintenance and evolution framework to improve the quality and efficiency of the existing migration process.Ph.D.College of Engineering & Computer ScienceUniversity of Michigan-Dearbornhttp://deepblue.lib.umich.edu/bitstream/2027.42/149153/1/Bader Alkhazi Final Dissertation.pdfDescription of Bader Alkhazi Final Dissertation.pdf : Restricted to UM users only

Predição da estrutura de proteínas off-lattice usando evolução diferencial multiobjetivo adaptativa

Protein Structure Prediction (PSP) can be considered one of the most challenging problems in Bioinformatics nowadays. When a protein is in its conformation state, the free energy is minimized. Evaluation of protein conformation is generally performed based on two values of the estimated free energy, i.e., those provided by intra and intermolecular interactions among atoms. Some recent experimental studies show that these interactions are in conflit, justifying the use of multiobjective optimization approaches to solve PSP. In this case, the energy optimization is performed separately, different from the mono-objective optimization which considers the sum of free energy. Differential Evolution (DE) is a technique based on Evolutionary Computation and represents an interesting alternative to solve multiobjective PSP. In this work, an optimizer based on DE is proposed to solve the PSP problem. Due to the great number of parameters, typical for evolutionary algorithms, this work also investigates adaptive parameters strategies. In experiments, a simple approach based on ED is evaluated for PSP. An evolution for this method, which incorporates concepts of the MOEA/D algorithm and parameter adaptation techniques is tested for a set of benchmarks in the multiobjective optimization context. The preliminary results for PSP (for six real proteins) are promising and those obtained for the benchmark set stands the proposed approach as a candidate to the state-of-art for multiobjective optimization.Fundação AraucáriaA Predição da Estrutura das Proteínas, conhecida como PSP (Protein Structure Prediction) pode ser considerada um dos problemas mais desafiadores da Bioinformática atualmente. Quando uma proteína está em seu estado de conformação nativa, a energia livre tende para um valor mínimo. Em geral, a predição da conformação de uma proteína por métodos computacionais é feita pela estimativa de dois valores de energia livre que são provenientes das interações intra e intermoleculares entre os átomos. Alguns estudos recentes indicam que estas interações estão em conflito, justificando o uso de abordagens baseadas em otimização multiobjetivo para a solução do PSP. Neste caso, a otimização destas energias é realizada separadamente, diferente da formulação mono-objetivo que considera a soma das energias. A Evolução Diferencial (ED) é uma técnica baseada em Computação Evolucionária e representa uma alternativa interessante para abordar o PSP. Este trabalho busca desenvolver um otimizador baseado no algoritmo de ED para o problema da Predição da Estrutura de Proteínas multiobjetivo. Este trabalho investiga ainda estratégias baseadas em parâmetros adaptativos para a evolução diferencial. Nicialmente avalia-se uma abordagem simples baseada em ED proposta para a solução do PSP. Uma evolução deste método que incorpora conceitos do algoritmo MOEA/D e adaptação de parâmetros é testada em um conjunto de problemas benchmark de otimização multiobjetivo. Os resultados preliminares obtidos para o PSP (para seis proteínas reais) são promissores e aqueles obtidos para o conjunto benchmark colocam a abordagem proposta como candidata para otimização multiobjetivo

Predição da estrutura de proteínas off-lattice usando evolução diferencial multiobjetivo adaptativa

Protein Structure Prediction (PSP) can be considered one of the most challenging problems in Bioinformatics nowadays. When a protein is in its conformation state, the free energy is minimized. Evaluation of protein conformation is generally performed based on two values of the estimated free energy, i.e., those provided by intra and intermolecular interactions among atoms. Some recent experimental studies show that these interactions are in conflit, justifying the use of multiobjective optimization approaches to solve PSP. In this case, the energy optimization is performed separately, different from the mono-objective optimization which considers the sum of free energy. Differential Evolution (DE) is a technique based on Evolutionary Computation and represents an interesting alternative to solve multiobjective PSP. In this work, an optimizer based on DE is proposed to solve the PSP problem. Due to the great number of parameters, typical for evolutionary algorithms, this work also investigates adaptive parameters strategies. In experiments, a simple approach based on ED is evaluated for PSP. An evolution for this method, which incorporates concepts of the MOEA/D algorithm and parameter adaptation techniques is tested for a set of benchmarks in the multiobjective optimization context. The preliminary results for PSP (for six real proteins) are promising and those obtained for the benchmark set stands the proposed approach as a candidate to the state-of-art for multiobjective optimization.Fundação AraucáriaA Predição da Estrutura das Proteínas, conhecida como PSP (Protein Structure Prediction) pode ser considerada um dos problemas mais desafiadores da Bioinformática atualmente. Quando uma proteína está em seu estado de conformação nativa, a energia livre tende para um valor mínimo. Em geral, a predição da conformação de uma proteína por métodos computacionais é feita pela estimativa de dois valores de energia livre que são provenientes das interações intra e intermoleculares entre os átomos. Alguns estudos recentes indicam que estas interações estão em conflito, justificando o uso de abordagens baseadas em otimização multiobjetivo para a solução do PSP. Neste caso, a otimização destas energias é realizada separadamente, diferente da formulação mono-objetivo que considera a soma das energias. A Evolução Diferencial (ED) é uma técnica baseada em Computação Evolucionária e representa uma alternativa interessante para abordar o PSP. Este trabalho busca desenvolver um otimizador baseado no algoritmo de ED para o problema da Predição da Estrutura de Proteínas multiobjetivo. Este trabalho investiga ainda estratégias baseadas em parâmetros adaptativos para a evolução diferencial. Nicialmente avalia-se uma abordagem simples baseada em ED proposta para a solução do PSP. Uma evolução deste método que incorpora conceitos do algoritmo MOEA/D e adaptação de parâmetros é testada em um conjunto de problemas benchmark de otimização multiobjetivo. Os resultados preliminares obtidos para o PSP (para seis proteínas reais) são promissores e aqueles obtidos para o conjunto benchmark colocam a abordagem proposta como candidata para otimização multiobjetivo

Evolutionary multiobjective optimization : review, algorithms, and applications

Programa Doutoral em Engenharia Industrial e SistemasMany mathematical problems arising from diverse elds of human activity can be formulated as optimization problems. The majority of real-world optimization problems involve several and con icting objectives. Such problems are called multiobjective optimization problems (MOPs). The presence of multiple con icting objectives that have to be simultaneously optimized gives rise to a set of trade-o solutions, known as the Pareto optimal set. Since this set of solutions is crucial for e ective decision-making, which generally aims to improve the human condition, the availability of e cient optimization methods becomes indispensable. Recently, evolutionary algorithms (EAs) have become popular and successful in approximating the Pareto set. The population-based nature is the main feature that makes them especially attractive for dealing with MOPs. Due to the presence of two search spaces, operators able to e ciently perform the search in both the decision and objective spaces are required. Despite the wide variety of existing methods, a lot of open research issues in the design of multiobjective evolutionary algorithms (MOEAs) remains. This thesis investigates the use of evolutionary algorithms for solving multiobjective optimization problems. Innovative algorithms are developed studying new techniques for performing the search either in the decision or the objective space. Concerning the search in the decision space, the focus is on the combinations of traditional and evolutionary optimization methods. An issue related to the search in the objective space is studied in the context of many-objective optimization. Application of evolutionary algorithms is addressed solving two di erent real-world problems, which are modeled using multiobjective approaches. The problems arise from the mathematical modelling of the dengue disease transmission and a wastewater treatment plant design. The obtained results clearly show that multiobjective modelling is an e ective approach. The success in solving these challenging optimization problems highlights the practical relevance and robustness of the developed algorithms.Muitos problemas matemáticos que surgem nas diversas áreas da atividade humana podem ser formulados como problemas de otimização. A maioria dos problemas do mundo real envolve vários objetivos conflituosos. Tais problemas chamam-se problemas de otimização multiobjetivo. A presença de vários objetivos conflituosos, que têm de ser otimizados em simultâneo, dá origem a um conjunto de soluções de compromisso, conhecido como conjunto de soluções ótimas de Pareto. Uma vez que este conjunto de soluções é fundamental para uma tomada de decisão eficaz, cujo objetivo em geral é melhorar a condição humana, o desenvolvimento de métodos de otimização eficientes torna-se indispensável. Recentemente, os algoritmos evolucionários tornaram-se populares e bem-sucedidos na aproximação do conjunto de Pareto. A natureza populacional é a principal característica que os torna especialmente atraentes para lidar com problemas de otimização multiobjetivo. Devido à presença de dois espaços de procura, operadores capazes de realizar a procura de forma eficiente, tanto no espaço de decisão como no espaço dos objetivos, são necessários. Apesar da grande variedade de métodos existentes, várias questões de investigação permanecem em aberto na área do desenvolvimento de algoritmos evolucionários multiobjetivo. Esta tese investiga o uso de algoritmos evolucionários para a resolução de problemas de otimização multiobjetivo. São desenvolvidos algoritmos inovadores que estudam novas técnicas de procura, quer no espaço de decisão, quer no espaço dos objetivos. No que diz respeito à procura no espaço de decisão, o foco está na combinação de métodos de otimização tradicionais com algoritmos evolucionários. A questão relacionada com a procura no espaço dos objetivos é desenvolvida no contexto da otimização com muitos objetivos. A aplicação dos algoritmos evolucionários é abordada resolvendo dois problemas reais, que são modelados utilizando abordagens multiobjectivo. Os problemas resultam da modelação matemática da transmissão da doença do dengue e do desenho ótimo de estações de tratamento de águas residuais. O sucesso na resolução destes problemas de otimização constitui um desafio e destaca a relevância prática e robustez dos algoritmos desenvolvidos

Novas estratégias para otimização por nuvem de partículas aplicadas a problemas com muitos objetivos

Orientadora: Profa. Dra. Aurora Trinidad Ramirez PozoTese (doutorado) - Universidade Federal do Paraná, Setor de Ciências Exatas, Curso de Pós-Graduação em Informática. Defesa: Curitiba, 14/03/2013Bibliografia: fls.206-218Resumo: Problemas de otimização multiobjetivo possuem mais de uma função objetivo que estão em conflito. Devido a essa característica, nao existe somente uma melhor soluçao, mas sim um conjunto com as melhores soluções do problema, definidas pelos conceitos da teoria da Otimalidade de Pareto. Algoritmos Evolucionarios Multiobjetivo sao aplicados com sucesso em diversos Problemas de Otimizacão Multiobjetivo. Dentre esses algoritmos, os baseados na Otimizaçao por Nuvem de Partículas Multiobjetivo (MOPSO) apresentam bons resultados para problemas multiobjetivo e se destacam por possuirem características específicas, como a cooperaçao entre as partículas da populacao. Porem, quando o numero de funcoes objetivo cresce, os algoritmos evolucionários multiobjetivo baseados em dominancia de Pareto encontram algumas dificuldades em definir quais sao as melhores solucoes e nao efetuam uma busca que converge para as soluçães ótimas do problema. A Otimizaçao com muitos objetivos e uma area nova que visa propor novos metodos para reduzir a deterioracao da busca desses algoritmos em problemas de otimizacão com muitos objetivos (problemas com mais de três funcoes objetivo). Assim, motivado por esse campo de pesquisa ainda em aberto e pelo fato da meta-heurística MOPSO ser pouco utilizada na Otimizaçao com Muitos Objetivos, este trabalho de doutorado contribuí com a proposta de novas metodos e algoritmos que buscam explorar três diferentes aspectos da Otimizacao por Nuvem de Partículas Multiobjetivo: uso de novas relacoes de preferencias, metodos de arquivamento e algoritmos MOPSO com multiplos enxames. Neste estudo, íe feita uma aníalise empírica que utiliza um conjunto de indicadores de qualidade e problemas de benchmark com o intuito de analisar aspectos como convergencia e diversidade da busca dos algoritmos utilizados. Por fim, esta tese traca os principais caminhos que serãao seguidos nos trabalhos futuros.Abstract: Multiobjective Optimization Problems have more than one objective function that are often in conflict. Therefore, there is no single best solution, but a set of the best solutions defined by the concepts of Pareto Optimality theory. Multiobjective Evolutionary Algorithms are applied successfully in several Multiobjective Optimization Problems. Among these algorithms, we highlight those based on Multiobjective Particle Swarm Optimization (MOPSO), since they have good results for multiobjective problems and exhibit unique characteristics such as cooperation among individuals of the population. However, Multi- Objective Evolutionary Algorithms scale poorly when the number of objectives increases. Many-Objective Optimization Problems are problems that have more than three objective functions. Many-Objective Optimization is a new area, which aims to propose new methods to reduce the deterioration of these algorithms. Thus, motivated by this research field still open and the fact that MOPSO algorithms are still underused in Many-Objective Optimization, this work aims to propose new methods for MOPSO metaheuristic applied to this context. The main contribution of this PhD work is the proposal of new methods and algorithms that seek to explore three different aspects of MOPSO metaheuristic: the use of new preference relations, exploring methods of archiving and exploring multi-swarm algorithms. Another important feature presented in this thesis are the empirical analyzes used to validate all new techniques. In this study, we use a set of quality indicators and benchmark problems in order to analyze aspects such as convergence and diversity of the search. Finally, this thesis outlines the main paths that will be followed in future work