PLANNING FOR TRUCK FLEET SIZE IN THE PRESENCE OF A COMMON‐CARRIER OPTION
研究在有公共承运商可选的情况下，如何确定最优车队规模并规划车辆路线，同时满足最长路线时间限制，对物流企业决策有参考价值。
This paper considers a class of network optimization problems in which certain directed arcs must be covered by a set of cycles. Our study was motivated by a distribution planning problem of a commercial firm that had to make deliveries over several origin‐destination pairs (directed arcs) and that could service any demand arc by using a vehicle in its own fleet or by paying a common carrier. The problem is to determine an optimal fleet size and the resulting vehicle routes while satisfying maximum route‐time restrictions. We formulate the problem, describe some approximate solution strategies, and discuss important implementation issues.