Related Experiment Videos
A memetic genetic algorithm for the vertex p-center problem
1School of Information and Communication Technology, Griffith University, Gold Coast, QLD, Australia. w.pullan@griffith.edu.au
Abstract:
The p-center problem is one of choosing p facilities from a set of candidates to satisfy the demands of n clients in order to minimize the maximum cost between a client and the facility to which it is assigned. In this article, PBS, a population based meta-heuristic for the p-center problem, is described. PBS is a genetic algorithm based meta-heuristic that uses phenotype crossover and directed mutation operators to generate new starting points for a local search. For larger p-center instances, PBS is able to effectively utilize a number of computer processors. It is shown empirically that PBS has comparable performance to state-of-the-art exact and approximate algorithms for a range of p-center benchmark instances.
Related Concept Videos
Mutation, Gene Flow, and Genetic Drift
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Genetic Drift
Centroid of a Body: Problem Solving
The x-coordinates and y-coordinates of each element's...
Genetic Variation
Genes exist in different versions called alleles, which...
Vectors in 2D: Problem Solving