Search results for "Heuristic"
showing 10 items of 476 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…
A Simple Metaheuristic for the FleetSize and Mix Problem with TimeWindows
2017
This paper presents a powerful new single-parameter metaheuristic to solve the Fleet Size and Mix Vehicle Routing Problem with Time Windows. The key idea of the new metaheuristic is to perform a random number of random-sized jumps in random order through four well-known local search operators. Computational testing on the 600 large-scale benchmarks of Bräysy et al. (Expert Syst Appl 36(4):8460–8475, 2009) show that the new metaheuristic outperforms previous best approaches, finding 533 new best-known solutions. Despite the significant number of random components, it is demonstrated that the variance of the results is rather low. Moreover, the suggested metaheuristic is shown to scale almost…
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…
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…
Incremental heuristic approach for meter placement in radial distribution systems
2019
The evolution of modern power distribution systems into smart grids requires the development of dedicated state estimation (SE) algorithms for real-time identification of the overall system state variables. This paper proposes a strategy to evaluate the minimum number and best position of power injection meters in radial distribution systems for SE purposes. Measurement points are identified with the aim of reducing uncertainty in branch power flow estimations. An incremental heuristic meter placement (IHMP) approach is proposed to select the locations and total number of power measurements. The meter placement procedure was implemented for a backward/forward load flow algorithm proposed by…
GRASP and Path Relinking for the Two-Dimensional Two-Stage Cutting-Stock Problem
2007
We develop a greedy randomized adaptive search procedure (GRASP) for the constrained two-dimensional two-stage cutting-stock problem. This is a special cutting problem in which the cut is performed in two phases. In the first phase, the stock rectangle is slit down its width into different vertical strips and in the second phase, each of these strips is processed to obtain the final pieces. We propose two different algorithms based on GRASP methodology. One is “piece-oriented” while the other is “strip-oriented.” Both procedures are fast and provide solutions of different structures to this cutting problem. We also propose a path-relinking algorithm, which operates on a set of elite soluti…
A multi-parametric evolution strategies algorithm for vehicle routing problems
2007
Vehicle routing problems are at the heart of most decision support systems for real-life distribution problems. In vehicle routing problem a set of routes must be determined at lowest total cost for a number of resources (i.e. fleet of vehicles) located at one or several points (e.g. depots, warehouses) in order to efficiently service a number of demand or supply points. In this paper an efficient evolution strategies algorithm is developed for both capacitated vehicle routing problem and for vehicle routing problem with time window constraints. The algorithm is based on a new multi-parametric mutation procedure that is applied within the 1 + 1 evolution strategies algorithm. Computational …
A Self-Adapting Approach for Forecast-Less Scheduling of Electrical Energy Storage Systems in a Liberalized Energy Market
2013
In this paper, an original scheduling approach for optimal dispatch of electrical Energy Storage Systems (ESS) in modern distribution networks is proposed. The control system is based on fuzzy rules and does not use forecasts since it repairs the past history according to the real time data on the electrical energy cost, renewable energy production and load. When the system detects a worsening of performances, the fuzzy logic rule-based control system self-adapts its membership functions using an economic indicator. The common use, in the relevant literature, of forecasted values in such systems can lead to large errors and economic losses. Moreover the speed of calculation guaranteed by th…
A novel heuristics-based energy management system for a multi-carrier hub enriched with solid hydrogen storage
2014
In this paper, an efficient optimization algorithm for the energy management of a grid-connected energy hub plant is proposed. The Simulated Annealing algorithm is adopted for the solution of the energy management problem aiming at the profit maximization for the owner of the energy hub plant. The use of a heuristic algorithm was required by the non-linearity of the efficiencies of each component in the energy transformation stages. The proposed heuristics is applied to a large energy hub, corresponding to the simulation of the test-bed that is being designed and developed inside the ongoing INGRID European research project.