Publication
An Analytical Hierarchy Process-Based Approach to Solve the Multi-Objective Multiple Traveling Salesman Problem
| dc.contributor.author | Trigui, Sahar | |
| dc.contributor.author | Cheikhrouhou, Omar | |
| dc.contributor.author | Koubâa, Anis | |
| dc.contributor.author | Zarrad, Anis | |
| dc.contributor.author | Youssef, Habib | |
| dc.date.accessioned | 2018-12-20T11:48:42Z | |
| dc.date.embargo | 2119 | |
| dc.date.issued | 2018 | |
| dc.description.abstract | We consider the problem of assigning a team of autonomous robots to target locations in the context of a disaster management scenario while optimizing several objectives. This problem can be cast as a multiple traveling salesman problem, where several robots must visit designated locations. This paper provides an analytical hierarchy process (AHP)-based approach to this problem, while minimizing three objectives: the total traveled distance, the maximum tour, and the deviation rate. The AHP-based approach involves three phases. In the first phase, we use the AHP process to define a specific weight for each objective. The second phase consists in allocating the available targets, wherein we define and use three approaches: market-based, robot and task mean allocation-based, and balanced-based. Finally, the third phase involves the improvement in the solutions generated in the second phase. To validate the efficiency of the AHP-based approach, we used MATLAB to conduct an extensive comparative simulation study with other algorithms reported in the literature. The performance comparison of the three approaches shows a gap between the market-based approach and the other two approaches of up to 30%. Further, the results show that the AHP-based approach provides a better balance between the objectives, as compared to other state-of-the-art approaches. In particular, we observed an improvement in the total traveled distance when using the AHP-based approach in comparison with the distance traveled when using a clustering-based approach. | pt_PT |
| dc.description.version | info:eu-repo/semantics/publishedVersion | pt_PT |
| dc.identifier.doi | 10.1007/s11370-018-0259-8 | pt_PT |
| dc.identifier.issn | 1861-2784 | |
| dc.identifier.uri | http://hdl.handle.net/10400.22/12448 | |
| dc.language.iso | eng | pt_PT |
| dc.peerreviewed | yes | pt_PT |
| dc.publisher | Springer Berlin Heidelberg | pt_PT |
| dc.relation.ispartofseries | Intelligent Service Robotics;Vol. 11, Issue 4 | |
| dc.relation.publisherversion | https://link.springer.com/article/10.1007%2Fs11370-018-0259-8 | pt_PT |
| dc.subject | Assignment | pt_PT |
| dc.subject | MTSP | pt_PT |
| dc.subject | Multiple depots | pt_PT |
| dc.subject | Multi-objective problem | pt_PT |
| dc.subject | AHP | pt_PT |
| dc.title | An Analytical Hierarchy Process-Based Approach to Solve the Multi-Objective Multiple Traveling Salesman Problem | pt_PT |
| dc.type | journal article | |
| dspace.entity.type | Publication | |
| oaire.citation.endPage | 369 | pt_PT |
| oaire.citation.issue | 4 | pt_PT |
| oaire.citation.startPage | 355 | pt_PT |
| oaire.citation.title | Intelligent Service Robotics | pt_PT |
| oaire.citation.volume | 11 | pt_PT |
| rcaap.rights | closedAccess | pt_PT |
| rcaap.type | article | pt_PT |