A biased random-key genetic algorithm for the Steiner triple covering problem

Optimization Letters

Volumn 6, Issue 4, 2012, Pages 605-619

  Resende, Mauricio G C ^a   Toso, Rodrigo F ^b   Gonçalves, José Fernando ^c   Silva, Ricardo M A ^d  

^a AT AND T LABS RESEARCH   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c UNIVERSITY OF PORTO   (Portugal)

^d FEDERAL UNIVERSITY OF PERNAMBUCO   (Brazil)

Author keywords

Biased random key genetic algorithm; Combinatorial optimization; Genetic algorithm; Heuristics; Metaheuristics; Random keys; Set covering; Steiner triple covering

Indexed keywords

HEURISTICS; META HEURISTICS; RANDOM KEYS; SET COVERINGS; STEINER TRIPLE COVERING;

COMBINATORIAL OPTIMIZATION;

GENETIC ALGORITHMS;

EID: 84859156691     PISSN: 18624472     EISSN: 18624480     Source Type: Journal    
DOI: 10.1007/s11590-011-0285-3     Document Type: Article

References (22)

1. Aiex R. M., Resende M. G. C., Ribeiro C. C.: TTTPLOTS: a perl program to create time-to-target plots. Optim. Lett. 1, 201-212 (2007).
2. Avis D.: A note on some computationally difficult set covering problems. Math. Program. 18, 138-145 (1980).
3. Bean J. C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 6, 154-160 (1994).
4. Feo T. A., Resende M. G. C.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8, 67-71 (1989).
5. Fulkerson D. R., Nemhauser G. L., Trotter L. E. Jr.: Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems. Math. Programm. Study 2, 72-81 (1974).
6. Garey M. R., Johnson D. S.: Computers and intractability. A guide to the theory of NP-completeness. WH Freeman and Company, San Francisco (1979).
7. Gonçalves, J. F., Resende, M. G. C.: Biased random-key genetic algorithms for combinatorial optimization. J. Heuristics (2010a). doi: 10. 1007/s10732-010-9143-1.
8. Gonçalves, J. F., Resende, M. G. C.: A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem. J. Combin. Optim. (2010b). doi: 10. 1007/s10878-009-9282-1.
9. Hall M.: Combinatorial theory. Blaisdell Company, Minneapolis (1967).
10. Johnson D. S.: Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9, 256-278 (1974).
11. Karmarkar N. K., Resende M. G. C., Ramakrishnan K. G.: An interior point algorithm to solve computationally difficult set covering problems. Math. Programm. 52, 597-618 (1991).
12. Mannino C., Sassano A.: Solving hard set covering problems. Oper. Res. Lett. 18, 1-5 (1995).
13. Matsumoto M., Nishimura T.: Mersenne Twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model. Comput. Simul. 8, 3-30 (1998).
14. Odijk M. A., van Maaren H.: Improved solutions to the Steiner triple covering problem. Inf. Process. Lett. 65, 67-69 (1998).
15. OpenMP. Last visited on 19 October (2010). http://openmp. org.
16. Östergård, P., Vaskelainen, V.: Russian doll search for the Steiner triple covering problem. Optimization Letters, pp. 1-8 (2010) doi: 10. 1007/s11590-010-0225-7.
17. Ostrowski, J., Linderoth, J., Rossi, F., Smriglio, S.: Solving large Steiner triple covering problems. Technical Report 1663, Computer Sciences Department, University of Wisconsin, Madison (2009).
18. Ostrowski, J., Linderoth, J., Rossi, F., Smriglio, S.: Solving Steiner triple covering problems. Optima 83 (2010).
19. Resende M. G. C., Toso R. F.: BRKGA framework: A C++ framework for implementing biased random-key genetic algorithms. Technical report, AT & T Labs Research, USA (2010).
20. Spears, W. M., DeJong, K. A.: On the virtues of parameterized uniform crossover. In: Proceedings of the Fourth International Conference on Genetic Algorithms, pp. 230-236 (1991).
21. Stroustrup B.: The C++ Programming Language. Addison-Wesley, Reading (1997).
22. Vemuganti R. R.: Applications of set covering, set packing and set partitioning models: a survey. In: Du, D.-Z., Pardalos, P. M. (eds) Handbook of Combinatorial Optimization, vol. 1, pp. 573-746. Kluwer, Dordrecht (1998).