An improved genetic algorithm with conditional genetic operators and its application to set-covering problem

Soft Computing

Volumn 11, Issue 7, 2007, Pages 687-694

  Wang, Rong Long ^a   Okazaki, Kozo ^a  

^a UNIVERSITY OF FUKUI   (Japan)

Author keywords

Combinatorial optimization; Genetic algorithm; Genetic operator; Set covering problem

Indexed keywords

EID: 33847185520     PISSN: 14327643     EISSN: 14337479     Source Type: Journal    
DOI: 10.1007/s00500-006-0131-1     Document Type: Article

References (20)

1. Beasley JE (1990) OR-library: Distributing test problems by electronic mail. J Oper Res Soc 41:1069-1072
2. Caldas LG, Norford LK (2002) A design optimization tool based on a genetic algorithm. Autom Construct 11:173-184
3. Caldero NM, Flores M (1996) Solving combinatorial problems through tabu search. Computing Engineer Final Project, Departamento de Ingeniermà Informàtica, Universidad de Santiago de Chile (in Spanish)
4. De Jong KA (1975) An analysis of the behaviour of a class of genetic adaptive systems. PhD thesis, University of Michigan
5. Duclos F (1998) Parallel hybrid algorithms to solve the SCP. Computing Engineer Final Project, Departamento de Ingeniermà Informàtica, Universidad de Santiago de Chile
6. Garey M, Johnson D (1979) Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman, San Francisco
7. Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading
8. Haupt RL, Haupt SE (1998) Practical genetic algorithms. Wiley Interscience, New York
9. Holland JH (1975) Adaption in natural and artificial system. MIT Press, Cambridge
10. Hwang SF, He RS (2006) Improved real-parameter genetic algorithm with simulated annealing for engineering problems. Adv Eng Softw 37:406-418
11. Jog P, Suh JY, Van Gucht D (1989). The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the traveling salesman problem. In: Schaffer JD (eds). Proceedings of the 3rd international conference on genetic algorithms. Morgan Kaufmann, Los Altos, pp. 110-115
12. van Laarhoven PJM, Aarts EHL (1988) Simulated annealing: Theory and applications. Kluwer, Dordrecht
13. Satoh H, Ono I, Kobayashi S (1997) A new generation alternation model of genetic algorithms and its assessment. J Japanese Soc Artif Intell 22:734-744
14. Sawai H, Kizu S, Endo T (1998) Performance comparison of parameter-free genetic algorithm with steady-state genetic algorithm. IEICE D-II, J81-D-II:1455-1459
15. Schmitt LJ, Amini MM (1998) Performance characteristics of alternative genetic algorithm approaches to the traveling salesman problem using path representation: An empirical study. Eur J Oper Res 108:551-570
16. Solar M, Parada V, Urrutia R (2002) A parallel genetic algorithm to solve the set-covering problem. Comput Oper Res 29:1221-1235
17. Whiley D (1993) A genetic algorithm tutorial. Technical Report CS-93-103, Department of Computer Science, Colorado State University
18. Whitley D, Beverridge R, Graves C, Mathias K (1995) New test functions and geometric matching. J Heuristics 1:77-104
19. Whitley D, Kauth J (1988) GENITOR: A different genetic algorithm. In: Proceedings of the Rocky Mountain conference on artificial intelligence, Denver, Colorado, pp 118-130
20. Wong SV, Hamouda AMS (2000) Optimization of fuzzy rules design using genetic algorithm. Adv Eng Softw 31:251-262