Kapasite Kısıtlı Araç Rotalama Problemi İçin Metasezgisel Yöntemler: Bilimsel Yazın Taraması

Yıl 2014, Cilt: 19 Sayı: 4, 337 - 355, 01.12.2014

  yusuf Şahin Prof.dr.abdullah Eroğlu

Öz

The vehicle routing problem is a popular NP-Hard class combinatorial optimization problem. Some constraints as capacity and time can be added to the problem to make it compatible with the real life application. It is very difficult to solve this problem for large real-life data sets in polynomial time using exact solution methods. The exact solution methods can solve only small instances of the problem. Because of this feature, to get near optimal solutions in acceptable CPU times, heuristics and metaheuristcs methods are widely used in recent years. A great many of heuristics methods have been proposed in the literature for solving Capacitated Vehicle Routing Problem by this time. In this paper, we have conducted a literature review about metaheuristcs and their application to the capacitated vehicle routing problem

Anahtar Kelimeler

-

KAPASİTE KISITLI ARAÇ ROTALAMA PROBLEMİ İÇİN METASEZGİSEL YÖNTEMLER: BİLİMSEL YAZIN TARAMASI

Öz

Araç rotalama problemi popüler bir NP-Zor sınıfı bütünleşik optimizasyon problemidir. Problemin gerçek yaşam ile uyumlu hale gelmesi için kapasite ve zaman gibi kısıtlar probleme eklenebilir. Büyük boyutlu gerçek yaşam veri setleri için kesin çözüm yöntemleri kullanılarak bu problemin polinom zamanda çözümü oldukça zordur. Kesin çözüm yöntemleri problemin sadece küçük boyutlu örneklerini çözebilmektir. Bu özelliği nedeniyle, optimale yakın çözümlerin kabul edilebilir bir hesap süresinde sağlanabilmesi için sezgisel ve metasezgisel yöntemler son yıllarda yaygın olarak kullanılmaktadır. Bugüne kadar kapasiteli araç rotalama probleminin çözümü yönelik olarak literatürde çok sayıda çözüm yöntemi önerilmiştir. Bu çalışmada, metasezgisel yöntemler ve bunların kapasiteli araç rotalama problemine uygulanışı hakkında bir literatür araştırması yapılmıştır

Anahtar Kelimeler

Kapasiteli Araç Rotalama, Sezgisel Yöntemler

Kaynakça

• AKDAĞLI, A., GÜNEY, K., KARABOĞA, D. (2002). "Karınca Koloni Optimizasyon Algoritması Kullanarak Faz Kontrolü ile Doğrusal Anten Dizi Diyagramında Sıfırların Üretilmesi.", Elektrik-Elektronik-Bilgisayar Mühendisliği Sempozyumu (ELECO’2002), 175-180, Bursa.
• ALABAS USLU, Ç., DENGĠZ, B., (2011). "A self-adaptive local search algorithm for the classical vehicle routing problem.", Expert System Application, 38 (7): 8990-8998.
• ALBA, E., DORRONSORO, B., (2005). ―The Exploration/Exploitation Tradeoff in Dynamic Cellular Genetic Algorithms.", IEEE, Transactions on Evolutionary Computation, 9, 26-142.
• ALVARENGA, G. B., MATEUS, G. R., DE TOMĠ, G., (2007). "A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows.", Computers and Operations Research, 34: 1561–1584, 2007.
• ARCHETTĠ, C., SAVELSBERGH, M., SPERANZA, M., (2006). "Worst-case analysis for split delivery vehicle routing problems", Transportation Science, 40 (2), 226–234.
• AZĠ, N., GENDREAU, M., POTVĠN, J.Y., (2007). "An exact algorithm for a single-vehicle routing problem with time windows and multiple routes.", European Journal of Operational Research 178 (3): 755–766.
• BAKER B.M., AYECHEW M.A. (2003). "A genetic algorithm for the vehicle routing problem.", Computers & Operations Research 30: 787–800.
• BAKER, B.M., CARRETO, C.A.C., (2003). "A visual interactive approach to vehicle ruting problem", Computers & Operational Research, 30: 321-337.
• BALDACCĠ, R.; TOTH, P.; VĠGO, D., (2007). ―Recent advances in vehicle routing exact algorithms‖. 4OR, 5, (4): 269-298.
• BALDACCĠ, R.; TOTH, P.; VĠGO, D., (2010). ―Exact algorithms for routing problems under vehicle capacity constraints.‖, Annals of Operations Research 175 (1): 213- 245.
• BARBAROSOGLU, G., OZGUR, D., (1999). " A tabu search algorithm for the vehicle routing problem", Computers and Operations Research, 26 (3): 255-270.
• BELL, J.E., MCMULLEN, P.R., (2004). "Ant colony optimization techniques for the vehicle routing problem‖, Advanced Engineering Informatics, 18, 41–48.
• BENSLIMANE, M.T., BENADADA, Y., (2013). "Ant colony algorithm for the multidepot vehicle routing problem in large quantities by a heterogeneous fleet of vehicles", INFOR: Information Systems and Operational Research, 51 (1): 31-40.
• BIN, Y., ZHONG-ZHENA, Y., BAOZHEN, Y., (2009). " An improved ant colony optimization for vehicle routing problem.", European Journal of Operational Research, 196, 171–176.
• BLUM, C., ROLI, A., (2003). "Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison.", ACM Computing Surveys, 35 (3): 268–308.
• BORTFELDT, A., (2012). "A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints.", Computers & Operations Research, 39, 2248-2257.
• BRANDÃO, J., (2004). "A tabu search heuristic algorithm for open vehicle routing problem.", European Journal of Operational Research, 157: 552–564.
• BRAYSY, O., GENDREAU, M., (2005). "Vehicle routing problem with time windows, part I: Route construction and local search algorithms", Transportation Science, 39 (1): 104 – 118.
• CALVETEA, H.I., GALÉB, C., OLĠVEROSC, M.J., SÁNCHEZ-VALVERDEB, B., (2007). "A goal programming approach to vehicle routing problems with soft time windows.", European Journal of Operational Research, 177 (3): 1720–1733.
• CHEN, P., HUANG, H.K., DONG, X.Y, (2010). " Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem", Expert Systems with Applications: An International Journal, 37 (2): 1620-1627.
• CHRISTOFIDES, N., MINGOZZI, A., AND TOTH, P. (1979), "The vehicle routing problem", (Edt) N. Christofides, A. Mingozzi, P. Toth and C. Sandi, Combinatorial Optimization, Wiley, Chichester, 315-338.
• CLARKE, G. & WRIGHT, J.W., (1964)."Scheduling of Vehicles from a Central Depot to a Number of Delivery Points", Operations Research, 12, 568-581.
• COLORNI A., DORIGO M., MANIEZZO V., MUZIO L., (1994). Il sistema formiche applicato al problema dell'assegnamento quadratico. Technical Report No. 34-058, Politechnico di Milano, Italy.
• CORDEAU, J.F., GENDREAU, M., HERTZ, A., LAPORTE, G., SORMANY, J.S., (2004). "New heuristics for the vehicle routing problem.", Technical Report G- 2004-33, GERAD, Montreal, Canada.
• CORDEAU, J.-F.; LAPORTE, G. (2005). Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search‖, Kluwer, Boston, 2005, ch. New heuristics for the Vehicle Routing Problem, pp. 145-163.
• ÇAVUġOĞLU, M.A., KARAKUZU,, C., ġAHĠN, S., (2010). ―Parçacık Sürü Optimizasyonu Algoritması ile Yapay Sinir Ağı Eğitiminin FPGA Üzerinde Donanımsal Gerçeklenmesi‖, Politeknik Dergisi, 13 (2), 83-92.
• ÇETĠN, S., GENCER, C., (2010). "Kesin zaman Pencereli - EĢ Zamanlı Dağıtım Toplamalı Araç Rotalama Problemi: Matematiksel Model", Gazi Üniversitesi Mühendislik ve Mimarlık Fakültesi Dergisi, 25 (3): 579-585.
• ÇEVĠK, K.K., KOÇER, H.E., (2013). Parçacık Sürü Optimizasyonu ile Yapay Sinir Ağları Eğitimine Dayalı Bir Esnek Hesaplama Uygulaması. Süleyman Demirel Üniversitesi Fen Bilimleri Enstitüsü Dergisi, 17 (2), 39-45.
• DANESHZAND, F. (2011). ―The Vehicle-Routing Problem‖, (Ed.) R. Z. Farahani, S. Rezapour & Laleh Kardar, Logistics Operations and Management Concepts and Models (pp. 127-145), Elsevier Insights London, U.K.
• DANTZĠG, G.B., RAMSER, J.M. (1959). ―The truck dispatching problem‖, Management Science, 6, 81–91.
• DEN BESTEN, M. STÜTZLE, T., DORIGO, M., (1999). "Scheduling single machines by ants.", Technical Report IRIDIA/99-16, Universit´e Libre de Bruxelles, Belgium.
• DERIGS, U., KAISER R., (2007). "Applying the attribute based hill climber heuristic to the vehicle routing problem.", Eur J Oper Res, 177 (2):719-732.
• DOERNER, K. F., HARTL, R. F., KIECHLE, G., LUCKA, M., REIMANN, M., (2004). "Parallel ant systems for the capacitated Vehicle Routing Problem", Evolutionary Computation in Combinatorial Optimization, 3004, 72-83.
• DORĠGO, M., (1992). "Optimization, Learning and Natural Algorithms", (in Italian). Ph.D. thesis, Dipartimento di Elettronica, Politecnico di Milano, Italy.
• DORIGO, M., MANIEZZO, V., COLORNI, A., (1991). ―Positive Feedback as a Search Strategy‖, Technical Report N. 91-016, Politecnico di Milano.
• DROR,M., LAPORTE, G., TRUDEAU, P., (1994). "Vehicle routing with split deliveries", Discrete Applied Mathematics, 50 (3): 2239-254.
• DU, L., HE, R., (2012). "Combining Nearest Neighbor Search with Tabu Search for LargeScale Vehicle Routing Problem", Physics Procedia, 25, 1536–1546.
• DÜZAKIN, E., DEMĠRCĠOĞLU, M., (2009). " Araç Rotalama Problemleri ve Çözüm Yöntemleri", Ç.Ü. Ġktisadi ve Ġdari Bilimler Fakültesi Dergisi, 13, (1): 68-87.
• EL HASSANĠ, A.J., BOUHAFS, L., KOUKAM, A., (2008). ―A Hybrid Ant Colony System Approach for the Capacitated Vehicle Routing Problem and the Capacitated Vehicle Routing Problem with Time Windows‖, (Ed) Tonci Caric & Hrvoje Gold, Vehicle Routing Problem (pp. 59-70). I-Tech Education and Publishing KG, Vienna, Austria.
• FARMER, J.D., PACKARD, N.H., PERELSON, A.S., (1986).‖The Immune System, Adaptation, and Machine Learning.‖, Physica, 22D, 187-204.
• FRIZZELL, P.W., GĠFFĠN, J.W., (1995)."The Split Delivery Vehicle Scheduling Problem with Time Windows and Grid Network Distance". Computers and Operations Research, 22, 655-667.
• FUELLERER, G., DOERNER, K.F., HARTL, R.F., (2009). "Ant colony optimization for the two-dimensional loading vehicle routing problem", Computers and Operations Research, 36 (3): 655-673.
• GAMBARDELLA L.M, DORĠGO M., (1995). "Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem", Twelfth International Conference on Machine Learning, (Ed) A. Prieditis and S. Russell, Morgan Kaufmann, 252- 260.
• GAMBARDELLA L.M, DORĠGO M., (1996). "Solving Symmetric and Asymmetric TSPs by Ant Colonies.", ICEC96, Proceedings of the IEEE Conference on Evolutionary Computation, Nagoya, Japan, May 20-22.
• GAMBARDELLA, M., T AĠLLARD, E. D., DORĠGO, M., (1999). "Ant Colonies for the QAP. Journal of the Operational Research Society (JORS), 50, 167-176.
• GANESH, K., NARENDRAN, T.T., (2007). " CLOVES: A cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up", European Journal of Operational Research, 178 (3): 699–717.
• GEN, M., CHENG, R., (1997), "Genetic Algorithms and Engineering Design", John Wiley & Sons, Inc., USA.
• GENDERAU, M., GUERTĠN, F., POTVĠN, J.Y., SEGUĠN, R., (2006). "Neighborhood Search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries.", Transport Research Part C, 14, 157-174.
• GENDREAU, M., HERTZ, A., LAPORTE, G., (1994). "A Tabu Search Heuristics for the Vehicle Routing Problem", Management Science, l276–l1290.
• GENDREAU, M.; LAPORTE, G.; SEMET, J.-Y. (2002). ―The Vehicle Routing Problem‖, (Ed) Toth, P., Vigo, D., The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia, pp. 1–26.
• GENDREAU, M.; POTVĠN, J.-Y.; BRÄYSY, O.; HASLE, G.; LØKKETANGEN, A. ―The Vehicle Routing Problem: Latest Advances and New Challenges‖, Springer, 2008, ch. Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography, pp. 143-169.
• GILLETT, B., AND MILLER, L. (1974), "A heuristic algorithm for the vehicle dispatch problem", Operations Research, 22, 340-349.
• GLOVER F., MCMILLAN, C., (1986). ―The General Employee Scheduling Problem: An Integration of Management Science and Artificial Intelligence‖, Computers and Operations Research 13 (5): 563-593.
• GLOVER, F., LAGUNA, M., (1989), ―Tabu Search-Part I‖, ORSA Journal on Computing, 1 (3): 190-206.
• HAIMOVĠCH, M., RĠNNOOY KAN A. H. G., (1985). "Bounds and Heuristics for Capacitated Routing Problems", Mathematics of Operations Research, 10 (4): 527- 542.
• HO, S.C., HAUGLAND, D., (2004). "A tabu search heuristic for the vehicle routing problem with time windows and split deliveries", Computers & Operations Research, 31, 1947- 1964.
• HOLLAND, J.H., (1975). ―Adaptation in Natural and Artificial Systems‖, University of Michigan Press, Ann Arbor, MI.
• JASZKIEWICZ, A., ISHIBUCHI, H., ZHANG, Q., (2012). ―Multiobjective Memetic Algorithms", (Ed) F. Neri, C. Cotta, P. Moscato, Handbook of Memetic Algorithms, s. 201-217.
• JASZKIEWICZ, A., KOMINEK, P., (2003). "Genetic local search with distance preserving recombination operator for a vehicle routing problem", Meta-heuristics in combinatorial optimization, 151 (2): 352-364.
• JĠN, J., CRAĠNĠC, T.G., LØKKETANGEN, A., (2012). ―A parallel multi-neighborhood cooperative tabu search for capacitated vehicle routing problems‖, European Journal of Operational Research, 222, 441–451.
• KARABOĞA, D., (2005). ―An Idea Based on Honey Bee Swarm For Numerical Optimization‖, TR-06, Erciyes University, Engineering Faculty, Computer Engineering Faculty.
• KARABOĞA, D., (2011). Yapay Zekâ Optimizasyon Algoritmaları, GeniĢletilmiĢ 2. Basım, Nobel Yayın Dağıtım, ĠSTANBUL.
• KATOH, N., YANO, T., (2006). " An approximation algorithm for the pickup and delivery vehicle routing problem on trees.", Discrete Applied Mathematics, 154 (16), 2335– 2349.
• KE, L., FENG, Z., (2013). ―A two-phase metaheuristic for the cumulative capacitated vehicle routing problem‖, Computers & Operations Research, 40, 633–638.
• KENNEDY, J., EBERHART, C., (1995). ―Particle Swarm Optimization‖, Proc. of IEEE International Conference on Neural Network, Piscataway, NJ. s. 1942-1948
• KIRKPATRICK, S., GELATT C.D. JR., VECCI, M.P., (1983). ―Optimization by simulated annealing‖, Science, 220, (4598): 671–680.
• KULAK, O., YILMAZ, Ġ.O., GÜNTHER, H.O., (2005). ―Genetik Algoritma Esasli PCB Montaji Optimizasyonu‖, V. Ulusal Üretim AraĢtırmaları Sempozyumu, Ġstanbul Ticaret Üniversitesi, 25-27 Kasım 2005.
• KUO, Y., WANG, C.C., (2012). ―A variable neighborhood search for the multidepot vehicle routing problem with loading cost‖, Expert Systems with Applications, 39, 6949-6954.
• KYTÖJOKĠ, J., NUORTĠO, T., BRÄYSY, O., GENDREAU, M., (2007). ―An efficient variable neighborhood search heuristic for very large scale vehicle routing problems‖, Operations Research and Computers, 34, 2743–2757.
• LAPORTE G., (1992). ―The Vehicle Routing Problem: An overview of exact and approximate algorithms‖. European Journal of Operational Research, 59, 345 – 358.
• LAPORTE, G., (2007). "What you should know about the vehicle routing problem". Naval Research Logistics 54 (8): 811-819.
• LAPORTE, G., (2009). Fifty years of vehicle routing. Transportation Science 43 (4): 408- 416.
• LAPORTE, G., NOBERT, Y., (1987). ―Exact algorithms for the vehicle routing problem‖, Annals of Discrete Mathematics, 31, 147-184.
• LAPORTE, G., SEMET, F. (2002). ―Classical heuristics for the capacitated VRP‖, (Ed) Toth, P., Vigo, D., The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia, pp. 109–128.
• LEUNG, S.C. H., ZHENG, J., ZHANG, D., ZHOU, X., (2010). ―Simulated annealing for the vehicle routing problem with two-dimensional loading constraints‖, Flexible Services and Manufacturing Journal, 22 (1), 61-82.
• MANIEZZO, V., (1998). ―Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem‖, Technical report, CSR 98-1. C. L. in Scienze dell’Informazione, Universitá di Bologna, Italy.
• MANIEZZO, V., COLORNI, A., (1999), "The Ant System Applied to the Quadratic Assignment Problem. IEEE Trans. Knowledge and Data Engineering, 11 (5): 769 - 778.
• MARINAKIS, Y., MARINAKI, M., (2010). ―A Hybrid Genetic-Particle Swarm Optimization Algorithm for the Vehicle Routing Problem‖, Expert Systems with Application, 37, 1446-1455.
• MAZZEO, S., LOISEAU, I., (2004). ―An Ant Colony Algorithm for the Capacitated Vehicle Routing‖, Electronic Notes in Discrete Mathematics, 18, 181—186.
• MESTER, D., BRAYSY, O., (2007). ―Active-guided evolution strategies for large-scale capacitated vehicle routing problems‖, Computers & operations Research,34 (10): 2964-2975.
• MOGHADDAM, R. T., SAFAEĠ, N., KAH, M. M. O., RABBANĠ, M., (2007). ―A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing‖, Journal of the Franklin Institute, 344, (5): 406-425.
• MOSHEĠOVA, G., (1998). ―Vehicle routing with pick-up and delivery: tour-partitioning heuristics‖, Computers & Industrial Engineering, 34 (3): 669–684.
• NADDEF, D., RĠNALDĠ, G., (2002). ―The Vehicle Routing Problem‖, Monographs on Discrete Mathematics and Applications‖. (Ed) Toth, P., Vigo, D., The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia,, pp. 53-84.
• NAZĠF, H., LEE. L.S., (2012). ―Optimized crossover genetic algorithm for capacitated vehicle routing problem‖, Applied Mathematical Modeling, 36, 2110–2117.
• OSMAN, I.H., (1993). ―Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem‖, Annals of Operations Research 41, 421–451.
• QI, C., (2011). ―Application of Improved Discrete Particle Swarm Optimization in Logistics Distribution Routing Problem‖, Procedia Engineering, 15, 3673-3677.
• RALPHS, T. K. (2003). ―Parallel branch and cut for capacitated vehicle routing‖, Parallel Computing, 29, 607–629.
• REIMANN, M., DOERNER, K., AND HARTL, R.F. (2004). ―D-Ants: Savings based ants divide and conquer the vehicle routing problem‖, Computers & Operations Research, 31, 563 – 591.
• ROCHAT Y., TAILLARD E., (1995). "Probabilistic Diversification and Intensification in Local Search for Vehicle Routing.", Journal of Heuristics 1, 147-167.
• SHANGYAO, Y., CHĠ, C.J., TANG, C.H. (2006), ―Inter-city Bus Routing and Timetable Setting under Stochastic Demands,‖ Transportation Research, 40A, 572-586.
• STÜTZLE, T., DORĠGO, M., (1999a). "ACO Algorithms for the Traveling Salesman Problem.‖, (Ed) K. Miettinen, M.M. Makel a, P . Neittaanmaki, & J. Periaux, Evolutionary Algorithms in Engineering and Computer Science: Recent Advances in Genetic Algorithms, Evolution Strategies, Evolutionary Programming, Genetic Programming and Industrial Applications. John Wiley & Sons.
• STUTZLE, T., DORĠGO, M., (1999b). "ACO Algorithms for the Quadratic Assignment Problem.", (Ed) D. Corne, M. Dorigo, & F. Glover, New Ideas in Optimization. McGraw-Hill.
• STUTZLE, T., HOOS, H., (1998), ―MAX –MIN Ant System and Local Search for Combinatorial Optimization Problems‖ Pages 313–329 of: S.Voß, S. Martello, I.H. Osman, & C. Roucairol, Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Kluwer Academics, Boston.
• STUTZLE, T., HOOS, H., (2000), ―MAX-MIN ant system‖, Future Generation Computer Systems, 16(8), 889-914.
• SWĠHART, M. R., PAPASTAVROU, J. D., (1999). "A stochastic and dynamic model for the single-vehicle pick-up and delivery problem", European Journal of Operational Research, 114: 447–464.
• SZETO, W., WU, Y., HO, S.C., (2011). "An artificial bee colony algorithm for the capacitated vehicle routing problem", European Journal of Operational Research, 215, 126–135.
• ġAHĠN, Y., KULAK, O., (2013). ―Depo Operasyonlarının Planlanması Ġçin Genetik Algoritma Esaslı Modeller.‖, Uluslararası Alanya ĠĢletme Fakültesi Dergisi, 5,3, 141-153.
• TAĠLLARD, É. D., (1993). ―Parallel Iterative Search Methods for Vehicle Routing Problems‖, Networks, 23, 661-676.
• TAN, W.F., LEE, L.S., MAJĠD, Z.A., SEOW, H.V., (2012). ―Ant colony optimization for capacitated vehicle routing problem‖, J. Comput. Sci., 8: 846-852.
• TARANTILIS, C.D., KIRANOUDIS, C.T., (2002). ―Using a spatial decision support system for solving the vehicle routing problem‖, Information & Management, 39, 359–375.
• TARANTILIS C.D., IOANNOU, G., KIRANOUDIS, C.T., PRASDACOS, G.P., (2005). ―Solving the open vehicle routing problem via single parameter meta-heuristic algorithm‖, Journal of the Operational Research Society: 1–9.
• TARANTILIS, C.D., (2005). ―Solving the Vehicle Routing Problem with Adaptive Memory Programming Methodology.‖Computers & Operations Research, 32 (9): 2309–2327.
• TOTH, P., VIGO, D. (1998), ―Exact algorithms for vehicle routing‖, (Ed) Crainic, T., Laporte, G., Fleet Management and Logistics. Kluwer Academic, Boston, pp. 1– 31.
• TOTH, P., VIGO, D. (2002a), ―An overview of vehicle routing problems‖, (Ed) Toth, P., Vigo, D., The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia, pp. 1–26.
• TOTH, P., VIGO, D. (2002b), Branch-and-bound algorithms for the capacitated VRP‖ (Ed) Toth, P., Vigo, D., The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia, pp. 29–51.
• TUTUNCU, G.Y., CARRETO, A.C., BAKER, M.B., (2009). ―A Visual Interactive Approach to the Classical and Mixed Vehicle Routing Problems with Backhauls‖, Omega-International Journal Of Management Science , 37 (1): 138-154.
• WANG, C.H. LU, J.Z., (2009). ―A hybrid genetic algorithm that optimizes capacitated vehicle routing problems‖, J Expert Syst. Appl., 36 (2): 2921-2936.
• WASSAN, N.A., (2006). ―A reactive tabu search for the vehicle routing problem‖, Journal of the Operational Research Society, 57, 111- 116.
• XIAO, Z.; JIANG-QING, W., (2012). ―Hybrid Ant Algorithm and Applications for Vehicle Routing Problem‖, Physics Procedia, 25, 1892-1899.
• ZACHARĠADĠS, E.E., TARANTĠLĠS, C.D., KĠRANOUDĠS, C.T., (2009), ―A guided tabu search for the vehicle routing problem with two-dimensional loading constraints‖, European Journal of Operational Research, 195 (3): 729-743.
• ZENG, L., ONG, H.L., NG, K.M., (2005). ―An assignment-based local search method for solving vehicle routing problems‖, Asia-Pacific Journal of Operational Research, 22, 85–104.