Skip to main content
SpringerLink
Log in

Packing Bins Using Multi-chromosomal Genetic Representation and Better-Fit Heuristic

  • Conference paper
Neural Information Processing (ICONIP 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3316))

Included in the following conference series:

Abstract

We propose a multi-chromosome genetic coding and set-based genetic operators for solving bin packing problem using genetic algorithm. A heuristic called better-fit is proposed, in which a left-out object replaces an existing object from a bin if it can fill the bin better. Performance of the genetic algorithm augmented with the better-fit heuristic has been compared with that of hybrid grouping genetic algorithm (HGGA). Our method has provided optimal solutions at highly reduced computational time for the benchmark uniform problem instances used. The better-fit heuristic is more effective compared to the best-fit heuristic when combined with the coding.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Beasley, J.E.: OR-Library: Distributing test problems by electronic mail. Journal of Operational Research Society 41(11), 1069–1072 (1990)

    Google Scholar 

  2. Coffman Jr, E.G., Galambos, G., Martello, S., Vigo, D.: Bin packing approximation algorithms: combinatorial analysis. In: Du, D.-Z., Pardalos, P. (eds.) Handbook of Combinatorial Optimization. Kluwer Academic Publishers, Dordrecht (1998)

    Google Scholar 

  3. Eiben, A.E., Hinterding, R., Michalewicz, Z.: Parameter control in evolutionary algorithms. IEEE Transactions on Evolutionary Computation 3(2), 124–141 (1999)

    Article  Google Scholar 

  4. Falkenauer, E.: A hybrid genetic algorithm for bin packing. Journal of Heuristics 2(1), 5–30 (1996)

    Article  Google Scholar 

  5. Falkenauer, E.: Genetic Algorithms and Grouping Problems. John Wiley & Sons, Chichester (1998)

    Google Scholar 

  6. Falkenauer, E., Delchambre, A.: A genetic algorithm for bin packing and line balancing. In: Proc. IEEE Int. Conf. on Robotics and Automation, France, pp. 1186–1192 (1992)

    Google Scholar 

  7. Fekete, S.P., Schepers, J.: New classes of fast lower bounds for bin packing problem. Mathematical Programming Series A 91(1), 11–31 (2001)

    MATH  MathSciNet  Google Scholar 

  8. Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, Reading (1989)

    MATH  Google Scholar 

  9. Martello, S., Toth, P.: Lower bounds and reduction procedures for the bin packing problem. Discrete Applied Mathematics 28, 59–70 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  10. Reeves, C.: Hybrid genetic algorithms for bin-packing and related problems. Annals of Operations Research 63, 371–396 (1996)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Banaras Hindu University, Varanasi, 221005, India

    A. K. Bhatia & S. K. Basu

Authors
  1. A. K. Bhatia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. K. Basu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Indian Statistical Institute, Electronics and Communication Sciences Unit, Kolkata, India

    Nikhil Ranjan Pal

  2. School of Computer and Information Sciences, Knowledge Engineering and Discovery Research Institute (KEDRI), Auckland University of Technology, Private Bag 92006, Auckland, New Zealand

    Nik Kasabov

  3. Department of Instrumentation and Electronics Engineering, Jadavpur University, Salt-lake Campus, 700098, Calcutta, India

    Rajani K. Mudi

  4. Indian Statistical Institute, 203 B. T. Road, 700 108, Calcutta,  

    Srimanta Pal

  5. Indian Statistical Institute, Computer Vision and Pattern Recognition Unit, 700108, Kolkata, India

    Swapan Kumar Parui

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bhatia, A.K., Basu, S.K. (2004). Packing Bins Using Multi-chromosomal Genetic Representation and Better-Fit Heuristic. In: Pal, N.R., Kasabov, N., Mudi, R.K., Pal, S., Parui, S.K. (eds) Neural Information Processing. ICONIP 2004. Lecture Notes in Computer Science, vol 3316. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30499-9_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30499-9_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23931-4

  • Online ISBN: 978-3-540-30499-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation