Submitted by Automa??o e Estat?stica (sst@bczm.ufrn.br) on 2016-08-26T23:09:02Z No. of bitstreams: 1 IngridMorganeMedeirosDeLucena_DISSERT.pdf: 1893477 bytes, checksum: af3baeea1aaa51a500a23196c3ed264b (MD5) / Approved for entry into archive by Arlan Eloi Leite Silva (eloihistoriador@yahoo.com.br) on 2016-08-30T23:12:54Z (GMT) No. of bitstreams: 1 IngridMorganeMedeirosDeLucena_DISSERT.pdf: 1893477 bytes, checksum: af3baeea1aaa51a500a23196c3ed264b (MD5) / Made available in DSpace on 2016-08-30T23:12:54Z (GMT). No. of bitstreams: 1 IngridMorganeMedeirosDeLucena_DISSERT.pdf: 1893477 bytes, checksum: af3baeea1aaa51a500a23196c3ed264b (MD5) Previous issue date: 2016-02-03 / A ?rea denominada de Engenharia de Software Baseada em Pesquisa (Search Based Software Engineering) vem crescendo nas ?ltimas d?cadas e possui um grande n?mero de trabalhos dedicados a ela. Esta ?rea re?ne a Engenharia de Software e a Otimiza??o no desenvolvimento de algoritmos que otimizem os custos de atividades inerentes ao processo do desenvolvimento de software. Dentre tais atividades est? o teste de software, o qual visa verificar, detectar e corrigir poss?veis erros cometidos pelos programadores. Uma vez que esta atividade ? respons?vel por at? 50% do custo total do desenvolvimento, os pesquisadores buscam minimizar o custo dos testes sem comprometer a qualidade do software. Os primeiros trabalhos abordando atividades de Teste de Software como problemas de otimiza??o surgiram na d?cada de 70. Este trabalho tem por objetivo realizar uma revis?o do estado-da-arte das t?cnicas e algoritmos de otimiza??o desenvolvidos para teste de software, estendendo um trabalho anterior, com a revis?o de 415 artigos da ?rea. ?, tamb?m, apresentada uma classifica??o de tais trabalhos quanto aos tipos de m?tricas, algoritmos de otimiza??o e outras caracter?sticas dos problemas inerentes ao teste de software. / The area known as Search Based Software Engineering has been growing in recent decades and has a large number of works dedicated to it. This area gathers the Software Engineering and Optimization in the development of algorithms that optimize the costs of activities related to the software development process. Software testing is one among those activities which aims at checking, detecting and correcting possible errors made by programmers. Since this activity is responsible for 50% of the total development cost, researchers seek to minimize testing costs without compromising the software quality. Early works addressing Software Testing activities as optimization problems arose in the 70s. This paper aims to conduct a review of the state of the art techniques and optimization algorithms developed for a major problem area, the Test Data Generation problem. A classification of works by metrics, optimization algorithms and other characteristics inherent to software testing problem.

Submitted by Automa??o e Estat?stica (sst@bczm.ufrn.br) on 2016-08-16T20:15:31Z No. of bitstreams: 1 GuilhermeFernandesDeAraujo_DISSERT.pdf: 1848505 bytes, checksum: eaa10d2add37ab0c93d005b148c492ee (MD5) / Approved for entry into archive by Arlan Eloi Leite Silva (eloihistoriador@yahoo.com.br) on 2016-08-17T22:17:58Z (GMT) No. of bitstreams: 1 GuilhermeFernandesDeAraujo_DISSERT.pdf: 1848505 bytes, checksum: eaa10d2add37ab0c93d005b148c492ee (MD5) / Made available in DSpace on 2016-08-17T22:17:58Z (GMT). No. of bitstreams: 1 GuilhermeFernandesDeAraujo_DISSERT.pdf: 1848505 bytes, checksum: eaa10d2add37ab0c93d005b148c492ee (MD5) Previous issue date: 2016-02-12 / O Problema do Caixeiro Viajante com Caronas M?ltiplas (PCV-MCa) ? uma classe do Caixeiro Viajante Capacitado que apresenta a possibilidade de compartilhamento de assentos para passageiros aproveitando os deslocamentos do caixeiro entre as localidades do ciclo. O caixeiro divide o custo do trajeto com os passageiros embarcados. O modelo pode representar uma situa??o real em que, por exemplo, motoristas est?o dispostos a compartilhas trechos de sua viagem com turistas que pretendem se deslocar entre duas localidades visitadas pela rota do motorista, aceitando compartilhar o ve?culo com outros indiv?duos e visitando outras localidades do ciclo. / The Traveling Salesman with Multiple Ridesharing (TSP-MR) is a type of the Capacitated Traveling Salesman, which presents the possibility of sharing seats with passengers taking advantage of the paths the salesman travels through his cycle. The salesman shares the cost of a path with the boarded passengers. This model can portray a real situation in which, for example, drivers are willing to share parts of a trip with tourists that wish to move between two locations visited by the driver?s route, accepting to share the vehicle with other individuals visiting other locations within the cycle. This work proposes a mathematical formulation for the problem, and an exact and metaheuristics algorithms for its solution, comparing them.

Submitted by Automa??o e Estat?stica (sst@bczm.ufrn.br) on 2016-04-08T22:40:13Z No. of bitstreams: 1 ThatianaCunhaNavarroDeSouza_TESE.pdf: 4253732 bytes, checksum: b88b33669e4903291d2e3da03d76f832 (MD5) / Approved for entry into archive by Arlan Eloi Leite Silva (eloihistoriador@yahoo.com.br) on 2016-04-11T22:01:06Z (GMT) No. of bitstreams: 1 ThatianaCunhaNavarroDeSouza_TESE.pdf: 4253732 bytes, checksum: b88b33669e4903291d2e3da03d76f832 (MD5) / Made available in DSpace on 2016-04-11T22:01:06Z (GMT). No. of bitstreams: 1 ThatianaCunhaNavarroDeSouza_TESE.pdf: 4253732 bytes, checksum: b88b33669e4903291d2e3da03d76f832 (MD5) Previous issue date: 2015-03-13 / Um importante problema enfrentado pela ind?stria petrol?fera ? distribuir v?rios produtos derivados de petr?leo atrav?s de polidutos. Tal distribui??o ? feita atrav?s de uma rede composta por refinarias (n?s fonte), parques de armazenagem (n?s intermedi?rios) e terminais (n?s de demanda), interligados por um conjunto de polidutos que transportam petr?leo e derivados entre ?reas adjacentes. Restri??es relativas a limites de armazenamento, tempo de entrega, disponibilidade das fontes, limites de envio e recebimento, entre outras, t?m de ser satisfeitas. Alguns pesquisadores lidam com este problema sob o ponto de vista discreto onde o fluxo na rede ? visto como o envio de bateladas. Geralmente, n?o existem dispositivos de separa??o entre bateladas de produtos diferentes e as perdas devidas ? interface podem ser significativas. Minimizar o tempo de entrega ? um objetivo usual dos engenheiros durante a programa??o do envio de produtos em redes de polidutos. No entanto, os custos devidos ?s perdas geradas nas interfaces n?o podem ser desconsiderados. O custo do envio dos produtos tamb?m depende das despesas de bombeamento as quais s?o, em grande parte, devidas ao custo da energia el?trica. Uma vez que a tarifa industrial de energia el?trica varia ao longo do dia, o bombeamento em diferentes per?odos ter?o diferentes custos. Este trabalho apresenta uma investiga??o experimental de m?todos computacionais desenvolvidos para lidar com o problema do envio de bateladas de derivados de petr?leo considerando a minimiza??o simult?nea de tr?s fun??es objetivo: tempo de entrega, perdas devidas ?s interfaces e custo de energia el?trica. Tal problema ? NP- ?rduo e ser? abordado atrav?s de algoritmos evolucion?rios h?bridos. As hibridiza??es t?m como foco principal os Algoritmos Transgen?ticos e arquiteturas cl?ssicas de algoritmos evolucion?rios multi-objetivo como MOEA/D, NSGA2 e SPEA2. Tr?s arquiteturas denominadas MOTA/D, NSTA e SPETA, s?o aplicadas ao problema. ? apresentado um estudo experimental dos algoritmos propostos onde ? utilizado um conjunto de trinta casos teste. Para analisar os resultados obtidos com os algoritmos s?o empregados indicadores de qualidade Pareto concordantes e testes estat?sticos n?o param?tricos. / An important problem faced by the oil industry is to distribute multiple oil products through pipelines. Distribution is done in a network composed of refineries (source nodes), storage parks (intermediate nodes), and terminals (demand nodes) interconnected by a set of pipelines transporting oil and derivatives between adjacent areas. Constraints related to storage limits, delivery time, sources availability, sending and receiving limits, among others, must be satisfied. Some researchers deal with this problem under a discrete viewpoint in which the flow in the network is seen as batches sending. Usually, there is no separation device between batches of different products and the losses due to interfaces may be significant. Minimizing delivery time is a typical objective adopted by engineers when scheduling products sending in pipeline networks. However, costs incurred due to losses in interfaces cannot be disregarded. The cost also depends on pumping expenses, which are mostly due to the electricity cost. Since industrial electricity tariff varies over the day, pumping at different time periods have different cost. This work presents an experimental investigation of computational methods designed to deal with the problem of distributing oil derivatives in networks considering three minimization objectives simultaneously: delivery time, losses due to interfaces and electricity cost. The problem is NP-hard and is addressed with hybrid evolutionary algorithms. Hybridizations are mainly focused on Transgenetic Algorithms and classical multi-objective evolutionary algorithm architectures such as MOEA/D, NSGA2 and SPEA2. Three architectures named MOTA/D, NSTA and SPETA are applied to the problem. An experimental study compares the algorithms on thirty test cases. To analyse the results obtained with the algorithms Pareto-compliant quality indicators are used and the significance of the results evaluated with non-parametric statistical tests.

Submitted by Automa??o e Estat?stica (sst@bczm.ufrn.br) on 2018-03-02T23:39:14Z No. of bitstreams: 1 BrennerHumbertoOjedaRios_DISSERT.pdf: 2438215 bytes, checksum: 3e559bfdaf797a4b9164e336ebd13429 (MD5) / Approved for entry into archive by Arlan Eloi Leite Silva (eloihistoriador@yahoo.com.br) on 2018-03-13T18:44:23Z (GMT) No. of bitstreams: 1 BrennerHumbertoOjedaRios_DISSERT.pdf: 2438215 bytes, checksum: 3e559bfdaf797a4b9164e336ebd13429 (MD5) / Made available in DSpace on 2018-03-13T18:44:23Z (GMT). No. of bitstreams: 1 BrennerHumbertoOjedaRios_DISSERT.pdf: 2438215 bytes, checksum: 3e559bfdaf797a4b9164e336ebd13429 (MD5) Previous issue date: 2018-02-02 / Coordena??o de Aperfei?oamento de Pessoal de N?vel Superior (CAPES) / O Problema do Caixeiro Viajante com Aluguel de Carros, ou simplesmente Problema do Caixeiro Alugador (PCA), ? uma generaliza??o do cl?ssico Problema do Caixeiro Viajante (PCV) onde seu tour de visitas pode ser decomposto em caminhos cont?guos que podem ser percorridos com diferentes carros alugados. O objetivo ? determinar o circuito hamiltoniano que resulte em um custo final m?nimo, considerando a penaliza??o paga em cada troca de ve?culos no tour. A penaliza??o ? o custo de retornar o carro at? a cidade onde foi alugado. O PCA est? classificado como um problema NP-dif?cil. O presente trabalho estuda a variante mais usada na literatura do PCA que ?: completo, total, irrestrito, sem repeti??o, livre e sim?trico. O foco da pesquisa s?o os procedimentos h?bridos que combinam meta-heur?sticas e m?todos baseados na Programa??o Linear. S?o hibridizados: algoritmos cient?ficos (ScA), descida em vizinhan?a vari?vel (VND), busca local adaptativa (ALSP) e uma nova variante do ALSP chamada busca local adaptativa iterativa (IALSP). As seguintes t?cnicas s?o propostas para lidar com o PCA: ScA+ALSP, ScA+IALSP e ScA+VND+IALSP. ? proposto um modelo de programa??o inteira mista para o PCA o qual ? usado no ALSP e no IALSP. Testes n?o param?tricos s?o usados para comparar os algoritmos em um conjunto de inst?ncias da literatura. / The Traveling Car Renter Salesman Problem, or simply Traveling Car Renter Problem (CaRS), is a generalization of the Traveling Salesman Problem (TSP) where the tour can be decomposed into contiguous paths that are traveled by different rented cars. The objective is to construct a minimal cost Hamiltonian circuit, considering the penalty paid for changing cars in the tour. This penalty is the cost of returning a car to the city where it was rented. CaRS is classified as an NP-hard problem. This work studies the CaRS version classified as: complete, total, unrestricted, with no repetition, free and symmetric. This research is focused on hybrid procedures that combine metaheuristics and methods based on Linear Programming (LP). The following methods were investigated: scientific algorithms (ScA), variable neighborhood descent (VND), adaptive local search (ASLP) and a new variant of ALSP called iterated adaptive local search (IALSP). The following techniques are proposed to deal with CaRS: ScA+ALSP, ScA+IALSP and ScA+VND+IALSP. A mixed integer programming model is proposed for CaRS which was used in the ALSP and IALSP. Non-parametric tests were used to compare the algorithms within a set of instances from the literature.