تخصیص ربات‌های چند ایستگاهی با رویکرد تلفیقی فازی

نویسندگان
دانشگاه پیام نور
چکیده
در این مقاله با استفاده از یک رویکرد تلفیقی فازی به حل مساله فروشندگان دوره‌گرد چند ایستگاهی به عنوان یک مساله بهینه‌سازی دوهدفه می‌پردازیم. این رویکرد، با تعریف مفهوم جدید چیره‌گی فازی، به هر یک از بردارهای توابع هدف مساله، یک درجه نزدیکی گوسی متناظر می‌کند که بر اساس آن امکان رتبه‌بندی و در نتیجه مقایسه جواب‌های پارتو در یک مساله بهینه‌سازی چندهدفه فراهم می‌شود. به عبارت دقیق‌تر، با استفاده از این رویکرد، مساله بهینه‌سازی چندهدفه را می‌توان به صورت یک مساله بهینه‌سازی تک‌هدفه در نظر گرفت. در این مقاله با تلفیق مفهوم چیره‌گی فازی و یک الگوریتم فراابتکاری مانند شبیه‌سازی تبریدی حل مساله فروشندگان دوره‌گرد چند ایستگاهی را مورد مطالعه قرار می‌دهیم. برای این منظور، با انجام شبیه‌سازی‌های مختلف، عملکرد این رویکرد پیشنهادی را ارزیابی می‌کنیم. نتایج عددی حاکی از تأثیر این رویکرد در بهبود کیفیت جواب‌ها و همچنین کاهش زمان محاسباتی حل مساله می‌باشد.
کلیدواژه‌ها

عنوان مقاله English

Assignment of multi-Depot robots with an integrated fuzzy approach

نویسندگان English

Hamid Reza Yousefzadeh
zahrasadat cheshomi
Aghile Heydari
Payame Noor University
چکیده English

In this paper, the multi-traveling salesman problem as a two-objective optimization problem, are solved by using an integrated fuzzy approach. This approach, by defining the new concept of fuzzy domination, corresponds to each of the vectors of the objective functions of the problem a degree of Gaussian proximity, so it can be ranked and hence, we can compare the obtained Pareto solutions in a multi- objective optimization problem. More precisely, using this approach, the multi-objective optimization problem was considered as a single optimization problem. In this paper, by combining the concept of fuzzy domination and a meta-heuristic algorithm such as simulating annealing we study the multi-traveling salesman problem. To this end, by performing some different simulation, the performance of this proposed approach is evaluated. Numerical results indicate the effect of this approach in improving the quality of results and also reducing the computational time of problems.

کلیدواژه‌ها English

Traveling salesman problem
Multi-objective optimization
Pareto solution
Complexity algorithm
Heuristic algorithm
[2] Baytürk E., Esnaf S., Kucukdeniz T. (2021) Two-phase fuzzy C-means and genetic algorithm for food distribution. In: Durakbasa N.M., Gençyılmaz M.G. (eds) Digital Conversion on the Way to Industry 4.0. ISPR 2020. Lecture Notes in Mechanical Engineering. Springer, Cham.

[3] Bolaños R., Echeverry M., Escobar J., (2015) A multiobjective nondominated sorting genetic algorithm (NSGA-II) for the multiple traveling salesman problem. Decis Sci Lett 4:559–568.

[4] Cheikhrouhou O., Koubâa A., Bennaceur H., (2014) Move and improve: a distributed multi-robot

coordination approach for multiple depots multiple traveling salesmen problem. In: IEEE international conference on autonomous robot systems and competitions (ICARSC) 2014, IEEE, p 28–35.

[5] Deb K., Pratap A., Agarwal S., Meyarivan T., (2002) A fast and elitist multiobjective genetic

algorithm: NSGA-II. IEEE Trans Evol Comput 6:182–197

[6] Fazli P., Davoodi A., Pasquier P., Mackworth A.K., (2010) Complete and robust cooperative robot

area coverage with limited range. In: 2010 IEEE/RSJ international conference on intelligent robots

and systems (IROS), p 5577–5582.

[7] Khamis A.M., Elmogy A.M., Karray F.O., (2011) Complex task allocation in mobile surveillance

systems. J Intell Robot Syst 64:33–55.

[8] Kirk J., (2011) Traveling-salesman-problem-genetic-algorithm. http:// www. mathworks.

com/matlabcentral/fileexchange/ 13680- traveling-salesman-problem-genetic-algorithm

[9] Koubáa A., Trigui S., Cháari I., (2012) Indoor surveillance application using wireless robots and

sensor networks: coordination and path planning. In: Mobile Ad Hoc Robots and Wireless Robotic

Systems: Design and Implementation: Design and Implementation, pp 19–57.

[10] Mamdani E.H., Assilian S., (1975) An experiment in linguistic synthesis with a fuzzy logic controller.

Int J Man Mach Stud 7:1–13

[11] Marler R.T., Arora J.S., (2010) The weighted sum method for multiobjective optimization: new

insights. Struct Multidiscip Optim 41:853–862

[12] Mavrotas G., (2009) Effective implementation of the ff-constraint method in multi-objective mathematical programming problems. Appl Math Comput 213:455–465

[13] Moradi N., Shadrokh S.,(2019) A simulated annealing optimization algorithm for equal and un-equal

area construction site layout problem. International Journal of Research in Industrial Engineering

8 (2), 89-104

[14] Nikoli´ c I., (2007) Total time minimizing transportation problem. Yugosl J Oper Res 17(1):125–133

[15] Pippin C., ChristensenH.,Weiss L.,(2013) Performance based task assignment in multi-robot patrolling. In: Proceedings of the 28th annual ACM symposium on applied computing, p 70–76.

[16] Shim V.A., Tan K.C., Cheong C.Y., (2012a) A hybrid estimation of distribution algorithm with

decomposition for solving the multiobjective multiple traveling salesman problem. IEEE Trans Syst

Man Cybern C Appl Rev 42:682–691

[17] Trigui S., Cheikhrouhou O., Koubaa A., Baroudi U., & Yousse H., (2016) FL-MTSP: a fuzzy logic

approach to solve the multi-objective multiple traveling salesman problem for multi-robot systems

Soft Computing volume 21, pages7351–7362.

[18] Wang M., Ma T., Li G., Zhai X and Qiao S., (2020) ”Ant Colony Optimization With an Improved

Pheromone Model for Solving MTSP With Capacity and Time Window Constraint,” in IEEE

Access, vol. 8, pp. 106872-106879.

[19] Wang X., Liu D., Hou M., (2013) A novel method for multiple depot and open paths, Multiple Traveling Salesmen Problem. In: 11th IEEE international symposium on applied machine intelligence

and informatics (SAMI), IEEE, p 187–192.

[20] Yousefikhoshbakht M., Didehvar F., Rahmati F., (2013) Modification of the ant colony optimization

for solving the multiple traveling salesman problem. Roman Acad Sect Inf Sci Technol 16:65–80.

[21] https://drive.google.com/drive/folders/1nMpFdUVT9yRf2o5CC1XczfcQxDBp1-Tf?usp=sharing