Evaluation of Heuristic Algorithms for the TSP: A New Statistical Approach

DOI10.1080/01966324.1984.10737138zbMath0554.62039OpenAlexW2056038508WikidataQ58295573 ScholiaQ58295573MaRDI QIDQ3217446

Rafael Solis

Publication date: 1984

Published in: American Journal of Mathematical and Management Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01966324.1984.10737138

zbMATH Keywords

Traveling Salesman Problemheuristic evaluationlinear rank statistics

Mathematics Subject Classification ID

Nonparametric hypothesis testing (62G10) Exact distribution theory in statistics (62E15) Monte Carlo methods (65C05)

Related Items (1)

Heuristic methods and applications: A categorized survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate Traveling Salesman Algorithms
• Integer programming approaches to the travelling salesman problem
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• Heuristic 0-1 Linear Programming: An Experimental Comparison of Three Methods
• Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
• Approximative Algorithms for Discrete Optimization Problems

This page was built for publication: Evaluation of Heuristic Algorithms for the TSP: A New Statistical Approach