一般的車輛路線問題中，通常限制每台車只能執行一條路線的工作，而多車次車輛路線問題和以往一般車輛路線問題最大的不同在於車輛可以迴轉，也就是同一台車在條件允許的情況下，可以重複執行多條路線的工作，以節省車輛的固定使用成本，獲得更大的效益。

本研究設計了兩種求解具時窗之多車次車輛路線問題的方法，一為時間區段法，另一為最大工作量法。時間區段法乃根據多車次車輛路線問題的特性，使用二階段的方式處理；而最大工作量法的主要設計則是將二階段的處理過程合併。本研究以各種問題類型測試此兩種演算法，觀察在各種設定下之變化，並說明其有效規劃路線的原因及方法。

觀察測試結果，得到以下結論：
一、節點散佈情形影響車輛迴轉率，其中以群集分佈的節點最適合多車次方法。
二、所求路線數愈多，迴轉率會上升，但工作時間亦會增加，迴轉率及工作時間之取捨端看車輛的固定使用成本。
三、時窗寬窄影響求解結果。時窗愈寬，路線數及工作時間減少，且迴轉率上升，說明多車次問題在寬時窗的設定下，能夠得到較大的發揮。
四、多車次方法較適合車輛裝載容量低，路線數多的情形。

1、 吳致昀，「多車次車輛路線問題之研究」，國立成功大學，工業管理研究所碩士論文，2000。
2、 張秀雲，「具時窗限制之車輛迴轉率與路線規劃問題之研究」，國科會計劃，2000。
3、 Aho A. V., The Design and Analysis of Computer Algorithms, Reading, Mass 1974.
4、 Atkinson J. B., “A Greedy Look-ahead Heuristic for Combinatorial Optimization: An Application to Vehicle Scheduling with Time Windows,” Operational Research, Vol.45, No.6, 673-684, 1994.
5、 Badeau P., Guertin F., Gendreau M., Potiven J. and Taillard E., “A Parallel Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows,” Transpn Research Vol.5, No.2, 109-122, 1997.
6、 Balakrishnan N., “Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows,” Operational Research, Vol.44, No.3, 279-287, 1993.
7、 Blanton Jr. L. and Wainwright R. L., “Multiple Vehicle Routing with Time and Capacity Constraints using Genetic Algorithms,” Proceedings of the 6th Oklahoma Symposium on Artificial Intelligence, Tulsa, OK, 452-459, 1992.
8、 Bowerman R. L., Calamai P. H. and Hall G. B., “The Spacefilling Curve with Optimal Partitioning Heuristic for the Vehicle Routing Problem,” European Journal of Operational Research, Vol.76, 128-142, 1994.
9、 Brandao J., Mercer A., “A Tabu Search Algorithm for the Multi-trip Vehicle Routing and Scheduling Problem,” European journal of operational research, Vol.100, 180-191, 1997.
10、 Brandao J. and Mercer A., “The Multi-trip Vehicle Routing Problem,” Journal of the Operation Research Society, Vol.49, 799-805, 1998.
11、 Cai X., Kloks T., and Wong C. K., “Time-Varying Shortest Path Problems with constraints,” Networks, Vol.29, 141-149, 1997.
12、 Calvo R. W., “A New Heuristic for the Traveling Salesman Problem With Time Windows,” Transportation Science, Vol.34, No.1, 2000.
13、 Chao I, Golden B., and Wasil E., “An improved Heuristic for the Period Vehicle Routing Problem”, Network, Vol.26, 25-44, 1995.
14、 Chen Y. L., and Yang H. H., “Shortest Paths in Traffic-light Networks,” Transportation Research Part B, Vol.34, 241-253, 2000.
15、 Desaulniers G. and Villeneuve D., “The Shortest Path Problem with Time Windows and Linear Waiting Costs,” Transportation Science, Vol.34, Bo.3, 312-319, 2000.
16、 Desrochers M., Desrosiers J. and Solomon M., “A New Optimization Algorithm For The Vehicle Routing Problem With Time Windows,” Operations Research, Vol.40, No. 2, 342-354, 1992.
17、 Desrochers M., and Soumis F., “A Generalized Permanent Labelling Algorithm for the Shortest Path Problem with Time Windows,” INFOR 26, 191-212, 1988
18、 Desrosiers J., Pelletier P. and Soumis F., “Plus Court Chemin avec Contraintes d’Horaives,” RAIRO 17, 357-377, 1983.
19、 Duhamel C. P., Jean Y., and Rousseau J. M., “A Tabu Search Heauristic for the Vehicle Routing Problem with Backhauls and Time Windows”, Institute for Operation Research and Management Science, 49-59, 1997.
20、 Fisher M. L., “Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees,” operations Research, Vol.42, No. 4, 626-642, 1994.
21、 Fisher M. L. and Jornsten K. O., “Vehicle Routing with Time Windows: Two Optimization Algorithms,” Operations Research, Vol.45, No.3, 1997.
22、 Fisher M. L. and Jaikumar R., “A Generalized Assignment Heuristic for Vehicle Routing,” Networks, Vol.11, 109-124, 1981.
23、 Fleischmann B., “The Vehicle Routing Problem with Multiple Use of Vehicle,” Working Paper, Fachbereich Wirtschaftswissenschaffen Universitat Hamburg, 1990.
24、 Ioachim I., Gelinas S., Soumis F., and Desrosiers J., “A Dynamic Programming Algorithm for the Shortest Path Problem with Time Windows and Linear Node Costs,” Networks, Vol.31, 193-204, 1998.
25、 Raymond E. M. and James W. T., Complexity of Computer Computations, New York, Plenum Press, 1972
26、 Russell R. A., “Hybrid Heuristics for the Vehicle Routing Problem with Time Windows,” Transportation Science, Vol.29, No.2, 156-166, 1995.
27、 Rochat Y. and Taillard E., “Probabilistic Diversification and Intensification in Local Search for Vehicle Routing,” Journal of Heuristics, Vol.1, 147-167 1995.
28、 Taillard E., “Parallel Iterative Search Methods for Vehicle Routing Problems,” Networks, Vol.23 661-673, 1993.
29、 Taillard E., Badeau P., Gendreau M., Guertin F. and Potiven J. Y., “A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows,” Transportation Science, Vol.31, No.2, 1997.
30、 Tillard, E., Laporte, G. and Gendreau, M., “Vehicle Routing with Multiple Use of Vehicles,” Journal of the Operation Research Socity, Vol.47, 1065-1070, 1996.
31、 William P., and Barnes J., “Solving the Pickup and Delivery Problem with Time Windows Using Reactive Tabu Search,” Transportation Research Part B, Vol.34, 107-121, 2000.