öz GEZGİN SATICI PROBLEMİNİN ALT TUR ENGELLEME KISITLARININ OLUŞTURULMASI VE UZANTILARI Tolga Bektaş ENDÜSTRİ MÜHENDİSLİĞİ ANABİLİM DALI YÜKSEK LİSANS TEZİ Ankara, 2000 Kombinatoryel optimizasyon alanının en tanınmış ve en övülen problemi, şüphesiz Gezgin Satıcı Problemi'dir (GSP). GSP, temel olarak bir şehirden başlayıp tekrar aynı şehire dönmek zorunda olan bir gezgin için, her şehiri bir kere ziyaret etmesini sağlayacak eniyi turun bulunması olarak tanımlanabilir. GSP'nin önemli bir uzantısı, bir yerine m adet gezgin içeren, Çok Gezgin Satıcılı Problem'dir (m-gsp). GSP ve m-gsp'deki en büyük problem, alt turların engellenmesidir. GSP ve m-gsp'nin kesin çözüm yöntemleri, alt tur engelleme kısıtlarına dayalı, atama tabanlı tamsayılı doğrusal programlama modellerini kullanırlar. GSP için ilk defa alt tur engelleme kısıtlarını öneren, 1954'da Dantzig, Fulkerson ve Johnson olmuştur. Daha sonra, Miller, Tucker ve Zemlin (1960) (MTZ), yeni değişkenler kullanarak alternatif başka bir grup kısıt önermişlerdir. Bunu takiben, Desrochers ve Laporte (1991) (DL), MTZ alt tur engelleme kısıtlarının daha da sıkılaştırılarak iyileştirilebileceklerini göstermişlerdir. m-gsp için bu alandaki çalışmalar daha kısıtlıdır ve bu problem için alt tur engelleme kısıtları, sadece Svestka ve Huckfeldt (1976) ve Sipahioğlu (1996) tarafından önerilmiştir. Bilgisayar yazılım ve donanım teknolojisindeki hızlı gelişme, matematiksel modellerin kesin çözümlerinin kolay ve etkin bir şekilde bulunmasına imkan vermiştir. Bu bağlamda, bu çalışma GSP ve m-gsp'nin atama tabanlı tamsayılı doğrusal karar modellerinin bir optimizasyon paket programı kullanarak, doğrudan çözümlerinin bulunmasını esas almaktadır. Çalışmada, GSP ve m-gsp'nin modelleme metodolojisine ağırlık verilerek, alt tur engelleme problemine mantıksal bir yaklaşım uygulanmıştır. Alt tur problemi çerçevesinde, alt turların oluşmasını engelleyen kısıtları türetmek için
zayıf ve kuvvetli mantıksal kısıtlamalar kullanılmıştır. Söz konusu kısıtlamalar, TSP ve m-gsp için kullanılmış ve sonuç olarak her durum için alt tur engelleme kısıtları oluşturulmuştur. Zayıf mantıksal kısıtlamaların GSP üzerinde uygulanması sonucunda elde edilen kısıtların, önceden deneysel olarak elde edilen MTZ kısıtlarıyla aynı olduğu görülmüştür. Kuvvetli mantıksal kısıtlamaların GSP üzerinde uygulanmasıyla ise, DL kısıtlarına erişilmiştir. Bu çalışma, bir yönüyle, ilgili kaynaklarda önerilen alt tur engelleme kısıtlarının doğrudan türetilme metodolojisini göstermektedir. Bu yaklaşım, aynı zamanda m-gsp üzerinde de uygulanmış ve sonuç olarak m-gsp için dört yeni model önerilmiştir. Bunlardan ilk üçü, düğüm potansiyeli ile yeni tanımlanan ve tur potansiyeli adı verilen değişkene dayanan modeller, sonuncusu ise önceden GSP için önerilmiş bir modelin m-gsp'ine uzantısıdır. Önerilen yeni m-gsp modelleri, varolanlarla birlikte, optimizasyon paket programı CPLEX 6.0 kullanılarak karşılaştırmalı analize tabi tutulmuştur. Analiz sonuçları, problemdeki gezgin sayısı arttıkça önerilen modelin diğerlerine olan üstünlüğünün arttığını göstermektedir. Anahtar kelimeler: Gezgin satıcı problemi, çok gezgin satıcılı problem, Alt tur engelleme kısıtları, tamsayılı doğrusal karar modeli, kesin çözüm.
ABSTRACT CONSTRUCTION OF THE SUBTOUR ELIMINATION CONSTRAINTS OF THE TRAVELING SALESMAN PROBLEM AND ITS EXTENSIONS Tolga Bektaş MASTER THESIS DEPARTMENT OF INDUSTRIAL ENGINEERING Ankara, 2000 The most famous and celebrated problem of the field of combinatorial optimization is with no doubt, the traveling salesman problem (TSP). The TSP is basically finding the shortest path for a salesman who has to visit each city exactly once and turn back to the city from which he starts. An important extension of TSP is the multiple traveling salesman problem (m-tsp), which considers m salesmen instead of one. The main problem for the TSP and the m-tsp is the subtour elimination. The exact solution methods of the TSP and the m-tsp mainly utilize assignment based integer linear programming (ILP) formulations which are based on subtour elimination constraints (SECs), i.e. constraints used to prevent the formation of subtours. Dantzig, Fulkerson and Johnson are one of the first to propose subtour elimination constraints in 1954 for the TSP. Later on, Miller, Tucker and Zemlin (1960) (MTZ) proposed an alternative formulation by introducing new variables. Following this, Desrochers and Laporte (1991) (DL) showed that the MTZ SECs could be strengthened using a lifting technique. The research on m-tsp is more limited and the subtour elimination constraints proposed for this problem are only due to Svestka and Huckfeldt (1976) and Sipahioglu(1996). The rapid development in computer software and hardware technology has given the opportunity to easily and effectively use exact solution methods for the solution of mathematical models. In this respect, this research considers assignment based ILP formulations of both TSP and m-tsp to be used for obtaining the solution of the problems directly, by means of optimization software. This work emphasizes
on the modelling methodology of the TSP and the m-tsp by using a logical approach on the subtour elimination problem. Weak and strong logical restrictions on the subtour problem are imposed to derive tight constraints prohibiting the formation of subtours. Each restriction is imposed on both the TSP and m-tsp and as a result, SECs are constructed for each case. The SECs obtained as a result of a weak logical restriction imposed on the TSP are observed to be the same as the MTZ SECs. In the case of strong logical restriction on the TSP, the previously proposed DL SECs are obtained. Part of this research demonstrates, in a sense, the way to directly derive the previously proposed SECs in the literature. The same logical approach is applied to the m-tsp as well and consequently, four new formulations for the m-tsp are proposed. The first three of the proposed formulations are based on node potentials and newly defined variables, called tour potentials. The last one is an extension of an ILP formulation previously proposed for the TSP. The new m-tsp formulations are compared with the existing ones using an optimization software CPLEX 6.0, in terms of computational efficiency. The results of the analysis show that the proposed formulation becomes superior to the existing ones as the number of salesman increase in the problem. Keywords: Traveling salesman problem, multiple traveling salesman problem, subtour elimination constraints, integer linear programming formulation, exact solution.
REFERENCES Ali, LA. and Kennington, J.L. (1986), "The Asymmetric M-Traveling Salesman Problem: a Duality Based Branch-and-Bound Algorithm", Discrete Appl. Math, 13, 259-276. Applegate, D., Bixby, R., Chvatal, V. and Cook, W. (1998), "On the Solution of Traveling Salesman Problems", Documenta Mathematica, Extra Volume ICM, III, 645-656. Applegate, D., Bixby, R., Chvatal, V. and Cook, W. (2000), "Annotated Bibliography of Work on the Solution of the Traveling Salesman Problem (TSP)", http://www.keck.caam.rice.edu/tsp/. Bellmore, M. And Nemhauser, G.L. (1968), "The Traveling Salesman Problem: a survey", Operations Research, 16, 538-558. Bellmore, M., Hong, S. (1974), "Transformation of Multisalesmen Problem to the Standard Traveling Salesman Problem", Journal of Association for Computing Machinery, 21 (3), 500-504. Bodin, L., Golden, B, Assad, A. and Ball, M. (1983), "Routing and Scheduling of Vehicles and Crews - The State of the Art", Computers and Operations Research, Special Issue. Dantzig, G.B., Fulkerson, D.R., Johnson, S.M. (1954), "Solution of a Large-Scale Traveling Salesman Problem", Operations Research, 2, 393-410. Desrochers, M., Laporte, G. (1991), "Improvements and Extensions to the Miller- Tucker-Zemlin Subtour Elimination Constraints", Operational Research Letters, 10, 27-36.
Fogel, D.B. (1990), "A Parallel Processing Approach to a Multiple Traveling Salesman Problem Using Evolutionary Programming", in: Proc. of the Fourth Annual Symposium on Parallel Processing, Fullerton, CA, 318-326. Gavish, B. (1976), "A Note on the Formulation of the m-salesman Traveling Salesman Problem", Management Science, 22 (6), 704-705. Gavish, B. and Graves, S.C. (1978), "The Traveling Salesman Problem and Related Problems", Working Paper GR-078-78, Operations Research Center, Massachusetts Institute of Technology. Gavish, B., Srikanth, K. (1986), "An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems", Operations Research, 34 (5), 698-717. Grefenstette, J., Ropal, R., Rosmaita, B.J., and Gucht, D. (1985), "Genetic Algorithms for the Traveling Salesman Problem", in Proc. Int. Conf. on Genetic Algorithms and their Appl., J.J. Grefenstette (ed.), Lawrence Erlbaum Associates, Hillsdale, NJ, 160-168. Gromicho, J., Paixao, J. and Bronco, I. (1992), "Exact Solution of Multiple Traveling Salesman Problems", in: Combinatorial Optimization (M. Akgül, ed.), NATO ASI Series, Vol. F 82, Springer-Verlag, Berlin, Heidelberg. Hoffman, K., and Padberg, M. (1999), "Traveling Salesman Problem", http://iris.gmu.edu/~khoffman/papers/trav_salesman.html/ Hong, S., and Padberg, M. W. (1977), "A Note on the Symmetric Multiple Traveling Salesman Problem with Fixed Charges", Operations Research, 25 (5), 871-874. Johnson, D.S., and McGeoch, L.A. (1997), "The Traveling Salesman Problem: A Case Study in Local Optimization", in: Local Search in Combinatorial Optimization (E.H.L. Aarts and J.K. Lenstra, eds.), John Wiley and Sons, London, 215-310. Jonker, R., Volgenant, T. (1988), "An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem", Operations Research, 36 (1), 163-167.
Jünger, M., Reinalt, G. and Rinaldi, G. (1994), "The Traveling Salesman Problem", in:, Handbook of Operations Research and Management Sciences: Networks (M. Ball, T. Magnanti, C.L. Monma and G.L. Nemhauser, eds.), North Holland. Kulkarni, R.V., Bhave, P.R. (1985), "Integer Programming Formulations of Vehicle Routing Problems", European Journal of Operational Research, 20, 58-67. Langevin, A., Soumis, F. and Desrosiers, J. (1990), "Classification of Traveling Salesman Problem Formulations", Operations Research Letters, 9, 127-132. Laporte, G. (1992), "The Traveling Salesman Problem: An Overview of Exact and Approximate Algorithms", European Journal of Operational Research, 59, 231-247. Laporte, G., Nobert, Y. (1980), "A Cutting Planes Algorithm for the m-salesmen Problem", Operational Research Quarterly, 31, 1017-1023. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (1985), The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley, Chichester. Miller, C.E., Tucker, A.W., Zemlin, R.A. (1960), "Integer Programming Formulation Traveling Salesman Problems", Journal of Association for Computing Machinery, 1, 326-329. Modares, A., Somhom, S., and Enkawa, T. (1999), "A Self-Organizing Neural Network Approach for Multiple Traveling Salesman and Vehicle Routing Problems", Intl. Trans. in Op. Res., 6, 591-606. Orloff, C.S. (1974), "Routing a Fleet of M Vehicles to/from a Central Facility", Networks, 4, 147-162.
Potvin, J. (1993), "The Traveling Salesman Problem: A Neural Network Perspective", ORSA Journal on Computing, 5 (4), 328-348. Rao, M. R. (1980), "A Note on the Multiple Traveling Salesmen Problem", Operations Research, 28 (3), 628-632. Reinelt, G. (1994), "The Traveling Salesman: Computational Solutions for TSP Applications", Springer-Verlag, Germany. Russell, R.A. (1977), "An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions", Operations Research, 25 (3), 517-524. Sipahioğlu, A. (1996), "Gezgin Satıcı ve Araç Turu Belirleme Problemleri için Yeni Alt Tur Engelleme Kısıtları", Ph.D. Thesis (in Turkish), Osmangazi University, Department of Industrial Engineering, Eskişehir, Türkiye. Somhom, S., Modares, A., and Enkawa, T. (1999), "Competition-based Neural Network for the Multiple Traveling Salesmen Problem with Minmax Objective", Computers and Operations Research, 26, 395-407. Svestka, J.A., Huckfeldt, V.E. (1973), "Computational Experience with an m-salesman Traveling Salesman Algorithm", Management Science, 19 (7), 790-799. Tang, L., Liu, J., Rong, A., Yang, Z. (2000), "A Multiple Traveling Salesman Problem Model for Hot Rolling Scheduling in Shanghai Baoshan Iron & Steel Complex", European Journal of Operational Research", 124, 267-282. Wong, R.T. (1980), "Integer Programming Formulations of the Traveling Salesman Problem", Proceedings of the IEEE International Conference of Circuits and Computers, 149-152.