Abstract: The main goal of this work is to propose a way for
combined use of two nontraditional algorithms by solving topological
problems on telecommunications concentrator networks. The
algorithms suggested are the Simulated Annealing algorithm and the
Genetic Algorithm. The Algorithm of Simulated Annealing unifies
the well known local search algorithms. In addition - Simulated
Annealing allows acceptation of moves in the search space witch lead
to decisions with higher cost in order to attempt to overcome any
local minima obtained. The Genetic Algorithm is a heuristic approach
witch is being used in wide areas of optimization works. In the last
years this approach is also widely implemented in
Telecommunications Networks Planning. In order to solve less or
more complex planning problem it is important to find the most
appropriate parameters for initializing the function of the algorithm.
Abstract: Computation of facility location problem for every
location in the country is not easy simultaneously. Solving the
problem is described by using cluster computing. A technique is to
design parallel algorithm by using local search with single swap
method in order to solve that problem on clusters. Parallel
implementation is done by the use of portable parallel programming,
Message Passing Interface (MPI), on Microsoft Windows Compute
Cluster. In this paper, it presents the algorithm that used local search
with single swap method and implementation of the system of a
facility to be opened by using MPI on cluster. If large datasets are
considered, the process of calculating a reasonable cost for a facility
becomes time consuming. The result shows parallel computation of
facility location problem on cluster speedups and scales well as
problem size increases.
Abstract: In this paper newly reported Cosh window function is
used in the design of prototype filter for M-channel Near Perfect
Reconstruction (NPR) Cosine Modulated Filter Bank (CMFB). Local
search optimization algorithm is used for minimization of distortion
parameters by optimizing the filter coefficients of prototype filter.
Design examples are presented and comparison has been made with
Kaiser window based filterbank design of recently reported work.
The result shows that the proposed design approach provides lower
distortion parameters and improved far-end suppression than the
Kaiser window based design of recent reported work.
Abstract: Particle Swarm Optimization (PSO) with elite PSO
parameters has been developed for power flow analysis under
practical constrained situations. Multiple solutions of the power flow
problem are useful in voltage stability assessment of power system.
A method of determination of multiple power flow solutions is
presented using a hybrid of Particle Swarm Optimization (PSO) and
local search technique. The unique and innovative learning factors of
the PSO algorithm are formulated depending upon the node power
mismatch values to be highly adaptive with the power flow problems.
The local search is applied on the pbest solution obtained by the PSO
algorithm in each iteration. The proposed algorithm performs reliably
and provides multiple solutions when applied on standard and illconditioned
systems. The test results show that the performances of
the proposed algorithm under critical conditions are better than the
conventional methods.
Abstract: This paper presents a novel two-phase hybrid optimization algorithm with hybrid genetic operators to solve the optimal control problem of a single stage hybrid manufacturing system. The proposed hybrid real coded genetic algorithm (HRCGA) is developed in such a way that a simple real coded GA acts as a base level search, which makes a quick decision to direct the search towards the optimal region, and a local search method is next employed to do fine tuning. The hybrid genetic operators involved in the proposed algorithm improve both the quality of the solution and convergence speed. The phase–1 uses conventional real coded genetic algorithm (RCGA), while optimisation by direct search and systematic reduction of the size of search region is employed in the phase – 2. A typical numerical example of an optimal control problem with the number of jobs varying from 10 to 50 is included to illustrate the efficacy of the proposed algorithm. Several statistical analyses are done to compare the validity of the proposed algorithm with the conventional RCGA and PSO techniques. Hypothesis t – test and analysis of variance (ANOVA) test are also carried out to validate the effectiveness of the proposed algorithm. The results clearly demonstrate that the proposed algorithm not only improves the quality but also is more efficient in converging to the optimal value faster. They can outperform the conventional real coded GA (RCGA) and the efficient particle swarm optimisation (PSO) algorithm in quality of the optimal solution and also in terms of convergence to the actual optimum value.