Skip to main content
SpringerLink
Log in

New topics in Genetic Algorithm research

  • News
  • Published:
New Generation Computing Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Goldberg, D. E.,Genetic Alqorithms in Search, Optimization, end Machine Learning, Addison Wesley Publishing Company, Inc., 1989.

  2. Rawlins, G. J. E. (Ed),Foundations of Genetic Algorithms, Morgan Kaufmann, 1991.

  3. Davis, L.,Handbook of Genetic Algorithms, Van Nostrand Reinhold, 1991.

  4. Schaffer, J. D. (Ed),Proc. of the Third Int. Conf. on Genetic Algorithms, Morgen Kaufmann, 1989.

  5. Belew, R. K. (Ed),Proc. of the Fourth Int. Conf. on Genetic Algorithms, Morgan Kaufmann, 1991.

  6. Bäck, T., Hoffmeister, F., and Schwefel, H., “A Survey of Evolution Strategies,”ICGA ’91, Morgan Kaufman, pp. 2–9, 1991.

  7. Hart, W. E., and Belew, R. K., “Optimizing an Arvitrary Function is Hard for the Genetic Algorithm,”ICGA ’91, Morgan Kaufman, pp. 191–195, 1991.

  8. Mason, A. J., “Partition Coefficients, Static Deception and Deceptive Problems for Non-Binary Alphabets,”ICGA ’91, Morgan Kaufman, pp. 210–214, 1991.

  9. Wilson, S. W., “GA-Easy Does Not Imply Steepest-Ascent Optimizable,”ICGA ’91, Morgan Kaufman, pp. 85–89, 1991.

  10. Vose, M. D. and Liepins, G. E., “Generalizing the Notion of Schema in Genetic Algorithms,”Artificial Intelligence, vol. 50., 1991.

  11. Syswerda, G., “Uniform in Genetic Algorithms,”ICGA ’89, pp. 2–9, 1989.

  12. Eshelmen, L. and Schaffer, D., “Preventing Premature Convergence in Genetic Algorithms by Preventing Incest,”ICGA ’91, pp. 115–122, 1991.

  13. Whitley, D., Mathias, K. and Fitzhorn, P., “Delta Coding: An Iterative Search Strategy for Genetic Algorithms,”ICGA ’91, pp. 77–84, 1991.

  14. Das, R. and Whitley, D., “The Only Challenging Problems are Decepive: Global Search by Solving Order-1 Hyperplanes,”ICGA ’91, pp. 166–173, 1991.

  15. Goldberg, D. E., Deb, K., and Korb, B., “Don’t Worry, Be Messy,”ICGA ’91, Morgan Kaufman, pp. 24–30, 1991.

  16. Sugato, B., Uckun, S., Miyabe, Y. and Kawamura, K. “Exploring Probrem-Specific Recombination Operators for Job Shop Scheduling,”ICGA ’91, pp. 10–17, 1991.

  17. Nakano, R. and Yamada, T., “Conventional Genetic Algorithm for Job Shop Problems,”ICGA ’91, pp. 474–479, 1991.

  18. von Laszewski, Gregor, “Intelligent Structural Operators for the k-wey Groph Partitioning Problem,”ICGA ’91, Morgen Kaufmann, pp. 45–52., 1991.

  19. Kernighan, B. W. and Lin, S., “An Efficient Heuristic Procedure for Partitioning Graphs,”Bell Systems Technical Journal, vol. 49, pp. 291–307., 1970.

    Google Scholar 

  20. Maruyama, T., “Parallel Graph Patitioning Algorithm using a Genetic Algorithm” JSPP, pp. 71–78, 1992, (in Japanese).

  21. Cohoon, J. P., Martin, W. N. and Richards, D. S., “A Multi-population Generic Algorithm for Solving the K-Partition Problem on Hyper-cubes,”ICGA ’91, Morgan Kaufmann, pp. 244–248., 1991.

  22. Tanese, Reiko, “Distributed Genetic Algorithms”ICGA ’89, Morgan Kaufmann, pp. 434–439., 1989.

  23. Kosak, Corey, Marks, Joe, Shieber, Stuart, “A Parallel Genetic Algorithm for Network-Diagram Layout,”ICGA ’91, Morgan Kaufmann, pp. 458–465., 1991.

  24. Collins, Robert J. and Jefferson, David R., “Selection in Massively Parallel Genetic Algorithms,”ICGA ’91, Morgan Kaufmann, pp. 249–256., 1991.

  25. Spiessens, Piet, and Manderick, Bernard, “A Massively Parallel Genetic Algorithm Implementation and First Analysis,”ICGA ’91, Morgan Kaufmann, pp. 279–286., 1991.

  26. Kitano, H., Smith, S. F. and Higuchi, T., “A Parallel Associative Memory Processor for Rule Learning with Genetic Algorithms,”ICGA ’91, PP. 311–317., 1991.

  27. Muhlenbein, H., Schomisch, M., and Born, J., “The Parallel Genetic Algorithm as Function Optimizer,”ICGA ’91, Morgan Kaufmann, pp. 271–278., 1991.

  28. Maruyama, T., Konagaya, A., and Konishi, K., “Asynchronous fine-grained Parallel Genetic Algorithm,”to appear in PPSN, (1992).

Download references

Author information

Authors and Affiliations

  1. C & C Systems Research Labs., NEC Corporation, 1-1, Miyamaeku, 216, Kanagawa, Japan

    A. Konagaya

Authors
  1. A. Konagaya
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. Konagaya.

About this article

Cite this article

Konagaya, A. New topics in Genetic Algorithm research. New Gener Comput 10, 423–427 (1992). https://doi.org/10.1007/BF03037946

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03037946

Search

Navigation