參考文獻
[1] Ai, T. J. and Kachitvichyanukul, V. (2009). A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. Computers &; Operations Research, 36(5), 1693-1702.
[2] Aldaihani, M. and Dessouky, M. M. (2003). Hybrid scheduling methods for paratransit operations. Computers &; Industrial Engineering, 45(1), 75-96.
[3] Aleman, R., Zhang, X. and Hill, R. (2010). An adaptive memory algorithm for the split delivery vehicle routing problem. Journal of Heuristics, 16(3), 441-473.
[4] Aleman, R. E. and Hill, R. R. (2010). A tabu search with vocabulary building approach for the vehicle routing problem with split demands. International Journal of Metaheuristics, 1(1), 55-80.
[5] Alonso, F., Alvarez, M. J. and Beasley, J. E. (2007). A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions. Journal of Operational Research Society, 59(7), 963-976.
[6] Alshamrani, A., Mathur, K. and Ballou, R. H. (2007). Reverse logistics: simultaneous design of delivery routes and returns strategies. Computers &; Operations Research, 34(2), 595-619.
[7] Archetti, C., Bianchessi, N. and Speranza, M. G. (2011). A Column Generation Approach for the Split Delivery Vehicle Routing Problem. Networks, 58(4), 241-254.
[8] Archetti, C., Bianchessi, N. and Speranza, M. G. (2014). Branch-and-cut algorithms for the split delivery vehicle routing problem. European Journal of Operational Research, 238(3), 685-698.
[9] Archetti, C., Speranza, M. G. and Hertz, A. (2006). A tabu search algorithm for the split delivery vehicle routing problem. Transportation Science, 40(1), 64-73.
[10] Archetti, C., Speranza, M. G. and Savelsbergh, M. W. P. (2008). An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem. Transportation Science, 42(1), 22-31.
[11] Augerat, P., Belenger, J., Benavent, E., Corberan, A., Naddef, D. and Rinaldi, G. (1995). Computational results with a branch and cut code for the capacitated vehicle routing problem. Technical Report : RR 949-M.
[12] Avci, M. and Topaloglu, S. (2015). An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries. Computers and Industrial Engineering, 83, 15-29.
[13] Bachtiyar, C. (2014). 以模擬退火法求解具容量限制之綠色車輛途程問題. (碩士論文), 國立臺灣科技大學工業管理研究所.
[14] Baldacci, R., Battarra, M. and Vigo, D. (2008). Routing a Heterogeneous Fleet of Vehicles. In B. Golden, S. Raghavan &; E. Wasil (Eds.), The vehicle routing problem: Latest advances and new challenges (Vol. 43, pp. 3-27): Springer US.
[15] Baldacci, R. and Mingozzi, A. (2009). A unified exact method for solving different classes of vehicle routing problems. Mathematical Programming, 120(2), 347-380.
[16] Ball, M. O., Golden, B., Assad, A. and Bodin, L. (1983). Planning for truck fleet size in the presence of a common‐carrier option. Decision Sciences, 14(1), 103-120.
[17] Bektaş, T. and Laporte, G. (2011). The Pollution-Routing Problem. Transportation Research Part B: Methodological, 45(8), 1232-1250.
[18] Belenguer, J. M., Martinez, M. C. and Mota, E. (2000). A lower bound for the split delivery vehicle routing problem. Operations Research, 48(5), 801-810.
[19] Berbotto, L., García, S. and Nogales, F. (2014). A Randomized Granular Tabu Search heuristic for the split delivery vehicle routing problem. Annals of Operations Research, 222(1), 153-173.
[20] Bodin, L., Golden, B., Assad, A. and Ball, M. O. (1983). Routing and scheduling of vehicles and crews: The state of the art. Computer &; Operation Research, 10(2), 63-211.
[21] Bolduc, M.-C., Renaud, J. and Boctor, F. (2007). A heuristic for the routing and carrier selection problem. European Journal of Operational Research, 183(2), 926-932.
[22] Bolduc, M. C., Renaud, J., Boctor, F. and Laporte, G. (2008). A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers. Journal of the Operational Research Society, 59(6), 776-787.
[23] Boudia, M., Prins, C. and Reghioui, M. (2007). An Effective Memetic Algorithm with Population Management for the Split Delivery Vehicle Routing Problem. In T. Bartz-Beielstein, M. Blesa Aguilera, C. Blum, B. Naujoks, A. Roli, G. Rudolph &; M. Sampels (Eds.), Hybrid Metaheuristics (Vol. 4771, pp. 16-30): Springer Berlin Heidelberg.
[24] Brandão, J. (2004). A tabu search algorithm for the open vehicle routing problem. European Journal of Operational Research, 157(3), 552-564.
[25] Brandão, J. (2006). A new tabu search algorithm for the vehicle routing problem with backhauls. European Journal of Operational Research, 173(2), 540-555.
[26] Brandão, J. (2009). A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem. European Journal of Operational Research, 195(3), 716-728.
[27] Brandão, J. (2011). A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem. Computers &; Operations Research, 38(1), 140-151.
[28] Brandao, J. C. S. and Mercer, A. (1998). The multi-trip vehicle routing problem. Journal of the Operational Research Society, 49(8), 799-805.
[29] Côté, J.-F. and Potvin, J.-Y. (2009). A tabu search heuristic for the vehicle routing problem with private fleet and common carrier. European Journal of Operational Research, 198(2), 464-469.
[30] Calvo, R. W. and Colorni, A. (2007). An effective and fast heuristic for the Dial-a-Ride problem. 4or-a Quarterly Journal of Operations Research, 5(1), 61-73.
[31] Campos, V., Corberán, A. and Mota, E. (2008). A Scatter Search Algorithm for the Split Delivery Vehicle Routing Problem. In A. Fink &; F. Rothlauf (Eds.), Advances in Computational Intelligence in Transport, Logistics, and Supply Chain Management (Vol. 144, pp. 137-152): Springer Berlin Heidelberg.
[32] Cao, E. and Lai, M. (2010). The open vehicle routing problem with fuzzy demands. Expert Systems with Applications, 37(3), 2405-2411.
[33] Changshi, L., Liuxun, L. and Jun, W. (2010). An effective tabu search for the vehicle routing problem with backhauls. Advanced Materials Research, 143-144, 1415-1419.
[34] Chao, I. M. (2002). A tabu search method for the truck and trailer routing problem. Computers &; Operations Research, 29(1), 33-51.
[35] Cheikh, M., Ratli, M., Mkaouar, O. and Jarboui, B. (2015). A variable neighborhood search algorithm for the vehicle routing problem with multiple trips. Electronic Notes in Discrete Mathematics, 47(0), 277-284.
[36] Chen, H.-K., Chou, H.-W. and Hsu, C.-Y. (2011a). The Linehaul-Feeder Vehicle Routing Problem with Virtual Depots and TimeWindows. Mathematical Problems in Engineering, 2011, 15 pages.
[37] Chen, H.-K., Chou, H.-W., Hsueh, C.-F. and Ho, T.-Y. (2011b). The Linehaul-Feeder Vehicle Routing Problem With Virtual Depots. IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 8(4), 694-704.
[38] Chen, H.-K., Chou, H.-W., Hsueh, C.-F. and Yu, Y.-J. (2015). The paired many-to-many pickup and delivery problem: an application. Top, 23(1), 220-243.
[39] Chen, J. F. and Wu, T. H. (2005). Vehicle routing problem with simultaneous deliveries and pickups. Journal of Operational Research Society, 57(5), 579-587.
[40] Chen, S., Golden, B. and Wasil, E. (2007). The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results. Networks, 49(4), 318-329.
[41] Chevrier, R., Liefoogheb, A., Jourdan, L. and Dhaenens, C. (2012). Solving a dial-a-ride problem with a hybrid evolutionary multi-objective approach: Application to demand responsive transport. Applied Soft Computing, 12(4), 1247-1258.
[42] Chiu, H.-M. and Huang, H.-S. (2008). A study on the application of genetic algorithms on the Dial-a-Ride Problem. WSEAS Transactions on Business and Economics, 5(4), 134-139.
[43] Choi, E. and Tcha, D.-W. (2007). A column generation approach to the heterogeneous fleet vehicle routing problem. Computers &; Operations Research, 34(7), 2080-2095.
[44] Christofides, N. and Eilon, S. (1969). An algorithm for the vehicle dispatching problem. Operational Research Quarterly, 20, 309-318.
[45] Christofides, N., Mingozzi, A. and Toth, P. (1979). The vehicle routing problem. In N. Christofides, A. Mingozzi, P. Toth, and C. Sandi, (editors) Combinatorial Optimization, 315–338.
[46] Chu, C. W. (2005). A heuristic algorithm for the truckload and less-than-truckload problem. European Journal of Operational Research, 165(3), 657-667.
[47] Clarke, G. and Wright, J. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12(4), 568-581.
[48] Colorni, A., Dorigo, M., Maffioli, F., Maniezzo, V., Righini, G. and Trubian, M. (1996). Heuristics from Nature for Hard Combinatorial Optimization Problems. International Transactions in Operational Research, 3(1), 1-21.
[49] Cordeau, J.-F. (2006). A Branch-and-Cut Algorithm for the Dial-a-Ride Problem. Operations Research, 54(3), 573-586.
[50] Cordeau, J.-F. and Laporte, G. (2003). A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research Part B: Methodological, 37(6), 579-594.
[51] Cordeau, J.-F., Laporte, G., Savelsbergh, M. W. P. and Vigo, D. (2005). Vehicle routing,” in: C. Barnhart and Laporte, G. (eds) (Vol. 14): Handbooks in Operations Research and Management Science: Transportation.
[52] Cordeau, J., Laporte, G., Potvin, J. Y. and Savelsbergh, M. W. P. (2004). Transportation on demand: In: Handbooks in Operations Research and Management Science, Elsevier, North-Holland, Amsterdam, vol. (to appear).
[53] Crevier, B., Cordeau, J.-F. and Laporte, G. (2007). The multi-depot vehicle routing problem with inter-depot routes. European Journal of Operational Research, 176(2), 756-773.
[54] Crispim, J. and Brandão, J. (2001). Reactive tabu search and variable neighbourhood descent applied to the vehicle routing problem with backhauls. Paper presented at the In: MIC 2001 4th Metaheuristic International Conference. Porto, Portugal, 16-20 July 2001.
[55] Crispim, J. and Brandao, J. (2005). Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls. Journal of the Operational Research Society, 56(11), 1296-1302.
[56] Cullen, F. H., Jarvis, J. J. and Ratliff, H. D. (1981). Set partitioning based heuristics for interactive routing. Networks, 11(2), 125-143.
[57] Dantzig, G. B. and Ramser, J. H. (1959). The truck disaptching problem. Management Science, 6(1), 80-91.
[58] Dekker, R., Bloemhof, J. and Mallidis, I. (2012). Operations Research for green logistics – An overview of aspects, issues, contributions and challenges. European Journal of Operational Research, 219(3), 671-679.
[59] Dell’Amico, M., Righini, G. and Salani, M. (2006). A Branch-and-Price Approach to the Vehicle Routing Problem with Simultaneous Distribution and Collection. Transportation Science, 40(2), 235-247.
[60] Derigs, U., Gottlieb, J., Kalkoff, J., Piesche, M., Rothlauf, F. and Vogel, U. (2011). Vehicle routing with compartments: applications, modelling and heuristics. OR Spectrum, 33(4), 885-914.
[61] Derigs, U., Li, B. and Vogel, U. (2010). Local search-based metaheuristics for the split delivery vehicle routing problem. Journal of the Operational Research Society, 61(9), 1356-1364.
[62] Derigs, U., Pullmann, M. and Vogel, U. (2013). Truck and trailer routing—Problems, heuristics and computational experience. Computers &; Operations Research, 40(2), 536-546.
[63] Derigs, U. and Reuter, K. (2009). A simple and efficient tabu search heuristic for solving the open vehicle routing problem. Journal of the Operational Research Society, 60(12), 1658-1669.
[64] Desrochers, M. and Verhoog, T. W. (1991). A new heuristic for the fleet size and mix vehicle routing problem. Computers &; Operations Research, 18(3), 263-274.
[65] Desrosiers, J., Dumas, Y. and Soumis, F. (1988). The Multiple Vehicle DIAL-A-RIDE Problem. In J. Daduna &; A. Wren (Eds.), Computer-Aided Transit Scheduling (Vol. 308, pp. 15-27): Springer Berlin Heidelberg.
[66] Dethloff, J. (2001). Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up. OR-Spektrum, 23(1), 79-96.
[67] Diana, M. and Dessouky, M. M. (2004). A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows. Transportation Research Part B: Methodological, 38(6), 539-557.
[68] Drexl, M. (2011). Branch-and-price and heuristic column generation for the generalized truck-and-trailer routing problem. Revista de Métodos Cuantitativos para la Economía y la Empresa, 12, 5-38.
[69] Dror, M. and Trudeau, P. (1989). Savings by split delivery routing. Transportation Science, 23(2), 141-149.
[70] Dror, M. and Trudeau, P. (1990). Split delivery routing. Naval Research Logistics, 37(3), 383-402.
[71] Duhamel, C., Lacomme, P. and Prodhon, C. (2012). A hybrid evolutionary local search with depth first search split procedure for the heterogeneous vehicle routing problems. Engineering Applications of Artificial Intelligence, 25(2), 345-358.
[72] Eglese, R. and Bektas, T. (2014). Green Vehicle Routing Vehicle Routing: Problems, Methods, and Applications (Vol. Second Edition, pp. 437-458).
[73] Eksioglu, B., Vural, A. V. and Reisman, A. (2009). The vehicle routing problem: A taxonomic review. Computers &; Industrial Engineering, 57(4), 1472-1483.
[74] El Fallahi, A., Prins, C. and Calvo, R. W. (2008). A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem. Computers &; Operations Research, 35(5), 1725-1741.
[75] Erdoğan, S. and Miller-Hooks, E. (2012). A Green Vehicle Routing Problem. Transportation Research Part E: Logistics and Transportation Review, 48(1), 100-114.
[76] Fisher, M. L. (1994). Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees. Operations Research, 42(4), 626-642.
[77] Fleischmann, B. (1990). The Vehicle Routing Problem with Multiple Use of Vehicles. working paper, Facbereich Wirtschaftswissenschafte Universitat Hamburg.
[78] Fleszar, K., Osman, I. H. and Hindi, K. S. (2009). A variable neighbourhood search algorithm for the open vehicle routing problem. European Journal of Operational Research, 195(3), 803-809.
[79] Fu, Z., Eglese, R. and Li, L. Y. O. (2005). A new tabu search heuristic for the open vehicle routing problem. Journal of the Operational Research Society, 56(3), 267-274.
[80] Fu, Z. and Nie, J. (2008). A Genetic algorithm for the capacitated Open Vehicle Routing Problem. Journal Systems Engineering, 170, 78-83.
[81] Gajpal, Y. and Abad, P. L. (2009). Multi-ant colony system (MACS) for a vehicle routing problem with backhauls. European Journal of Operational Research, 196(1), 102-117.
[82] Ge, J. and Ying, X. (2011). Application of improved TS algorithm for MC-VRPTW. 2011 Fourth International Symposium on Computational Intelligence and Design, Hangzhou, China.
[83] Gendreau, M., Laporte, G., Musaraganyi, C. and Taillard, É. D. (1999). A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Computers &; Operations Research, 26(12), 1153-1173.
[84] Gendreau, M., Nossack, J. and Pesch, E. (2015). Mathematical formulations for a 1-full-truckload pickup-and-delivery problem. European Journal of Operational Research, 242(3), 1008-1016.
[85] Gerdessen, J. C. (1996). Vehicle routing problem with trailers. European Journal of Operational Research, 93(1), 135-147.
[86] Gheysens, F., Golden, B. and Assad, A. (1984). A comparison of techniques for solving the fleet size and mix vehicle routing problem. Operations Research Spektrum, 6(4), 207-216.
[87] Goetschalckx and Jacobs-Blecha. (1992). The vechicle routing problem with backhauls: Properties and solution algorithms: Georgia Institute of Technology, Atlanta, Technical Report MHRC-TR-88-l3.
[88] Goetschalckx, M. and Jacobs-Blecha, C. (1989). The vehicle routing problem with backhauls. European Journal of Operational Research, 42(1), 39-51.
[89] Goksal, F. P., Karaoglan, I. and Altiparmak, F. (2013). A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery. Computers &; Industrial Engineering, 65(1), 39-53.
[90] Golden, B., Assad, A., Levy, L. and Gheysens, F. (1984). The fleet size and mix vehicle routing problem. Computers &; Operations Research, 11(1), 49-66.
[91] Golden, B., Baker, E., Alfaro, J. and Schaffer, J. (1985). The vehicle routing problem with backhauling: Two approaches. Paper presented at the In: Hammesfahr, RD eds, Proceedings of the Twenty-First Annual Meeting of S. E. TIMS. Myrtle Beach, SC.
[92] Golden, B., Wasil, E., Kelly, J. and Chao, I. M. (1998). The Impact of Metaheuristics on Solving the Vehicle Routing Problem: Algorithms, Problem Sets, and Computational Results. In T. Crainic &; G. Laporte (Eds.), Fleet Management and Logistics (pp. 33-56): Springer US.
[93] Golden, B. L. and Assad, A. A. (1988). Vehicle Routing: Methods and Studies. Elsevier Science Publishers B.V.
[94] Gulczynski, D., Golden, B. and Wasil, E. (2010). The split delivery vehicle routing problem with minimum delivery amounts. Transportation Research Part E: Logistics and Transportation Review, 46(5), 612-626.
[95] Guo, F. and Long, Y. (2005). Genetic algorithms for improved vehicle routing problem with backhauls: Proceedings of the 12th International Conference on Industrial Engineering and Engineering Management, Vols 1 and 2: Modern Industrial Engineering and Innovation in Enterprise Management.
[96] Guo, J., Liu, C. and Ieee. (2014). A Spatio-temporal Based Parallel Insertion Algorithm for Solving Dial-A-Ride Problem. 26th Chinese Control and Decision Conference (2014 Ccdc), 3257-3261.
[97] Hame, L. (2011). An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows. European Journal of Operational Research, 209(1), 11-22.
[98] Han, A. F., Cho, Y.-J. and Chu, H. Y. (2011, December 17-20). Neighborhood Search Methods Designed for Spilt Delivery Vehicle Routing Problems. Paper presented at the Proceedings of the 16th HKSTS International Conference of Hong Kong Society for Transportation Studies, Hong Kong, pp. 97-104. (NSC- 99-2211-E-009-089).
[99] He, J. and Song, T. (2014). A Bio-Inspired Algorithm for the Fleet Size and Mix Vehicle Routing Problem. Journal of Computational and Theoretical Nanoscience, 11(10), 2085-2090.
[100] Healy, P. and Moll, R. (1995). A new extension of local search applied to the Dial-A-Ride Problem. European Journal of Operational Research, 83(1), 83-104.
[101] Ho, S. C. and Haugland, D. (2011). Local search heuristics for the probabilistic dial-a-ride problem. OR Spectrum, 33(4), 961-988.
[102] Imran, A., Salhi, S. and Wassan, N. A. (2009). A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem. European Journal of Operational Research, 197(2), 509-518.
[103] Jaw, J.-J., Odoni, A. R., Psaraftis, H. N. and Wilson, N. H. M. (1986). A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows. Transportation Research Part B: Methodological, 20(3), 243-257.
[104] Jin, M., Liu, K. and Bowden, R. O. (2007). A two-stage algorithm with valid inequalities for the split delivery vehicle routing problem. International Journal of Production Economics, 105(1), 228-242.
[105] Jin, M., Liu, K. and Eksioglu, B. (2008). A column generation approach for the split delivery vehicle routing problem. Operations Research Letters, 36(2), 265-270.
[106] Jorgensen, R. M., Larsen, J. and Bergvinsdottir, K. B. (2007). Solving the Dial-a-Ride problem using genetic algorithms. Journal of the Operational Research Society, 58(10), 1321-1331. doi: 10.1057/palgrave.jors.2602287
[107] Joseph, C. D., Prins, C., Amodeo, L. and Yalaoui, F. (2012). A Multi Start Iterated Local Search algorithm for the multi compartment vehicle routing problem. 10th International Industrial Simulation Conference 2012 (ISC 2012), 125-129.
[108] Jun, Y. and Kim, B.-I. (2012). New best solutions to VRPSPD benchmark problems by a perturbation based algorithm. Expert Systems with Applications, 39(5), 5641-5648.
[109] Kikuchi, S. and Rhee, J. (1989). Scheduling Method for Demand‐Responsive Transportation System. Journal of Transportation Engineering, 115(6), 630-645. doi: doi:10.1061/(ASCE)0733-947X(1989)115:6(630)
[110] Kim, T. and Haghani, A. (2011). Model and Algorithm Considering Time-Varying Travel Times to Solve Static Multidepot Dial-a-Ride Problem. Transportation Research Record(2218), 68-77.
[111] Kirchler, D. and Calvo, R. W. (2013). A Granular Tabu Search algorithm for the Dial-a-Ride Problem. Transportation Research Part B-Methodological, 56, 120-135.
[112] Lang, M.-x. (2005). Study on simulated annealing algorithm for vehicle routing problem with backhauls. Journal of Systems Engineering, 20(5), 485-491.
[113] Laporte, G. (2009). Fifty Years of Vehicle Routing. Transportation Science, 43(4), 408-416.
[114] Laporte, G., Mercure, H. and Nobert, Y. (1986). An exact algorithm for the asymmetrical capacitated vehicle-routing problem. Networks, 16(1), 33-46.
[115] Laporte, G. and Nobert, Y. (1983). A branch and bound algorithm for the capacitated vehicle routing problem. OR-Spektrum, 5(2), 77-85.
[116] Lawler, E., Lenstra, J., Rinnooy Kan, A. and Shmoys, D. (1985). The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization: John Wiley &; Sons, Inc.
[117] Lee, Y. H., Kim, J. I., Kang, K. H. and Kim, K. H. (2007). A heuristic for vehicle fleet mix problem using tabu search and set partitioning. Journal of the Operational Research Society, 59(6), 833-841.
[118] Li, F., Golden, B. and Wasil, E. (2005). Very large-scale vehicle routing: new test problems, algorithms, and results. Computers &; Operations Research, 32(5), 1165-1179.
[119] Li, F., Golden, B. and Wasil, E. (2007a). The open vehicle routing problem: Algorithms, large-scale test problems, and computational results. Computers &; Operations Research, 34(10), 2918-2930.
[120] Li, F., Golden, B. and Wasil, E. (2007b). A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem. Computers &; Operations Research, 34(9), 2734-2742.
[121] Li, H. and Lim, A. (2003). Local search with annealing-like restarts to solve the VRPTW. European Journal of Operational Research, 150(1), 115-127.
[122] Li, X. and Tian, P. (2006). An Ant Colony System for the Open Vehicle Routing Problem. In M. Dorigo, L. Gambardella, M. Birattari, A. Martinoli, R. Poli &; T. Stützle (Eds.), Ant Colony Optimization and Swarm Intelligence (Vol. 4150, pp. 356-363): Springer Berlin Heidelberg.
[123] Li, X. Y., Tian, P. and Leung, S. C. H. (2008). An ant colony optimization metaheuristic hybridized with tabu search for open vehicle routing problems. Journal of the Operational Research Society, 60(7), 1012-1025.
[124] Liao, X.-L., Chien, C.-H. and Ting, C.-K. (2014). A genetic algorithm for the minimum latency pickup and delivery problem.
[125] Lin, C., Choy, K. L., Ho, G. T. S., Chung, S. H. and Lam, H. Y. (2014). Survey of Green Vehicle Routing Problem: Past and future trends. Expert Systems with Applications, 41(4, Part 1), 1118-1138.
[126] Lin, S.-W., Yu, V. F. and Chou, S.-Y. (2009). Solving the truck and trailer routing problem based on a simulated annealing heuristic. Computers &; Operations Research, 36(5), 1683-1692.
[127] Liu, F. H. and Shen, S. Y. (1999). The Fleet Size and Mix Vehicle Routing Problem with Time Windows. Journal of the Operational Research Society, 50(7), 721-732.
[128] Liu, R. and Jiang, Z. (2012). The close–open mixed vehicle routing problem. European Journal of Operational Research, 220(2), 349-360.
[129] Marinakis, Y. and Marinaki, M. (2012). A hybrid particle swarm optimization algorithm for the open vehicle routing problem. in: M. Dorigo, et al. (Ed.), ANTS 2012, Lecture Notes in Computer Science,Springer-Verlag, Berlin, Heidelberg, 7461, 180-187.
[130] Marinakis, Y. and Marinaki, M. (2014). A Bumble Bees Mating Optimization algorithm for the Open Vehicle Routing Problem. Swarm and Evolutionary Computation, 15(0), 80-94.
[131] Melachrinoudis, E., Ilhan, A. B. and Min, H. (2007). A dial-a-ride problem for client transportation in a health-care organization. Computers &; Operations Research, 34(3), 742-759.
[132] Mendoza, J. E., Castanier, B., Guéret, C., Medaglia, A. L. and Velasco, N. (2010). A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands. Computers &; Operations Research, 37(11), 1886-1898.
[133] Meng, L. and Guo, X. (2008). A new hybrid metaheuristics for the vehicle routing problem with simultaneous pick-up and delivery (Vol. 1). Service Operations and Logistics, and Informatics, IEEE/SOLI 2008. IEEE International Conference.
[134] Mi, C., Masrur, M. A. and Gao, D. W. (2011). Plug-in Hybrid Electric Vehicles Hybrid Electric Vehicles (pp. 107-138): John Wiley &; Sons, Ltd.
[135] Min, H. K. (1989). The multiple vehicle routing problem with simultaneous delivery pickup points. Transportation Research Part A-Policy and Practice, 23(5), 377-386.
[136] Mingozzi, A., Giorgi, S. and Baldacci, R. (1999). An Exact Method for the Vehicle Routing Problem with Backhauls. Transportation Science, 33(3), 315-329.
[137] MirHassani, S. A. and Abolghasemi, N. (2011). A particle swarm optimization algorithm for open vehicle routing problem. Expert Systems with Applications, 38(9), 11547-11551.
[138] Montané, F. A. T. and Galvão, R. D. (2006). A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Computers &; Operations Research, 33(3), 595-619.
[139] Montoya, A., Guéret, C., Mendoza, J. E. and Villegas, J. G. (2014). A modified multi-space sampling heuristic for the green vehicle routing problem. Technical Report LARIS - EA 7315 - Université d’Angers.
[140] Moreno, L., de Aragão, M. P. and Uchoa, E. (2010). Improved lower bounds for the Split Delivery Vehicle Routing Problem. Operations Research Letters, 38(4), 302-306.
[141] Muyldermans, L. and Pang, G. (2010). On the benefits of co-collection: Experiments with a multi-compartment vehicle routing algorithm. European Journal of Operational Research, 206(1), 93-103.
[142] Nagy, G. and Salhi, S. d. (2005). Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. European Journal of Operational Research, 162(1), 126-141.
[143] Norouzi, N., Tavakkoli-Moghaddam, R., Ghazanfari, M., Alinaghian, M. and Salamatbakhsh, A. (2012). A New Multi-objective Competitive Open Vehicle Routing Problem Solved by Particle Swarm Optimization. Networks and Spatial Economics, 12(4), 609-633.
[144] Ochi, L., Vianna, D., Drummond, L. A. and Victor, A. (1998a). An evolutionary hybrid metaheuristic for solving the vehicle routing problem with heterogeneous fleet. In W. Banzhaf, R. Poli, M. Schoenauer &; T. Fogarty (Eds.), Genetic Programming (Vol. 1391, pp. 187-195): Springer Berlin Heidelberg.
[145] Ochi, L., Vianna, D., Drummond, L. A. and Victor, A. (1998b). A parallel evolutionary algorithm for the vehicle routing problem with heterogeneous fleet. In J. Rolim (Ed.), Parallel and Distributed Processing (Vol. 1388, pp. 216-224): Springer Berlin Heidelberg.
[146] Olivera, A. and Viera, O. (2007). Solving the vehicle routing problem with multiple trips by adaptive memory programming. International Journal of Logistics Systems and Management, 3(4), 440-450.
[147] Osaba, E., Onieva, E., Diaz, F., Carballedo, R., Lopez, P. and Perallos, A. (2015). An Asymmetric Multiple Traveling Salesman Problem with Backhauls to Solve a Dial-a-Ride problem. 2015 IEEE 13th International Symposium on Applied Machine Intelligence and Informatics.
[148] Osman, I. H. and Salhi., S. (1996). Local search strategies for the vehicle fleet mix problem. In V.J. Rayward-Smith, I.H. Osman, C.R. Reeves, and G.D. Smith, editors, Modern Heuristic Search Methods, Wiley: Chichester, 131-153.
[149] Osman, I. H. and Wassan, N. A. (2002). A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls. Journal of Scheduling, 5(4), 263-285.
[150] Palhazi Cuervo, D., Goos, P., Sörensen, K. and Arráiz, E. (2014). An iterated local search algorithm for the vehicle routing problem with backhauls. European Journal of Operational Research, 237(2), 454-464.
[151] Pan, L. and Fu, Z. (2009). A clonal selection algorithm for open vehicle routing problem. WGEC, 2009, Genetic and Evolutionary Computing, International Conference on, Genetic and Evolutionary Computing, International Conference on 2009, 786-790.
[152] Parragh, S. N., Doerner, K. F. and Hartl, R. F. (2006). A survey on pickup and delivery models Part II: Transportation between pickup and delivery locations. Working paper, Chair of Production and Operations Management, University of Vienna.
[153] Parragh, S. N., Doerner, K. F. and Hartl, R. F. (2010). Variable neighborhood search for the dial-a-ride problem. Computers &; Operations Research, 37(6), 1129-1138. doi: 10.1016/j.cor.2009.10.003
[154] Penna, P., Subramanian, A. and Ochi, L. (2013). An iterated local search heuristic for the heterogeneous fleet vehicle routing problem. Journal of Heuristics, 19(2), 201-232.
[155] Pessoa, A., Uchoa, E. and Poggi de Aragão, M. (2009). A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem. Networks, 54(4), 167-177.
[156] Petch, R. J. and Salhi, S. (2003). A multi-phase constructive heuristic for the vehicle routing problem with multiple trips. Discrete Applied Mathematics, 133(1–3), 69-92.
[157] Pichpibul, T. and Kawtummachai, R. (2012). A modified savings heuristic for the close-open mixed vehicle routing problem. Paper presented at the Proceedings of the Asia Pacific Industrial Engineering &; Management Systems Conference.
[158] Pichpibul, T. and Kawtummachai, R. (2013). New best solutions for the close-open mixed vehicle routing problem by using an improved harmony search algorithm. Paper presented at the Asian Conference on Information Systems.
[159] Pillac, V., Gendreau, M., Guéret, C. and Medaglia, A. L. (2013). A review of dynamic vehicle routing problems. European Journal of Operational Research, 225(1), 1-11.
[160] Pisinger, D. and Ropke, S. (2007). A general heuristic for vehicle routing problems. Computers &; Operations Research, 34(8), 2403-2435.
[161] Potvin, J. Y. and Naud, M. A. (2011). Tabu search with ejection chains for the vehicle routing problem with private fleet and common carrier. Journal of the Operational Research Society, 62(2), 326-336.
[162] Potvin, J. Y. and Rousseau, J. M. (1992). Constrained-directed search for the advance request dial-a-ride problem with service quality constraints. In: Balci O, Shrada R, Zenios ZA (eds.) Computer Science and Operations Research: New Developments in Their Interfaces. Pergamon Press, Oxford, 457-474.
[163] Prins, C. (2009). Two memetic algorithms for heterogeneous fleet vehicle routing problems. Engineering Applications of Artificial Intelligence, 22(6), 916-928.
[164] Psaraftis, H. N. (1980). A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem. Transportation Science, 14(2), 130-154.
[165] Raff, S. (1983). Routing and scheduling of vehicles and crews: The state of the art. Computers &; Operations Research, 10(2), 63-211.
[166] Ran, L., Zhibin, J., Hongtao, H. and Shiqing, Y. (2010). A Memetic Algorithm for the Close-open Mixed Vehicle Routing Problem. 2010 IEEE International Conference on Industrial Engineering &; Engineering Management (IE&;EM 2010), 728-732.
[167] Reed, M., Yiannakou, A. and Evering, R. (2014). An ant colony algorithm for the multi-compartment vehicle routing problem. Applied Soft Computing, 15, 169-176.
[168] Reinholz, A. and Schneider, H. (2013). A hybrid (1+1)-evolutionary strategy for the open vehicle routing problem. in: L. Di Gaspero, et al. (Eds.), Advances in Metaheuristics Operations Research Computer Science Interfaces Series, 53, 127–141.
[169] Rekiek, B., Delchambre, A. and Saleh, H. A. (2006). Handicapped Person Transportation: An application of the Grouping Genetic Algorithm. Engineering Applications of Artificial Intelligence, 19(5), 511-520.
[170] Renaud, J. and Boctor, F. F. (2002). A sweep-based algorithm for the fleet size and mix vehicle routing problem. European Journal of Operational Research, 140(3), 618-628.
[171] Repoussis, P. P., Tarantilis, C. D., Bräysy, O. and Ioannou, G. (2010). A hybrid evolution strategy for the open vehicle routing problem. Computers &; Operations Research, 37(3), 443-455.
[172] Ropke, S. and Pisinger, D. (2006). A unified heuristic for a large class of Vehicle Routing Problems with Backhauls. European Journal of Operational Research, 171(3), 750-775.
[173] Ruland, K. S. and Rodin, E. Y. (1997). The pickup and delivery problem: Faces and branch-and-cut algorithm. Computers &; Mathematics with Applications, 33(12), 1-13.
[174] Salhi, S. and Nagy, G. (1999). A Cluster Insertion Heuristic for Single and Multiple Depot Vehicle Routing Problems with Backhauling. The Journal of the Operational Research Society, 50(10), 1034-1042.
[175] Salhi, S. and Petch, R. J. (2007). A GA Based Heuristic for the Vehicle Routing Problem with Multiple Trips. Journal of Mathematical Modelling and Algorithms, 6(4), 591-613.
[176] Salhi, S. and Rand, G. K. (1993). Incorporating vehicle routing into the vehicle fleet composition problem. European Journal of Operational Research, 66(3), 313-330.
[177] Sariklis, D. and Powell, S. (2000). A heuristic method for the open vehicle routing problem. Journal of the Operational Research Society, 51(5), 564-573.
[178] Savelsbergh, M. W. P. (1995). The general pickup and delivery problem. Transportation Science, 29(1), 17-29.
[179] Sbihi, A. and Eglese, R. (2007). Combinatorial optimization and Green Logistics. 4OR, 5(2), 99-116.
[180] Scheuerer, S. (2006). A tabu search heuristic for the truck and trailer routing problem. Computers &; Operations Research, 33(4), 894-909.
[181] Schneider, M., Stenger, A. and Goeke, D. (2014). The Electric Vehicle-Routing Problem with Time Windows and Recharging Stations. Transportation Science, 48(4), 500-520.
[182] Schneider, M., Stenger, A. and Hof, J. (2015). An adaptive VNS algorithm for vehicle routing problems with intermediate stops. OR Spectrum, 37(2), 353-387.
[183] Schonfeld, P. and Ying, L. (2007). A rejected-reinsertion heuristic for the static Dial-A-Ride Problem. Transportation Research, Part B (Methodological), 41(7), 736-755. doi: 10.1016/j.trb.2007.02.003
[184] Schrage, L. (1981). Formulation and structure of more complex/realistic routing and scheduling problems. Networks, 11(2), 229-232.
[185] Sedighpour, M., Ahmadi, V., Yousefikhoshbakht, M., Didehvar, F. and Rahmati, F. (2014). Solving the open vehicle routing problem by a hybrid ant colony optimization. Kuwait Journal of Science, 41(3), 139-162.
[186] Sexton, T. R. and Choi, Y.-M. (1986). Pickup and Delivery of Partial Loads with “Soft” Time Windows. American Journal of Mathematical and Management Sciences, 6(3-4), 369-398.
[187] Shamshirband, S., Shojafar, M., Hosseinabadi, A. and Abraham, A. (2015). OVRP_ICA: An Imperialist-Based Optimization Algorithm for the Open Vehicle Routing Problem. In E. Onieva, I. Santos, E. Osaba, H. Quintián &; E. Corchado (Eds.), Hybrid Artificial Intelligent Systems (Vol. 9121, pp. 221-233): Springer International Publishing.
[188] Silva, M. M., Subramanian, A. and Ochi, L. S. (2015). An iterated local search heuristic for the split delivery vehicle routing problem. Computers &; Operations Research, 53(0), 234-249.
[189] Soonpracha, K., Mungwattana, A., Janssens, G. K. and Manisri, T. (2014). Heterogeneous VRP review and conceptual framework. International MultiConference of Engineers and Computer Scientists (IMECS). Proceedings, 1052-1059.
[190] Stein, D. M. (1978). Scheduling dial-a-ride transportation systems. Transportation Science, 12(3), 232-249.
[191] Subramanian, A., Penna, P. H. V., Uchoa, E. and Ochi, L. S. (2012). A hybrid algorithm for the Heterogeneous Fleet Vehicle Routing Problem. European Journal of Operational Research, 221(2), 285-295.
[192] Subramanian, A., Uchoa, E. and Ochi, L. S. (2013). A hybrid algorithm for a class of vehicle routing problems. Computers &; Operations Research, 40(10), 2519-2531.
[193] Taillard, E. D. (1999). A heuristic column generation method for the heterogeneous fleet VRP. RAIRO - Operations Research, 33(1), 1-14.
[194] Taillard, E. D., Laporte, G. and Gendreau, M. (1996). Vehicle Routeing with Multiple Use of Vehicles. The Journal of the Operational Research Society, 47(8), 1065-1070.
[195] Tarantilis, C. D., Diakoulaki, D. and Kiranoudis, C. T. (2004). Combination of geographical information system and efficient routing algorithms for real life distribution operations. European Journal of Operational Research, 152(2), 437-453.
[196] Tarantilis, C. D., Ioannou, G., Kiranoudis, C. T. and Prastacos, G. P. (2004). Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm. Journal of the Operational Research Society, 56(5), 588-596.
[197] Tarantilis, C. D., Ioannou, G., Kiranoudis, C. T. and Prastacos, G. P. (2004). A threshold accepting approach to the Open Vehicle Routing problem. RAIRO-Operational Research, 38(4), 345-360.
[198] Tarantilis, C. D., Kiranoudis, C. T. and Vassiliadis, V. S. (2003). A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. Journal of the Operational Research Society, 54(1), 65-71.
[199] Tarantilis, C. D., Kiranoudis, C. T. and Vassiliadis, V. S. (2004). A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. European Journal of Operational Research, 152(1), 148-158.
[200] Tarantilis, C. D., Zachariadis, E. E. and Kiranoudis, C. T. (2008). A hybrid guided local search for the vehicle-routing problem with intermediate replenishment facilities. Informs Journal on Computing, 20(1), 154-168.
[201] Tavakkoli-Moghaddam, R., Saremi, A. R. and Ziaee, M. S. (2006). A memetic algorithm for a vehicle routing problem with backhauls. Applied Mathematics and Computation, 181(2), 1049-1060.
[202] Teodorovic, D., Krcmar-Nozic, E. and Pavkovic, G. (1995). The mixed fleet stochastic vehicle routing problem. Transportation Planning and Technology, 19(1), 31-43.
[203] Tiwari, A. and Chang, P.-C. (2015). A block recombination approach to solve green vehicle routing problem. International Journal of Production Economics, 164(0), 379-387.
[204] Toth, P. and Vigo, D. (1996a). Fast Local Search Algorithms for the Handicapped Persons Transportation Problem. In I. Osman &; J. Kelly (Eds.), Meta-Heuristics (pp. 677-690): Springer US.
[205] Toth, P. and Vigo, D. (1996b). A Heuristic Algorithm for the Vehicle Routing Problem with Backhauls. In L. Bianco &; P. Toth (Eds.), Advanced Methods in Transportation Analysis (pp. 585-608): Springer Berlin Heidelberg.
[206] Toth, P. and Vigo, D. (1997a). An Exact Algorithm for the Vehicle Routing Problem with Backhauls. Transportation Science, 31(4), 372-385.
[207] Toth, P. and Vigo, D. (1997b). Heuristic Algorithms for the Handicapped Persons Transportation Problem. Transportation Science, 31(1), 60-71. doi: doi:10.1287/trsc.31.1.60
[208] Toth, P. and Vigo, D. (1999). A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls. European Journal of Operational Research, 113(3), 528-543.
[209] Uchimura, K., Saitoh, T. and Takahashi, H. (1999). The dial-a-ride problem in a public transit system. Electronics and Communications in Japan (Part III: Fundamental Electronic Science), 82(7), 30-38.
[210] Van der Bruggen, L. J. J., Lenstra, J. K. and Schuur, P. C. (1993). Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows. Transportation Science, 27(3), 298-311.
[211] Villegas, J. G., Prins, C., Prodhon, C., Medaglia, A. L. and Velasco, N. (2011). A GRASP with evolutionary path relinking for the truck and trailer routing problem. Computers &; Operations Research, 38(9), 1319-1334.
[212] Villegas, J. G., Prins, C., Prodhon, C., Medaglia, A. L. and Velasco, N. (2013). A matheuristic for the truck and trailer routing problem. European Journal of Operational Research, 230(2), 231-244.
[213] Vogel, D. R. and Wetherbe, J. C. (1984). MIS research: A profile of leading journals and universities. SIGMIS Database, 16(1), 3-14.
[214] Wade, A. and Salhi, S. (2003). An Ant System Algorithm for the Mixed Vehicle Routing Problem with Backhauls Metaheuristics: Computer Decision-Making (Vol. 86, pp. 699-719): Springer US.
[215] Wade, A. and Salhi, S. (2004). An ant system algorithm for the mixed vehicle routing problem with backhauls. In M. G. C. Resende &; J. P. DeSousa (Eds.), Metaheuristics: Computer Decision-Making (Vol. 86, pp. 699-719).
[216] Wade, A. C. and Salhi, S. (2002). An investigation into a new class of vehicle routing problem with backhauls. Omega, 30(6), 479-487.
[217] Wang, W., Wu, B., Zhao, Y. and Feng, D. (2006). Particle swarm optimization for open vehicle routing problem. in: D.-S. Huang, K. Li, G.W. Irwin (Eds.), ICIC 2006, Lecture Notes in Artificial Intelligence, 4114, 999-1007.
[218] Wassan, N. (2006). Reactive tabu adaptive memory programming search for the vehicle routing problem with backhauls. Journal of the Operational Research Society, 58(12), 1630-1641.
[219] Wassan, N., Nagy, G. and Ahmadi, S. (2008). A heuristic method for the vehicle routing problem with mixed deliveries and pickups. Journal of Scheduling, 11(2), 149-161.
[220] Wassan, N. A. and Osman, I. H. (2002). Tabu Search Variants for the Mix Fleet Vehicle Routing Problem. The Journal of the Operational Research Society, 53(7), 768-782.
[221] Wilck IV, J. H. and Cavalier, T. M. (2012). A Genetic Algorithm for the Split Delivery Vehicle Routing Problem. American Journal of Operations Research, 2(2), 10.
[222] Wilson, H., Sussman, J., Wang, H. and Higonnet, B. (1971). Scheduling algorithms for dial-a-ride system. Tech. Rep. USL TR-70-13, Urban Systms Laboratory, MIT, Cambridge, MA.
[223] Wilson, N. and Weissburg, H. (1967). Advanced dial-a-ride algorithms research project: Final report. CTS Report R76-20, Department of Civil Engineering, MIT, Cambridge, MA.
[224] Xiang, Z., Chu, C. and Chen, H. (2006). A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints. European Journal of Operational Research, 174(2), 1117-1139.
[225] Xiong, Y., Gulczynski, D., Kleitman, D., Golden, B. and Wasil, E. (2013). A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts. Optimization Letters, 7(7), 1597-1609.
[226] Yaman, H. (2006). Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing Problem. Mathematical Programming, 106(2), 365-390.
[227] Yousefikhoshbakht, M., Didehvar, F. and Rahmati, F. (2014). A combination of modified tabu search and elite ant system to solve the vehicle routing problem with simultaneous pickup and delivery. Journal of Industrial and Production Engineering, 31(2), 65-75.
[228] Zachariadis, E. E. and Kiranoudis, C. T. (2010). An open vehicle routing problem metaheuristic for examining wide solution neighborhoods. Computers &; Operations Research, 37(4), 712-723.
[229] Zachariadis, E. E. and Kiranoudis, C. T. (2011). A local search metaheuristic algorithm for the vehicle routing problem with simultaneous pick-ups and deliveries. Expert Systems with Applications, 38(3), 2717-2726.
[230] Zachariadis, E. E. and Kiranoudis, C. T. (2012). An effective local search approach for the Vehicle Routing Problem with Backhauls. Expert Systems with Applications, 39(3), 3174-3184.
[231] Zachariadis, E. E., Tarantilis, C. D. and Kiranoudis, C. T. (2009). A hybrid metaheuristic algorithm for the vehicle routing problem with simultaneous delivery and pick-up service. Expert Systems with Applications, 36(2, Part 1), 1070-1081.
[232] Zachariadis, E. E., Tarantilis, C. D. and Kiranoudis, C. T. (2010). An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries. European Journal of Operational Research, 202(2), 401-411.
[233] Zhao, Y. W., Zhang, J. L. and Peng, D. J. (2010). Open Vehicle Routing Problem using quantum evolutionary algorithm. Advanced Materials Research, 102-104, 807-812.
[234] 尤彥皓. (2007). 一個新的以群聚概念為基礎的蟻群最佳化技術用於車輛途程問題之研究. (碩士論文), 國立屏東科技大學資訊管理研究所.[235] 尤燕祺. (2005). 螞蟻演算法求解車輛路線問題之研究. (碩士論文), 中華大學科技管理研究所.[236] 王生德. (2004). 以巨集啟發式方法求解時窗限制回程取貨車輛路線問題(VRPBTW)之研究. (碩士論文), 中華大學科技管理研究所.[237] 王春鎰. (2007). 混合演化巨集啟發式解法應用於具時間窗車輛路線問題之研究. (碩士論文), 國立交通大學運輸科技與管理研究所.[238] 王培鈺. (2010). 顧客生產率固定及儲存空間有限下之週期性車輛途程問題. (碩士論文), 國立東華大學運籌管理研究所.[239] 王暢湘. (2006). 多場站多車種車輛路線問題之巨集啟發式演算法研究. (碩士論文), 中華大學科技管理研究所.[240] 王獻大. (2008). 含時窗限制之多趟次途程規劃問題. (碩士論文), 國立東華大學全球運籌管理研究所.[241] 古順文. (2004). 中油公司油罐車輛途程問題之研究. (碩士論文), 樹德科技大學資訊管理研究所.[242] 申生元. (1999). 時窗限制車輛途程問題. (博士論文), 國立交通大學工業工程與管理所.[243] 危基瑪. (2014). 以模擬退火法求解具容量限制之混合動力車輛途程問題. (碩士論文), 國立臺灣科技大學工業管理研究所.[244] 朱佑旌. (2006). 巨集啟發式方法應用於時窗限制多車種回程取貨車輛路線問題之研究. (碩士論文), 中華大學科技管理研究所.[245] 朱經武, 劉曄 , 洪秀幸. (2004). 同時考慮以自有車輛收送貨或委託貨運公司服務之啟發式演算法. 海運學報, 13, 147-162.
[246] 朱經武, 鄭超元 and 洪秀幸. (2005). 選擇以自有車輛運送或委託貨運公司服務之啟發式演算法. 航運季刊, 14(1), 87-100.[247] 何孟潔. (2012). 考慮時窗限制及可分拆運送的城市內依時性之車輛途程規劃. (碩士論文), 國立東華大學運籌管理研究所.[248] 何宗育. (2007). 車種接駁補貨車輛途程問題. (碩士論文), 國立中央大學土木工程研究所.[249] 何昆諭. (2005). 以巨集啟發式解法求解時間窗車輛路線問題. (碩士論文), 國立交通大學運輸科技與管理研究所.[250] 何明蔚. (2011). 產品碳足跡盤查之最佳化車輛途程問題. (碩士論文), 明新科技大學工業工程與管理研究所.[251] 何秉珊. (2008). 道路緊急搶修車輛途程問題之研究. (碩士論文), 國立中央大學土木工程研究所.[252] 吳志仁. (2003). 一般化卡車拖車路線問題. (碩士論文), 國立交通大學運輸科技與管理研究所.[253] 吳宗祐. (2008). 改良型螞蟻演算法結合模擬退火法於車輛途程問題之應用. (碩士論文), 華梵大學資訊管理研究所.[254] 吳宗勳. (2012). 多車種固定車隊車輛路線問題之啟發式解法研究. (碩士論文), 國立交通大學運輸與物流管理研究所.[255] 吳致昀. (2000). 多車次車輛路線問題之研究. (碩士論文), 國立成功大學工業管理研究所.[256] 吳泰熙, 陳正芳, 徐俊誠. (2003). 含取貨之車輛途程問題解法之研究. 工業工程學刊, 20(6), 651-665.[257] 吳泰億. (2006). 以修正之拉式鬆弛法之啟發式解法求解車輛路線問題. (碩士論文), 國立交通大學運輸科技與管理研究所.[258] 吳啟綸. (2011). 螞蟻記憶系統結合鄰域搜尋法應用於車輛途程問題. (碩士論文), 逢甲大學運輸科技與管理研究所.[259] 吳善哲. (2015). 兼具自有與委外之車輛路線問題：巨集啟發式方法之研究. (碩士論文), 國立交通大學運輸與物流管理研究所.
[260] 李玉雯. (2000). 軟性時窗限制下醫院運輸部門車輛途程問題之研究. (碩士論文), 國立成功大學工業管理研究所.[261] 李沛盈. (2008). 多趟次多車種途程問題之研究. (碩士論文), 國立東華大學全球運籌管理研究所.[262] 李佳珊. (2008). 可同時進行分割與多趟次收配送的最佳規劃. (碩士論文), 國立高雄第一科技大學運籌管理研究所.[263] 李其霖. (2007). 考慮時間窗限制之卡車拖車路線問題. (碩士論文), 國立成功大學工業與資訊管理所.[264] 李孟澤. (2008). 結合平行基因演算法與蟻群最佳化應用於具時窗限制之車輛途程問題. (碩士論文), 國立臺中技術學院事業經營研究所.[265] 李宗儒. (2011). 時窗限制下補貨點接駁補貨之車輛途程問題-同時考量收送貨進行. (碩士論文), 國立雲林科技大學工業工程與管理研究所.[266] 李俊穎. (2004). 以禁忌搜尋法求解週期性車輛途程問題. (碩士論文), 大同大學資訊經營學研究所.[267] 李洪鑫. (2000). 含時間窗車輛途程問題各演算法適用範圍之探討. (碩士論文), 東海大學工業工程研究所.[268] 李盈鋒. (2010). 在考量尖峰時間下之同時收送貨的車輛途程問題. (碩士論文), 國立雲林科技大學全球運籌管理研究所.[269] 李首清. (2013). 運用基因演算法探討限制條件下的車輛途程規劃—以國內一家食品公司為實證分析對象. (碩士論文), 國立屏東科技大學資訊管理系所.[270] 李泰琳, 張靖. (2008). 應用時窗分割與整數化策略簡化時窗收卸貨問題之研究. 運輸學刊, 20(3), 313 - 350.[271] 李泰琳, 張靖. (2010). 調適型導引螞蟻演算法求解時窗收卸貨問題之研究. 運輸計劃季刊, 39(1), 99 - 132.[272] 李健銘. (2010). 多趟次車輛途程問題與物流中心區位選擇之探討. (碩士論文), 國立雲林科技大學工業工程與管理研究所.[273] 卓裕仁. (2001). 以巨集啟發式方法求解多車種與週期性車輛路線問題之研究. (博士論文), 國立交通大學運輸科技與管理研究所.[274] 卓裕仁, 王生德. (2003). 回程取貨車輛路線問題(VRPB)之解法回顧. Paper presented at the 中華民國運輸學會第十八屆論文研討會.
[275] 卓裕仁, 朱佑旌. (2008). 兩階段回溯式門檻接受法求解時窗限制回程取貨車輛路線問題之研究. 運輸計劃季刊, 37(4), 405 - 429.[276] 周偉禮, 朱經武. (2006). 以啟發式演算法求解單一場站多車種同時收送貨之車輛途程問題. 航運季刊, 15(3), 63-88.[277] 周淑蓉. (2004). 以群聚及禁制搜尋法求解含時窗限制之車輛巡迴路線問題. (碩士論文), 朝陽科技大學資訊管理研究所.[278] 周韻佳. (2007). 具時間窗限制提送貨問題之研究. (碩士論文), 國立交通大學運輸科技與管理研究所.[279] 林大傑, 賴敬棠, 蕭秀姮, 吳啟綸. (2010). 螞蟻記憶系統應用於車輛途程問題. 交通信息與安全, 28(5), P50-52, 57.
[280] 林佑昇. (2006). 結合遺傳演算法與螞蟻演算法求解車輛途程問題. (碩士論文), 立德大學應用資訊研究所.[281] 林孝禹. (2014). 以變動鄰域搜尋法求解可調式多載具之車輛途程問題. (碩士論文), 國立臺灣科技大學工業管理研究所.[282] 林志勳. (2008). 連續補貨點接駁車輛路線問題之研究. (碩士論文), 中華大學運輸科技與物流管理研究所.[283] 林志興. (2010). 單一物流中心含時窗限制車輛途程問題模式之空間分析. (碩士論文), 元智大學工業工程與管理研究所.[284] 林佳鴻. (2005). 智慧型撥召公車預約派遣模式之研究. (碩士論文), 中華大學科技管理研究所.[285] 林依潔. (2003). 整合模糊理論與螞蟻演算法於含時窗限制之車輛途程問題. (碩士論文), 國立台北科技大學生產系統工程與管理研究所.[286] 林欣誼. (2007). 結合自有車隊與委外貨運的車輛路線問題. (碩士論文), 國立交通大學運輸與物流管理研究所.[287] 林建宏. (2009). 每日需求變異下考慮人員分區之多趟次車輛途程問題. (碩士論文), 國立雲林科技大學全球運籌管理研究所.[288] 林美吟. (2004). 可同時收送貨物網路下車輛巡行與收送計畫的多期排程. (碩士論文), 國立高雄第一科技大學運輸倉儲營運所.[289] 林致瑄. (2015). 應用PSO求解多艙種車輛路線問題. (碩士論文), 國立交通大學運輸與物流管理研究所.[290] 林修禾. (2012). 越庫環境考量下之收送貨車輛途程問題. (碩士論文), 國立雲林科技大學全球運籌管理研究所.[291] 林書銘. (1996). 塔布搜尋法於含時窗與裝載限制車輛途程問題解算之研究. (碩士論文), 元智大學工業工程研究所.[292] 林惠民. (2002). 具時窗之多趟次車輛途程問題. (碩士論文), 元智大學資訊管理學研究所.[293] 林韵函. (2012). 以粒子群最佳化演算法求解具時間窗之開放式車輛途程問題. (碩士論文), 國立臺灣科技大學工業管理所.[294] 林德禮. (2003). 分群遺傳演算法求解車輛途程問題之研究. (碩士論文), 華梵大學工業管理研究所.[295] 林應豪. (2013). 以分區方式探討車輛途程問題-以中部某瓦斯分裝場為例. (碩士論文), 國立雲林科技大學工業工程與管理研究所.[296] 林耀銘. (2008). 供應鏈中具越庫作業的車輛途程問題. (碩士論文), 國立臺灣科技大學工業管理所.[297] 邱仕銘. (2006). 同時收送貨車輛配送問題之研究. (碩士論文), 長榮大學經營管理研究所.[298] 胡智維. (2013). 粒子群演算法應用於多車種固定車隊之車輛途程問題. (碩士論文), 元智大學工業工程與管理研究所.[299] 胥挺峰. (2012). 具顧客時窗限制與駕駛員休息規定之車輛途程問題之研究. (碩士論文), 國立交通大學工業工程與管理研究所.[300] 夏承永. (2003). 以遺傳演算法求解多車種多倉庫之車輛途程問題. (碩士論文), 國立清華大學工業工程與工程管理研究所.[301] 夏祖文. (2007). 應用模擬退火法於限制性經費之車輛途程問題. (碩士論文), 華梵大學資訊管理研究所.[302] 徐俊誠. (2000). 車輛途程含取貨問題解法之研究. (碩士論文), 大葉大學工業工程研究所.[303] 殷敏修. (2007). 應用基因演算法求解卡車拖車途程問題. (碩士論文), 國立高雄第一科技大學運籌管理所.[304] 殷德成. (1998). 以禁制搜尋法求解多車種車輛路線問題. (碩士論文), 國立國防大學資源管理研究所.[305] 涂紓瑜, 賴淑娟, 黎燕萍. (2001). 時間限制VRP之應用研究─以網路訂購便當之配送車隊排程為例. (畢業專題報告), 中華大學交通與物流管理學系.
[306] 涂慧敏. (2004). 週期性車輛排程問題之研究. (碩士論文), 大同大學資訊經營學研究所.[307] 馬凱賢. (2007). 結合區域搜尋之遺傳演算法求解多車種之車輛途程問題. (碩士論文), 國立暨南國際大學土木工程研究所.[308] 高世昌. (2002). 考量同時送貨及收貨之多場站車輛途程問題. (碩士論文), 逢甲大學工業工程學所.[309] 高秀梅. (2003). 蟻群最佳化演算法於時窗限制之車輛途程問題的研究. (碩士論文), 元智大學工業工程與管理研究所.[310] 高秉裕. (2013). 探討整合生產排程及車輛途程規劃的總成本最小化問題. (碩士論文), 國立雲林科技大學工業工程與管理研究所.[311] 高啟銘. (2012). 應用門檻接受法求解具時窗限制撥召服務問題之研究. (碩士論文), 中華大學運輸科技與物流管理學系.[312] 高崇明. (2005). 多場站車輛路線問題巨集啟發式方法之研究. (碩士論文), 中華大學科技管理研究所.[313] 張廷吉. (2000). 考慮派車時段與載重均衡之車輛途程規劃問題. (碩士論文), 逢甲大學工業工程研究所.[314] 張志榮. (2000). 整合自有車隊或選擇貨運公司服務與車輛運送路線問題之研究. (碩士論文), 國立海洋大學航運管理學研究所.[315] 張怡凡. (2012). 離散型細菌演算法解容量限制車輛途程問題. (碩士論文), 大同大學資訊經營學研究所.[316] 張哲旗. (2009). 以混合啟發式演算法求解具模糊時窗限制車輛途程問題. (碩士論文), 龍華科技大學商學與管理研究所.[317] 張哲維. (2006). 修正禁忌搜尋法求解週期性車輛途程問題. (碩士論文), 國立東華大學企業管理研究所.[318] 張祖明. (1994). 多車種車輛路線問題啟發式解法之研究. (碩士論文), 國立交通大學土木工程研究所.[319] 張耘翠. (2006). 指定點接駁車輛路線問題之構建與解法研究. (碩士論文), 中華大學科技管理研究所.[320] 張凱惠. (2008). 整合多場站收送貨車輛途程問題與委託貨運公司. (碩士論文), 國立臺灣海洋大學系統工程暨造船所.[321] 張寶豐. (2003). 以複合啟發式演算法求解時窗限制車輛途程問題. (碩士論文), 中原大學工業工程研究所.[322] 敖君瑋. (1999). 禁制搜尋法於軟性時窗限制之車輛途程問題研究. (碩士論文), 元智大學工業工程研究所.[323] 曹祐菘. (2013). 應用基因演算法以解決最小碳足跡之依時可選擇路徑之多車種車輛途程問題. (碩士論文), 國立交通大學工業工程與管理系所.[324] 莊政杰. (2013). 在考量尖峰時間下具時窗限制之多趟次車輛途程問題. (碩士論文), 國立雲林科技大學工業工程與管理研究所.[325] 莊英群. (2003). 應用禁忌搜尋法於混合送收貨之車輛途程問題. (碩士論文), 逢甲大學工業工程學所.[326] 許丞博. (2010). 以修正之拉氏鬆弛啟發式解法求解包含委外運輸之車輛路線問題. (碩士論文), 國立交通大學運輸與物流管理研究所.[327] 許秀瑜. (2006). 含取送貨之多目標車輛途程規劃. (碩士論文), 國立屏東科技大學工業管理研究所.[328] 許秋文. (2005). 應用行產生法求解多場站多趟次車輛巡迴路徑問題之研究. (碩士論文), 國立清華大學工業工程與工程管理研究所.[329] 許哲斌. (2008). 在需求變動下具有軟時窗限制之同時收送貨車輛途程問題. (碩士論文), 國立雲林科技大學工業工程與管理研究所.[330] 許家筠. (2008). 時窗限制虛擬場站接駁補貨車輛途程問題之研究. (碩士論文), 國立中央大學.[331] 許珮慈. (2012). 運用基因演算法求解同時收送貨之車輛路線問題之研究. (碩士論文), 國立交通大學運輸與物流管理研究所.[332] 許淙竣. (2013). 運用標籤機制求解具有時窗限制及容量限制之車輛途程問題. (碩士論文), 明志科技大學工業工程與管理研究所.[333] 許富雄. (2005). 以模擬退火法結合區域搜索法應用於載重限制車輛途程問題. (碩士論文), 華梵大學資訊管理研究所.[334] 許雅雯. (2006). 應用啟發式方法求解多車種多溫共配車輛路線問題. (碩士論文), 中華大學運輸科技與物流管理研究所.[335] 郭佳林. (2005). 求解具時間窗之多趟次車輛途程問題. (碩士論文), 國立交通大學運輸科技與管理研究所.[336] 郭維凌. (1999). 負載變動與需求分割條件下車輛途程問題之研究. (碩士論文), 中華大學工業工程與管理研究所.[337] 陳正元. (1992). 節省法與路線間交換改善法在車輛路線問題(VRP)上之應用. (碩士論文), 國立交通大學土木工程研究所.[338] 陳百傑. (2002). 以啟發式演算法求解時窗限制車輛途程問題. (碩士論文), 中原大學工業工程研究所.[339] 陳宏昇. (206). 以模擬退火演算法求解時間視窗限制車輛途程問題. (碩士論文), 華梵大學資訊管理研究所.[340] 陳志峰. (1996). 車輛多次載運排程問題之研究. (碩士論文), 國立成功大學交通管理科學研究所.[341] 陳每. (2011). 混合式粒子群最佳化演算法解容量限制車輛途程問題. (碩士論文), 大同大學資訊經營學研究所.[342] 陳坤賓. (1998). 模擬退火演算法應用於車輛途程問題之研究. (碩士論文), 元智大學工業工程研究所.[343] 陳宛吟. (2013). 以混合塔布搜尋法求解變動週期車輛途程問題. (碩士論文), 國立臺灣科技大學工業管理研究所.[344] 陳怡菁. (2011). 考慮同時收送貨之自有車與委外貨運的車輛途程問題. (碩士論文), 國立雲林科技大學工業工程管理研究所.[345] 陳俊傑. (2004). 使用種子導引的蟻拓分群優化法求解車輛途程問題. (碩士論文), 元智大學工業工程與管理研究所.[346] 陳信宏. (2001). 考慮回程撿收之設施位址-車輛途程問題演算法之研究. (碩士論文), 大葉大學工業工程研究所.[347] 陳冠宇. (2008). 以密度分群概念為基礎的螞蟻群聚系統技術應用於車輛途程問題. (碩士論文), 國立屏東科技大學資訊管理研究所.[348] 陳勇霖. (2014). 考量產品時效成本整合生產排序與車輛途程規劃的總 成本最小化問題. (碩士論文), 國立雲林科技大學工業工程與管理研究所.[349] 陳契伸. (2001). 硬性/軟性時窗限制之車輛途程問題研究. (碩士論文), 中原大學工業工程研究所.[350] 陳建廷. (2005). 有限資源與分割配送條件下之模糊時窗配送策略研究. (碩士論文), 國立雲林科技大學工業工程管理研究所.
[351] 陳建甫. (2006). 以基因搜尋法求解多桶格車輛途程問題. (碩士論文), 南台科技大學工業管理研究所.[352] 陳致元. (2001). 單一物流中心車輛途程問題求解模式之空間分析研究. (碩士論文), 國立臺灣大學地理環境資源學研究所.[353] 陳家和. (2002). 網路購物商品配送車輛途程問題之研究. (碩士論文), 長榮大學經營管理研究所.[354] 陳啟文. (2007). 應用導引式區域搜尋法求解車輛路線問題之研究. (碩士論文), 中華大學運輸科技與物流管理所.[355] 陳勝男. (1996). 禁忌搜尋法應用於車輛路線問題之研究. (碩士論文), 大葉工學院工業工程研究所.[356] 陳惠國, 林奕隆, 王宣. (2013). 應用修正式蜂群最佳化演算法求解撥召問題－以復康巴士問題為例. 運輸學刊, 25(3), 279 - 308.[357] 陳暉陵. (2013). 以蟻拓優化演算法及遺傳演算法求解價選式多車場車輛途程問題. (碩士論文), 國立臺灣大學工業工程學研究所.[358] 喻奉天, 林宗漢, 盧宗成. (2011). 應用蟻群系統求解卡車與拖車途程問題. 運輸學刊, 23(2), 199-218.[359] 彭冠儒. (2002). 考量同時送貨及收貨之車輛途程問題. (碩士論文), 逢甲大學工業工程學所.[360] 曾俊傑. (1991). 撥召公車路線設計之研究. (碩士論文交通運輸工程研究所), 國立交通大學.[361] 曾維豪. (2000). 軟性時窗與回程撿收之車輛途程問題研究. (碩士論文), 元智大學工業工程研究所.[362] 游世民. (1998). 結合車輛途程問題（VRP）及配銷需求規劃（DRP）之配銷管理模式. (碩士論文), 大葉大學工業工程研究所.[363] 游政偉. (2007). 變動鄰域搜尋法於車輛路線問題之應用與測試分析. (碩士論文), 中華大學運輸科技與物流管理所.
[364] 游珮暄. (2013). 復康巴士場站區位之最佳化研究. (碩士論文), 國立臺灣大學土木工程學研究所.[365] 游進俊. (1992). 靜態撥召服務問題啟發式解法之研究. (碩士論文), 國立交通大學土木工程研究所.[366] 黃小芬. (2005). 考慮有限巡行距離下之混合收、送貨車輛途程問題. (碩士論文), 國立雲林科技大學工業工程與管理研究所.[367] 黃文秀. (2008). 分群式螞蟻演算法求解車輛途程問題─預拌混凝土配送管理為例. (碩士論文), 立德大學資訊傳播研究所.[368] 黃正賢. (2001). 時間相依且軟性時窗限制下之車輛途程問題研究. (碩士論文), 元智大學工業工程研究所.[369] 黃至穩. (2008). 多重補貨點接駁車輛路線問題之研究. (碩士論文), 中華大學運輸科技與物流管理研究所.[370] 黃保源. (2006). 類電磁理論演算法於求解多場站車輛路徑排程問題之研究. (碩士論文), 義守大學工業工程管理研究所.[371] 黃信翔. (2006). 解決具時間窗限制的提送貨問題. (碩士論文), 國立交通大學運輸科技與管理研究所.[372] 黃信穎. (2005). 同時處理收貨與送貨業務之配送路線規劃. (碩士論文), 立德大學應用資訊研究所.[373] 黃冠雄. (2002). 時效導向的娃娃車接送之車輛途程問題---以禁忌搜尋法求解. (碩士論文), 國立中正大學數學研究所.[374] 黃勇智. (2002). 多車種接駁配送車輛途程規劃之研究. (碩士論文), 中華大學科技管理研究所.[375] 黃柏揚. (2013). 利用巨網機制結合回溯式門檻接受法求解中繼補貨站車輛路線問題之研究. (碩士論文), 國立交通大學運輸科技與管理研究所.[376] 黃翊婷. (2012). 混合式螞蟻演算法解容量限制車輛途程問題. (碩士論文), 大同大學資訊經營學研究所.[377] 黃聖峰. (1999). 考量回程撿收之車輛途程問題研究. (碩士論文), 大葉大學工業工程研究所.[378] 黃漢瑄. (2006). 撥召服務最佳化指派作業之研究. (碩士論文), 淡江大學運輸管理研究所.[379] 黃慧如. (2014). 具彈性運送量之提前送貨週期性車輛途程問題. (碩士論文), 國立雲林科技大學工業工程與管理研究所.[380] 黃瓊萱. (2007). 多場站具時窗限制並配合外包策略之車輛路線問題探討. (碩士論文), 國立東華大學全球運籌管理研究所.[381] 楊文欣. (2013). 軟時窗限制下考量裝載重量影響燃料消耗之多車種車輛途程規劃. (碩士論文), 國立雲林科技大學工業工程與管理研究所.[382] 楊承堯. (2009). 資料包絡分析法應用於基因演算法求解具時間窗收送貨車輛路線問題之績效評估. (碩士論文), 國立高雄第一科技大學運籌管理所.[383] 楊明仁, 李秋緣, 張力允, 呂聰輝, 林詩偉, 李仁鐘. (2012). 模擬退火法結合禁忌搜尋演算法求解協同配送問題. 華岡工程學報(29), 121-129.[384] 楊建志. (2010). 撥召公車問題之探討－應用於非營利組織. (碩士論文), 國立清華大學工業工程與工程管理研究所.[385] 楊雅裴. (2005). 使用改良式遺傳演算法求解車輛途程問題. (碩士論文), 立德大學應用資訊研究所.
[386] 楊馥豪. (2006). 時窗限制下混合收送貨之配送路線規劃. (碩士論文), 立德大學應用資訊研究所.[387] 萬紘杰. (2007). 載運乘客時允許車輛暫停等待之撥召公車問題. (碩士論文工業工程與工程管理研究所), 國立清華大學.[388] 葉珮婷. (2008). 應用變數產生法求解有時間窗限制的收送貨問題. (碩士論文), 國立交通大學運輸科技與管理研究所.[389] 鄒育銓. (2010). 可調式多載具的車輛途程問題之研究. (碩士論文), 國立臺灣科技大學工業管理研究所.[390] 廖亮富. (1998). 含時窗限制多部車車輛途程問題解算之研究. (碩士論文), 元智大學工業工程研究所.[391] 廖昱傑. (2007). 應用可回溯式門檻接受法結合GENIUS求解VRP問題之研究. (碩士論文), 國立交通大學運輸科技與管理研究所.[392] 熊碩成. (2001). 以實驗設計改善時窗限制下物流中心車輛途程問題之研究. (碩士論文), 國立國防大學源管理研究所.[393] 趙致傑. (2011). 以適應性門檻接受法求解同時收送貨之車輛路線問題之研究. (碩士論文), 國立交通大學運輸與物流管理研究所.[394] 趙敏樺. (2012). 求解車輛途程問題的仿水流演算法. (碩士論文), 國立臺灣大學工業工程學研究所.[395] 劉又逢. (2010). 考量分批送貨之多車種車輛途程問題. (碩士論文), 國立雲林科技大學工業工程與管理研究所.[396] 劉玉滿. (2008). 連鎖披薩店物流中心車輛路線問題之探討. (碩士論文), 國立南台科技大學行銷與流通管理研究所.[397] 劉芸希. (2013). 接駁式轉運環境下具同時收送貨之車輛途程問題. (碩士論文), 國立雲林科技大學工業工程與管理研究所.[398] 劉建宏. (2005). 含時窗限制式卡車與拖車途程問題之研究. (碩士論文), 國立中央大學土木工程研究所.[399] 劉雅魁. (1998). 運用路線鄰域法求解車輛路線含回程取貨問題. (碩士論文), 國立國防大學資源管理研究所.[400] 劉瑋佑. (2010). 以萬用啟發式演算法求解車輛途程問題. (碩士論文), 華梵大學資訊管理研究所.[401] 劉曄. (2005). 整合同時收送貨與選擇貨運公司服務之車輛途程問題. (碩士論文), 國立臺灣海洋大學航運管理研究所.[402] 劉選泓. (2010). 二階供應鏈聯合補貨策略下週期性車輛途程問題之規劃. (碩士論文), 國立雲林科技大學工業工程與管理研究所.[403] 劉繼仁. (2012). 一個以車輛途程規劃為基礎之綠色物流配送計劃方法之發展. (碩士論文), 國立中央大學企業管理研究所.[404] 蔡玉晶. (2004). 以複合啟發式演算法求解硬式時窗限制下車輛途程問題. (碩士論文), 中原大學工業工程研究所.[405] 鄧全斌. (2015). 應用迭代區域搜尋法求解混合封閉與開放車輛路線問題. (碩士論文), 國立交通大學運輸與物流管理研究所.[406] 鄧宗倫. (2010). 應用人工智慧法於最佳消毒作業之時窗限制車輛途程問題. (碩士論文), 國立虎尾科技大學工業工程與管理研究所.[407] 鄭佳琳. (2007). 結合門檻接受法與螞蟻演算法於求解車輛路線問題之研究. (碩士論文), 中華大學運輸科技與物流管理所.[408] 鄭雁嬬. (2009). 混合式演算法應用於同時收送貨之車輛途程問題. (碩士論文), 元智大學工業工程與管理學系.[409] 黎逸欣. (2003). 結合模糊理論及車輛途程問題於供應鏈配銷系統. (碩士論文), 國立雲林科技大學工業工程與管理研究所.[410] 駱景堯, 盧柏翔, 李宜軒. (2009). 考慮混合分批送貨和取貨之車輛途程問題數學模式建構. 先進工程學刊, 4(3), 239-241.[411] 謝君強. (2011). 考量人員分區與同時收送之車輛途程問題. (碩士論文), 國立雲林科技大學工業工程與管理研究所.[412] 謝宛汝. (2011). 汽車貨運業者車輛資源不足之車輛途程規劃及業務委外評選模式. (碩士論文), 國立政治大學資訊管理研究所.[413] 韓復華, 方建皓, 朱佑旌. (2014). 以重置門檻接受法求解多車種固定車隊車輛路線問題之研究. 運輸學刊, 26(3), 411 - 433.[414] 韓復華, 朱佑旌. (2011). 需求分割之車輛路線問題啟發式解法研究: 行政院國家科學委員會專題研究計畫 NSC 99-2221-E-009-089-
[415] 韓復華, 呂泓儒, 朱佑旌. (2011). 以改良型回溯門檻接受法求解回程取貨車輛路線問題之研究. 運輸計劃季刊, 40(2), 213-232.[416] 韓復華, 卓裕仁. (1996). 門檻接受法、噪音擾動法與搜尋空間平滑法在車輛路線問題之應用研究與比較分析. 運輸學刊, 9(3), p113-143.[417] 韓復華, 卓裕仁. (2002). 包容性深廣度搜尋法在週期性車輛路線問題之應用. 運輸計劃季刊, 31(1), 1-35.[418] 韓復華, 陳仲豪. (2010). 應用時窗離散策略與可回溯式門檻接受法求解VRPBTW問題之研究. 運輸學刊, 22(3), 285-306.[419] 韓復華, 楊智凱, 卓裕仁. (1997). 應用門檻接受法求解車輛路線問題之研究. 運輸計劃季刊, 26(2), p253-280.[420] 韓復華, 楊禮瑛. (2013). 應用粒子群演算法求解開放式車輛路線問題之研究. 運輸學刊, 25(2), 199-220.[421] 簡世釗. (2001). 時窗與容量限制下車輛途程問題之研究. (碩士論文), 國立成功大學工業管理研究所.[422] 簡銓蔚. (2013). 粒子群演算法應用於具容量限制的開放式車輛途程問題. (碩士論文), 元智大學工業工程與管理學研究所.[423] 顏成佑. (2000). 基因演算法解算軟性時窗車輛途程問題之研究. (碩士論文), 元智大學工業工程研究所.[424] 魏宗徹. (2001). 整合時窗限制與回程撿收之多車種車輛途程問題. (碩士論文), 元智大學工業工程研究所.[425] 魏健宏, 王穆衡, 蔡欽同, 辛孟鑫. (2007). 臺北市復康巴士路線規劃問題之研究. 運輸學刊, 19(3), 301-332.[426] 羅敏華. (2003). 蟻群最佳化演算法於載重限制之車輛途程問題的研究. (碩士論文), 元智大學工業工程與管理研究所.[427] 饒怡莊. (2000). 應用地理資訊系統於車輛途程問題之研究. (碩士論文), 元智大學工業工程研究所.