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...
Sábháilte in:
| Príomhchruthaitheoirí: | , , |
|---|---|
| Formáid: | Artigo |
| Teanga: | Inglês |
| Foilsithe / Cruthaithe: |
IEEE
2025-01-01
|
| Sraith: | IEEE Access |
| Ábhair: | |
| Rochtain ar líne: | https://ieeexplore.ieee.org/document/10950365/ |
| Clibeanna: |
Níl clibeanna ann, Bí ar an gcéad duine le clib a chur leis an taifead seo!
|