Now showing items 1-10 of 6424
Hybridizing a multi-objective simulated annealing algorithm with a multi-objective evolutionary algorithm to solve a multi-objective project scheduling problem
In this paper, a multi-objective project scheduling problem is addressed. This problem considers two conflicting, priority optimization objectives for project managers. One of these objectives is to minimize the project ...
Algorithms for Maximum Independent Set in Convex Bipartite Graphs
A bipartite graph G = (V, W, E) is convex if there exists an ordering of the vertices of W such that, for each v. V, the neighbors of v are consecutive in W. We describe both a sequential and a BSP/CGM algorithm to find a ...
An implementation of modified scatter search algorithm to transmission expansion planning
(Tubitak Scientific & Technical Research Council Turkey, 2012-01-01)
Transmission network expansion planning (TNEP) is one of the most important tasks in the field of power systems, especially in deregulated power system environments. TNEP is a nonlinear mixed integer programming problem ...
An enhanced genetic algorithm to solve the static and multistage transmission network expansion planning
An enhanced genetic algorithm (EGA) is applied to solve the long-term transmission expansion planning (LTTEP) problem. The following characteristics of the proposed EGA to solve the static and multistage LTTEP problem are ...
Alternation and Redundancy Analysis of the Intersection Problem
(ASSOC COMPUTING MACHINERY, 2008-03)
The intersection of sorted arrays problem has applications in search engines such as Google. Previous work has proposed and compared deterministic algorithms for this problem, in an adaptive analysis based on the encoding ...
Bayesian online algorithms for learning in discrete Hidden Markov Models
(AMER INST MATHEMATICAL SCIENCES, 2008)
We propose and analyze two different Bayesian online algorithms for learning in discrete Hidden Markov Models and compare their performance with the already known Baldi-Chauvin Algorithm. Using the Kullback-Leibler divergence ...
A Randomized O(log N) -competitive Algorithm For The Online Connected Facility Location Problem
(SpringerNew York, 2016)
Using traditional heuristic algorithms on an initial genetic algorithm population applied to the transmission expansion planning problem
(Univ Nac Colombia, Fac Ingenieria, 2011-04-01)
This paper analyses the impact of choosing good initial populations for genetic algorithms regarding convergence speed and final solution quality. Test problems were taken from complex electricity distribution network ...
PARALLEL ALGORITHMS FOR MAXIMAL CLIQUES IN CIRCLE GRAPHS AND UNRESTRICTED DEPTH SEARCH
(EDP SCIENCES S A, 2010)
We present parallel algorithms on the BSP/CGM model, with p processors, to count and generate all the maximal cliques of a circle graph with n vertices and m edges. To count the number of all the maximal cliques, without ...
General subpopulation framework and taming the conflict inside populations
(MIT PressCambridge, Mass, 2015)
Structured evolutionary algorithms have been investigated for some time. However, they have been under explored especially in the field of multi-objective optimization. Despite good results, the use of complex dynamics ...