Search results for "Algorithm"
showing 10 items of 4887 documents
Split-Delivery Capacitated Arc-Routing Problem: Lower Bound and Metaheuristic
2010
International audience; This paper proposes lower and upper bounds for the split-delivery capacitated arc-routing problem (SDCARP), a variant of the capacitated arc-routing problem in which an edge can be serviced by several vehicles. Recent papers on related problems in node routing have shown that this policy can bring significant savings. It is also more realistic in applications such as urban refuse collection, where a vehicle can become full in the middle of a street segment. This work presents the first lower bound for the SDCARP, computed with a cutting plane algorithm and an evolutionary local search reinforced by a multistart procedure and a variable neighborhood descent. Tests on …
Optimal Electrical Distribution Systems Reinforcement Planning Using Gas Micro Turbines by Dynamic Ant Colony Search Algorithm
2007
Distribution systems management is becoming an increasingly complicated issue due to the introduction of new energy trading strategies and new technologies. In this paper, an optimal reinforcement strategy to provide reliable and economic service to customers in a given time frame is investigated. In the new deregulated energy market and considering the incentives coming from the political and economical fields, it is reasonable to consider distributed generation (DG) as a viable option for systems reinforcement. In the paper, the DG technology is considered as a possible solution for distribution systems capacity problems, along several years. Therefore, compound solutions comprising the i…
A new innovative cooling law for simulated annealing algorithms
2015
The present paper proposes an original and innovative cooling law in the field of Simulated Annealing (SA) algorithms. Particularly, such a law is based on the evolution of different initial seeds on which the algorithm works in parallel. The efficiency control of the new proposal, executed on problems of different kind, shows that the convergence quickness by using such a new cooling law is considerably greater than that obtained by traditional laws. Furthermore, it is shown that the effectiveness of the SA algorithm arising from the proposed cooling law is independent of the problem type. This last feature reduces the number of parameters to be initially fixed, so simplifying the prelimin…
Service restoration in compensated distribution networks using a hybrid genetic algorithm
1998
In this paper a genetic algorithm (GA) based approach to the service restoration (SR) problem in automated distribution networks is presented. Normal operation within the network comprises both automatic reconfiguration and compensation so as to reduce power losses, allow load balancing and improve the voltage profile. In the restorative state, the reconfiguration is performed together with compensation, taking mainly into account the load supply requirement and secondarily, the losses reduction requirement. After a general discussion on the restoration problem together with a short review of recent papers on the topic, a solution strategy is proposed. Then, a short account about classical …
A polynomial algorithm solving a special class of hybrid optimal control problems
2006
Hybrid optimal control problems are, in general, difficult to solve. A current research goal is to isolate those problems that lead to tractable solutions [5]. In this paper, we identify a special class of hybrid optimal control problems which are easy to solve. We do this by using a paradigm borrowed from the Operations Research field. As main result, we present a solution algorithm that converges to the exact solution in polynomial time. Our approach consists in approximating the hybrid optimal control problem via an integer-linear programming reformulation. The integer-linear programming problem is a Set-covering one with a totally unimodular constraint matrix and therefore solving the S…
EABOT – Energetic analysis as a basis for robust optimization of trigeneration systems by linear programming
2008
Abstract The optimization of synthesis, design and operation in trigeneration systems for building applications is a quite complex task, due to the high number of decision variables, the presence of irregular heat, cooling and electric load profiles and the variable electricity price. Consequently, computer-aided techniques are usually adopted to achieve the optimal solution, based either on iterative techniques, linear or non-linear programming or evolutionary search. Large efforts have been made in improving algorithm efficiency, which have resulted in an increasingly rapid convergence to the optimal solution and in reduced calculation time; robust algorithm have also been formulated, ass…
Multi-step ahead electricity price forecasting using a hybrid model based on two-layer decomposition technique and BP neural network optimized by fir…
2017
In the deregulated competitive electricity market, the price which reflects the relationship between electricity supply and demand is one of the most important elements, making it crucial for all market participants to precisely forecast the electricity price. However, electricity price series usually has complex features such as non-linearity, non-stationarity and volatility, which makes the price forecasting turn out to be very difficult. In order to improve the accuracy of electricity price forecasting, this paper first proposes a two-layer decomposition technique and then develops a hybrid model based on fast ensemble empirical mode decomposition (FEEMD), variational mode decomposition …
An efficient analytical approach for obtaining a five parameters model of photovoltaic modules using only reference data
2013
Exploiting the equivalent one-diode circuit of a photovoltaic (PV) module, this paper proposes a novel and fully analytical model to predict the electrical performance upon solar irradiance intensity and PV module temperature. The model refers essentially to an equivalent circuit governed by five parameters and the extraction of them permits to describe the current–voltage curve of the PV panel and consequently permits to assess the energy output of PV modules. The proposed model extracts the five characteristic parameters using only exact analytical relationship and tabular data always available such as short-circuit current, open circuit voltage and the Maximum Power Point (MPP). The diff…
Multi-Objective Design of Optimisation of a Class of PKMs - The 3-DOF Gantry-Tau
2010
The main contribution of this paper is the use of the evolutionary multi-objective methodology based on the com plex search algorithm and geometric approaches to optimise a parallel kinematic structure. The design optimisation scheme includes the kinematic (collisions free workspace), elastostatic (Cartesian stiffness in the Y direction) and elastodynamic (first resonance frequency) properties of the PKM as the objectives. The optimisation constraints are the support frame lengths, actuator positions, end-effector’s kinematic parameters and the robot’s arm lengths. The optimisation results are presented in this paper.
The Scatter Search Methodology
2011
Scatter search (SS) is an evolutionary approach for optimization. It has been applied to problems with continuous and discrete variables and with a single or multiple objectives. The success of SS as an optimization technique is well documented in a constantly growing number of journal articles and book chapters. This article first focuses on the basic SS framework, which is responsible for most of the outcomes reported in the literature, and then covers advanced elements that have been introduced in a few selected papers, such as the hybridization with tabu search, a well-known memory-based metaheuristic. We consider the maximum diversity problem to illustrate the search elements, methods …