This paper aims at presenting the multiple depot vehicle scheduling problem with heterogeneous fleet and time windows (MDHFVSP-TW). We used a time-space network (TSN) to perform the modeling of MDHFVSP-TW, along with two methodologies to reduce its size and, therefore, its complexity. Along with size reduction methods, a mixed integer programming (MIP) heuristic with variable fixation was presented. Its operation is based on the use of the solution for this problem with relaxed variables as a basis for the removal of arcs from the problem, reducing its size and enabling its resolution in reasonable computational time. Extensive tests were performed for a collection of randomly generated instances. Subsequently, a case study arising from a real instance from a Brazilian city is presented. The computational results showed that the proposed heuristic and size reduction methods obtained good performance, providing high-quality solutions in an adequate computational time.

本文旨在提出具有不同车队和时间窗口（MDHFVSP-TW）的多仓库车辆调度问题。我们使用时空网络（TSN）进行MDHFVSP-TW的建模，并使用两种方法来减小其尺寸并因此减小其复杂性。伴随着尺寸减小的方法，提出了一种具有可变固定的混合整数规划（MIP）启发式方法。它的操作基于对该问题的解决方案的使用，该变量具有宽松的变量，作为从问题中消除电弧的基础，从而减小了问题的大小并在合理的计算时间内实现了解决。对随机生成的实例的集合进行了广泛的测试。随后，介绍了一个来自巴西城市的真实案例的案例研究。