4 research outputs found
Comprehensive Taxonomies of Nature- and Bio-inspired Optimization: Inspiration Versus Algorithmic Behavior, Critical Analysis Recommendations
In recent algorithmic family simulates different biological processes observed in Nature in order to efficiently address complex optimization problems. In the last years the number of bio-inspired optimization approaches in literature has grown considerably, reaching unprecedented levels that dark the future prospects of this field of research. This paper addresses this problem by proposing two comprehensive, principle-based taxonomies that allow researchers to organize existing and future algorithmic developments into well-defined categories, considering two different criteria: the source of inspiration and the behavior of each algorithm. Using these taxonomies we review more than three hundred publications dealing with nature- inspired and bio-inspired algorithms, and proposals falling within each of these categories are examined, leading to a critical summary of design trends and similarities between them, and the identification of the most similar classical algorithm for each reviewed paper. From our analysis we conclude that a poor relationship is often found between the natural inspiration of an algorithm and its behavior. Furthermore, similarities in terms of behavior between different algorithms are greater than what is claimed in their public disclosure: specifically, we show that more than one-third of the reviewed bio-inspired solvers are versions of classical algorithms. Grounded on the conclusions of our critical analysis, we give several recommendations and points of improvement for better methodological practices in this active and growing research field
Algoritmos de aproximação para problemas de roteamento e conectividade com múltiplas funções de distância
Orientador: Lehilton Lelis Chaves PedrosaDissertação (mestrado) - Universidade Estadual de Campinas, Instituto de ComputaçãoResumo: Nesta dissertação, estudamos algumas generalizações de problemas clássicos de roteamento e conectividade cujas instâncias são compostas por um grafo completo e múltiplas funções de distância. Por exemplo, existe o Problema do Caixeiro Alugador (CaRS), no qual um viajante deseja visitar um conjunto de cidades alugando um ou mais carros disponíveis. Cada carro tem uma função de distância e uma taxa de retorno ao local do aluguel. CaRS é uma generalização do Problema do Caixeiro Viajante (TSP). Nós lidamos com esses problemas usando algoritmos de aproximação, que são algoritmos eficientes que produzem soluções com garantia de qualidade. Neste trabalho, são apresentadas duas abordagens, uma baseada em uma redução linear que preserva o fator de aproximação e outra baseada na construção de instâncias de dois problemas distintos. Os problemas considerados são o Steiner TSP, o Problema do Passeio com Coleta de Prêmios e o Problema da Floresta Restrita. Generalizamos cada um desses problemas considerando múltiplas funções de distância e, para cada um deles, apresentamos um algoritmo de aproximação com fator O(logn), onde n é o número de vértices (cidades). Essas aproximações são assintoticamente ótimas, já que não há algoritmos com fator o(log n), a não ser que P = NPAbstract: In this dissertation, we study some generalizations of classical routing and connectivity problems whose instances are composed of a complete graph and multiple distance functions. As an example, there is the Traveling Car Renter Problem (CaRS) in which a traveler wants to visit a set of cities by renting one or more available cars. Each car is associated to a distance function and a service fee to return to the rental location. CaRS is a generalization of the Traveling Salesman Problem (TSP). We deal with these problems using approximation algorithms which are efficient algorithms that produce solutions with quality guarantee. In this work, two approaches are presented, one based on a linear reduction that preserves the approximation factor and the other based on the construction of instances of two distinct problems. The studied problems are the Steiner TSP, the Profitable Tour Problem, and the Constrained Forest Problem. We generalize these problems by considering multiple distance functions and, for each of them, we present an O(log n)-approximation algorithm, where n is the number of vertices (cities). The factor is asymptotically optimal, since there is no approximation algorithm with factor o(log n) unless P = NPMestradoCiência da ComputaçãoMestra em Ciência da Computação001CAPE
Comprehensive Taxonomies of Nature- and Bio-inspired Optimization: Inspiration versus Algorithmic Behavior, Critical Analysis and Recommendations
In recent years, a great variety of nature- and bio-inspired algorithms has
been reported in the literature. This algorithmic family simulates different
biological processes observed in Nature in order to efficiently address complex
optimization problems. In the last years the number of bio-inspired
optimization approaches in literature has grown considerably, reaching
unprecedented levels that dark the future prospects of this field of research.
This paper addresses this problem by proposing two comprehensive,
principle-based taxonomies that allow researchers to organize existing and
future algorithmic developments into well-defined categories, considering two
different criteria: the source of inspiration and the behavior of each
algorithm. Using these taxonomies we review more than three hundred
publications dealing with nature-inspired and bio-inspired algorithms, and
proposals falling within each of these categories are examined, leading to a
critical summary of design trends and similarities between them, and the
identification of the most similar classical algorithm for each reviewed paper.
From our analysis we conclude that a poor relationship is often found between
the natural inspiration of an algorithm and its behavior. Furthermore,
similarities in terms of behavior between different algorithms are greater than
what is claimed in their public disclosure: specifically, we show that more
than one-third of the reviewed bio-inspired solvers are versions of classical
algorithms. Grounded on the conclusions of our critical analysis, we give
several recommendations and points of improvement for better methodological
practices in this active and growing research field.Comment: 76 pages, 6 figure