Skip to main content
SpringerLink
Log in
Book cover

International Conference on Information, Communication and Computing Technology

ICICCT 2017: Information, Communication and Computing Technology pp 296–304Cite as

A Hybridized Evolutionary Algorithm for Bi-objective Bi-dimensional Bin-packing Problem

  • Conference paper
  • First Online:

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 750))

Abstract

The bin-packing problem is a widely studied combinatorial optimization problem. In classical bin-packing problem, we are given a set of real numbers in the range (0,1] and the goal is to place them in minimum number of bins so that no bin holds more than one. In this paper we consider a bi-dimensional bin-packing in which we are given a set of rectangular items to be packed into minimum number of fixed size of square bins. Here we consider two objectives applied on a bi-dimensional variant, one is related to minimize number of bins and second is minimize average percentage of wastage/gaps in bins. To solve this problem we incorporate the concept of Pareto’s optimality to evolve set of solutions using evolutionary algorithm (EA) tool hybridized with the heuristic operator leading to improve results from existing techniques.

This is a preview of subscription content, 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 EPUB and 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

Learn about institutional subscriptions

References

  1. Anily, S., Bramel, J., Simchi-Levi, D.: Worst-case analysis of heuristics for the bin-packing problem with general cost structures. Oper. Res. 42(2), 287–298 (1994)

    Article  MATH  Google Scholar 

  2. Baker, B.S., Coffman Jr., E.G., Rivest, R.L.: Orthogonal packings in two dimensions. SIAM J. Comput. 9(4), 846–855 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bortfeldt, A.: A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces. Eur. J. Oper. Res. 172(3), 814–837 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chandra, A.K., Hirschberg, D.S., Wong, C.K.: Bin-packing with geometric constraints in computer network design. Oper. Res. 26(5), 760–772 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  5. Chang, Y.-C., et al.: B*-Trees: a new representation for non-slicing floorplans. In: Proceedings of the 37th Annual Design Automation Conference. ACM, New York (2000)

    Google Scholar 

  6. Dowsland, K.A.: Some experiments with simulated annealing techniques for packing problems. Eur. J. Oper. Res. 68(3), 389–399 (1993)

    Article  MATH  Google Scholar 

  7. Garey, M.R., Graham, R.L., Ullman, J.D.: Worst-case analysis of memory allocation algorithms. In: Proceedings of the Fourth Annual ACM Symposium on Theory of Computing. ACM, New York (1972)

    Google Scholar 

  8. Imahori, S., Yagiura, M., Ibaraki, T.: Local search algorithms for the rectangle packing problem with general spatial costs. Math. Program. 97(3), 543–569 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  9. Imahori, S., Yagiura, M., Ibaraki, T.: Improved local search algorithms for the rectangle packing problem with general spatial costs. Eur. J. Oper. Res. 167(1), 48–67 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  10. Jakobs, S.: On genetic algorithms for the packing of polygons. Eur. J. Oper. Res. 88(1), 165–181 (1996)

    Article  MATH  Google Scholar 

  11. Lesh, N., et al.: New heuristic and interactive approaches to 2D rectangular strip packing. J. Exp. Algorithmics 10, 1–2 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  12. Mongeau, M., Bes, C.: Optimization of aircraft container loading. IEEE Trans. Aerosp. Electron. Syst. 39(1), 140–150 (2003)

    Article  Google Scholar 

  13. Murata, H., et al.: VLSI module placement based on rectangle-packing by the sequence-pair. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 15(12), 1518–1524 (1996)

    Article  Google Scholar 

  14. Minorikawa, H., Sawa, S.S.: Current status and future trends of electronic packaging in automotive applications. In: Proceedings of the International Congress on Transportation Electronics, 1990. Vehicle Electronics in the 90’s. IEEE (1990)

    Google Scholar 

  15. Ullman, J.D.: The Performance of a Memory Allocation Algorithm. Computer Science Laboratory, Department of Electrical Engineering, Princeton University, Princeton (1971)

    Google Scholar 

  16. Van De Vel, H., Shijie, S.: An application of the bin-packing technique to job scheduling on uniform processors. J. Oper. Res. Soc. 42, 169–172 (1991)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer and Systems Sciences, Jawaharlal Nehru University, New Delhi, 110067, India

    Neeraj Pathak & Rajeev Kumar

Authors
  1. Neeraj Pathak
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rajeev Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Neeraj Pathak .

Editor information

Editors and Affiliations

  1. Indian Institute of Technology Delhi, New Delhi, India

    Saroj Kaushik

  2. Delhi Technological University, Delhi, India

    Daya Gupta

  3. Jagan Institute of Management Studies, Delhi, India

    Latika Kharb

  4. Jagan Institute of Management Studies, Delhi, India

    Deepak Chahal

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Nature Singapore Pte Ltd.

About this paper

Cite this paper

Pathak, N., Kumar, R. (2017). A Hybridized Evolutionary Algorithm for Bi-objective Bi-dimensional Bin-packing Problem. In: Kaushik, S., Gupta, D., Kharb, L., Chahal, D. (eds) Information, Communication and Computing Technology. ICICCT 2017. Communications in Computer and Information Science, vol 750. Springer, Singapore. https://doi.org/10.1007/978-981-10-6544-6_27

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-6544-6_27

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-6543-9

  • Online ISBN: 978-981-10-6544-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation