New heuristics for the Fleet Size and Mix Vehicle Routing Problem with Time Windows
针对带时间窗的车队规模与混合车辆路径问题，开发了新的启发式算法，性能显著优于以往方法，有助于解决实际路径规划问题。
In the Fleet Size and Mix Vehicle Routing Problem with Time Windows (FSMVRPTW) customers need to be serviced in their time windows at minimal costs by a heterogeneous fleet. In this paper new heuristics for the FSMVRPTW are developed. The performance of the heuristics is shown to be significantly higher than that of any previous heuristic approach and therefore likely to achieve better solutions to practical routing problems.