Biased mutation operators for subgraph-selection problems

IEEE Transactions on Evolutionary Computation

Volumn 10, Issue 2, 2006, Pages 145-156

  Raidl, Günther R ^a   Koller, Gabriele ^a   Julstrom, Bryant A ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b ST CLOUD STATE UNIVERSITY   (United States)

Author keywords

Biased operators; Graph problems; Minimum spanning tree problem (MSTP); Mutation; Traveling salesman problem (TSP)

Indexed keywords

APPROXIMATION THEORY; CONSTRAINT THEORY; EVOLUTIONARY ALGORITHMS; GRAPH THEORY; MATHEMATICAL OPERATORS; PROBABILITY;

BIASED OPERATORS; EXPONENTIAL FUNCTIONS; GRAPH PROBLEMS; MINIMUM SPANNING TREE PROBLEM (MSTP); OPTIMAL PROBABILITIES; TRAVELING SALESMAN PROBLEM (TSP);

TRAVELING SALESMAN PROBLEM;

EID: 33645578683     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2006.871251     Document Type: Article

References (23)

1. J. Knowles and D. Corne, "A new evolutionary approach to the degree constrained minimum spanning tree problem," IEEE Trans. Evol. Comput., vol. 4, no. 2, pp. 125-134, Apr. 2000.
2. M. Krishnamoorthy, A. T. Ernst, and Y. M. Sharaiha, "Comparison of algorithms for the degree constrained minimum spanning tree," J. Heuristics, vol. 7, pp. 587-611, 2001.
3. N. Deo and P. Micikevicius, "A heuristic for a leaf constrained minimum spanning tree problem," Congressus Numerantium, vol. 141, pp. 61-72, 1999.
4. B. A. Julstrom, "Codings and operators in two genetic algorithms for the leaf-constrained minimum spanning tree problem," Int. J. Appl. Math. Comput. Sci., vol. 14, no. 3, pp. 385-396, 2004.
5. I. Ljubić and G. R. Raidl, "A memetic algorithm for minimum-cost vertex-biconnectivity augmentation of graphs," J. Heuristics, no. 9, pp. 401-427, 2003.
6. J. J. Grefenstette, "Incorporating problem specific knowledge into genetic algorithms," Genetic Algorithms and Simulated Annealing, pp. 42-60, 1987.
7. B. A. Julstrom, "Very greedy crossover in a genetic algorithm for the traveling salesman problem," in Proc. ACM Symp. Appl. Comput., K. M. George, J. H. Carroll, E. Deaton, D. Oppenheim, and J. Hightower, Eds. New York, 1995, pp. 324-328.
8. G. R. Raidl and B. A. Julstrom, "Edge-sets: An effective evolutionary coding of spanning trees," IEEE Trans. Evol. Comput., vol. 7, no. 3, Jun. 2003.
9. "Dept. Business Admin. Inf. Syst.," Univ. Mannheim, Germany, Tech. Rep. 11/2004, 2004.
10. B. A. Julstrom and G. R. Raidl, "Weight-biased edge-crossover in evolutionary algorithms for two graph problems," in Proc. 16th ACM Symp. Appl. Comput., G. Lamont et al., Eds.. New York, 2001, pp. 321-326.
11. G. R. Raidl, G. Kodydek, and B. Julstrom, "On weight-biased mutation for graph problems," in Lecture Notes in Computer Science, J. J. Merelo Guervs, P. Adamidis, H.-G. Beyer, J.-L. Fernndez-Villacaas, and H.-P. Schwefel, Eds. New York: Springer-Verlag, 2002, vol. 2439, Proc. Parallel Problem Solving From Nature - PPSN VII, pp. 204-213.
12. J. B. Kruskal, "On the shortest spanning subtree of a graph and the traveling salesman problem," in Proc. Amer. Math. Soc., vol. 7, 1956, pp. 48-50.
13. S. Thienel, "ABACUS - A branch-and-cut system," Ph.D. dissertation, Univ. Cologne, Cologne, Germany, 1995.
14. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge, U.K.: Cambridge Univ. Press, 1995.
15. F. Neumann and I. Wegener, "Randomized local search, evolutionary algorithms, and the minimum spanning tree problem," in Genetic and Evolutionary Computation - GECCO 2004. ser. LNCS, K. Deb, R. Poli, W. Banzhaf, H.-G. Beyer, E. Burke, P. Darwen, D. Dasgupta, D. Floreano, J. Foster, M. Harman, O. Holland, P. L. Lanzi, L. Spector, A. Tettamanzi, D. Thierens, and A. Tyrrell, Eds. New York: Springer-Verlag, 2004, vol. 3102, pp. 713-724.
16. A. Rényi and G. Szekeres, "On the height of trees," J. Australian Math. Soc., vol. 7, pp. 497-507, 1967.
17. G. Szekeres, "Distribution of labeled trees by diameter," Lecture Notes in Mathematics, vol. 1036, pp. 392-397, 1983.
18. A. Broder, "Generating random spanning trees," in Proc. IEEE 30th Annu. Symp. Found. Computer Science, 1989, pp. 442-447.
19. E. W. Mayr and C. G. Plaxton, "On the spanning trees of weighted graphs," Combinatorica, vol. 12, pp. 433-447, 1992.
20. D. R. Karger and R. E. Tarjan, "A randomized linear time algorithm for finding minimum spanning trees," J. ACM, vol. 42, no. 2, pp. 321-328, 1995.
21. G. R. Raidl, "An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem," in Proc. IEEE Congr. Evol. Comput., C. Fonseca, J.-H. Kim, and A. Smith, Eds., 2000, pp. 104-111.
22. B. A. Julstrom and G. R. Raidl, "Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges," in Proc. ACM Symp. Appl. Comput., G. Lamont, J. Llorens, and J. Carrol, Eds., 2002, pp. 547-552.
23. D. Whitley, T. Starkweather, and D. Fuquay, "Scheduling problems and traveling salesman: The genetic edge recombination operator," in Proc. 3rd Int. Conf. Genetic Algorithms, J. D. Schaffer, Ed., 1989, pp. 133-140.