Optimizing the Trapezoidal Fuzzy Travelling Salesman Problem Through Dhouib-Matrix-TSP1 Method Based on Magnitude Technique

Sa. Dhouib¹ , S. Dhouib²

Section:Research Paper, Product Type: Journal-Paper
Vol.8 , Issue.2 , pp.1-4, Apr-2021

Online published on Apr 30, 2021

Copyright © Sa. Dhouib, S. Dhouib . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
 

View this paper at   Google Scholar | DPI Digital Library

XML View     PDF Download

How to Cite this Paper

Abstract :
In this paper, we propose to optimize the trapezoidal fuzzy Travelling Salesman Problem (TSP). First, we rank the fuzzy matrix of distance using the magnitude ranking technique. Second, the new method named Dhouib-Matrix-TSP1 is applied to easily and quickly search an optimal or a near optimal solution in polynomial computational time. A numerical example will be presented and discussed to prove the efficiency of the Dhouib-Matrix-TSP1 approach

Key-Words / Index Term :
Fuzzy Set, Travelling Salesman Problem, Optimization, Approximation Method, Dhouib-Matrix-TSP1, Magnitude Technique

References :
[1] L. A. Zadeh, “Fuzzy Sets,” Information and Control, Vol. 8, No.3, pp.338-353, 1965.
[2] G. Dantzig, D. Fulkerson and S. Johnson, “Solutions of a large-scale traveling-salesman problem,” Operations Research, Vol.2 No.4, pp.393-410, 1954.
[3] C. Changdar, S. G. Mahapatra and R. P. Kumar, “An efficient genetic algorithm for multi-objective solid travelling salesman problem under fuzziness,” Swarm and Evolutionary Computation, Vol.15, pp.27–37, 2014.
[4] Z. Wang, J. Guo, M. Zheng and Y. Wang, “Uncertain multiobjective traveling salesman problem,” European Journal of Operational Research, Vol.241 No. 2, 2015.
[5] W. Gu, Y. Liu Y., L. Wei and B. Dong, “A Hybrid Optimization Algorithm for Travelling Salesman Problem Based on Geographical Information System for Logistics Distribution,” International Journal of Grid Distribution Computing, Vol.8 No. 3, pp.359-370, 2015.
[6] J. D. D. Francisco, M. Oscar and R. Sepúlveda, “Reducing the size of traveling salesman problems using vaccination by fuzzy selector,” Expert Systems with Applications, Vol.49, pp.20-30, 2016.
[7] V. Vasilchikov,“On the Optimization and Parallelizing Little Algorithm for Solving the Traveling Salesman Problem,” Modeling and Analysis of Information Systems, Vol. 23 No.4, pp.401-411, 2016.
[8] L. S. Smith and F. Imeson, “GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem,” Computer Operatioanl Research, Vol.87, pp.1-19, 2017.
[9] P. Tinarut and K. Leksakul, “Hybrid self-organizing map approach for traveling salesman problem”, Chiang Mai University Journal of Natural Sciences, Vol.18 No.1, pp.27-37, 2019.
[10] M. Divya, “Solving Travelling Salesman Problem Using Ant Systems: A Programmer’s Approach,” International Journal of Applied and Computational Mathematics, Vol.5, pp.101, 2019.
[11] S. Suriya and M. Rahul Kumar, "Solving Travelling Salesman Problem using an Enhanced Ant Colony Algorithm," International Journal of Computer Sciences and Engineering, Vol.7, Issue-7, July 2019.
[12] H. Zhang, L. Xiang and X. Liu, “A SN P System for Travelling Salesman Problem,” International Conference on Human Centered Computing, pp.339-346, 2019.
[13] M. S. Hardi, M. Zarlis, S. Effendi and S. M. Lydia, “Taxonomy Genetic Algorithm For Implementation Partially Mapped Crossover In Travelling Salesman Problem,” International Conference on Advanced Information Scientific Development (ICAISD), Vol.1641, 2020.
[14] A. A. Mehmet, B. C. Kalayci, “A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem,” Metaheuristics for Combinatorial Optimization, pp. 23-36, 2021.
[15] O. Cheikhrouhoua and I. Khoufi, “A comprehensive survey on the Multiple Traveling Salesman Problem: Applications, approaches and taxonomy,” Computer Science Review, vol.40, pp.100369, 2021.
[16] M. Gunduza and M. Aslan, “DJAYA: A discrete Jaya algorithm for solving traveling salesman problem”, Applied Soft Computing, Vol. 105, pp.107275, 2021.
[17] S. Dhouib, “A New Column-Row Method for Traveling Salesman Problem: The Dhouib-Matrix-TSP1,” International Journal of Recent Engineering Science, Vol. 8, No. 1, pp. 6-10, 2021.
[18] S. Dhouib, “Stochastic Column-Row Method for Travelling Salesman Problem: the Dhouib-Matrix-TSP2,” International Journal of Engineering Research & Technology, Vol. 10, Issue 3, pp. 524-527, 2021.