New Heuristic Approaches for the Min–Max Regret Traveling Salesman Problem
The traveling salesman problem (TSP) is widely known as one of the most important NP-hard combinatorial optimization problems. In this paper, we consider the min-max regret traveling salesman problem (MMR-TSP) with interval travel costs. The MMR-TSP aims to find a tour that minimizes the difference...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
IEEE
2025-01-01
|
| Schriftenreihe: | IEEE Access |
| Schlagworte: | |
| Online-Zugang: | https://ieeexplore.ieee.org/document/10950365/ |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|