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

On solving multiobjective bin packing problems using evolutionary particle swarm optimization

Author

Listed:
  • Liu, D.S.
  • Tan, K.C.
  • Huang, S.Y.
  • Goh, C.K.
  • Ho, W.K.

Abstract

The bin packing problem is widely found in applications such as loading of tractor trailer trucks, cargo airplanes and ships, where a balanced load provides better fuel efficiency and safer ride. In these applications, there are often conflicting criteria to be satisfied, i.e., to minimize the bins used and to balance the load of each bin, subject to a number of practical constraints. Unlike existing studies that only consider the issue of minimum bins, a multiobjective two-dimensional mathematical model for bin packing problems with multiple constraints (MOBPP-2D) is formulated in this paper. To solve MOBPP-2D problems, a multiobjective evolutionary particle swarm optimization algorithm (MOEPSO) is proposed. Without the need of combining both objectives into a composite scalar weighting function, MOEPSO incorporates the concept of Pareto's optimality to evolve a family of solutions along the trade-off surface. Extensive numerical investigations are performed on various test instances, and their performances are compared both quantitatively and statistically with other optimization methods to illustrate the effectiveness and efficiency of MOEPSO in solving multiobjective bin packing problems.

Suggested Citation

  • Liu, D.S. & Tan, K.C. & Huang, S.Y. & Goh, C.K. & Ho, W.K., 2008. "On solving multiobjective bin packing problems using evolutionary particle swarm optimization," European Journal of Operational Research, Elsevier, vol. 190(2), pages 357-382, October.
    • Handle: RePEc:eee:ejores:v:190:y:2008:i:2:p:357-382
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(07)00567-X
    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. Scholl, Armin & Klein, Robert & Jürgens, Christian, 1996. "BISON : a fast hybrid procedure for exactly solving the one-dimensional bin packing problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 49135, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    2. Lodi, Andrea & Martello, Silvano & Vigo, Daniele, 2002. "Heuristic algorithms for the three-dimensional bin packing problem," European Journal of Operational Research, Elsevier, vol. 141(2), pages 410-420, September.
    3. A. K. Chandra & D. S. Hirschberg & C. K. Wong, 1978. "Bin Packing with Geometric Constraints in Computer Network Design," Operations Research, INFORMS, vol. 26(5), pages 760-772, October.
    4. 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.
    5. Jakobs, Stefan, 1996. "On genetic algorithms for the packing of polygons," European Journal of Operational Research, Elsevier, vol. 88(1), pages 165-181, January.
    6. Shoshana Anily & Julien Bramel & David Simchi-Levi, 1994. "Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures," Operations Research, INFORMS, vol. 42(2), pages 287-298, April.
    7. Liu, Dequan & Teng, Hongfei, 1999. "An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles," European Journal of Operational Research, Elsevier, vol. 112(2), pages 413-420, January.
    8. Edmund Burke & Robert Hellier & Graham Kendall & Glenn Whitwell, 2006. "A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem," Operations Research, INFORMS, vol. 54(3), pages 587-601, June.
    9. Silvano Martello & David Pisinger & Daniele Vigo, 2000. "The Three-Dimensional Bin Packing Problem," Operations Research, INFORMS, vol. 48(2), pages 256-267, April.
    10. 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. Mateusz Malarczyk & Seiichiro Katsura & Marcin Kaminski & Krzysztof Szabat, 2024. "A Novel Meta-Heuristic Algorithm Based on Birch Succession in the Optimization of an Electric Drive with a Flexible Shaft," Energies, MDPI, vol. 17(16), pages 1-34, August.
    2. Labiba Noshin Asha & Arup Dey & Nita Yodo & Lucy G. Aragon, 2022. "Optimization Approaches for Multiple Conflicting Objectives in Sustainable Green Supply Chain Management," Sustainability, MDPI, vol. 14(19), pages 1-24, October.
    3. Kristina Yancey Spencer & Pavel V. Tsvetkov & Joshua J. Jarrell, 2019. "A greedy memetic algorithm for a multiobjective dynamic bin packing problem for storing cooling objects," Journal of Heuristics, Springer, vol. 25(1), pages 1-45, February.
    4. Tseng, Lin-Yu & Lin, Ya-Tai, 2009. "A hybrid genetic local search algorithm for the permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 198(1), pages 84-92, October.
    5. Goh, C.K. & Tan, K.C. & Liu, D.S. & Chiam, S.C., 2010. "A competitive and cooperative co-evolutionary approach to multi-objective particle swarm optimization algorithm design," European Journal of Operational Research, Elsevier, vol. 202(1), pages 42-54, April.
    6. Jie Fang & Yunqing Rao & Xusheng Zhao & Bing Du, 2023. "A Hybrid Reinforcement Learning Algorithm for 2D Irregular Packing Problems," Mathematics, MDPI, vol. 11(2), pages 1-17, January.
    7. Manuel V. C. Vieira & Margarida Carvalho, 2023. "Lexicographic optimization for the multi-container loading problem with open dimensions for a shoe manufacturer," 4OR, Springer, vol. 21(3), pages 491-512, September.
    8. Wang, Yujia & Yang, Yupu, 2010. "Particle swarm with equilibrium strategy of selection for multi-objective optimization," European Journal of Operational Research, Elsevier, vol. 200(1), pages 187-197, January.
    9. Bin, Wei & Qinke, Peng & Jing, Zhao & Xiao, Chen, 2012. "A binary particle swarm optimization algorithm inspired by multi-level organizational learning behavior," European Journal of Operational Research, Elsevier, vol. 219(2), pages 224-233.
    10. Cho, Huidae & Kim, Dongkyun & Olivera, Francisco & Guikema, Seth D., 2011. "Enhanced speciation in particle swarm optimization for multi-modal problems," European Journal of Operational Research, Elsevier, vol. 213(1), pages 15-23, August.
    11. Seyed Mojib Zahraee & Nirajan Shiwakoti & Peter Stasinopoulos, 2024. "Metaheuristic Optimization of the Agricultural Biomass Supply Chain: Integrating Strategic, Tactical, and Operational Planning," Energies, MDPI, vol. 17(16), pages 1-35, August.
    12. Carlos A. Vega-Mejía & Jairo R. Montoya-Torres & Sardar M. N. Islam, 2019. "Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review," Annals of Operations Research, Springer, vol. 273(1), pages 311-375, February.
    13. Xiangling Zhao & Yun Dong & Lei Zuo, 2023. "A Combinatorial Optimization Approach for Air Cargo Palletization and Aircraft Loading," Mathematics, MDPI, vol. 11(13), pages 1-16, June.
    14. 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.
    15. Li, Yanzhi & Tao, Yi & Wang, Fan, 2009. "A compromised large-scale neighborhood search heuristic for capacitated air cargo loading planning," European Journal of Operational Research, Elsevier, vol. 199(2), pages 553-560, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Marco Antonio Boschetti & Lorenza Montaletti, 2010. "An Exact Algorithm for the Two-Dimensional Strip-Packing Problem," Operations Research, INFORMS, vol. 58(6), pages 1774-1791, December.
    2. Rosephine G. Rakotonirainy & Jan H. Vuuren, 2021. "The effect of benchmark data characteristics during empirical strip packing heuristic performance evaluation," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(2), pages 467-495, June.
    3. H. Terashima-Marín & P. Ross & C. Farías-Zárate & E. López-Camacho & M. Valenzuela-Rendón, 2010. "Generalized hyper-heuristics for solving 2D Regular and Irregular Packing Problems," Annals of Operations Research, Springer, vol. 179(1), pages 369-392, September.
    4. Bennell, Julia A. & Soon Lee, Lai & Potts, Chris N., 2013. "A genetic algorithm for two-dimensional bin packing with due dates," International Journal of Production Economics, Elsevier, vol. 145(2), pages 547-560.
    5. Hadjiconstantinou, Eleni & Iori, Manuel, 2007. "A hybrid genetic algorithm for the two-dimensional single large object placement problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1150-1166, December.
    6. Gonçalves, José Fernando & Resende, Mauricio G.C., 2013. "A biased random key genetic algorithm for 2D and 3D bin packing problems," International Journal of Production Economics, Elsevier, vol. 145(2), pages 500-510.
    7. Kenmochi, Mitsutoshi & Imamichi, Takashi & Nonobe, Koji & Yagiura, Mutsunori & Nagamochi, Hiroshi, 2009. "Exact algorithms for the two-dimensional strip packing problem with and without rotations," European Journal of Operational Research, Elsevier, vol. 198(1), pages 73-83, October.
    8. 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.
    9. Schmid, Verena & Doerner, Karl F. & Laporte, Gilbert, 2013. "Rich routing problems arising in supply chain management," European Journal of Operational Research, Elsevier, vol. 224(3), pages 435-448.
    10. Igor Kierkosz & Maciej Luczak, 2014. "A hybrid evolutionary algorithm for the two-dimensional 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. 22(4), pages 729-753, December.
    11. Felix Prause & Kai Hoppmann-Baum & Boris Defourny & Thorsten Koch, 2021. "The maximum diversity assortment selection problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 93(3), pages 521-554, June.
    12. Hu, Qian & Wei, Lijun & Lim, Andrew, 2018. "The two-dimensional vector packing problem with general costs," Omega, Elsevier, vol. 74(C), pages 59-69.
    13. José Fernando Gonçalves & Mauricio G. C. Resende, 2011. "A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem," Journal of Combinatorial Optimization, Springer, vol. 22(2), pages 180-201, August.
    14. Wei, Lijun & Oon, Wee-Chong & Zhu, Wenbin & Lim, Andrew, 2011. "A skyline heuristic for the 2D rectangular packing and strip packing problems," European Journal of Operational Research, Elsevier, vol. 215(2), pages 337-346, December.
    15. E. K. Burke & G. Kendall & G. Whitwell, 2004. "A New Placement Heuristic for the Orthogonal Stock-Cutting Problem," Operations Research, INFORMS, vol. 52(4), pages 655-671, August.
    16. Silvano Martello & Michele Monaci & Daniele Vigo, 2003. "An Exact Approach to the Strip-Packing Problem," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 310-319, August.
    17. Fekete, Sandor P. & van der Veen, Jan C., 2007. "PackLib2: An integrated library of multi-dimensional packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1131-1135, December.
    18. Liao, Chung-Shou & Hsu, Chia-Hong, 2013. "New lower bounds for the three-dimensional orthogonal bin packing problem," European Journal of Operational Research, Elsevier, vol. 225(2), pages 244-252.
    19. Ortmann, Frank G. & Ntene, Nthabiseng & van Vuuren, Jan H., 2010. "New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems," European Journal of Operational Research, Elsevier, vol. 203(2), pages 306-315, June.
    20. Edmund K. Burke & Graham Kendall & Glenn Whitwell, 2009. "A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem," INFORMS Journal on Computing, INFORMS, vol. 21(3), pages 505-516, August.

    More about this item

    Statistics

    Access and download statistics

    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:190:y:2008:i:2:p:357-382. See general information about how to correct material in RePEc.

    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 bibliographic 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.

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

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.