An adaptive hybrid genetic algorithm for the three-matching problem

IEEE Transactions on Evolutionary Computation

Volumn 4, Issue 2, 2000, Pages 135-146

  Magyar, Gábor ^a   Johnsson, Mika ^a   Nevalainen, Olli ^a  

^a UNIVERSITY OF TURKU   (Finland)

Author keywords

Adaptation; Genetic algorithms; Hybridization; Matching; Optimization; Partitioning.

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; HEURISTIC METHODS; MATHEMATICAL OPERATORS; OPTIMIZATION;

ADAPTIVE HYBRID GENETIC ALGORITHMS; GENETIC OPERATORS; THREE-MATCHING PROBLEMS;

GENETIC ALGORITHMS;

EID: 0034227375     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/4235.850654     Document Type: Article

References (24)

1. M. Johnsson, G. Magyar, and O. Nevalainen, "On the Euclidean 3-matching problem," Nordic J. Comput., vol. 5, pp. 143-171, June 1998.
2. M. Johnsson, T. Leipälä, and O. Nevalainen, "Determining the manual setting order of components on PC-boards," J. Manufact. Syst., vol. 15, no. 3, pp. 155-163, 1996.
3. G. Magyar, M. Johnsson, and O. Nevalainen, "Genetic algorithm approach for the three-matching problem," in Proc. 3rd Nordic Workshop Genetic Algorithms Appl. (3NWGA), Aug. 1997, Available ftp://ftp.uwasa.fi/cs/3NWGA/Magyar.ps.Z, pp. 109-112.
4. G. Reinelt, "TSPLIB - A traveling salesman problem library," ORSA J. Comput., vol. 3, pp. 376-384, 1991.
5. F. G. Lobo and D. E. Goldberg, "Decision making in a hybrid genetic algorithm," in Proc. 1997 IEEE Conf. Evol. Comput. New York: IEEE Press, 1997, pp. 121-125.
6. B. A. Julstrom, "What have you done for me lately? Adapting operator probabilities in a steady-state genetic algorithm," in Proc. 6th Int. Conf. Genetic Algorithms, L. J. Eshelman, Ed. San Mateo, CA: Morgan Kaufmann, 1995, pp. 81-87.
7. L. Davis, Ed., Handbook of Genetic Algorithms. New York: Van Nostrand Reinhold, 1991.
8. W. M. Spears, "Adapting crossover in evolutionary algorithms," in Proc. 4th Annu. Conf. Evol. Programming, J. R. McDonnell, R. G. Reynolds, and D. B. Fogel, Eds. Cambridge, MA: MIT Press, 1995, pp. 367-384.
9. R. Hinterding, Z. Michalewicz, and A. E. Eiben, "Adaptation in evolutionary computation: A survey," in Proc. 4th IEEE Conf. Evol. Comput. (Indianapolis, IN). Piscataway, NJ: IEEE Press, 1997, pp. 65-69.
10. J. Xiao, Z. Michalewicz, L. Zhang, and K. Trojanowski, "Adaptive evolutionary planner/navigator for mobile robots," IEEE Trans. Evol. Comput., vol. 1, pp. 18-28, Apr. 1997.
11. W. M. Spears, "Recombination parameters," in The Handbook of Evolutionary Computation, T. Baeck, D. Fogel, and Z. Michalewicz, Eds: IOP Publishing and Oxford University Press, 1997, pp. E1.3:1-E1.3:13.
12. C. Houck and M. Kay, "Adapting the order and frequency of genetic operators through co-evolving populations," North Carolina State Univ., Tech. Rep. NCSU-IE TR 96-03, 1996.
13. D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA: Addison-Wesley, 1989.
14. G. Magyar, M. Johnsson, and O. Nevalainen, "Heuristic algorithms for the Euclidean three-matching problem," Turku Centre for Comput. Sci. (TUCS), Tech. Rep. 262, 1999.
15. D. Whitley, S. Gordon, and K. Mathias, "Lamarckian evolution, the Baldwin effect and function optimization," in Parallel Problem Solving from Nature-PPSN III, Y. Davidor, H.-P. Schwefel, and R. Männer, Eds. Berlin, Germany: Springer-Verlag, 1994, pp. 6-15.
16. G. Magyar, M. Johnsson, and O. Nevalainen, "On the exact solution of the Euclidean three-matching problem," Acta Cybern., vol. 14, no. 2, 1999.
17. E. Falkenauer, "A hybrid grouping genetic algorithm for bin packing," J. Heuristics, vol. 2, no. 1, pp. 5-30, 1996.
18. _, "A new representation and operators for GA's applied to grouping problems," Evol. Comput., vol. 2, no. 2, pp. 123-144, 1994.
19. Y. Crama, A. W. J. Kolen, A. G. Oerlemans, and F. C. R. Spieksma, Production Planning in Automated Manufacturing. Berlin, Germany: Springer-Verlag, 1994.
20. P. J. M. van Laarhoven and W. H. m. Zijm, "Production preparation and numerical control in PCB assembly," Int. J. Flexible Manuf. Syst., vol. 5, pp. 187-207, 1993.
21. N. Christofides and J. E. Beasley, "A tree search algorithm for the p-median problem," EJOR, vol. 10, pp. 196-204, 1982.
22. V. Maniezzo, A. Mingozzi, and R. Baldacci, "A bionomic approach to the capacitated p-median problem," J. Heuristics, vol. 4, no. 3, pp. 263-280, 1998.
23. S. S. Chaudhry, I.-C. Choi, and D. K. Smith, "Facility location with and without maximum distance constraints through the p-median problem," Int. J. Oper. Prod. Manag., vol. 15, no. 10, pp. 75-81, 1995.
24. J. E. Beasley, "An algorithm for solving large capacitated warehouse location problems," Eur. J. Oper. Res., vol. 33, pp. 314-325, 1988.