A distribution network design problem in the automotive industry: MIP formulation and heuristics
A distribution network design problem in the automotive industry: MIP formulation and heuristics
复制标题
DOI：
10.1016/j.cor.2014.07.007
复制
发表时间：
2014-12
期刊：
影响因子：
--
通讯作者：
Mouna Kchaou Boujelben;C. Gicquel;M. Minoux
中科院分区：
文献类型：
--
作者：
Mouna Kchaou Boujelben;C. Gicquel;M. Minoux
本文以汽车工业为例，研究了一个多产品分销网络的设计问题。基于现实假设，我们引入了最小体积、最大覆盖距离和单一采购约束，使得问题难以解决。因此，我们开发了几个启发式程序，使用问题的原始MIP公式的各种松弛。在我们的数值实验中，我们分析了得到的网络的结构以及不同的问题参数对计算时间的影响。我们还表明，实现的启发式方法在较短的计算时间内提供了高质量的解决方案，而最先进的MIP求解器无法产生任何可行的解决方案。
We consider a multi-product distribution network design problem arising from a case-study in the automotive industry. Based on the realistic assumptions, we introduce minimum volume, maximum covering distance and single sourcing constraints, making the problem difficult to solve for large-size instances. We thus develop several heuristic procedures using various relaxations of the original MIP formulation of the problem. In our numerical experiments, we analyze the structure of the obtained network as well as the impact of varying the problem parameters on computation times. We also show that the implemented heuristic methods provide good quality solutions within short computation times on instances for which a state-of-the-art MIP solver does not produce any feasible solution.