Modeling soft unloading constraints in the multi-drop container loading problem

Guillem Bonet Filella, Alessio Trivella, F. Corman
{"title":"Modeling soft unloading constraints in the multi-drop container loading problem","authors":"Guillem Bonet Filella, Alessio Trivella, F. Corman","doi":"10.2139/ssrn.3929994","DOIUrl":null,"url":null,"abstract":"The multi-drop container loading problem (MDCLP) requires loading a truck so that boxes can be unloaded at each drop-off point without rearranging other boxes to deliver later. However, modeling such unloading constraints as hard constraints, as done in the literature, considerably limits the flexibility to optimize the packing and utilize the vehicle capacity. We thus propose a more general approach that considers soft unloading constraints. Specifically, we penalize unnecessary relocations of boxes using penalty functions that depend on the volume and weight of the boxes to move as well as the type of move. Our goal is to maximize the total value of the loaded cargo including penalty functions due to violations of the unloading constraints. We provide a mixed-integer linear programming formulation for the MDCLP with soft unloading constraints, which can solve to optimality small scale instances but is intractable for larger ones. We thus propose a heuristic framework to solve large instances, which is based on a randomized extreme-point constructive phase and a subsequent improvement phase. The latter phase iteratively destroys regions in the packing space where high penalties originate, and reconstructs them. Extensive numerical experiments involving different penalties show that our approach significantly outperforms: (i) the hard unloading constraints approach, and (ii) a sequential heuristic that neglects unloading constraints first and evaluates the penalties afterwards. Our findings underscore the relevance of accounting for soft unloading constraints in the MDCLP.","PeriodicalId":446050,"journal":{"name":"CompSciRN: Other Software Engineering (Topic)","volume":"517 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"CompSciRN: Other Software Engineering (Topic)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.3929994","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

The multi-drop container loading problem (MDCLP) requires loading a truck so that boxes can be unloaded at each drop-off point without rearranging other boxes to deliver later. However, modeling such unloading constraints as hard constraints, as done in the literature, considerably limits the flexibility to optimize the packing and utilize the vehicle capacity. We thus propose a more general approach that considers soft unloading constraints. Specifically, we penalize unnecessary relocations of boxes using penalty functions that depend on the volume and weight of the boxes to move as well as the type of move. Our goal is to maximize the total value of the loaded cargo including penalty functions due to violations of the unloading constraints. We provide a mixed-integer linear programming formulation for the MDCLP with soft unloading constraints, which can solve to optimality small scale instances but is intractable for larger ones. We thus propose a heuristic framework to solve large instances, which is based on a randomized extreme-point constructive phase and a subsequent improvement phase. The latter phase iteratively destroys regions in the packing space where high penalties originate, and reconstructs them. Extensive numerical experiments involving different penalties show that our approach significantly outperforms: (i) the hard unloading constraints approach, and (ii) a sequential heuristic that neglects unloading constraints first and evaluates the penalties afterwards. Our findings underscore the relevance of accounting for soft unloading constraints in the MDCLP.
多滴集装箱装载问题的软卸载约束建模
多重集装箱装载问题(MDCLP)要求装载一辆卡车,以便在每个卸货点卸下箱子,而不必重新安排其他箱子稍后交付。然而,如文献中所做的那样,将此类卸载约束建模为硬约束,极大地限制了优化包装和利用车辆容量的灵活性。因此,我们提出了一种考虑软卸载约束的更通用的方法。具体来说,我们使用惩罚函数来惩罚不必要的盒子重新定位,惩罚函数取决于盒子的体积和重量以及移动的类型。我们的目标是使装载货物的总价值最大化,包括因违反卸载约束而产生的惩罚函数。我们为具有软卸载约束的MDCLP提供了一个混合整数线性规划公式,该公式可以解决小规模实例的最优性问题,但对于大型实例则难以解决。因此,我们提出了一种基于随机极值点构建阶段和后续改进阶段的启发式框架来解决大型实例。后一阶段迭代地破坏填充空间中产生高惩罚的区域,并重建它们。涉及不同惩罚的大量数值实验表明,我们的方法明显优于:(i)硬卸载约束方法,以及(ii)顺序启发式方法,该方法首先忽略卸载约束,然后评估惩罚。我们的研究结果强调了MDCLP中考虑软卸载约束的相关性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书