• TUCS Publication Series
• How to Publish in TUCS Series
• Publication Search
• Publication Graph
• Publication Input
• Publication Input Guide
• JuFo Browser

A Short Note on Efficiency of Two Heuristics for the Robust Traveling Salesman Problem

Sepinoud Azimi, Yury Nikulin, A Short Note on Efficiency of Two Heuristics for the Robust Traveling Salesman Problem. TUCS Technical Reports 987, Turku Centre for Computer Science, 2010.

Abstract:

This report examines a version of the symmetric traveling salesman problem in which the travel costs associated with arcs are given as interval ranges. The problem is optimized using robust deviation criterion. Two heuristic algorithms based on midpoint and upper point scenarios are investigated, and their efficiency on small size instances is evaluated. The quality of heuristic solutions is evaluated by means of its comparison with optimal solution obtained through mixed integer programming formulation. The efficiency of the heuristic approaches on small size instances is argued.

Files:

Full publication in PDF-format

BibTeX entry:

@TECHREPORT{tAzNi10a,
  title = {A Short Note on Efficiency of Two Heuristics for the Robust Traveling Salesman Problem},
  author = {Azimi, Sepinoud and Nikulin, Yury},
  number = {987},
  series = {TUCS Technical Reports},
  publisher = {Turku Centre for Computer Science},
  year = {2010},
}

Belongs to TUCS Research Unit(s): Other

Edit publication