Publication

Optimal configuration of electrical distribution networks using heuristic methods

Alain Germond, Sidi-Rachid Cherkaoui
1993
Conference Papers

Abstract

The search for an optimal configuration for a distribution network can be viewed by three different approaches based on the implicit enumeration of solutions. The approach called branch exchange seems to avoid the disadvantages of the two others. This approach has allowed the authors to imagine and develop, initially, two descent search strategies. Thereafter, to improve these strategies, they have been transformed to include the principles of an optimization method, called TABU. All strategies have finally been tested in the case of a real network to find a feasible configuration with minimal losses

Official source

https://infoscience.epfl.ch/entities/publication/c0d7b9af-edde-4221-b8ee-3b117555459b

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Alain Germond, Sidi-Rachid Cherkaoui
1993
Conference Papers

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/c0d7b9af-edde-4221-b8ee-3b117555459b

About this result

Related concepts (26)

Search algorithm

In computer science, a search algorithm is an algorithm designed to solve a search problem. Search algorithms work to retrieve information stored within particular data structure, or calculated in the search space of a problem domain, with either discrete or continuous values. Although search engines use search algorithms, they belong to the study of information retrieval, not algorithmics. The appropriate search algorithm to use often depends on the data structure being searched, and may also include prior knowledge about the data.

Optimization problem

In mathematics, computer science and economics, an optimization problem is the problem of finding the best solution from all feasible solutions. Optimization problems can be divided into two categories, depending on whether the variables are continuous or discrete: An optimization problem with discrete variables is known as a discrete optimization, in which an object such as an integer, permutation or graph must be found from a countable set.

Mathematical optimization

Mathematical optimization (alternatively spelled optimisation) or mathematical programming is the selection of a best element, with regard to some criterion, from some set of available alternatives. It is generally divided into two subfields: discrete optimization and continuous optimization. Optimization problems arise in all quantitative disciplines from computer science and engineering to operations research and economics, and the development of solution methods has been of interest in mathematics for centuries.

Related publications (9)

Optimal configuration of electrical distribution networks using heuristic methods

Chat with Graph Search

Optimization of Pelton turbines start-up considering fatigue damage via a fracture mechanics model

Computational Planning and Structural Analysis for Robotic Construction of Stone Masonry

Non-convex optimization for robust multi-view imaging