A genetic algorithm with conditional crossover and mutation operators and its application to combinatorial optimization problems

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E90-A, Issue 1, 2007, Pages 287-293

  Wang, Rong Long ^a   Fukuta, Shinichi ^a   Wang, Jia Hai ^b   Okazaki, Kozo ^a  

^a UNIVERSITY OF FUKUI   (Japan)

^b SUN YAT SEN UNIVERSITY   (China)

Author keywords

Combinatorial optimization problem; Genetic algorithm; Set covering problem; Subset sum problem

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL METHODS; MATHEMATICAL OPERATORS; OPTIMIZATION; PROBABILISTIC LOGICS; PROBLEM SOLVING;

COMBINATORIAL OPTIMIZATION PROBLEMS; SET COVERING PROBLEMS; SUBSET SUM PROBLEMS;

GENETIC ALGORITHMS;

EID: 33846443264     PISSN: 09168508     EISSN: 17451337     Source Type: Journal    
DOI: 10.1093/ietfec/e90-a.1.287     Document Type: Conference Paper

References (33)

1. J.H. Holland, Adaption in Natural and Artificial System, MIT Press, Cambridge, MA, 1975.
2. D.E. Goldberg, Genetic algorithms in search, optimization, and machine learning, Addison-Wesley, 1989.
3. D. Whiley, "A genetic algorithm tutorial," Technical Report CS-93-103, Department of Computer Science, Colorado State University, 1993.
4. G. Syswerda, "A study of reproduction in generational and steady-state genetic algorithm," in Foundation of Genetic Algorithm, pp.94-101, Morgan Kaufman, 1991.
5. L.J. Schmitt and M.M. Amini, "Performance characteristics of alternative genetic algorithm approaches to the traveling salasman problem using path representation: An empirical study," Eur. J. Oper. Res., vol.108, pp.551-570, 1998.
6. I. Ahmad and M.K. Dhodhi, "On the m-way graph partitioning problem" Comput. J., vol.38, no.3, pp.237-244, 1995.
7. J.O. Kim, D.J. Shin, J.N. Park, and C. Singh, "Atavistic genetic algorithm for economic dispatch with valve point effect," Electric Power Systems Research, vol.62, pp.201-207, 2002.
8. L. Davis, "Adapting operator probabilities in genetic algorithms," Proc. 3rd International Conference on Genetic Algorithm (ICGA), pp.61-69, 1989.
9. B.A. Julstrom, "What have you done for me lately? Adapting operator probabilities in a steady-state genetic algorithm," Proc. 6th International Conference on Genetic Algorithm (ICGA), pp.81-87, 1995.
10. A. Tuson and P. Ross, "Cost based operator rate adaptation: An investigation," Proc. 4-th Conference of Parallel Problem Solving from Nature (PPSN) IV, pp.461-469, 1996.
11. L.G. Caldas and L.K. Norford, "A design optimization tool based on a genetic algorithm," Automation in Construction, vol.11, pp. 173-184, 2002.
12. K.A. De Jong, An analysis of the behaviour of a class of genetic adaptive systems, PhD Thesis, University of Michigan, 1975.
13. R.M. Karp, "Reducibility among combinatorial problems," in Complexity of Computer Copulation, ed. R.E. Miller and J.W. Thatcher, pp.85-103, Plenum, New York, 1972.
14. M. Garey and D. Johnson, Computers and intractability: A guide to the theory of NP-completeness, W.H. Freeman and Co., San Fran
15. cisco, 1979.
16. D. Whitley and J. Kauth, "GENITOR: A different genetic algorithm," Proc. Rocky Mountain Conference on Artificial Intelligence, pp.118-130, Denver, Colorado, 1988.
17. D.E. Goldberg, Genetic Algorithm, pp.106-120, Eddison-Wesley Publishing Company, 1989.
18. B.P. Buckles and F.E. Petty, Genetic Algorithm, IEEE Computer Press, Los Alanitos, CA, 1994.
19. P. Jog, J.Y. Suh, and D. Van Gucht, "The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the traveling salesman problem," Proc. Third International Conference on Genetic Algorithms, ed. J.D. Schaffer, pp. 110-115, Morgan Kaufmann, Los Altos, CA, 1989.
20. P.J.M. van Laarhoven and E.H.L. Aarts, Simulated Annealing: Theory and Applications, Kluwer, Dordrecht, 1988.
21. H. Swai, S. Kizu, and T. Endo, "Performance comparison of parameter-free genetic algorithm with steady-state genetic algorithm," IEICE Trans. Inf. & Syst. (Japanese Edition), vol.J81-D-II, no.6, pp.1455-1459, June 1998.
22. B.L. Dietrich and L.F. Escudero, "Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds," Operation Research Letters, vol.9, pp.9-14, 1990.
23. L. Dietrich, L.F. Escudero, and F. Chance, "Efficient reformulation for 0-1 programs: Methods and computational results," Discrete Appl. Math., vol.42, pp.144-176, 1993.
24. A.G. Konheim, Cryptography: A primer, Wiley, New York, 1981.
25. K. Prasad and J.S. Kelly, "NP-Completeness of some problems concerning voting games," International Journal of Game Theory, vol.19, pp.1-9, 1990.
26. N. Chakravarti, A.M. Goel, and T. Sastty, Easy weighted majority games, Working Paper Series WPS-287/97 Indian Institute of Management Calcutta, 1997.
27. D.R. Stinson, An Introduction to the Design and Analysis of Algorithms, 2nd ed., The Charles Babbage Research Center, Winnipeg, Manitoba, Canada, 1987.
28. J. Bartholdi, "A guaranteed-accuracy round-off algorithm for cyclic scheduling and set covering," Oper. Res., vol.29, pp.501-510, 1981.
29. W. Walker, "Using the set covering problem to assign fire companies to fire houses," Oper. Res., vol.22, pp.275-277, 1974.
30. M. Salveson, "The assembly line balancing problem," Journal of Industrial Engineering, vol.6, pp. 18-25, 1955.
31. M. Breuer, "Simplification of the set covering problem with application to Boolean expressions," Journal for the Association of Computing Machinery, vol.17, pp.166-181, 1970.
32. J.E. Beasley, "OR-library: Distributing test problems by electronic mail," Journal of the Operational Research Society, vol.41, pp. 1069-1072, 1990.
33. M. Solar, V. Parada, and R. Urrutia, "A parallel genetic algorithm to solve the set-covering problem," Computers & Operations Research, vol.29, pp.1221-1235, 2002.