Bi-objective covering salesman problem with uncertainty
Humanitarian relief transportation and mass fatality management activities are the most strenuous tasks after a natural or artificial disaster. A feasible and realistic transport model is essential for accomplishing the tasks in a planned way. Covering Salesman Problem (CSP) is a variant of Travelin...
Uloženo v:
| Vydáno v: | Journal of Decision Analytics and Intelligent Computing Ročník 3; číslo 1; s. 122 - 138 |
|---|---|
| Hlavní autor: | |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
15.08.2023
|
| ISSN: | 2787-2572, 2787-2572 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | Humanitarian relief transportation and mass fatality management activities are the most strenuous tasks after a natural or artificial disaster. A feasible and realistic transport model is essential for accomplishing the tasks in a planned way. Covering Salesman Problem (CSP) is a variant of Traveling Salesman Problem (TSP) which has been used in many application areas, including disaster management. In this paper, we consider a bi-objective CSP in an uncertain environment where Interval Type 2 fuzzy numbers represent the costs of the edges. A new local search technique is introduced in the memetic algorithm, which has been used to solve the problem. A computational experiment on a set of instances indicates the effectiveness of the introduced local search technique along with the proposed methodology. |
|---|---|
| ISSN: | 2787-2572 2787-2572 |
| DOI: | 10.31181/jdaic10015082023t |