IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v192y2009i3p767-781.html
   My bibliography  Save this article

An agent-based approach to the two-dimensional guillotine bin packing problem

Author

Listed:
  • Polyakovsky, Sergey
  • M'Hallah, Rym

Abstract

The two-dimensional guillotine bin packing problem consists of packing, without overlap, small rectangular items into the smallest number of large rectangular bins where items are obtained via guillotine cuts. This problem is solved using a new guillotine bottom left (GBL) constructive heuristic and its agent-based (A-B) implementation. GBL, which is sequential, successively packs items into a bin and creates a new bin every time it can no longer fit any unpacked item into the current one. A-B, which is pseudo-parallel, uses the simplest system of artificial life. This system consists of active agents dynamically interacting in real time to jointly fill the bins while each agent is driven by its own parameters, decision process, and fitness assessment. A-B is particularly fast and yields near-optimal solutions. Its modularity makes it easily adaptable to knapsack related problems.

Suggested Citation

  • Polyakovsky, Sergey & M'Hallah, Rym, 2009. "An agent-based approach to the two-dimensional guillotine bin packing problem," European Journal of Operational Research, Elsevier, vol. 192(3), pages 767-781, February.
  • Handle: RePEc:eee:ejores:v:192:y:2009:i:3:p:767-781
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(07)01024-7
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. repec:spr:compst:v:60:y:2004:i:2:p:311-329 is not listed on IDEAS
    2. Dowsland, Kathryn A., 1993. "Some experiments with simulated annealing techniques for packing problems," European Journal of Operational Research, Elsevier, vol. 68(3), pages 389-399, August.
    3. Lodi, Andrea & Martello, Silvano & Monaci, Michele, 2002. "Two-dimensional packing problems: A survey," European Journal of Operational Research, Elsevier, vol. 141(2), pages 241-252, September.
    4. Wascher, Gerhard & Hau[ss]ner, Heike & Schumann, Holger, 2007. "An improved typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1109-1130, December.
    5. Sergei Parinov, 1999. "Toward a Theory and Agent-Based Model of the Networked Economy," Russian Working Paper Archive for Economists and Sociologists 827080, The Institute of Economics and Industrial Engineering of SD of RAS.
    6. Beasley, J. E., 2004. "A population heuristic for constrained two-dimensional non-guillotine cutting," European Journal of Operational Research, Elsevier, vol. 156(3), pages 601-627, August.
    7. Hopper, E. & Turton, B. C. H., 2001. "An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem," European Journal of Operational Research, Elsevier, vol. 128(1), pages 34-57, January.
    8. Sándor P. Fekete & Jörg Schepers, 2004. "A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 60(2), pages 311-329, October.
    9. Lodi, Andrea & Martello, Silvano & Vigo, Daniele, 1999. "Approximation algorithms for the oriented two-dimensional bin packing problem," European Journal of Operational Research, Elsevier, vol. 112(1), pages 158-166, January.
    10. Mes, Martijn & van der Heijden, Matthieu & van Harten, Aart, 2007. "Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems," European Journal of Operational Research, Elsevier, vol. 181(1), pages 59-75, August.
    11. Silvano Martello & Daniele Vigo, 1998. "Exact Solution of the Two-Dimensional Finite Bin Packing Problem," Management Science, INFORMS, vol. 44(3), pages 388-399, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Dutta, Kaushik & VanderMeer, Debra, 2011. "Cost-based decision-making in middleware virtualization environments," European Journal of Operational Research, Elsevier, vol. 210(2), pages 344-357, April.
    2. Han, Wei & Bennell, Julia A. & Zhao, Xiaozhou & Song, Xiang, 2013. "Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints," European Journal of Operational Research, Elsevier, vol. 230(3), pages 495-504.
    3. Martinez-Sykora, Antonio & Alvarez-Valdes, Ramon & Bennell, Julia & Tamarit, Jose Manuel, 2015. "Constructive procedures to solve 2-dimensional bin packing problems with irregular pieces and guillotine cuts," Omega, Elsevier, vol. 52(C), pages 15-32.
    4. Nikolaus Furian & Siegfried Vössner, 2013. "Constrained order packing: comparison of heuristic approaches for a new bin packing problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 21(1), pages 237-264, January.
    5. Gašper Žerovnik & Janez Žerovnik, 2011. "Constructive heuristics for the canister filling problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 19(3), pages 371-389, September.
    6. Cui, Yi-Ping & Cui, Yaodong & Tang, Tianbing, 2015. "Sequential heuristic for the two-dimensional bin-packing problem," European Journal of Operational Research, Elsevier, vol. 240(1), pages 43-53.
    7. Wang, Xiaoping & Zhao, Yunliang & Sun, Peng & Wang, Xiaobin, 2013. "An analysis on convergence of data-driven approach to ship lock scheduling," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 88(C), pages 31-38.
    8. Hong, Shaohui & Zhang, Defu & Lau, Hoong Chuin & Zeng, XiangXiang & Si, Yain-Whar, 2014. "A hybrid heuristic algorithm for the 2D variable-sized bin packing problem," European Journal of Operational Research, Elsevier, vol. 238(1), pages 95-103.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:192:y:2009:i:3:p:767-781. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/locate/eor .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.