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...
Saved in:
| Published in: | Journal of Decision Analytics and Intelligent Computing Vol. 3; no. 1; pp. 122 - 138 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
15.08.2023
|
| ISSN: | 2787-2572, 2787-2572 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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 |