Computing the metric dimension of graphs by genetic algorithms

Computational Optimization and Applications

Volumn 44, Issue 2, 2009, Pages 343-361

  Kratica, Jozef ^a   Kovačević Vujčić, Vera ^b   Čangalović, Mirjana ^b  

^a MATHEMATICAL INSTITUTE   (Serbia)

^b UNIVERSITY OF BELGRADE   (Serbia)

Author keywords

Evolutionary approach; Graph theory; Metric dimension

Indexed keywords

APPROXIMATE SOLUTION; BINARY ENCODINGS; CACHING TECHNIQUE; CREW SCHEDULING; EVOLUTIONARY APPROACH; GENETIC OPERATORS; GRAPH COLORINGS; HAMMING GRAPHS; HYPER-CUBES; METRIC DIMENSION; NP-HARD PROBLEM; PSEUDO-BOOLEAN; STANDARD TESTS; TEST INSTANCES;

COMPUTATIONAL COMPLEXITY; GENETIC ALGORITHMS; MATHEMATICAL OPERATORS; METRIC SYSTEM;

GRAPH THEORY;

EID: 70449413740     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-007-9154-5     Document Type: Article

References (52)

1. Bäck, T., Fogel, D.B., Michalewicz, Z.: Evolutionary Computation 1: Basic Algorithms and Operators. Institute of Physics Publishing, Bristol (2000)
2. Bäck, T., Fogel, D.B., Michalewicz, Z.: Evolutionary Computation 2: Advanced Algorithms and Operators. Institute of Physics Publishing, Bristol (2000)
3. J.E. Beasley 1996 Obtaining test problems via internet J. Glob. Optim. 8 429 433 10.1007/BF02404002 http://www.brunel.ac.uk/depts/ma/research/jeb/orlib
4. J.E. Beasley B. Cao 1996 A tree search algorithm for the crew scheduling problem Eur. J. Oper. Res. 94 517 526 10.1016/0377-2217(95)00093-3 (Pubitemid 126391959)
5. Cáceres, J., Hernando, C., Mora, M., Pelayo, I.M., Puertas, M.L., Seara, C.: On the metric dimension of some families of graphs. In: Proc. 7th Internacional Colloquium on Graph Theory-ICGT'05, Hyères, France (2005)
6. Cáceres, J., Hernando, C., Mora, M., Pelayo, I.M., Puertas, M.L., Seara, C., Wood, D.R.: On the metric dimension of graph products. In: Proc. 20th British Combinatorial Conference, Durham, England (2005)
7. J. Cáceres C. Hernando M. Mora I.M. Pelayo M.L. Puertas C. Seara D.R. Wood 2007 On the metric dimension of Cartesian products of graphs SIAM J. Discrete Math. 21 2 423 441 10.1137/050641867 2318676
8. Chappell, G.G., Gimbel, J., Hartman, C.: Bounds on the metric and partition dimensions of a graph. Manuscript (2003)
9. G. Chartrand L. Eroha M.A. Johnson O.R. Oellermann 2000 Resolvability in graphs and the metric dimension of a graph Discrete Appl. Math. 105 99 113 10.1016/S0166-218X(00)00198-0 1780464
10. G. Chartrand C. Poisson P. Zhang 2000 Resolvability and the upper dimension of graphs Comput. Math. Appl. 39 19 28 10.1016/S0898-1221(00)00126-7 1763834 (Pubitemid 30849886)
11. J.D. Currie O.R. Oellerman 2001 The metric dimension and metric independence of a graph J. Comb. Math. Comb. Comput. 39 157 167
12. D. Cvetković P. Hansen V. Kovačević- Vujčić 2004 On some interconnections between combinatorial optimization and extremal graph theory Yugosl. J. Oper. Res. 14 2 147 154 10.2298/YJOR0402147C 2421095
13. Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
14. M. Fehr S. Gosselin O.R. Oellermann 2006 The metric dimension of Cayley digraphs Discrete Math. 306 1 31 41 10.1016/j.disc.2005.09.015 2202072 (Pubitemid 43144812)
15. V. Filipović 2003 Fine-grained tournament selection operator in genetic algorithms Comput. Inform. 22 143 161 2022675
16. Filipović, V.: Selection and migration operators and Web services in parallel evolutionary algorithms. Ph.D. thesis, Faculty of Mathematics, University of Belgrade (2006) (in Serbian)
17. Filipović, V., Kratica, J., Tošić, D., Ljubić, I.: Fine grained tournament selection for the simple plant location problem. In: Proceedings of the 5th Online World Conference on Soft Computing Methods in Industrial Applications-WSC5, pp. 152-158 (2000)
18. C. Fleurent J.A. Ferland 1996 Genetic and hybrid algorithms for graph coloring Ann. Oper. Res. 63 437 461 10.1007/BF02125407 (Pubitemid 126729251)
19. Glover, F., Laguna, F.: Tabu Search. Kluwer Academic, Norwell (1997)
20. P. Hansen N. Mladenović 2001 Variable neighborhood search: Principles and applications Eur. J. Oper. Res. 130 3 449 467 10.1016/S0377-2217(00)00100-4 (Pubitemid 32875304)
21. F. Harary R.A. Melter 1976 On the metric dimension of a graph Ars Comb. 2 191 195 457289
22. A. Hertz M. Widmer 2003 Guidelines for the use of meta-heuristics in combinatorial optimization Eur. J. Oper. Res. 151 247 252 10.1016/S0377-2217(02) 00823-8 2014074
23. C. Hernando M. Mora I.M. Pelayo C. Seara J. Cáceres M.L. Puertas 2005 On the metric dimension of some families of graphs Electron. Notes Discrete Math. 22 129 133 10.1016/j.endm.2005.06.023
24. Juhos, I., van Hemert, J.I.: Improving graph colouring algorithms and heuristics using a novel representation. In: Lecture Notes in Computer Science, vol. 3906, pp. 123-134. Springer, Berlin (2006)
25. Kennedy, J., Eberhart, R.C., Shi, Y.: Swarm Intelligence. Morgan Kaufmann, San Francisco (2001)
26. S. Khuller B. Raghavachari A. Rosenfeld 1996 Landmarks in graphs Discrete Appl. Math. 70 217 229 10.1016/0166-218X(95)00106-2 1410574 (Pubitemid 126399089)
27. S. Kirkpatrick C.D. Gelatt M.P. Vecchi 1983 Optimization by simulated annealing Science 220 671 680 10.1126/science.220.4598.671 702485 http://citeseer.ist.psu.edu/kirkpatrick83optimization.html
28. Kovačević-Vujčić, V., Mladenović, N., Čangalović, M., Dražić, M.: Continuous variable neighborhood search: comparison with exact methods. Yugosl. J. Oper. Res. (accepted for publication)
29. J. Kratica 1999 Improving performances of the genetic algorithm by caching Comput. Artif. Intell. 18 271 283
30. Kratica, J.: Parallelization of genetic algorithms for solving some NP-complete problems. Ph.D. thesis, Faculty of Mathematics, University of Belgrade (2000) (in Serbian)
31. J. Kratica Z. Stanimirović 2006 Solving the uncapacitated multiple allocation p-hub center problem by genetic algorithm Asia-Pacific J. Oper. Res. 24 4 425 438 10.1142/S0217595906001042 (Pubitemid 46113145)
32. J. Kratica Z. Stanimirović D. Tošić V. Filipović 2005 Genetic algorithms for solving uncapacitated multiple allocation hub median problem Comput. Inform. 24 415 426
33. J. Kratica Z. Stanimirović D. Tošić V. Filipović 2007 Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem Eur. J. Oper. Res. 182 1 15 28 10.1016/j.ejor.2006.06.056 (Pubitemid 46562550)
34. Ljubić, I.: Exact and memetic algorithms for two network design problems. Ph.D. thesis, Institute of Computer Graphics, Vienna University of Technology (2004)
35. I. Ljubić G.R. Raidl 2003 A memetic algorithm for minimum-cost vertex-biconnectivity augmentation of graphs J. Heuristics 9 401 427 10.1023/B:HEUR.0000004810.27436.30
36. I. Ljubić R. Weiskircher U. Pferschy G.W. Klau P. Mutzel M. Fischetti 2006 An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem Math. Program. Series B 105 2-3 427 449 10.1007/s10107-005-0660-x
37. P. Merz 2004 Advanced fitness landscape analysis and the performance of memetic algorithms Evol. Comput. 12 3 303 325 10.1162/1063656041774956 399709 (Pubitemid 39219650)
38. A. Misevicius 2005 A tabu search algorithm for the quadratic assignment problem Comput. Optim. Appl. 30 1 95 111 10.1007/s10589-005-4562-x 2122184 (Pubitemid 40356735)
39. N. Mladenović M. Dražić V. Kovačević- Vujčić M. Čangalović 2007 General variable neighborhood search for the continuous optimization Eur. J. Oper. Res. 10.1016/j.ejor.2006.12.064
40. S.K. Mondel J.K. Dey M. Maiti 2007 A single period inventory model of a deteriorating item sold from two shops with shortage via genetic algorithm Yugosl. J. Oper. Res. 17 1 75 94 10.2298/YJOR0701075M 2421010
41. Moscato, P.: Memetic algorithms. In: Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Applied Optimization, pp. 157-167. Oxford University Press, Oxford (2002)
42. J. Peters-Fransen O. Oellermann 2006 The metric dimension of Cartesian products of graphs Util. Math. 69 33 41 2212795
43. Puchinger, J., Raidl, G.R., Pferschy, U.: The core concept for the multidimensional knapsack problem. In: Lecture Notes in Computer Science, vol. 3906, pp. 195-208. Springer, Berlin (2006)
44. G.R. Raidl J. Gottlieb 2005 Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: a case study for the multidimensional knapsack problem Evol. Comput. 13 4 441 475 10.1162/106365605774666886 (Pubitemid 43955278)
45. Y. Rochat E.D. Taillard 1995 Probabilistic diversification and intensification in local search for vehicle routing J. Heuristics 1 147 167 10.1007/BF02430370
46. V. Saenpholphat P. Zhang 2003 Connected resolvability of graphs Czechoslov. Math. J. 53 128 827 840 10.1023/B:CMAJ.0000024524.43125.cd 2018833 (Pubitemid 38254388)
47. V. Saenpholphat P. Zhang 2004 On connected resolving decompositions in graphs Czechoslov. Math. J. 54 129 681 696 10.1007/s10587-004-6417-5 2086725 (Pubitemid 40042152)
48. B. Shanmukha B. Sooryanarayana K.S. Harinath 2002 Metric dimension of wheels Far East J. Appl. Math. 8 217 229 1944130
49. Stanimirović, Z.: Solving some discrete location problems by using genetic algorithms. Master's thesis, Faculty of Mathematics, University of Belgrade (2004) (in Serbian)
50. Stanimirović, Z.: An efficient genetic algorithm for the uncapacitated multiple allocation p-hub median problem. Control Cybern. (submitted)
51. Z. Stanimirović J. Kratica Dj. Dugošija 2007 Genetic algorithms for solving the discrete ordered median problem Eur. J. Oper. Res. 182 3 983 1001 10.1016/j.ejor.2006.09.069 (Pubitemid 46729623)
52. K. Xu W. Li 2006 Many hard examples in exact phase transitions Theor. Comp. Sci. 355 291 302 10.1016/j.tcs.2006.01.001 http://www.nlsde.buaa.edu.cn/ ~kexu/benchmarks/pb-benchmarks.htm