Search results for "Algorithm"
showing 10 items of 4887 documents
On multi-objective optimal reconfiguration of MV networks in presence of different grounding
2015
The present work faces the traditional multi-objective optimal reconfiguration problem of a distribution grid including the safety issue in the objective functions. Actually, in many medium voltage networks still transformers with ungrounded neutral and with resonant grounded neutral coexist in the same area. This may be sometimes cause of problems during a single-line-to-ground fault if the ground electrodes of one or more cabins, initially designed for satisfying the safety conditions in a resonant grounded neutral network, after the reconfiguration are in a grounded neutral one or vice versa. In the paper a safety objective function is defined and the Non dominated Sorting Genetic Algori…
GRASP and path relinking for the max–min diversity problem
2010
The max-min diversity problem (MMDP) consists in selecting a subset of elements from a given set in such a way that the diversity among the selected elements is maximized. The problem is NP-hard and can be formulated as an integer linear program. Since the 1980s, several solution methods for this problem have been developed and applied to a variety of fields, particularly in the social and biological sciences. We propose a heuristic method-based on the GRASP and path relinking methodologies-for finding approximate solutions to this optimization problem. We explore different ways to hybridize GRASP and path relinking, including the recently proposed variant known as GRASP with evolutionary p…
A comparison of different solution approaches to the vehicle scheduling problem in a practical case
2000
Abstract The Vehicle Scheduling Problem (VSP) consists in assigning a set of scheduled trips to a set of vehicles, satisfying a set of constraints and optimizing an objective function. A wide literature exists for the VSP, but usually not all the practical requirements of the real cases are taken into account. In the present paper a practical case is studied, and for it a traditional method is tailored and two innovative heuristics are developed. As the problem presents a multicriteria nature, each of the three algorithms adopts a different approach to multicriteria optimization. Scalarization of the different criteria is performed by the traditional algorithm. A lexicographic approach is f…
Hybridizing the cross-entropy method: An application to the max-cut problem
2009
Cross-entropy has been recently proposed as a heuristic method for solving combinatorial optimization problems. We briefly review this methodology and then suggest a hybrid version with the goal of improving its performance. In the context of the well-known max-cut problem, we compare an implementation of the original cross-entropy method with our proposed version. The suggested changes are not particular to the max-cut problem and could be considered for future applications to other combinatorial optimization problems.
A non dominated ranking Multi Objective Genetic Algorithm and electre method for unequal area facility layout problems
2013
The unequal area facility layout problem (UA-FLP) comprises a class of extremely difficult and widely applicable optimization problems arising in diverse areas and meeting the requirements for real-world applications. Genetic Algorithms (GAs) have recently proven their effectiveness in finding (sub) optimal solutions to many NP-hard problems such as UA-FLP. A main issue in such approach is related to the genetic encoding and to the evolutionary mechanism implemented, which must allow the efficient exploration of a wide solution space, preserving the feasibility of the solutions and ensuring the convergence towards the optimum. In addition, in realistic situations where several design issues…
Memetic Algorithms in Engineering and Design
2012
When dealing with real-world applications, one often faces non-linear and nondifferentiable optimization problems which do not allow the employment of exact methods. In addition, as highlighted in [104], popular local search methods (e.g. Hooke-Jeeves, Nelder Mead and Rosenbrock) can be ill-suited when the real-world problem is characterized by a complex and highly multi-modal fitness landscape since they tend to converge to local optima. In these situations, population based meta-heuristics can be a reasonable choice, since they have a good potential in detecting high quality solutions. For these reasons, meta-heuristics, such as Genetic Algorithms (GAs), Evolution Strategy (ES), Particle …
An Interactive Evolutionary Multiobjective Optimization Method: Interactive WASF-GA
2015
In this paper, we describe an interactive evolutionary algorithm called Interactive WASF-GA to solve multiobjective optimization problems. This algorithm is based on a preference-based evolutionary multiobjective optimization algorithm called WASF-GA. In Interactive WASF-GA, a decision maker (DM) provides preference information at each iteration simple as a reference point consisting of desirable objective function values and the number of solutions to be compared. Using this information, the desired number of solutions are generated to represent the region of interest of the Pareto optimal front associated to the reference point given. Interactive WASF-GA implies a much lower computational…
Experiments on a Prey Predators System
2003
The paper describes a prey-predators system devoted to perform experiments on concurrent complex environment. The problem has be treated as an optimization problem. The prey goal is to escape from the predators reaching its lair, while predators want to capture the prey. At the end of the 19th century, Pareto found an optimal solutions for decision problems regarding more than one criterion at the same time. In most cases this ‘Pareto-set’ cannot be determined analytically or the computation time could be exponential. In such cases, evolutionary Algorithms (EA) are powerful optimization tools capable of finding optimal solutions of multi-modal problems. Here, both prey and predators learn i…
Adaptive and Dynamic Ant Colony Search Algorithm for Optimal Distribution Systems Reinforcement Strategy
2006
The metaheuristic technique of Ant Colony Search has been revised here in order to deal with dynamic search optimization problems having a large search space and mixed integer variables. The problem to which it has been applied is an electrical distribution systems management problem. This kind of issues is indeed getting increasingly complicated due to the introduction of new energy trading strategies, new environmental constraints and new technologies. In particular, in this paper, the problem of finding the optimal reinforcement strategy to provide reliable and economic service to customers in a given time frame is investigated. Utilities indeed need efficient software tools to take deci…
Local search based evolutionary multi-objective optimization algorithm for constrained and unconstrained problems
2009
Evolutionary multi-objective optimization algorithms are commonly used to obtain a set of non-dominated solutions for over a decade. Recently, a lot of emphasis have been laid on hybridizing evolutionary algorithms with MCDM and mathematical programming algorithms to yield a computationally efficient and convergent procedure. In this paper, we test an augmented local search based EMO procedure rigorously on a test suite of constrained and unconstrained multi-objective optimization problems. The success of our approach on most of the test problems not only provides confidence but also stresses the importance of hybrid evolutionary algorithms in solving multi-objective optimization problems.