Solving the maximally balanced connected partition problem in graphs by using genetic algorithm

Computing and Informatics

Volumn 27, Issue 3, 2008, Pages 341-354

  Djurić, Brankica ^a   Kratica, Jozef ^b   Tošić, Dušan ^a   Filipović, Vladimir ^a  

^a UNIVERSITY OF BELGRADE   (Serbia)

^b MATHEMATICAL INSTITUTE   (Serbia)

Author keywords

Balanced partitions; Combinatorial optimization; Evolutionary computation; Metaheuristics

Indexed keywords

EID: 47249137773     PISSN: 13359150     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (22)

1. BACK, T. - FOGEL, D.B. - MICHALEWICZ, Z.: Evolutionary Computation 1: Basic Algorithms and Operators. Institute of Physics Publishing, Bristol-Philadelphia, 2000.
2. BACK, T. - FOGEL, D. B. - MICHALEWICZ, Z.: Evolutionary Computation 2: Advanced Algorithms and Operators. Institute of Physics Publishing, Bristol-Philadelphia, 2000.
3. BLUM, C. - EHRGOTT, M.: Local Search Algorithms for the k-Cardinality Tree Problem. Discrete Applied Mathematics, Vol. 128, 2003, No. 2-3, pp. 511-540.
4. BRIMBERG, J. - UROŠEVIĆ, D.-MLADENOVIĆ, N.: Variable Neighborhood Search for the Vertex Weighted k-Cardinality Tree. European Journal of Operational Research, Vol. 171, 2006, pp. 74-84.
5. CHLEBÍKOVÁ, J.: Approximating the Maximally Balanced Connected Partition Problem in Graphs. Information Processing Letters, Vol. 60, 1996, pp. 225, pp. 230.
6. FILIPOVIĆ, V.: Fine-Grained Tournament Selection Operator in Genetic Algorithms. Computing and Informatics, Vol. 22, 2003, No. 2, pp. 143-161.
7. FILIPOVIĆ, V.: Selection and Migration Operators and Web Services in Parallel Evolutionary Algorithms (in Serbian). Ph.D. thesis, Faculty of Mathematics, University of Belgrade, 2006.
8. HOLLAND, J. H.: Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor, 1975.
9. JUHOS, I. - VAN HEMERT, J. I.: Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation. Lecture Notes in Computer Science, Vol. 3906, 2006, pp. 123-134.
10. KERSTING, S. - RAIDL, G.R. - LJUBIC, I.: A Memetic Algorithm for Vertex-Biconnectivity Augmentation. Applications of Evolutionary Computing: EvoWorkshops 2002, Vol. 2279, 2002, pp. 102-111.
11. KRATICA, J.: Improving Performances of the Genetic Algorithm by Caching. Computers and Artificial Intelligence, Vol. 18, 1999, No. 3, pp. 271-283.
12. KRATICA, J.: Parallelization of Genetic Algorithms for Solving Some NP-complete Problems (in Serbian). Ph. D. thesis, Faculty of Mathematics, University of Belgrade, 2000.
13. KRATICA, J. - STANIMIROVIĆ, Z.: Solving the Uncapacitated Multiple Allocation p-Hub Center Problem by Genetic Algorithm. Asia-Pacific Journal of Operational Research, Vol. 24, 2006, No. 4, pp. 425-437.
14. KRATICA, J. - STANIMIROVIĆ, Z.- TOŠIĆ, D. - FILIPOVIĆ, V.: Two Genetic Algorithms for Solving Uncapacitated Single Allocation Hub Location Problem. European Journal of Operational Research, Vol. 182, 2007, No. 1, pp. 15-28.
15. LJUBIĆ, I. - RAIDL, G. R.: A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs. Journal of Heuristics, Vol. 9, 2003, pp. 401-427.
16. LJUBIĆ, I.: Exact and Memetic Algorithms for Two Network Design Problems. Ph. D. thesis, Institute of Computer Graphics, Vienna University of Technology, 2004.
17. LJUBIĆ, I. - WEISKIRCHER, R. - PFERSCHY, U. - KLAU, G.W. - MUTZEL, P. - FISCHETTI, M.: An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem. Mathematical Programming, Series B, Vol. 105, No. 2-3, 2006, pp. 427-449.
18. PUCHINGER, J. - RAIDL, G. R. - PFERSCHY, U.: The Core Concept for the Multi-dimensional Knapsack Problem. Lecture Notes in Computer Science, Vol. 3906, 2006, pp. 195-208.
19. RAIDL, G. R. - GOTTLIEB, J.: Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem. Evolutionary Computation, Vol. 13, 2005, No. 4, pp. 441-475.
20. STANIMIROVIĆ, Z.: Solving Some Discrete Location Problems by Using Genetic Algorithms (in Serbian). Master's thesis, Faculty of Mathematics, University of Belgrade, 2004.
21. STANIMIROVIĆ, Z.: An Efficient Genetic Algorithm for the Uncapacitated Multiple Allocation p-hub Median Problem, submited for Control and Cybernetics.
22. STANIMIROVIĆ, Z.: A Genetic Algorithm Approach for the Capacitated Single Allocation p-Hub Median Problem. Computing and Informatics, Vol. 27, 2008.