Search results for "Algorithm"
showing 10 items of 4887 documents
An open-source GA framework for optimizing the seismic upgrading design of RC frames through BRBs
2022
Abstract Optimizing seismic upgrading interventions in reinforced concrete (RC) structures is a difficult task, due to the inner non-linearity of the analyses usually performed. Additionally, it is well known that the displacement demand to the structure depends from the mass and stiffness of the system, and consequently its definition cannot be made a-priori. This paper presents the application of a soft-computing method -i.e. Genetic Algorithm (GA)- for the shaping optimization of code-compliant seismic upgrading interventions on plane RC frames through Buckling-Restrained Braces (BRB). The metaheuristic procedure allows to minimize the cost while ensuring the required safety level, witho…
Field estimation in wireless sensor networks using distributed kriging
2012
In this paper, we tackle the problem of spatial interpolation for distributed estimation in Wireless Sensor Networks by using a geostatistical technique called kriging. We present a novel Distributed Iterative Kriging Algorithm (DIKA) which is composed of two main phases. First, the spatial dependence of the field is exploited by calculating semivariograms in an iterative way. Second, the kriging system of equations is solved by an initial set of nodes in a distributed manner, providing some initial interpolation weights to each node. In our algorithm, the estimation accuracy can be improved by iteratively adding new nodes and updating appropriately the weights, which leads to a reduction i…
Algorithms for Rational Discrete Least Squares Approximation Part I: Unconstrained Optimization
1976
In this paper a modification of L. Wittmeyer’s method ([1], [14]) for rational discrete least squares approximation is given which corrects for its failure to converge to a non-optimal point in general. The modification makes necessary very little additional computing effort only. It is analysed thoroughly with respect to its conditions for convergence and its numerical properties. A suitable implementation is shown to be benign in the sense of F. L. Bauer [2]. The algorithm has proven successful even in adverse situations.
An airline connection builder using maximum connection lag with greedy parameter selection
2014
Abstract This paper introduces a methodology for designing an airline connection builder (CB) and adjusting its parameter settings. The objective of the proposed CB is to construct relevant connections that attract passenger demand while avoiding operationally infeasible and commercially irrelevant connections. Using worldwide MIDT booking data, we examined the sensitivity of CB results to the setting of the standard CB parameters maximum connection time and geographical detour. We demonstrated that CB performance can be increased by replacing these two parameters with connection lag, a measure that combines the impact of connection time with geographical detour on the total travel time of …
A multi-objective approach for a project scheduling problem with due dates and temporal constraints infeasibilities
2014
In this paper, we study a multi-mode resource-constrained project scheduling problem (RCPSP) which considers time and work generalised precedence relationships with minimal and maximal time lags and due dates where each activity requires only one unit of resource (e.g. a worker, a machine, etc.). To find a feasible solution for this problem is NP-hard and therefore for instances where a feasible solution has not been found, an appropriate real-life approach would consist of providing the decision-maker with a collection of quality solutions with a trade-off between due dates and temporal constraints violations. We propose a multi-objective evolutionary algorithm for the generation of an app…
A powerful route minimization heuristic for the vehicle routing problem with time windows
2009
We suggest an efficient route minimization heuristic for the vehicle routing problem with time windows. The heuristic is based on the ejection pool, powerful insertion and guided local search strategies. Experimental results on the Gehring and Homberger's benchmarks demonstrate that our algorithm outperforms previous approaches and found 18 new best-known solutions.
Vehicle Routing Problem with Time Windows, Part II: Metaheuristics
2005
This paper surveys the research on the metaheuristics for the Vehicle Routing Problem with Time Windows (VRPTW). The VRPTW can be described as the problem of designing least cost routes from one depot to a set of geographically scattered points. The routes must be designed in such a way that each point is visited only once by exactly one vehicle within a given time interval; all routes start and end at the depot, and the total demands of all points on one particular route must not exceed the capacity of the vehicle. Metaheuristics are general solution procedures that explore the solution space to identify good solutions and often embed some of the standard route construction and improvemen…
A challenging family of automata for classical minimization algorithms
2010
In this paper a particular family of deterministic automata that was built to reach the worst case complexity of Hopcroft's state minimization algorithm is considered. This family is also challenging for the two other classical minimization algorithms: it achieves the worst case for Moore's algorithm, as a consequence of a result by Berstel et al., and is of at least quadratic complexity for Brzozowski's solution, which is our main contribution. It therefore constitutes an interesting family, which can be useful to measure the efficiency of implementations of well-known or new minimization algorithms.
Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms
2005
This paper presents a survey of the research on the vehicle routing problem with time windows (VRPTW). The VRPTW can be described as the problem of designing least cost routes from one depot to a set of geographically scattered points. The routes must be designed in such a way that each point is visited only once by exactly one vehicle within a given time interval, all routes start and end at the depot, and the total demands of all points on one particular route must not exceed the capacity of the vehicle. Both traditional heuristic route construction methods and recent local search algorithms are examined. The basic features of each method are described, and experimental results for Solom…
Stochastic reconstruction of sandstones
2000
A simulated annealing algorithm is employed to generate a stochastic model for a Berea and a Fontainebleau sandstone with prescribed two-point probability function, lineal path function, and ``pore size'' distribution function, respectively. We find that the temperature decrease of the annealing has to be rather quick to yield isotropic and percolating configurations. A comparison of simple morphological quantities indicates good agreement between the reconstructions and the original sandstones. Also, the mean survival time of a random walker in the pore space is reproduced with good accuracy. However, a more detailed investigation by means of local porosity theory shows that there may be s…