On Solving the Maximum Betweenness Problem Using Genetic Algorithms

Savić, Aleksandar

The search session has expired. Please query the service again.

Displaying similar documents to “On Solving the Maximum Betweenness Problem Using Genetic Algorithms”

Genetic Algorithm Approach for Solving the Task Assignment Problem

Savić, Aleksandar, Tošić, Dušan, Marić, Miroslav, Kratica, Jozef (2008)

Serdica Journal of Computing

Similarity:

This research was partially supported by the Serbian Ministry of Science and Ecology under project 144007. The authors are grateful to Ivana Ljubić for help in testing and to Vladimir Filipović for useful suggestions and comments. In this paper a genetic algorithm (GA) for the task assignment problem (TAP) is considered.An integer representation with standard genetic operators is used. Computational results are presented for instances from the literature, and compared to...

Solving the Task Assignment Problem with a Variable Neighborhood Search

Kratica, Jozef, Savić, Aleksandar, Filipović, Vladimir, Milanović, Marija (2010)

Serdica Journal of Computing

Similarity:

In this paper a variable neighborhood search (VNS) approach for the task assignment problem (TAP) is considered. An appropriate neighborhood scheme along with a shaking operator and local search procedure are constructed specifically for this problem. The computational results are presented for the instances from the literature, and compared to optimal solutions obtained by the CPLEX solver and heuristic solutions generated by the genetic algorithm. It can be seen that the proposed...

A comparative evaluation of medium- and large-scale feature selectors for pattern classifiers

Mineichi Kudo, Jack Sklansky (1998)

Kybernetika

Similarity:

Needs of feature selection in medium and large problems increases in many fields including medical and image processing fields. Previous comparative studies of feature selection algorithms are not satisfactory in problem size and in criterion function. In addition, no way has not shown to compare algorithms with different objectives. In this study, we propose a unified way to compare a large variety of algorithms. Our results show that the sequential floating algorithms promises for...

An efficient genetic algorithm for the uncapacitated multiple allocation p-hub median problem

Zorica Stanimirović (2008)

Control and Cybernetics

Similarity:

New machine learning methods for prediction of protein secondary structures

Jacek Błażewicz, Piotr Łukasik, Szymon Wilk (2007)

Control and Cybernetics

Similarity:

Theoretical and Practical Analysis about Census by Internet.

J. L. Vega (2010)

Boletín de Estadística e Investigación Operativa. BEIO

Similarity:

Evolutionary Design of Digital Circuits Using Improved Multi Expression Programming (IMEP).

F. Z. Hadjam, C. Moraga, M. K. Rahmouni (2007)

Mathware and Soft Computing

Similarity:

CAPS in Z(2,n)

Kurz, Sascha (2009)

Serdica Journal of Computing

Similarity:

We consider point sets in (Z^2,n) where no three points are on a line – also called caps or arcs. For the determination of caps with maximum cardinality and complete caps with minimum cardinality we provide integer linear programming formulations and identify some values for small n.