Skip to main content

Evolving Bin Packing Heuristic Using Micro-Differential Evolution with Indirect Representation

  • Chapter
Recent Advances on Hybrid Intelligent Systems

Abstract

The development of low-level heuristics for solving instances of a problem is related to the knowledge of an expert. He needs to analyze several components from the problem instance and to think out an specialized heuristic for solving the instance. However if any inherent component to the instance gets changes, then the designed heuristic may not work as it used to do it. In this paper it is presented a novel approach to generated low-level heuristics; the proposed approach implements micro-Differential Evolution for evolving an indirect representation of the Bin Packing Problem. It was used the Hard28 instance, which is a well-known and referenced Bin Packing Problem instance. The heuristics obtained by the proposed approach were compared against the well know First-Fit heuristic, the results of packing that were gotten for each heuristic were analized by the statistic non-parametric test known as Wilcoxon Signed Rank test.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Belov, G., Scheithauer, G.: A Cutting Plane Algorithm for the One-Dimensional Cutting Stock Problem with Multiple Stock Lengths. European Journal of Operational Research 141, 274–294 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  2. Burke, E.K., Hart, E., Kendall, G., Newall, J., Ross, P., Schulenbur, S.: Hyperheuristics: An emerging direction in modern search technology. In: Glover, F., Kochenberger, G. (eds.) Handbook of Meta-Heuristics, pp. 457–474. Kluwer (2003)

    Google Scholar 

  3. Burke, E.K., Hyde, M.R., Kendall, G.: Evolving Bin Packing Heuristics with Genetic Programming. In: Runarsson, T.P., Beyer, H.-G., Burke, E.K., Merelo-Guervós, J.J., Whitley, L.D., Yao, X. (eds.) PPSN 2006. LNCS, vol. 4193, pp. 860–869. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  4. Burke, E.K., Kendall, G.: Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques. Springer (2006)

    Google Scholar 

  5. Coffman Jr., E.G., Johnson, D.S., Mcgeoch, L.A., Weber, R.R.: Bin Packing with Discrete Item Sizes Part II: Average-Case Behavior of FFD and BFD 13, 384–402 (1997) (in preparation)

    Google Scholar 

  6. Falkenauer, E., Delchambre, A.: A genetic algorithm for bin packing and line balancing. In: Proceedings of IEEE International Conference on Robotics and Automation, vol. 2, pp. 1186–1192 (1992)

    Google Scholar 

  7. Garey, M.R., Johnson, D.S.: “ Strong ” NP-Completeness Results: Motivation, Examples, and Implications. J. ACM 25, 499–508 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  8. Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press (1975)

    Google Scholar 

  9. Luke, S.: Essentials of Metaheuristics. Lulu (2009)

    Google Scholar 

  10. Martello, S., Toth, P.: Knapsack Problems, Algorithms and and Computer Implementations. John Wiley & Sons Ltd., New York (1990)

    MATH  Google Scholar 

  11. Parsopoulos, K.E.: Cooperative micro-differential evolution for high-dimensional problems. In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation in GECCO 2009, pp. 531–538. ACM, New York (2009)

    Chapter  Google Scholar 

  12. Ryan, C., Collins, J.J., Neill, M.O.: Grammatical Evolution: Evolving Programs for an Arbitrary Language. In: Banzhaf, W., Poli, R., Schoenauer, M., Fogarty, T.C. (eds.) EuroGP 1998. LNCS, vol. 1391, pp. 83–95. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  13. Schoenfield, J.E.: Fast, exact solution of open bin packing problems without linear programming. PhD thesis. US Army Space and Missile Defense Command, Huntsville, Alabama, USA (2002)

    Google Scholar 

  14. Soubeiga, E.: Development and application of hyperheuristics to personnel scheduling. PhD thesis, University of Nottingham (2003)

    Google Scholar 

  15. Storn, R., Price, K.: Differential Evolution - A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces. J. of Global Optimization 11, 341–359 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  16. Yang, X.S.: Nature Inspired Metaheuristic Algorithms, 2nd edn. Luniver Press (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Marco Aurelio Sotelo-Figueroa .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Sotelo-Figueroa, M.A., Soberanes, H.J.P., Carpio, J.M., Fraire Huacuja, H.J., Reyes, L.C., Soria Alcaraz, J.A. (2013). Evolving Bin Packing Heuristic Using Micro-Differential Evolution with Indirect Representation. In: Castillo, O., Melin, P., Kacprzyk, J. (eds) Recent Advances on Hybrid Intelligent Systems. Studies in Computational Intelligence, vol 451. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33021-6_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33021-6_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33020-9

  • Online ISBN: 978-3-642-33021-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics