Tabu Search Implementation on Traveling Salesman Problem and Its Variations: A Literature Survey

Basu, Sumanta

doi:10.4236/ajor.2012.22019

Cited by 39 publications

(10 citation statements)

References 67 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…It is planned to follow the approaches based on tabu search [15], on genetic ideas [16], and on cuckoo search [17]. We would like to create the environment allowing the comparison of more algorithms and in consequence, for answering the question which of meta-heuristic and evolutionary approaches is the most convenient for solving the considered problem.…”

Section: Resultsmentioning

confidence: 99%

Ant Colony Optimization Algorithm for Solving the Provider - Modified Traveling Salesman Problem

Baranowski

Koszalka

Pozniak-Koszalka

et al. 2014

Intelligent Information and Database Systems

View full text Add to dashboard Cite

Abstract. The paper concerns the introduced and defined problem which was called the Provider. This problem coming from practice and can be treated as a modified version of Travelling Salesman Problem. For solving the problem an algorithm (called ACO) based on ant colony optimization ideas has been created. The properties of the algorithm were tested using the designed and implemented experimentation system. The effectiveness of the algorithm was evaluated and compared to reference results given by another implemented Random Optimization algorithm (called RO) on the basis of simulation experiments. The reported investigations have shown that the ACO algorithm seems to be very effective for solving the considered problem. Moreover, the ACO algorithm can be recommended for solving other transportation problems.

show abstract

Section: Resultsmentioning

confidence: 99%

Ant Colony Optimization Algorithm for Solving the Provider - Modified Traveling Salesman Problem

Baranowski

Koszalka

Pozniak-Koszalka

et al. 2014

Intelligent Information and Database Systems

View full text Add to dashboard Cite

show abstract

“…GSP'nin çözümü için guguk kuĢu algoritması (Jati vd., 2012;Ouaarab vd., 2013;Ouyang vd., 2013;Karagül, 2014), yarasa algoritması (Yang, 2010), ateĢ böceği algoritması (Yang, 2010;Sureja, 2012;Bhushan ve Pillai, 2013;Fister vd., 2013), arı kolonisi algoritması (Yang, 2010), kanguru algoritması (Pollard, 1978;Romsy, 2011;Erdem ve Keskintürk, 2011), parçacık sürüsü optimizasyon algoritması (Dorigo ve Gamberdalla, 1997;Htun, 2018;) ve karınca kolonisi optimizasyon algoritması (Mavrovouniotis ve Yang, 2013;Aksaraylı ve Pala, 2018;Htun, 2018;) kullanılması ile ilgili çalıĢmalar bilimsel literatürde yer almaktadır. Doğadaki hayvanların davranıĢlarından esinlenilerek geliĢtirilen bu yöntemlerin yanı sıra genetik algoritma (Zhao vd., 2009;Htun, 2018;), tabu arama algoritması (Glover, 1990;Glover ve Laguna, 1993;Glover ve Laguna, 1997;Gendreau vd., 1998;Gendreau, 2002;Basu, 2012), benzetimli tavlama algoritması (Kirkpatrick vd., 1983;Malek vd., 1989;Özdağoğlu, 2008;Wang vd., 2009;Zhou vd., 2019), harmoni arama algoritması (Geem vd., 2001;Yang, 2009;Yun vd., 2013;Karagül vd., 2016;Boryczka ve Szwarc, 2019) ve akıĢkan genetik algoritma (Jafari-Marandi ve Smith, 2017; ġahin ve Karagül, 2019) gibi meta-sezgisellerin kullanıldığı çalıĢmalar da bulunmaktadır.…”

Section: Bi̇li̇msel Yazinunclassified

Prüfer-Karagül Algorithm: A Novel Approach for Travelling Salesman Problem

Karagül

2019

Mehmet Akif Ersoy Üniversitesi İktisadi Ve İdari Bilimler Fakültesi Dergisi

View full text Add to dashboard Cite

Kombinatoryal optimizasyon alanında temel bir model olduğu için literatürde oldukça yaygın çalıĢılan gezgin satıcı probleminin etkin ve hızlı çözümü için yeni sezgisel yöntemler geliĢtirilmesine devam edilmektedir. Bu çalıĢmada, gezgin satıcı problemi için Prüfer-Karagül adı verilen yeni bir yapısal çözüm yaklaĢımı önerilmiĢtir. Önerilen yöntemin performansını değerlendirmek için literatürde yaygın olarak kullanılan gezgin satıcı test problemleri ile analizler yapılmıĢtır. Yapılan testler sonucunda elde edilen en iyi çözümler optimal çözümden %2, ortalama çözüm değerleri ise %2,50 sapma göstermiĢtir. Sonuç olarak, önerilen yöntem çözüm performansı ve hızı açısından baĢarılı çözümler üretmektedir. As it is a fundamental model in the field of combinatorial optimization, new heuristic methods are developed for effective and rapid solution of the travelling salesman problem, which is widely used in the literature. In this study, a new constructive approach called Prüfer-Karagül has been proposed for the traveling salesman problem. In order to evaluate the performance of the proposed method, analysis was made with travelling salesman problem test instances which are commonly used in the literature. The best solutions obtained as a result of the tests showed 2% deviation from the optimal solution and 2.50% deviation from the average solution values. As a result, the proposed method produces successful solutions in terms of solution performance and speed.

show abstract

“…It is a successful application of artificial intelligence in combinatorial optimization algorithm, and in 1986, the TS method was firstly proposed by Glover, 22 after nearly 20 years of development, it has formed a complete set of algorithms. Because its flexible framework and strong versatility, the TS has become a best algorithm for solving the small-scale TSP, 23 which avoids roundabout searches by introducing a flexible storage structure and corresponding taboo criteria, and through the contempt criteria to pardon some of the fine states to be tabooed, and then to ensure a variety of effective explorations to achieve the ultimate global optimization. Therefore, the TS algorithm is used to solve the open and constrained TSP in this section.…”

Section: Solution Of Optimization Model Basedon the Tsmentioning

confidence: 99%

A cutting sequence optimization method based on tabu search algorithm for complex parts machining

Zhang

Han

2018

Proceedings of the Institution of Mechanical Engineers, Part B:

View full text Add to dashboard Cite

Defining the cutting sequence of each cutter scientifically in the process of removing the allowance has an important influence on the machining efficiency for complex parts, which have multiple machining features. In order to satisfy the needs of high efficiency for rough machining, after determining the tool path of the machining region, a cutting sequence optimization method based on the tabu search algorithm is presented to define the cutting order in rough machining of complex parts. First, a cutting sequence optimization mathematical model is established, which relates to the shortest total length of the tool path. Second, through the problem analysis, the cutting sequence optimization model is converted into an open and constrained traveling salesman problem. And then, the optimization model is solved by dealing with an open and constrained traveling salesman problem using the tabu search algorithm. Finally, the optimal cutting sequence of machining a casing part is calculated, and a simulation and experiment are carried out. The result shows that the optimization approach presented in this article can optimize the cutting sequence and cutter position of advance and retract. Compared with the non-optimized cutting sequence method, the total length of tool path is reduced by 16.7%, the cutter lifting times are reduced to 26, and the efficiency is increased by 21.62%.

show abstract

Tabu Search Implementation on Traveling Salesman Problem and Its Variations: A Literature Survey

Cited by 39 publications

References 67 publications

Ant Colony Optimization Algorithm for Solving the Provider - Modified Traveling Salesman Problem

Ant Colony Optimization Algorithm for Solving the Provider - Modified Traveling Salesman Problem

Prüfer-Karagül Algorithm: A Novel Approach for Travelling Salesman Problem

A cutting sequence optimization method based on tabu search algorithm for complex parts machining

Contact Info

Product

Resources

About