Results 1 
4 of
4
Biased mutation operators for subgraphselection problems
 IN IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
, 2004
"... Many graph problems seek subgraphs of minimum weight that satisfy a set of constraints. Examples include the minimum spanning tree problem (MSTP), the degreeconstrained minimum spanning tree problem (dMSTP), and the traveling salesman problem (TSP). Lowweight edges predominate in optimum solution ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
Many graph problems seek subgraphs of minimum weight that satisfy a set of constraints. Examples include the minimum spanning tree problem (MSTP), the degreeconstrained minimum spanning tree problem (dMSTP), and the traveling salesman problem (TSP). Lowweight edges predominate in optimum solutions to such problems, and the performance of evolutionary algorithms (EAs) is often improved by biasing variation operators to favor these edges. We investigate the impact of biased edgeexchange mutation. In a largescale empirical investigation, we study the distributions of edges in optimum solutions of the MSTP, the dMSTP, and the TSP in terms of the edges ’ weightbased ranks. We approximate these distributions by exponential functions and derive approximately optimal probabilities for selecting edges to be incorporated into candidate solutions during mutation. A theoretical analysis of the expected running time
CUSTOMIZED CROSSOVER IN EVOLUTIONARY SETS OF SAFE SHIP TRAJECTORIES
"... The paper presents selected aspects of evolutionary sets of safe ship trajectories—a method which applies evolutionary algorithms and some of the assumptions of game theory to solving ship encounter situations. For given positions and motion parameters of the ships, the method finds a near optimal s ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
The paper presents selected aspects of evolutionary sets of safe ship trajectories—a method which applies evolutionary algorithms and some of the assumptions of game theory to solving ship encounter situations. For given positions and motion parameters of the ships, the method finds a near optimal set of safe trajectories of all ships involved in an encounter. The method works in real time and the solutions must be returned within one minute, which enforces speeding up the optimisation process. During the development of the method the authors tested various problemdedicated crossover operators to obtain the best performance. The results of that research are given here. The paper includes a detailed description of these operators as well as statistical simulation results and examples of experiment results.
Genetic Programming Based Degree Constrained Spanning Tree Extraction
"... Abstract—The problem of extracting a degree constraint spanning tree deals with extraction of a spanning tree from a given graph. Where, the degree of each node is greater than or equal to a thread hold value. Genetic Programming is an evolution based strategy appropriate for optimization problems. ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract—The problem of extracting a degree constraint spanning tree deals with extraction of a spanning tree from a given graph. Where, the degree of each node is greater than or equal to a thread hold value. Genetic Programming is an evolution based strategy appropriate for optimization problems. In this paper we propose a genetic programming based solution to the degree constraint spanning tree extraction. The individuals of the population are represented as a tree and mutation is applied as the only genetic operator for evaluation to occur. We have further tested our proposed solution on different graph and found it to be suitable for degree constraint spanning tree extraction problem
A PARTICLE SWARM OPTIMIZATIONLIKE ALGORITHM FOR CONSTRAINED MINIMAL SPANNING TREE PROBLEMS
"... algorithm, constrained minimal spanning tree. Previous studies have discussed various constrained minimal spanning tree (MST) problems. In this paper, we propose an efficient algorithm for solving a class of constrained MST problems. The proposed PSO (Particle Swarm Optimization)like strategy for ..."
Abstract
 Add to MetaCart
(Show Context)
algorithm, constrained minimal spanning tree. Previous studies have discussed various constrained minimal spanning tree (MST) problems. In this paper, we propose an efficient algorithm for solving a class of constrained MST problems. The proposed PSO (Particle Swarm Optimization)like strategy for solving constrained MST problems identifies optimal MSTs under degree and delay constraints. The solution quality and computation time of the proposed PLCMST (PSOLike algorithm for Constrained MST problems) algorithm is compared with two other algorithms: one based on ant colony optimization, and the other based on a genetic algorithm strategy. Our experimental results show that the PLCMST outperforms the other two approaches, particularly when using dense graphs. I.