检索结果-内蒙古大学图书馆

Solving capacitated vehicle routing problem with three-dimensional loading and relocation constraints

COMPUTERS & OPERATIONS RESEARCH 2025年 173卷

作者： Chi, Jushang He, Shiwei Song, Rui Beijing Jiaotong Univ Frontiers Sci Ctr Smart High speed Railway Syst Beijing Peoples R China

In capacitated vehicle routing problem with three-dimensional loading constraints (3L-CVRP) that combines the container loading and capacitated vehicle routing problems, the relationship between vehicle visiting sequence and item loading sequence is reflected through relocation-ban constraint. This widely applied constraint prohibits the temporarily unloading and repositioning of loaded items during the entire transportation process, simplifying loading operations but also limiting the volume utilization of each vehicle and increasing transportation costs. To address this issue and obtain a trade-off between transportation cost and operational complexity (reflected in relocation cost), two improved relocation constraints that seek to allow necessary and restricted relocations are developed in this study. Under pickup scenario, a mixed integer-linear programming model is developed to describe the 3L-CVRP with the relocation constraints. An improved branch-and-price algorithm is employed to solve the model. Two loading algorithms, incorporated with a backward dynamic programming method, are proposed to simultaneously generate loading and relocation plans. Enhancement strategies, including an improved label-correcting-based algorithm and memory components that collect loading feasibility and relocation cost information, are developed. Numerical experiments were designed to test the performance of the proposed algorithms and validate the significance of necessary relocations. In pure loading instances, necessary relocations bring an increase in volume utilization by 3.75 % on average and 36.48 % at maximum. In large-scale benchmark instances, allowing necessary relocations decrease the overall costs by 4.86 % on average and 13.08 % at maximum. Abbreviations: 3L-CVRP, capacitated vehicle routing problem with three-dimensional loading constraints;CLP, container loading problem;CVRP, capacitated vehicle routing problem;RC, relocation constraints;MILP, mixed integer linear

关键词： Transportation Three-dimensional loading Relocation backward dynamic programming Branch-and-price algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：