New methods for system planning

Authors:
Ahmad Sadegheih
Affiliations:
Department of Industrial Engineering, University of Yazd, P.O. Box 89195-741, Yazd, Iran
Venue:
Applied Soft Computing
Year:
2011

Citing 4
Cited 1

Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem

Annals of Operations Research - Special issue on Tabu search
Adaptive Selection Methods for Genetic Algorithms

Proceedings of the 1st International Conference on Genetic Algorithms
How Genetic Algorithms Work: A Critical Look at Implicit Parallelism

Proceedings of the 3rd International Conference on Genetic Algorithms
Evolutionary algorithms and simulated annealing in the topological configuration of the spanning tree

WSEAS TRANSACTIONS on SYSTEMS

Simultaneous solving of balancing and sequencing problems with station-dependent assembly times for mixed-model assembly lines

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, three artificial intelligence techniques, genetic algorithm (GA), simulated annealing (SA), and tabu search (TS) are proposed to search for solutions to transmission network planning. The performance of each of the techniques is studied and the results compared with these from conventional methods. The problem of transmission network planning is formulated as a genetic algorithm, simulated annealing and tabu search with the cost of new lines and security constraints at each bus-bar included. The novel results from a set of tests carried out on the prototype show that the application of genetic algorithm; simulated annealing and tabu search techniques are feasible in transmission network planning. Finally, observations (1), (2), (3), (4), and (5) are presented by analysis of variance.