Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2012, Article ID 703601, 23 pages
http://dx.doi.org/10.1155/2012/703601
Research Article

A Fuzzy Genetic Algorithm Based on Binary Encoding for Solving Multidimensional Knapsack Problems

1Department of Basic Science, Islamic Azad University, Dolatabad Branch, Esfahan 84318–11111, Iran
2Laboratory of Computational Statistics and Operations Research, Institute for Mathematical Research, Universiti Putra Malaysia, 43400 Serdang, Selangor, Malaysia
3Department of Mathematics, Faculty of Science, Universiti Putra Malaysia, 43400 Serdang, Selangor, Malaysia

Received 3 December 2011; Accepted 14 February 2012

Academic Editor: Hector Pomares

Copyright © 2012 M. Jalali Varnamkhasti and L. S. Lee. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Co., San Francisco, Calif, USA, 1979. View at Zentralblatt MATH
  2. J. H. Holland, Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence, University of Michigan Press, Ann Arbor, Mich, USA, 1975. View at Zentralblatt MATH
  3. F. Herrera and M. Lozano, “Fuzzy genetic algorithms: issues and models,” Tech. Rep. DECSAI-98116, Department of Computer Science and A.I., University of Granada, 1998. View at Google Scholar
  4. Y. H. Song, G. S. Wang, P. Y. Wang, and A. T. Johns, “Environmental/economic dispatch using fuzzy logic controlled genetic algorithms,” IEE Proceedings: Generation, Transmission and Distribution, vol. 144, no. 4, pp. 377–382, 1997. View at Google Scholar
  5. Y. Yun and M. Gen, “Performance analysis of adaptive genetic algorithms with fuzzy logic and heuristics,” Fuzzy Optimization and Decision Making, vol. 2, no. 2, pp. 161–175, 2003. View at Publisher · View at Google Scholar
  6. R. Subbu, A. C. Sanderson, and P. P. Bonissone, “Fuzzy logic controlled genetic algorithms versus tuned genetic algorithms: an agile manufacturing application,” in Proceedings of the IEEE International Symposium on Intelligent Control (ISIC '98), pp. 434–440, September 1998. View at Scopus
  7. Q. Li, X. Tong, S. Xie, and G. Liu, “An improved adaptive algorithm for controlling the probabilities of crossover and mutation based on a fuzzy control strategy,” in 6th International Conference on Hybrid Intelligent Systems and 4th Conference on Neuro-Computing and Evolving Intelligence (HIS-NCEI '06), December 2006. View at Publisher · View at Google Scholar · View at Scopus
  8. C. H. Wang, T. P. Hong, and S. S. Tseng, “Integrating membership functions and fuzzy rule sets from multiple knowledge sources,” Fuzzy Sets and Systems, vol. 112, no. 1, pp. 141–154, 2000. View at Google Scholar · View at Scopus
  9. K. Wang, “A new fuzzy genetic algorithm based on population diversity,” in Proceedings of the IEEE International Symposium on Computational Intelligence in Robotics and Automation, pp. 108–112, 2001.
  10. H. Liu, Z. Xu, and A. Abraham, “Hybrid fuzzy-genetic algorithm approach for crew grouping,” in 5th International Conference on Intelligent Systems Design and Applications (ISDA '05), pp. 332–337, September 2005. View at Publisher · View at Google Scholar · View at Scopus
  11. F. Herrera, E. Herrera-Viedma, M. Lozano, and J. L. Verdegay, “Fuzzy tools to improve genetic algorithms,” in Proceedings of the European Congress on Intelligent Techniques and soft Computing, pp. 1532–1539, 1994.
  12. F. Herrera and M. Lozano, “Adaptation of genetic algorithm parameters based on fuzzy logic controllers,” in Genetic Algorithms and Soft Computing, F. Herrera and J. L. Verdegay, Eds., pp. 95–125, Physica, 1996. View at Google Scholar
  13. F. Herrera and M. Lozano, “Fuzzy adaptive genetic algorithm: design, taxonomy, and future directions,” Soft Computing, vol. 7, no. 8, pp. 545–562, 2005. View at Google Scholar
  14. M. A. Lee and H. Takagi, “Dynamic control of genetic algorithms using fuzzy logic techniques,” in Proceedings of the 5th International Conference on Genetic Algorithms, pp. 76–83, 1993.
  15. S. M. Im and J. J. Lee, “Adaptive crossover, mutation and selection using fuzzy system for genetic algorithms,” Artificial Life and Robotics, vol. 13, no. 1, pp. 129–133, 2008. View at Publisher · View at Google Scholar · View at Scopus
  16. M. Jalali Varnamkhasti and L. S. Lee, “Fuzzy genetic algorithm with sexual selection,” in Proceedings of the 2nd International Conference and Workshops on Basic and Applied Sciences and Regional Annual Fundamental Science Seminar, pp. 38–43, 2009.
  17. S. A. Jafari, S. Mashohor, and M. J. Varnamkhasti, “Committee neural networks with fuzzy genetic algorithm,” Journal of Petroleum Science and Engineering, vol. 76, no. 3-4, pp. 217–223, 2011. View at Publisher · View at Google Scholar
  18. M. Srinivas and L. M. Patnaik, “Adaptive probabilities of crossover and mutation in genetic algorithms,” IEEE Transactions on Systems, Man and Cybernetics, vol. 24, no. 4, pp. 656–667, 1994. View at Publisher · View at Google Scholar · View at Scopus
  19. K. Q. Zhu and Z. Liu, “Empirical study of population diversity in permutation-based genetic algorithm,” in Proceedings of the 15th European Conference on Machine Learning (ECML '04), vol. 3103 of Lecture Notes in Computer Science, pp. 537–547, 2004.
  20. M. Jalali Varnamkhasti, L. S. Lee, M. R. Abu Bakar, and W. J. Leong, “A genetic algorithm with fuzzy crossover operator and probability,” Advances in Operations Research, vol. 2012, Article ID 956498, 16 pages, 2012. View at Publisher · View at Google Scholar
  21. C. Jassadapakorn and P. Chongstitvatana, “Diversity control to improve convergence rate in genetic algorithms,” in Proceedings of the 4th International Conference on Intelligent Data Engineering and Automated Learning (IDEAL '03), vol. 2690 of Lecture Notes in Computer Science, pp. 421–425, 2004.
  22. H. M. Voigt, J. Born, and I. Santibanez-Koref, “A multivalued evolutionary algorithm,” Tech. Rep. TR-93-022, International Computer Science Institute, Berkeley, Calif, USA, 1993. View at Google Scholar
  23. K. A. De Jong and W. M. Spears, “An analysis of the interacting roles of population size and crossover in genetic algorithms,” in Proceedings of the International Conference on Parallel Problem Solving from Nature, vol. 496 of Lecture Notes in Comput. Sci., pp. 38–47, 1991.
  24. K. A. De Jong and W. M. Spears, “A formal analysis of the role of multi-point crossover in genetic algorithms,” Annals of Mathematics and Artificial Intelligence, vol. 5, no. 1, pp. 1–26, 1992. View at Publisher · View at Google Scholar · View at Scopus
  25. G. Syswerda, “Uniform crossover in genetic algorithms,” in Proceedings of the 3rd International Conference on Genetic Algorithms, pp. 2–9, 1989.
  26. L. J. Eshelman, R. A. Caruana, and J. D. Schaffer, “Biases in the crossover landscape,” in Proceedings of the 3rd International Conference on Genetic Algorithms, pp. 10–19, 1989.
  27. S. Rajasekaran and G. A. Vijayalakshmi Pai, Neural Networks, Fuzzy Logic and Genetic Algorithms Synthesis and Application, PHL Learning Private Limited, New Dehli, India, 2008.
  28. J. J. Grefenstette, “Optimization of control parameters for genetic algorithms,” IEEE Transactions on Systems, Man and Cybernetics, vol. 16, no. 1, pp. 122–128, 1986. View at Google Scholar · View at Scopus
  29. K. A. De Jong, Analysis of the behavior of a class of genetic adaptive systems, Ph.D. thesis, Department of Computer and Communication Sciences, University of Michigan, 1975.
  30. K. A. De Jong, “Adaptive system design: a genetic approach,” IEEE Transactions on Systems, Man, and Cybernetics, vol. 10, no. 9, pp. 566–574, 1980. View at Publisher · View at Google Scholar
  31. D. E. Goldberg and K. Sastry, “A practical schema theorem for genetic algorithm design and tuning,” in Proceedings of the Genetic and Evolutionary Computation Conference, pp. 328–335, 2001.
  32. J. D. Schaffer, R. A. Caruana, L. J. Eshelman, and R. Das, “A study of control parameters affecting online performance of genetic algorithms for function optimization,” in Proceedings of the 3rd International Conference Genetic Algorithms, pp. 51–60, 1989.
  33. D. Pisinger, “An expanding-core algorithm for the exact 0-1 knapsack problem,” European Journal of Operational Research, vol. 87, no. 1, pp. 175–187, 1995. View at Google Scholar · View at Scopus
  34. L. Davis, “Adapting operator probabilities in genetic algorithms,” in Proceedings of the 3rd International Conference on Genetic Algorithms, pp. 91–69, 1989.
  35. C. Fernandes, R. Tavares, and A. Rosa, “niGAVaPS–outbreeding in genetic algorithms,” in Proceedings of the Symposium on Applied Computing (ACM '00), pp. 477–482, 2000.
  36. M. Annunziato and S. Pizzuti, “Adaptive parameterization of evolutionary algorithms driven by reproduction and competition,” in Proceedings of the European Symposium on Intelligent Techniques (ESIT '00), pp. 246–256, 2000.
  37. S. N. Sivanandam and S. N. Deepa, Introduction to Genetic Algorithms, Springer, Berlin, Germany, 2008.
  38. M. Jalali Varnamkhasti, “A genetic algorithm based on new mutation for solving 0/1 knapsack problem,” Far East Journal of Mathematical Science, vol. 64, no. 1, pp. 23–35, 2012. View at Google Scholar
  39. B. Gavish and H. Pirkul, “Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality,” Mathematical Programming, vol. 31, no. 1, pp. 78–105, 1985. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  40. S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations, Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, Chichester, UK, 1990.
  41. P. C. Chu and J. E. Beasley, “A Genetic Algorithm for the Multidimensional Knapsack Problem,” Journal of Heuristics, vol. 4, no. 1, pp. 63–86, 1998. View at Google Scholar · View at Scopus
  42. A. Freville and G. Plateau, “An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem,” Discrete Applied Mathematics, vol. 49, no. 1–3, pp. 189–212, 1994. View at Publisher · View at Google Scholar
  43. F. Djannaty and S. Doostdar, “A hybrid genetic algorithm for the multidimensional knapsack problem,” International Journal of Contemporary Mathematical Sciences, vol. 3, no. 9–12, pp. 443–456, 2008. View at Google Scholar · View at Zentralblatt MATH
  44. F. Qian and R. Ding, “Simulated annealing for the 0/1 multidimensional knapsack problem,” Numerical Mathematics, vol. 16, no. 4, pp. 320–327, 2007. View at Google Scholar · View at Zentralblatt MATH
  45. M. J. Magazine and O. Oguz, “A heuristic algorithm for the multidimensional zero-one knapsack problem,” European Journal of Operational Research, vol. 16, no. 3, pp. 319–326, 1984. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  46. A. Volgenant and J. A. Zoon, “Improved heuristic for multidimensional 0-1 knapsack problems,” Journal of the Operational Research Society, vol. 41, no. 10, pp. 963–970, 1990. View at Google Scholar · View at Scopus
  47. H. Pirkul, “A heuristic solution procedure for the multiconstrained zero-one knapsack problem,” Naval Research Logistics, vol. 34, no. 2, pp. 161–172, 1987. View at Google Scholar · View at Scopus
  48. J. E. Beasley, “OR-Library: distributing test problems by electronic mail,” Journal of the Operational Research Society, vol. 41, no. 11, pp. 1069–1072, 1990. View at Google Scholar