A carregar...
20 resultados
Resultados da pesquisa
A mostrar 1 - 10 de 20
- CROSS-PLATFORM DEVELOPMENT FOR E-COMMERCEPublication . Vieira, Leandro; Bernardino, Anabela; Bernardino, EugéniaElectronic commerce is generally seen as a competitor for physical stores, however, this paper proposes a solution where they work side-by-side to improve the in-store customer experience. An application directed for store retailers was created with the cross-platform framework React Native, making it available for Android, iOS, and the web. Using thebe of their interest, and place orders, providing the customer with a unique and faster shopping experience.
- Solving the Ring Loading Problem Using Genetic Algorithms with Intelligent Multiple OperatorsPublication . Bernardino, Anabela M.; Bernardino, Eugénia M.; Sánchez-Pérez, Juan M.; Gómez-Pulido, Juan A.; Vega-Rodríguez, Miguel A.; Moreira Bernardino, Anabela; Bernardino, EugéniaPlanning optical communication networks suggests a number of new optimization problems, most of them in the field of combinatorial optimization. We address here the Ring Loading Problem. The objective of the problem is to find a routing scheme such that the maximum weighted load on the ring is minimized. In this paper we consider two variants: (i) demands can be split into two parts, and then each part is sent in a different direction; (ii) each demand must be entirely routed in either of the two directions, clockwise or counterclockwise. In this paper, we propose a genetic algorithm employing multiple crossover and mutation operators. Two sets of available crossover and mutation operators are established initially. In each generation a crossover method is selected for recombination and a mutation method is selected for mutation based on the amount fitness improvements achieve over a number of previous operations (recombinations/mutations). We use tournament selection for this purpose. Simulation results with the different methods implemented are compared.
- Solving the Terminal Assignment Problem Using a Local Search Genetic AlgorithmPublication . Bernardino, Eugénia M.; Bernardino, Anabela M.; Sánchez-Pérez, Juan M.; Gómez-Pulido, Juan A.; Vega-Rodríguez, Miguel A.; Bernardino, Eugénia; Moreira Bernardino, AnabelaTerminal assignment is an important issue in telecommunication networks optimization. The task here is to assign a given collection of terminals to a given collection of concentrators. The main objective is to minimize the link cost to form a network. This optimization task is an NP-complete problem. The intractability of this problem is a motivation for the pursuits of a local search genetic algorithm that produces approximate, rather than exact, solutions. In this paper, we explore one of the most successful emerging ideas combining local search with population-based search. Simulation results verify the effectiveness of the proposed method. The results show that our algorithm provides good solutions in a better running time.
- Billing in the Mobile Era : Octa Code’s Study CasePublication . Andrade, Eduardo; Bernardino, Anabela; Bernardino, EugeniaNa era digital, cada vez mais os serviços existentes se adaptam às novas tecnologias e aos seus benefícios. Com o surgimento de nova legislação, irá passar a ser obrigatório a utilização de plataformas digitas para todos os documentos de faturação. Com esta alteração, surge a necessidade de aplicações móveis que possam ser utilizadas em qualquer lado para substituir a tradicional fatura manual ainda utilizada em muitos negócios de cariz ambulante, onde o manuseamento de computadores ou portáteis não é fácil. Mas este novo mercado cria também novos desafios e problemas que serão explorados no caso de estudo em questão. Octa Gest Faturas, da Octa Code, é uma nova aplicação que pretende destacar-se ao oferecer uma experiência de fácil utilização, enquanto ao mesmo tempo aplica as práticas recomendadas no desenvolvimento de aplicações móveis.
- Solving the Regenerator Location Problem using bioinspired algorithmsPublication . Pessoa, Rodrigo; Ferreira, Pedro Henrique; Bernardino, Anabela; Bernardino, Eugénia; Piedade, Maria Beatriz Guerra daNas redes óticas, a força de um sinal ótico deteriora-se à medida que fica mais longe da fonte, devido a deficiências de transmissão na fibra. Ou seja, a distância a que um sinal ótico pode ser enviado sem perder ou deteriorar a informação é limitada. É por isso necessário regenerar os sinais periodicamente, utilizando regeneradores. Dada uma rede ótica, o problema da localização de regeneradores procura que o subconjunto de regeneradores seja instalado a um custo mínimo, de modo a que cada par de nós possa comunicar entre si. Neste artigo são aplicados algoritmos baseadosna natureza para resolver este problema. Foram testadas 480instâncias diferentes para cada um dos algoritmos e os resultados comprovam a sua eficiência em termos de tempo e qualidade das soluções.
- Hybrid Honey Bees Mating Optimisation algorithm to assign terminals to concentratorsPublication . Bernardino, Eugénia M.; Bernardino, Anabela M.; Sánchez-Pérez, Juan Manuel; Gómez-Pulido, Juan Antonio; Vega-Rodríguez, Miguel AngelIn this paper we propose a new approach to assign terminals to concentrators using a Hybrid Honey Bees Mating Optimisation algorithm. Honey Bees Mating Optimisation (HBMO) algorithm is a swarm-based optimisation algorithm, which simulates the mating process of real honey bees. We apply a hybridisation of HBMO to solve a combinatorial optimisation problem known as Terminal Assignment Problem (TAP). The purpose is to connect a given set of terminals to a given set of concentrators and minimise the link cost to form a communication network. The feasibility of Hybrid HBMO is demonstrated and compared with the solutions obtained by other algorithms from literature over different TAP instances.
- A Hybrid Scatter Search algorithm to assign terminals to concentratorsPublication . Bernardino, Eugénia Moreira; Bernardino, Anabela Moreira; Sánchez-Pérez, Juan Manuel; Gómez-Pulido, Juan Antonio; Vega-Rodríguez, Miguel AngelThe last few years have seen a significant growth in communication networks. With the growth of data traffic, network operators seek network-engineering tools to extract the maximum benefits out of the existing infrastructure. This has suggested a number of new optimisation problems, most of them in the field of combinatorial optimisation. We address here the Terminal Assignment problem. The main objective is to assign a collection of terminals to a collection of concentrators. In this paper, we propose a Hybrid Scatter Search (HSS) algorithm to assign terminals to concentrators. Coupled with the Scatter Search algorithm we use a Tabu Search algorithm to locate the global minimum. We show that HSS is able to achieve feasible solutions to Terminal Assignment instances, improving the results obtained by previous approaches.
- A Hybrid Population-Based Incremental Learning algorithm for load balancing in RPRPublication . Bernardino, Anabela M.; Bernardino, Eugénia M.; Sánchez-Pérez, Juan Manuel; Gómez-Pulido, Juan Antonio; Vega-Rodríguez, Miguel AngelWhen managed properly, the ring networks are uniquely suited to deliver a large amount of bandwidth in a reliable and inexpensive way. An optimal load balancing is very important, because it increases the system capacity and improves the overall ring performance. An important optimisation problem in this context is the Weighted Ring Arc Loading Problem (WRALP). It consists of the design, in a communication network of a transmission route (direct path) for each request, such that high load on the ring arcs will be avoided. WRALP asks for a routing scheme such that the maximum load on the ring arcs will be minimum. In this paper we study WRALP without demand splitting and we propose a Hybrid Populationbased Incremental Learning (HPBIL) to solve it. We show that HPBIL is able to achieve good solutions, improving the results obtained by previous approaches.
- Solving the ring arc-loading problem using a hybrid scatter search algorithmPublication . Bernardino, Anabela Moreira; Bernardino, Eugénia Moreira; Sánchez-Pérez, Juan Manuel; Gómez-Pulido, Juan Antonio; Vega-Rodríguez, Miguel AngelResilient Packet Ring (RPR) is a standard that uses Ethernet switching and a dual counter-rotating ring topology to provide SONET-like network resiliency and optimised bandwidth usage, while it delivers multipoint Ethernet/IP services. An important optimisation problem arising in this context is the Weighted Ring Arc Loading Problem (WRALP). That is the design of a direct path for each request in a communication network, in such a way that high load on the arcs will be avoided, where an arc is an edge endowed with a direction. The load of an arc is defined as the total weight of those requests routed through the arc in its direction. WRALP ask for a routing scheme such that the maximum load on the arcs will be minimum. In this paper we study the loading problem without demand splitting and for solving it we propose a Hybrid Scatter Search (HSS) algorithm. Coupled with the Scatter Search algorithm we use a Tabu Search algorithm to locate the global minimum. We show that HSS is able to achieve feasible solutions to WRALP instances, improving the results obtained by previous approaches.
- Evolutionary Swarm based algorithms to minimise the link cost in Communication NetworksPublication . Moreira Bernardino, Anabela; Sánchez-Pérez, Juan Manuel; Gómez-Pulido, Juan Antonio; Vega-Rodríguez, Miguel Ángel; Bernardino, Eugénia MoreiraIn the last decades, nature-inspired algorithms have been widely used to solve complex combinatorial optimisation problems. Among them, Evolutionary Algorithms (EAs) and Swarm Intelligence (SI) algorithms have been extensively employed as search and optimisation tools in various problem domains. Evolutionary and Swarm Intelligent algorithms are Artificial Intelligence (AI) techniques, inspired by natural evolution and adaptation. This paper presents two new nature-inspired algorithms, which use concepts of EAs and SI. The combination of EAs and SI algorithms can unify the fast speed of EAs to find global solutions and the good precision of SI algorithms to find good solutions using the feedback information. The proposed algorithms are applied to a complex NP-hard optimisation problem - the Terminal Assignment Problem (TAP). The objective is to minimise the link cost to form a network. The proposed algorithms are compared with several EAs and SI algorithms from literature. We show that the proposed algorithms are suitable for solving very large scaled problems in short computational times.