Results 1  10
of
25
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
 ACM COMPUTING SURVEYS
, 2003
"... The field of metaheuristics for the application to combinatorial optimization problems is a rapidly growing field of research. This is due to the importance of combinatorial optimization problems for the scientific as well as the industrial world. We give a survey of the nowadays most important meta ..."
Abstract

Cited by 314 (17 self)
 Add to MetaCart
The field of metaheuristics for the application to combinatorial optimization problems is a rapidly growing field of research. This is due to the importance of combinatorial optimization problems for the scientific as well as the industrial world. We give a survey of the nowadays most important metaheuristics from a conceptual point of view. We outline the different components and concepts that are used in the different metaheuristics in order to analyze their similarities and differences. Two very important concepts in metaheuristics are intensification and diversification. These are the two forces that largely determine the behaviour of a metaheuristic. They are in some way contrary but also complementary to each other. We introduce a framework, that we call the I&D frame, in order to put different intensification and diversification components into relation with each other. Outlining the advantages and disadvantages of different metaheuristic approaches we conclude by pointing out the importance of hybridization of metaheuristics as well as the integration of metaheuristics and other methods for optimization.
Power Transmission Network Design by Greedy Randomized Adaptive Path Relinking
"... This paper presents results obtained by a new metaheuristic approach called Greedy Randomized Adaptive Path Relinking, applied to solve static power transmission network design problems. This new approach uses generalized GRASP concepts to explore different trajectories between two “highquality” ..."
Abstract

Cited by 15 (8 self)
 Add to MetaCart
This paper presents results obtained by a new metaheuristic approach called Greedy Randomized Adaptive Path Relinking, applied to solve static power transmission network design problems. This new approach uses generalized GRASP concepts to explore different trajectories between two “highquality” solutions previously found. The results presented were obtained from two realworld case studies of Brazilian systems.
Greedy Randomized Adaptive Path Relinking
, 2001
"... this paper we present a new search procedure that combines GRASP concepts and those of Path Relinking. Summarizing, original Path Relinking finds a path between two "good" solutions in order to discover new ones, potentially better than the older solutions. GRASP's basic mechanisms ar ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
this paper we present a new search procedure that combines GRASP concepts and those of Path Relinking. Summarizing, original Path Relinking finds a path between two "good" solutions in order to discover new ones, potentially better than the older solutions. GRASP's basic mechanisms are the greedy randomized construction phase, where a feasible solution is built, and the local search procedure, where the neighborhood of the solution obtained is explored. Greedy randomized adaptive path relinking (GRAPR) constructs a GRASP to build di#erent paths in a Path Relinking phase
GRASP: Basic components and enhancements
 Telecommunication Systems
, 2011
"... ..."
(Show Context)
Grasp: Greedy randomized adaptive search procedures
 in Search Methodologies
, 2014
"... ..."
(Show Context)
Discrete Particle Swarm Optimization Algorithm Used for TNEP Considering Network Adequacy Restriction
"... Abstract—Transmission network expansion planning (TNEP) is a basic part of power system planning that determines where, when and how many new transmission lines should be added to the network. Up till now, various methods have been presented to solve the static transmission network expansion plannin ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract—Transmission network expansion planning (TNEP) is a basic part of power system planning that determines where, when and how many new transmission lines should be added to the network. Up till now, various methods have been presented to solve the static transmission network expansion planning (STNEP) problem. But in all of these methods, transmission expansion planning considering network adequacy restriction has not been investigated. Thus, in this paper, STNEP problem is being studied considering network adequacy restriction using discrete particle swarm optimization (DPSO) algorithm. The goal of this paper is obtaining a configuration for network expansion with lowest expansion cost and a specific adequacy. The proposed idea has been tested on the Garvers network and compared with the decimal codification genetic algorithm (DCGA). The results show that the network will possess maximum efficiency economically. Also, it is shown that precision and convergence speed of the proposed DPSO based method for the solution of the STNEP problem is more than DCGA approach. Keywords—DPSO algorithm, Adequacy restriction, STNEP. I.
Genetic algorithm based studying of bundle lines effect on network losses in transmission network expansion planning
 Journal of Electrical Engineering
"... Transmission network expansion planning (TNEP) is a basic part of power system planning that its task is to minimize the network construction and operational cost, while meeting imposed technical, economic and reliability constraints. Recently, many methods have been introduced for solution of the ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Transmission network expansion planning (TNEP) is a basic part of power system planning that its task is to minimize the network construction and operational cost, while meeting imposed technical, economic and reliability constraints. Recently, many methods have been introduced for solution of the static transmission network expansion planning (STNEP) problem. However, in whole of them, the effect of bundle lines on network losses has not been investigated. For this reason, in this paper, STNEP problem is being solved considering the effect of bundle lines on the network losses in a transmission network with different voltage levels using decimal codification genetic algorithm (DCGA). Finally, the effectiveness of proposed idea is tested on an actual transmission network of the Azerbaijan regional electric company, Iran. The results analysis reveals that bundle lines have important effect on the network losses in STNEP problem. Moreover, considering the bundle lines in a power system with various line voltage levels are caused the operational costs is decreased in addition to reduce of the total expansion costs. Thus, the effect of bundle lines on the network losses is caused the total expansion costs (expansion cost of lines and substations) are calculated more exactly and therefore the transmission expansion planning is optimized.
Optimization of Transmission Lines Loading in TNEP Using Decimal Codification Based GA
"... Abstract—Transmission network expansion planning (TNEP) is a basic part of power system planning that determines where, when and how many new transmission lines should be added to the network. Up till now, various methods have been presented to solve the static transmission network expansion plannin ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract—Transmission network expansion planning (TNEP) is a basic part of power system planning that determines where, when and how many new transmission lines should be added to the network. Up till now, various methods have been presented to solve the static transmission network expansion planning (STNEP) problem. But in all of these methods, lines adequacy rate has not been considered at the end of planning horizon, i.e., expanded network misses adequacy after some times and needs to be expanded again. In this paper, expansion planning has been implemented by merging lines loading parameter in the STNEP and inserting investment cost into the fitness function constraints using genetic algorithm. Expanded network will possess a maximum adequacy to provide load demand and also the transmission lines overloaded later. Finally, adequacy index could be defined and used to compare some designs that have different investment costs and adequacy rates. In this paper, the proposed idea has been tested on the Garvers network. The results show that the network will possess maximum efficiency economically.
Sustainable Energy Systems
, 2011
"... Dissertation submitted in partial fulfilment of the requirements for the Degree of ..."
Abstract
 Add to MetaCart
(Show Context)
Dissertation submitted in partial fulfilment of the requirements for the Degree of