Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014, Article ID 545191, 12 pages
http://dx.doi.org/10.1155/2014/545191
Research Article

Improving the Bin Packing Heuristic through Grammatical Evolution Based on Swarm Intelligence

1División de Estudios de Posgrado e Investigación, Instituto Tecnológico de León, León 37290, GTO, Mexico
2División de Estudios de Posgrado e Investigación, Instituto Tecnológico de Ciudad Madero, Ciudad Madero 89440, TAMPS, Mexico

Received 11 April 2014; Revised 22 June 2014; Accepted 23 June 2014; Published 24 July 2014

Academic Editor: Ker-Wei Yu

Copyright © 2014 Marco Aurelio Sotelo-Figueroa et al. 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, New York, NY, USA, 1979. View at MathSciNet
  2. E. A. Feigenbaum and J. Feldman, Computers and Thought, AAAI Press, 1963.
  3. M. H. J. Romanycia and F. J. Pelletier, “What is a heuristic?” Computa tional Intelligence, vol. 1, no. 1, pp. 47–58, 1985. View at Google Scholar
  4. F. Glover, “Future paths for integer programming and links to artificial intelligence,” Computers & Operations Research, vol. 13, no. 5, pp. 533–549, 1986. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. J. R. Koza, “Hierarchical genetic algorithms operating on populations of computer programs,” in Proceedings of the 11th International Joint Conference on Artificial Intelligence, pp. 768–774, San Mateo, Calif, USA, 1989.
  6. E. K. Burke, M. Hyde, and G. Kendall, “Evolving bin packing heuristics with genetic programming,” in Parallel Problem Solving from Nature-PPSN IX, T. Runarsson, H.-G. Beyer, J. Merelo-Guervós, L. Whitley, and X. Yao, Eds., vol. 4193 of Lecture Notes in Comput er Science, pp. 860–869, Springer, Berlin, Germany, 2006. View at Google Scholar
  7. C. Ryan, J. Collins, and M. O'Neill, “Grammatical evolution: evolving programs for an arbitrary language,” in Proceedings of the 1st European Workshop on Genetic Programming, vol. 1391 of Lecture Notes in Com puter Science, pp. 83–95, Springer, 1998.
  8. M. O'Neill and A. Brabazon, “Grammatical differential evolution,” in Proceedings of the International Conference on Artificial Intelligence (ICAI '06), CSEA Press, Las Vegas, Nev, USA, 2006.
  9. M. O'Neill and A. Brabazon, “Grammatical swarm: the generation of programs by social programming,” Natural Computing, vol. 5, no. 4, pp. 443–462, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. J. Togelius, R. de Nardi, and A. Moraglio, “Geometric PSO + GP = particle swarm programming,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '08), pp. 3594–3600, Hong Kong, June 2008. View at Publisher · View at Google Scholar · View at Scopus
  11. A. Moraglio and S. Silva, “Geometric di ff ere ntial evolution on the space of genetic programs,” in Genetic Programming, A. Esparcia-Alcazar, A. Ekart, S. Silva, S. Dignum, and A. Uyar, Eds., vol. 6021 of Lecture Notes in Computer Science, pp. 171–183, Springer, Berlin, Germany, 2010. View at Google Scholar
  12. A. Lodi, S. Martello, and D. Vigo, “Recent advances on two-dimensional bin packing problems,” Discrete Applied Mathematics, vol. 123, no. 1–3, pp. 379–396, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. H. van de Vel and S. Shijie, “Application of the bin-packing technique to job scheduling on uniform processors,” The Journal of the Operational Research Society, vol. 42, no. 2, pp. 169–172, 1991. View at Publisher · View at Google Scholar · View at Scopus
  14. B. T. Han, G. Diehr, and J. S. Cook, “Multiple-type, two-dimensional bin packing problems: applications and algorithms,” Annals of Operations Research, vol. 50, no. 1, pp. 239–261, 1994. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. D. S. Johnson, A. Demers, J. D. Ullman, M. R. Garey, and R. L. Graham, “Worst-case performance bounds for simple one-dimensional packing algorithms,” SIAM Journal on Computing, vol. 3, pp. 299–325, 1974. View at Publisher · View at Google Scholar · View at MathSciNet
  16. A. C. C. Yao, “New algorithms for bin packing,” Journal of the Association for Computing Machinery, vol. 27, no. 2, pp. 207–227, 1980. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  17. W. T. Rhee and M. Talagrand, “On-line bin packing with items of random size,” Mathematics of Operations Research, vol. 18, no. 2, pp. 438–445, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  18. E. Coffman Jr., G. Galambos, S. Martello, and D. Vigo, Bin Packing Approximation Algorithms: Combinatorial Analysis, Kluwer Academic Publishers, 1998.
  19. K. Fleszar and K. S. Hindi, “New heuristics for one-dimensional bin-packing,” Computers and Operations Research, vol. 29, no. 7, pp. 821–839, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  20. T. Kämpke, “Simulated annealing: use of a new tool in bin packing,” Annals of Operations Research, vol. 16, no. 1, pp. 327–332, 1988. View at Publisher · View at Google Scholar · View at Scopus
  21. E. Falkenauer, “A hybrid grouping genetic algorithm for bin packing,” Journal of Heuristics, vol. 2, pp. 5–30, 1996. View at Google Scholar
  22. A. Ponee-Pérez, A. Pérez-Garcia, and V. Ayala-Ramirez, “Bin-packing using genetic algorithms,” in Proceedings of the 15th International Conference on Electronics, Communications and Computers (CONIELECOMP '05), pp. 311–314, IEEE Computer Society, Los Alamitos, Calif, USA, March 2005. View at Publisher · View at Google Scholar · View at Scopus
  23. A. Scholl, R. Klein, and C. Jürgens, “Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem,” Computers and Operations Research, vol. 24, no. 7, pp. 627–645, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  24. J. M. V. de Carvalho, “Exact solution of bin-packing problems using column generation and branch-and-bound,” Annals of Operations Research, vol. 86, pp. 629–659, 1999. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  25. J. Puchinger and G. Raidl, “Combining metaheuristics and exact algorithms in combinatorial optimization: a survey and classification,” in Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach, J. Mira and J. Alvarez, Eds., vol. 3562 of Lecture Notes in Computer Science, pp. 41–53, Springer, Berlin, Germany, 2005. View at Google Scholar
  26. J. Derrac, S. García, D. Molina, and F. Herrera, “A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms,” Swarm and Evolutionary Computation, vol. 1, no. 1, pp. 3–18, 2011. View at Publisher · View at Google Scholar · View at Scopus
  27. J. R. Koza and R. Poli, “Genetic programming,” in Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, E. K. Burke and and G. Kendall, Eds., pp. 127–164, Kluwer, Boston, Mass, USA, 2005. View at Google Scholar
  28. I. Dempsey, M. O'Neill, and A. Brabazon, “Foundations in grammatical,” in Foundations in Grammatical Evolution for Dynamic Environments, vol. 194, Springer, New York, NY, USA, 2009. View at Google Scholar
  29. H. lan Fang, P. Ross, and D. Corne, “A promising genetic algorithm approach to job -shop scheduling, rescheduling, and open-shop scheduling problems,” in Proceedings of the 5th International Conference on Genetic Algorithms, pp. 375–382, Morgan Kaufmann, Burlington, Mass, USA, 1993.
  30. J. H. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, 1975. View at MathSciNet
  31. J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proceedings of the IEEE International Conference on Neural Networks, pp. 1942–1948, December 1995. View at Scopus
  32. C. Maurice, Particle Swarm Optimization, Wiley, Estados Unidos, USA, 2006. View at Publisher · View at Google Scholar · View at MathSciNet
  33. R. Poli, J. Kennedy, and T. Blackwell, “Particle swarm optimization,” Swarm Intelligence, vol. 1, no. 1, pp. 33–57, 2007. View at Google Scholar
  34. M. F. Tasgetiren, P. N. Suganthan, and Q. Pan, “A discrete particle swarm optimization algorithm for the generalized traveling salesman problem,” in Proceedings of the 9th Annual Genetic and Evolutionary Computation Conference (GECCO '07), pp. 158–167, New York, NY, USA, July 2007. View at Publisher · View at Google Scholar · View at Scopus
  35. T. Gong and A. L. Tuson, “Binary particle swarm optimization: a forma analysis approach,” in Proceedings of the 9th annual conference on Genetic and evolutionary computation (GECCO '07), p. 172, ACM, New York, NY, USA, July 2007. View at Publisher · View at Google Scholar · View at Scopus
  36. A. E. M. Zavala, A. H. Aguirre, and E. R. Villa Diharce, “Constrained optimization via Particle Evolutionary Swarm Optimization algorithm (PESO),” in Proceedings of the Conference on Genetic and Evolutionary Computation (GECCO '05), pp. 209–216, New York, NY, USA, June 2005. View at Scopus
  37. A. E. M. Zavala, A. H. Aguirre, and E. R. Villa Diharce, “Particle evolutionary swarm optimization algorithm (PESO),” in Proceedings of the 6th Mexican International Conference on Computer Science (ENC '05), pp. 282–289, Puebla, Mexico, September 2005. View at Publisher · View at Google Scholar · View at Scopus
  38. A. E. Muñoz-Zavala, A. Hernández-Aguirre, E. R. Villa-Diharce, and S. Botello-Rionda, “PESO+ for constrained optimization,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '06), pp. 231–238, July 2006. View at Scopus
  39. G. T. Pulido and C. A. C. Coello, “A constraint-handling mechanism for particle swarm optimization,” in Proceedings of the Congress on Evolutionary Computation (CEC '04), vol. 2, pp. 1396–1403, Portland, Ore, USA, June 2004. View at Publisher · View at Google Scholar · View at Scopus
  40. S. Martello and P. Toth, Knapsack Problems. Algorithms and Computer Implementations, John Wiley & Sons, New York, NY, USA, 1990. View at MathSciNet
  41. E. G. Coffman Jr., C. Courcoubetis, M. R. Garey, P. W. Shor, and R. R. Weber, “Bin packing with discrete item sizes. I. Perfect packing theorems and the average case behavior of optimal packings,” SIAM Journal on Discrete Mathematics, vol. 13, no. 3, pp. 384–402, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  42. T. G. Crainic, G. Perboli, M. Pezzuto, and R. Tadei, “New bin packing fast lower bounds,” Computers and Operations Research, vol. 34, no. 11, pp. 3439–3457, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  43. J. Coffman, G. Galambos, S. Martello, and D. Vigo, “Bin packing approximation algorithms: combinatorial analysis,” in Handbook of Combinatorial Optimization, pp. 151–207, Kluwer Academic, 1999. View at Google Scholar · View at MathSciNet
  44. S. P. Fekete and J. Schepers, “New classes of fast lower bounds for bin packing problems,” Mathematical Programming, vol. 91, no. 1, pp. 11–31, 2001. View at Google Scholar · View at MathSciNet · View at Scopus
  45. S. S. Seiden, R. van Stee, and L. Epstein, “New bounds for variable-sized online bin packing,” SIAM Journal on Computing, vol. 32, no. 2, pp. 455–469, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  46. E. G. Coffman Jr. and J. Csirik, “A classification scheme for bin packing theory,” Acta Cybernetica, vol. 18, no. 1, pp. 47–60, 2007. View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  47. E. Falkenauer and A. Delchambre, “A genetic algorithm for bin packing and line balancing,” in Proceedings of the IEEE International Conference on Robotics and Automation, vol. 2, pp. 1186–1192, May 1992. View at Scopus
  48. A. Lodi, S. Martello, and D. Vigo, “Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems,” INFORMS Journal on Computing, vol. 11, no. 4, pp. 345–357, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  49. E. Hopper and B. C. H. Turton, “A review of the application of meta-heuristic algorithms to 2D strip packing problems,” Artificial Intelligence Review, vol. 16, no. 4, pp. 257–300, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  50. 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 Publisher · View at Google Scholar · View at Scopus
  51. A. C. F. Alvim, C. C. Ribeiro, F. Glover, and D. J. Aloise, “A hybrid improvement heuristic for the one-dimensional bin packing problem,” Journal of Heuristics, vol. 10, no. 2, pp. 205–229, 2004. View at Publisher · View at Google Scholar · View at Scopus
  52. C. D. T. Suárez, E. P. Gonzlez, and M. V. Rendón, “A heuristic algorithm for the offline one-dimensional bin packing problem inspired by the point Jacobi matrix iterative method,” in Proceedings of the 5th Mexican International Conference on Artificial Intelligence (MICAI '06), pp. 281–286, Mexico City, Mexico, November 2006. View at Publisher · View at Google Scholar · View at Scopus
  53. S. Tam, H. Tam, L. Tam, and T. Zhang, “A new optimization method, the algorithm of changes, for Bin Packing Problem,” in Proceedings of the IEEE 5th International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA '10), pp. 994–999, September 2010. View at Publisher · View at Google Scholar · View at Scopus
  54. M. Hyde, A genetic programming hyper-heuristic approach to automated packing [Ph.D. thesis], University of Nottingham, 2010.
  55. M. A. Sotelo-Figueroa, H. J. Puga Soberanes, J. Martin Carpio et al., “Evolving bin packing heuristic using micro-differential evolution with indirect representation,” in Recent Advances on Hybrid Intelligent Systems, vol. 451 of Studies in Computational Intelligence, pp. 349–359, Springer, Berlin, Germany, 2013. View at Publisher · View at Google Scholar
  56. M. Sotelo-Figueroa, H. Puga Soberanes, J. Martin Carpio, H. Fraire Huacuja, L. Cruz Reyes, and J. Soria-Alcaraz, “Evolving and reusing bin packing heuristic through grammatical differential evolution,” in Proceedings of the World Congress on Nature and Biologically Inspired Computing (NaBIC '13), pp. 92–98, Fargo, ND, USA, August 2013. View at Publisher · View at Google Scholar
  57. E. K. Burke and G. Kendall, Search Method ologies: Introductory Tutorials in Optimization and Decision Support Techniques, Springer, New York, NY, USA, 2006.
  58. A. Rodriguez-Cristerna, J. Torres-Jimenez, I. Rivera-Islas, C. Hernandez-Morales, H. Romero-Monsivais, and A. Jose-Garcia, “A mutation-selection algorithm for the problem of minimum brauer chains,” in Advances in Soft Computing, I. Batyrshin and G. Sidorov, Eds., vol. 7095 of Lecture Notes in Computer Science, pp. 107–118, Springer, Berlin, Germany, 2011. View at Google Scholar
  59. R. N. Kacker, D. Richard Kuhn, Y. Lei, and J. F. Lawrence, “Combinatorial testing for software: an adaptation of design of experiments,” Measurement, vol. 46, no. 9, pp. 3745–3752, 2013. View at Publisher · View at Google Scholar · View at Scopus
  60. D. J. Sheskin, Handbook of Parametric and Nonparametric Statistical Procedures, Chapman & Hall/CRC, Boca Raton, Fla, USA, 2nd edition, 2000. View at MathSciNet