Volume 9, Issue 3 (12-2023)
mmr 2023, 9(3): 56-74 |
Back to browse issues page
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Yousefzadeh H R, cheshomi Z, Heydari A. Assignment of multi-Depot robots with an integrated fuzzy approach. mmr 2023; 9 (3) :56-74
URL: http://mmr.khu.ac.ir/article-1-3138-en.html
URL: http://mmr.khu.ac.ir/article-1-3138-en.html
1- Payame Noor University , usefzadeh.math@pnu.ac.ir
2- Payame Noor University
2- Payame Noor University
Abstract: (430 Views)
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.
Keywords: Traveling salesman problem, Multi-objective optimization, Pareto solution, Complexity algorithm, Heuristic algorithm.
Type of Study: S |
Subject:
Mat
Received: 2020/10/11 | Revised: 2024/02/19 | Accepted: 2021/07/17 | Published: 2023/12/31 | ePublished: 2023/12/31
Received: 2020/10/11 | Revised: 2024/02/19 | Accepted: 2021/07/17 | Published: 2023/12/31 | ePublished: 2023/12/31
Send email to the article author
| Rights and permissions | |
 |
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. |
