IDEAS home Printed from https://ideas.repec.org/a/hin/complx/2024184.html
   My bibliography  Save this article

Optimization of Heterogeneous Container Loading Problem with Adaptive Genetic Algorithm

Author

Listed:
  • Xianbo Xiang
  • Caoyang Yu
  • He Xu
  • Stuart X. Zhu

Abstract

This paper studies an optimized container loading problem with the goal of maximizing the 3D space utilization. Based on the characteristics of the mathematical loading model, we develop a dedicated placement heuristic integrated with a novel dynamic space division method, which enables the design of the adaptive genetic algorithm in order to maximize the loading space utilization. We use both weakly and strongly heterogeneous loading data to test the proposed algorithm. By choosing 15 classic sets of test data given by Loh and Nee as weakly heterogeneous data, the average space utilization of our algorithm reaching 70.62% outperforms those of 13 algorithms from the related literature. Taking a set of test data given by George and Robinson as strongly heterogeneous data, the space utilization in this paper can be improved by 4.42% in comparison with their heuristic algorithm.

Suggested Citation

  • Xianbo Xiang & Caoyang Yu & He Xu & Stuart X. Zhu, 2018. "Optimization of Heterogeneous Container Loading Problem with Adaptive Genetic Algorithm," Complexity, Hindawi, vol. 2018, pages 1-12, November.
    • Handle: RePEc:hin:complx:2024184
    DOI: 10.1155/2018/2024184
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2018/2024184.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/8503/2018/2024184.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2018/2024184?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Xue, Zhaojie & Zhang, Canrong & Lin, Wei-Hua & Miao, Lixin & Yang, Peng, 2014. "A tabu search heuristic for the local container drayage problem under a new operation mode," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 62(C), pages 136-150.
    2. Yu Zhou & Leishan Zhou & Yun Wang & Zhuo Yang & Jiawei Wu, 2017. "Application of Multiple-Population Genetic Algorithm in Optimizing the Train-Set Circulation Plan Problem," Complexity, Hindawi, vol. 2017, pages 1-14, July.
    3. Christensen, Jonas & Pacino, Dario, 2017. "A matheuristic for the Cargo Mix Problem with Block Stowage," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 97(C), pages 151-171.
    4. Tang, Ching-Hui, 2011. "A scenario decomposition-genetic algorithm method for solving stochastic air cargo container loading problems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(4), pages 520-531, July.
    5. Bischoff, Eberhard E. & Marriott, Michael D., 1990. "A comparative evaluation of heuristics for container loading," European Journal of Operational Research, Elsevier, vol. 44(2), pages 267-276, January.
    6. Wu, Yong & Li, Wenkai & Goh, Mark & de Souza, Robert, 2010. "Three-dimensional bin packing problem with variable bin height," European Journal of Operational Research, Elsevier, vol. 202(2), pages 347-355, April.
    7. Yan, Shangyao & Shih, Yu-Lin & Shiao, Fei-Yen, 2008. "Optimal cargo container loading plans under stochastic demands for air express carriers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 44(3), pages 555-575, May.
    8. Lipowski, Adam & Lipowska, Dorota, 2012. "Roulette-wheel selection via stochastic acceptance," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(6), pages 2193-2196.
    9. Li, Xinyu & Gao, Liang, 2016. "An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem," International Journal of Production Economics, Elsevier, vol. 174(C), pages 93-110.
    10. Bischoff, E. E. & Ratcliff, M. S. W., 1995. "Issues in the development of approaches to container loading," Omega, Elsevier, vol. 23(4), pages 377-390, August.
    11. Bortfeldt, Andreas & Gehring, Hermann, 2001. "A hybrid genetic algorithm for the container loading problem," European Journal of Operational Research, Elsevier, vol. 131(1), pages 143-161, May.
    12. Lim, Andrew & Ma, Hong & Qiu, Chaoyang & Zhu, Wenbin, 2013. "The single container loading problem with axle weight constraints," International Journal of Production Economics, Elsevier, vol. 144(1), pages 358-369.
    13. Ren, Jidong & Tian, Yajie & Sawaragi, Tetsuo, 2011. "A tree search method for the container loading problem with shipment priority," European Journal of Operational Research, Elsevier, vol. 214(3), pages 526-535, November.
    14. Wang, Zhoujing & Li, Kevin W. & Levy, Jason K., 2008. "A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach," European Journal of Operational Research, Elsevier, vol. 191(1), pages 86-99, November.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. Bortfeldt, Andreas & Wäscher, Gerhard, 2013. "Constraints in container loading – A state-of-the-art review," European Journal of Operational Research, Elsevier, vol. 229(1), pages 1-20.
    3. Sheng, Liu & Hongxia, Zhao & Xisong, Dong & Changjian, Cheng, 2016. "A heuristic algorithm for container loading of pallets with infill boxes," European Journal of Operational Research, Elsevier, vol. 252(3), pages 728-736.
    4. Y Wu, 2011. "Modelling of containerized air cargo forwarding problems under uncertainty," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(7), pages 1211-1226, July.
    5. Araya, Ignacio & Moyano, Mauricio & Sanchez, Cristobal, 2020. "A beam search algorithm for the biobjective container loading problem," European Journal of Operational Research, Elsevier, vol. 286(2), pages 417-431.
    6. Alonso, M.T. & Alvarez-Valdes, R. & Iori, M. & Parreño, F. & Tamarit, J.M., 2017. "Mathematical models for multicontainer loading problems," Omega, Elsevier, vol. 66(PA), pages 106-117.
    7. Wang, Ning & Lim, Andrew & Zhu, Wenbin, 2013. "A multi-round partial beam search approach for the single container loading problem with shipment priority," International Journal of Production Economics, Elsevier, vol. 145(2), pages 531-540.
    8. I. Gimenez-Palacios & M. T. Alonso & R. Alvarez-Valdes & F. Parreño, 2021. "Logistic constraints in container loading problems: the impact of complete shipment conditions," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(1), pages 177-203, April.
    9. F. Parreño & R. Alvarez-Valdes & J. M. Tamarit & J. F. Oliveira, 2008. "A Maximal-Space Algorithm for the Container Loading Problem," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 412-422, August.
    10. Lim, Andrew & Ma, Hong & Qiu, Chaoyang & Zhu, Wenbin, 2013. "The single container loading problem with axle weight constraints," International Journal of Production Economics, Elsevier, vol. 144(1), pages 358-369.
    11. Tian, Tian & Zhu, Wenbin & Lim, Andrew & Wei, Lijun, 2016. "The multiple container loading problem with preference," European Journal of Operational Research, Elsevier, vol. 248(1), pages 84-94.
    12. Silva, Elsa & Ramos, António G. & Oliveira, José F., 2018. "Load balance recovery for multi-drop distribution problems: A mixed integer linear programming approach," Transportation Research Part B: Methodological, Elsevier, vol. 116(C), pages 62-75.
    13. Ambrosino, Daniela & Sciomachen, Anna & Tanfani, Elena, 2004. "Stowing a containership: the master bay plan problem," Transportation Research Part A: Policy and Practice, Elsevier, vol. 38(2), pages 81-99, February.
    14. Toffolo, Túlio A.M. & Esprit, Eline & Wauters, Tony & Vanden Berghe, Greet, 2017. "A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem," European Journal of Operational Research, Elsevier, vol. 257(2), pages 526-538.
    15. Bischoff, E.E., 2006. "Three-dimensional packing of items with limited load bearing strength," European Journal of Operational Research, Elsevier, vol. 168(3), pages 952-966, February.
    16. Ren, Jidong & Tian, Yajie & Sawaragi, Tetsuo, 2011. "A tree search method for the container loading problem with shipment priority," European Journal of Operational Research, Elsevier, vol. 214(3), pages 526-535, November.
    17. Ramos, António G. & Silva, Elsa & Oliveira, José F., 2018. "A new load balance methodology for container loading problem in road transportation," European Journal of Operational Research, Elsevier, vol. 266(3), pages 1140-1152.
    18. Gajda, Mikele & Trivella, Alessio & Mansini, Renata & Pisinger, David, 2022. "An optimization approach for a complex real-life container loading problem," Omega, Elsevier, vol. 107(C).
    19. Bortfeldt, Andreas & Mack, Daniel, 2007. "A heuristic for the three-dimensional strip packing problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1267-1279, December.
    20. Wu, Yue, 2010. "A dual-response forwarding approach for containerizing air cargoes under uncertainty, based on stochastic mixed 0-1 programming," European Journal of Operational Research, Elsevier, vol. 207(1), pages 152-164, November.

    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:hin:complx:2024184. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.