We introduce a novel two-phase matheuristic for assignment and truck loading. The scope of our approach involves scenarios with an extensive amount of items requiring assignment to a heterogeneous fleet of trucks and subsequent transportation. A distinguishing feature of our matheuristic lies in the fact that the complex underlying problem is divided into subproblems which later are merged into a global solution. The proposed matheuristic tackles the assignment problem in its first phase, followed by a complex truck loading algorithm to validate the assignment solution in the second phase. This enables the identification of optimal solutions and adaptability to diverse use cases. This approach is motivated by the ROADEF/EURO challenge 2022 and is awarded with the scientific prize of the challenge. We demonstrate superior performance on selected instances, showcasing the potential for significant cost reduction in Renault’s supply chains.

中文翻译：

---

用于分配和卡车装载问题的两阶段数学


我们引入了一种新颖的两阶段数学法，用于分配和卡车装载。我们的方法范围涉及需要分配给异构卡车车队和后续运输的大量项目的场景。我们的数学的一个显著特征在于，复杂的潜在问题被划分为子问题，这些子问题后来被合并为一个全局解决方案。所提出的数学在第一阶段解决了分配问题，然后在第二阶段提出了一个复杂的卡车装载算法来验证分配解决方案。这样可以确定最佳解决方案并适应各种用例。这种方法受到 2022 年 ROADEF/EURO 挑战赛的启发，并获得了挑战赛的科学奖。我们在选定的实例上展示了卓越的性能，展示了 Renault 供应链显著降低成本的潜力。