Multi-Objective Optimization of Container Loading: Balancing Space Utilization, Unloading Obstacles, and Cargo Stability

preprint OA: closed
Full text JSON View at publisher
Full text 13,606 characters · extracted from preprint-html · click to expand
Multi-Objective Optimization of Container Loading: Balancing Space Utilization, Unloading Obstacles, and Cargo Stability | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article Multi-Objective Optimization of Container Loading: Balancing Space Utilization, Unloading Obstacles, and Cargo Stability Mahboob Elahi, Wael Mohammed, Samuel Olaiya Afolaranmi, Jose Luis Martinez Lastra, and 1 more This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-7712709/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 4 You are reading this latest preprint version Abstract The Container Loading Problem (CLP) involves arranging rectangular boxes within a container while satisfying practical constraints such as dimensional fit, weight capacity, stackability, delivery order, customer priorities, and cargo stability. In real-world multi-drop delivery scenarios, additional considerations include minimizing unloading obstacles (ULOs) and maintaining cargo balance to ensure transport safety. This study formally defines a tri-objective CLP through a mathematical model that (i) maximizes space utilization, (ii) minimizes ULOs, and (iii) constrains the center of gravity (CG) of the loaded cargo within specified limits along each axis. The model integrates diverse practical constraints into a unified formulation. However, due to its complexity, it is used here for problem definition rather than being solved directly to optimality. A constraint-aware variant of the Non-dominated Sorting Genetic Algorithm II (NSGA-II) is developed to generate high-quality feasible solutions. Computational results on benchmark instances from Bischoff and Ratcliff, adapted to include CG balance requirements, demonstrate that the algorithm can efficiently capture trade-offs between volume utilization, unloading efficiency, and cargo balance. The approach addresses current limitations of CLP studies by jointly considering multiple operational objectives and stability constraints, providing realistic insight into how different priorities affect container space use. container loading problem cargo balance metaheuristic optimization genetic algorithm multi-drop deliveries stability constraints Full Text Cite Share Download PDF Status: Under Review Version 1 posted Editorial decision: Major Revision 16 Dec, 2025 Reviewers agreed at journal 13 Oct, 2025 Reviewers invited by journal 13 Oct, 2025 First submitted to journal 25 Sep, 2025 You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-7712709","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":528682906,"identity":"bfb98500-1936-475e-8f79-10d7c3301c9b","order_by":0,"name":"Mahboob Elahi","email":"","orcid":"","institution":"Tampere University: Tampereen Yliopisto","correspondingAuthor":false,"prefix":"","firstName":"Mahboob","middleName":"","lastName":"Elahi","suffix":""},{"id":528682907,"identity":"3f15d48b-733d-4724-a10b-599fd0001cd5","order_by":1,"name":"Wael Mohammed","email":"","orcid":"","institution":"Tampere University: Tampereen Yliopisto","correspondingAuthor":false,"prefix":"","firstName":"Wael","middleName":"","lastName":"Mohammed","suffix":""},{"id":528682908,"identity":"caf7a6e6-fb96-4954-8b85-3443f0cfafe5","order_by":2,"name":"Samuel Olaiya Afolaranmi","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABBklEQVRIiWNgGAWjYNCCAgYG9gbmBjCbjR1EGzDws+HVYsDAwHOAEaqF5zBYRLKNaC0MEslgSrIBh2L59tNpEh8MGOR52BsbP1fU3Inmk3x/TLqggEGCD5f5Z3K3Sc4wYDDs4TnYLHnm2LPcNulkNmmgiAQuvxgw5G6T5jFgYNwvkdgg2cB2GKIFKFKHS4t8/9tt0n8MGOx7JBKbfzb8A2qRPAzWgtMWhhtAW4B2JQK1tEk2tgG1SDDj12Jw4+1myx4DiWSgX9osG/uAWniSja15DCRwapHvz91440eFjW0Pe/Phmw3fDufObz/48DbPHxsJ+QZcLgMDCSJERsEoGAWjYBQQDwA4FlACjbyqLAAAAABJRU5ErkJggg==","orcid":"https://orcid.org/0000-0002-8132-3017","institution":"Tampere University: Tampereen Yliopisto","correspondingAuthor":true,"prefix":"","firstName":"Samuel","middleName":"Olaiya","lastName":"Afolaranmi","suffix":""},{"id":528682909,"identity":"2756f288-704c-4e0d-a58d-3129126efe7f","order_by":3,"name":"Jose Luis Martinez Lastra","email":"","orcid":"","institution":"Tampere University: Tampereen Yliopisto","correspondingAuthor":false,"prefix":"","firstName":"Jose","middleName":"Luis Martinez","lastName":"Lastra","suffix":""},{"id":528682910,"identity":"0c7ba8fa-7d86-4707-a54c-6dabc6daf2ad","order_by":4,"name":"Jose Antonio Perez Garcia","email":"","orcid":"","institution":"University of Vigo: Universidade de Vigo","correspondingAuthor":false,"prefix":"","firstName":"Jose","middleName":"Antonio Perez","lastName":"Garcia","suffix":""}],"badges":[],"createdAt":"2025-09-25 12:03:43","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-7712709/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-7712709/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":94449229,"identity":"6f9b0509-2fb0-4898-9869-4bd89f3c6d69","added_by":"auto","created_at":"2025-10-27 14:38:02","extension":"xml","order_by":1,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":8902,"visible":true,"origin":"","legend":"","description":"","filename":"socoSOCOD2502332.xml","url":"https://assets-eu.researchsquare.com/files/rs-7712709/v1/af9f26e662905d0a62a05093.xml"},{"id":94449758,"identity":"87fa9bdd-2de6-4ae5-ac9f-ae9f25972216","added_by":"auto","created_at":"2025-10-27 14:38:43","extension":"xml","order_by":2,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":940,"visible":true,"origin":"","legend":"","description":"","filename":"SOCOD250233291420.go.xml","url":"https://assets-eu.researchsquare.com/files/rs-7712709/v1/d9822c483335f6bcb4e918a2.xml"},{"id":94449917,"identity":"e26ca831-b000-4728-9010-35c3503c6ce1","added_by":"auto","created_at":"2025-10-27 14:38:50","extension":"xml","order_by":3,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":809,"visible":true,"origin":"","legend":"","description":"","filename":"SOCOD2502332Import.xml","url":"https://assets-eu.researchsquare.com/files/rs-7712709/v1/2719eb093d2f61ad5f453d6d.xml"},{"id":94466970,"identity":"14c84c77-eacd-4245-862d-5ba09dfc281d","added_by":"auto","created_at":"2025-10-27 15:21:23","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":6274095,"visible":true,"origin":"","legend":"","description":"","filename":"MultiObjectiveCLPPaper.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7712709/v1_covered_2db7f9e6-5c9c-4f72-9ab0-4b4ba48fdf57.pdf"}],"financialInterests":"","formattedTitle":"Multi-Objective Optimization of Container Loading: Balancing Space Utilization, Unloading Obstacles, and Cargo Stability","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":true,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":true,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"soft-computing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"soco","sideBox":"Learn more about [Soft Computing](https://www.springer.com/journal/500)","snPcode":"500","submissionUrl":"https://submission.nature.com/new-submission/500/3","title":"Soft Computing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"container loading problem, cargo balance, metaheuristic optimization, genetic algorithm, multi-drop deliveries, stability constraints","lastPublishedDoi":"10.21203/rs.3.rs-7712709/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-7712709/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"The Container Loading Problem (CLP) involves arranging rectangular boxes within a container while satisfying practical constraints such as dimensional fit, weight capacity, stackability, delivery order, customer priorities, and cargo stability. In real-world multi-drop delivery scenarios, additional considerations include minimizing unloading obstacles (ULOs) and maintaining cargo balance to ensure transport safety. This study formally defines a tri-objective CLP through a mathematical model that (i) maximizes space utilization, (ii) minimizes ULOs, and (iii) constrains the center of gravity (CG) of the loaded cargo within specified limits along each axis. The model integrates diverse practical constraints into a unified formulation. However, due to its complexity, it is used here for problem definition rather than being solved directly to optimality.\nA constraint-aware variant of the Non-dominated Sorting Genetic Algorithm II (NSGA-II) is developed to generate high-quality feasible solutions. Computational results on benchmark instances from Bischoff and Ratcliff, adapted to include CG balance requirements, demonstrate that the algorithm can efficiently capture trade-offs between volume utilization, unloading efficiency, and cargo balance. The approach addresses current limitations of CLP studies by jointly considering multiple operational objectives and stability constraints, providing realistic insight into how different priorities affect container space use.","manuscriptTitle":"Multi-Objective Optimization of Container Loading: Balancing Space Utilization, Unloading Obstacles, and Cargo Stability","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-10-27 11:28:42","doi":"10.21203/rs.3.rs-7712709/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Major Revision","date":"2025-12-16T05:03:00+00:00","index":"","fulltext":""},{"type":"reviewerAgreed","content":"","date":"2025-10-13T09:03:46+00:00","index":0,"fulltext":""},{"type":"reviewersInvited","content":"","date":"2025-10-13T08:48:45+00:00","index":"","fulltext":""},{"type":"submitted","content":"Soft Computing","date":"2025-09-25T08:03:20+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"soft-computing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"soco","sideBox":"Learn more about [Soft Computing](https://www.springer.com/journal/500)","snPcode":"500","submissionUrl":"https://submission.nature.com/new-submission/500/3","title":"Soft Computing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"682922d8-9932-45a0-b335-12810dfdcd7b","owner":[],"postedDate":"October 27th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2026-04-10T07:45:24+00:00","versionOfRecord":[],"versionCreatedAt":"2025-10-27 11:28:42","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-7712709","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-7712709","identity":"rs-7712709","version":["v1"]},"buildId":"XKTyCvWXoU3ODBz1xrDgd","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00