The multi-depot open vehicle routing problem (MDOVRP) is a hard combinatorial optimization problem belonging to the vehicle routing problem family. It considers vehicles departing from different depots to deliver goods to customers without requiring to return to the depots once all customers have been served. The aim of this work is to provide a new two-index-based mathematical formulation for the MDOVRP as well as enhancements on alternative sub-tour elimination constraints. Through numerical experiments, using traditional benchmarks for the MDOVRP, we show that the proposed formulation outperforms existing ones. In addition, we provide insights with regards to problem instance defining parameters on the models performance.

多站点开放式车辆路径问题（MDOVRP）是属于车辆路径问题家族的硬组合优化问题。它考虑了从不同的仓库出发以将货物交付给客户而无需在服务完所有客户后返回仓库的车辆。这项工作的目的是为MDOVRP提供一种新的基于两指标的数学公式，以及对替代子行程消除约束的增强。通过数值实验，使用MDOVRP的传统基准，我们表明，所提出的公式优于现有公式。此外，我们提供有关问题实例定义模型性能参数的见解。