Search results for "A* algorithm"

New Heuristic Algorithms for the Windy Rural Postman Problem

2005

[EN] In this paper we deal with the windy rural postman problem. This problem generalizes several important arc routing problems and has interesting real-life applications. Here, we present several heuristics whose study has lead to the design of a scatter search algorithm for the windy rural postman problem. Extensive computational experiments over different sets of instances, with sizes up to 988 nodes and 3952 edges, are also presented. (c) 2004 Elsevier Ltd. All rights reserved.

A branch-and-cut algorithm for the Profitable Windy Rural Postman Problem

2016

[EN] In this paper we study the profitable windy rural postman problem. This is an arc routing problem with profits defined on a windy graph in which there is a profit associated with some of the edges of the graph, consisting of finding a route maximizing the difference between the total profit collected and the total cost. This problem generalizes the rural postman problem and other well-known arc routing problems and has real-life applications, mainly in snow removal operations. We propose here a formulation for the problem and study its associated polyhedron. Several families of facet-inducing inequalities are described and used in the design of a branch-and-cut procedure. The algorithm…

The Windy clustered prize-collecting arc-routing problem

2011

This paper introduces the windy clustered prize-collecting arc-routing problem. It is an arc-routing problem where each demand edge is associated with a profit that is collected once if the edge is serviced, independent of the number of times the edge is traversed. It is further required that if a demand edge is serviced, then all the demand edges of its component are also serviced. A mathematical programming formulation is given and some polyhedral results including several facet-defining and valid inequalities are presented. The separation problem for the different families of inequalities is studied. Numerical results from computational experiments are analyzed. © 2011 INFORMS.

Evolutionary Algorithms and Metaheuristics : Applications in Engineering Design and Optimization

2018

A Probabilistic Analysis to Quantify the Effect of March 11, 2004, Attacks in Madrid on the March 14 Elections in Spain: A Dynamic Modelling Approach

2015

[EN] The bomb attacks in Madrid three days before the general elections of March 14, 2004, and their possible influence on the victory of PSOE (Spanish Workers Socialist Party), defeating PP (Popular Party), have been a matter of study from several points of view (i.e., sociological, political, or statistical). In this paper, we present a dynamic model based on a system of differential equations such that it, using data from Spanish CIS (National Center of Sociological Research), describes the evolution of voting intention of the Spanish people over time. Using this model, we conclude that the probability is very low that the PSOE would have won had the attack not happened.Moreover, after t…

A new approach to portfolio selection based on forecasting

2023

In this paper we analyze the portfolio selection problem from a novel perspective based on the analysis and prediction of the time series corresponding to the portfolio’s value. Namely, we define the value of a particular portfolio at the time of its acquisition. Using the time series of historical prices of the different financial assets, we calculate backward the value that said portfolio would have had in past time periods. A damped trend model is then used to analyze this time series and to predict the future values of the portfolio, providing estimates of the mean and variance for different forecasting horizons. These measures are used to formulate the portfolio selection problem, whic…

A Bacterial-Based Algorithm to Simulate Complex Adaptative Systems

2014

Paper presented at the 13th International Conference on Simulation of Adaptive Behavior which took place at Castellón, Spain in 2014, July 22-25. Bacteria have demonstrated an amazing capacity to overcome envi-ronmental changes by collective adaptation through genetic exchanges. Using a distributed communication system and sharing individual strategies, bacteria propagate mutations as innovations that allow them to survive in different envi-ronments. In this paper we present an agent-based model which is inspired by bacterial conjugation of DNA plasmids. In our approach, agents with bounded rationality interact in a common environment guided by local rules, leading to Complex Adaptive Syste…

Hybrid Particle Swarm Optimization With Genetic Algorithm to Train Artificial Neural Networks for Short-Term Load Forecasting

2019

This research proposes a new training algorithm for artificial neural networks (ANNs) to improve the short-term load forecasting (STLF) performance. The proposed algorithm overcomes the so-called training issue in ANNs, where it traps in local minima, by applying genetic algorithm operations in particle swarm optimization when it converges to local minima. The training ability of the hybridized training algorithm is evaluated using load data gathered by Electricity Generating Authority of Thailand. The ANN is trained using the new training algorithm with one-year data to forecast equal 48 periods of each day in 2013. During the testing phase, a mean absolute percentage error (MAPE) is used …

Tabu and Scatter Search for Artificial Neural Networks

2003

In this paper we address the problem of training multilayer feed-forward neural networks. These networks have been widely used for both prediction and classification in many different areas. Although the most popular method for training these networks is back propagation, other optimization methods such as tabu search or scatter search have been applied to solve this problem. This paper presents a new training algorithm based on the tabu search methodology that incorporates elements for search intensification and diversification by utilizing strategic designs where other previous approaches resort to randomization. Our method considers context and search information, as it is provided by th…

A 4K-Input High-Speed Winner-Take-All (WTA) Circuit with Single-Winner Selection for Change-Driven Vision Sensors

2019

Winner-Take-All (WTA) circuits play an important role in applications where a single element must be selected according to its relevance. They have been successfully applied in neural networks and vision sensors. These applications usually require a large number of inputs for the WTA circuit, especially for vision applications where thousands to millions of pixels may compete to be selected. WTA circuits usually exhibit poor response-time scaling with the number of competitors, and most of the current WTA implementations are designed to work with less than 100 inputs. Another problem related to the large number of inputs is the difficulty to select just one winner, since many competitors ma…