Advanced search
Publication Cover
American Journal of Mathematical and Management Sciences Volume 4, 1984 - Issue 1-2: Statistics and Optimization: The Interface
Submit an article Journal homepage
47
Views
2
CrossRef citations to date
0
Altmetric
Original Articles

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

Rafael SolisDepartment of Decision SciencesCollege of Business Administration Florida International UniversityMiami, Florida33199
Pages 89-108 | Published online: 14 Aug 2013

  • AbramowitzM. and StegunI.A. (1964). Handbook of Mathematical Functions. National Bureau of Standards, WashingtonD.C.
  • CramerH. (1946). Mathematical Methods of Statistics. Princeton University Press, PrincetonNew Jersey.
  • GareyM.R. and JohnsonD.S. (1976). Approximation algorithms for combinatorial problems: an annotated bibliography. Algorithms and Complexity - New Directions and Recent Results. (edited by TraubJ.F.), 41–52. Academic Press, New York.
  • GareyM.R. and JohnsonD.S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco.
  • GoldenB.L., BodinT., DoyleT., and StewartW.Jr. (1980). Approximate traveling salesman algorithms. Operations Research, 28, 594–711.
  • GoldenB.L., AssadA., BodinL., BallM., and DahlR. (1981). Listing and documentation for selected network optimization computer codes. Working Paper MS/S 81–003. College of Business and Management, University of Maryland, College ParkMaryland.
  • HajekJ. (1969). A Course in Nonparametric Statistics. Holden Day, San FranciscoCalifornia.
  • JohnsonN.L. and KotzS. (1970). Distributions in Statistics, Volume 2: Continuous Univariate Distributions. Houghton Mifflin Company, BostonMassachusetts.
  • KarpR.M. (1976). The probabilistic analysis of some combinatorial search algorithms. Algorithms and Complexity - New Directions and Recent Results. (edited by TraubJ.F.), 1–5. Academic Press, New York.
  • KarpR.M. (1977). Probabilistic analysis of partitioning algorithms for the traveling salesman problem in the plane. Mathematics of Operations Research, 2, 209–224.
  • KorteB. (1979). Approximative algorithms for discrete optimization problems. Discrete optimization. Annals of Discrete Mathematics, 4, 85–120.
  • MiliotisP. (1976). Integer programming approaches to the traveling salesman problem. Mathematical Programming, 10, 367–378.
  • RandlesR.H. and WolfeD.A. (1979). Introduction to the Theory of Nonparametric Statistics. John Wiley & Sons, Inc., New York.
  • RosenkrantzD., StearnsR. and LewisP. (1977). An analysis of several heuristics for the traveling salesman problem. SIAM Journal on Computing, 6, 563–581.
  • SahniS. and HorowitzE. (1978). Combinatorial problems: Reducibility and approximation. Operations Research, 26, 718–759.
  • ZanakisS.H. (1977). Heuristic 0–1 LP: an experimental comparison of three methods. Management Science, 24, 91–104.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Supercharge Your Next Research Paper: Research and write your next paper with Jenni AI.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.