An experimental comparison of human schedulers and heuristic algorithms for the traveling salesman problem
- 1 August 1982
- journal article
- Published by Wiley in Journal of Operations Management
- Vol. 2 (4), 215-223
- https://doi.org/10.1016/0272-6963(82)90010-9
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Humans vs. Computer Algorithms for the Plant Layout ProblemManagement Science, 1980
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the PlaneMathematics of Operations Research, 1977
- Critical Ratio Scheduling: An Experimental AnalysisManagement Science, 1975
- A rapid heuristic algorithm for the approximate solution of the traveling salesman problemTransportation Research, 1975
- A man-machine approach toward solving the traveling salesman problemCommunications of the ACM, 1971
- Bases for Vehicle Fleet SchedulingJournal of the Operational Research Society, 1967
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965
- Three Heuristic Rules for Sequencing Jobs to a Single Production FacilityManagement Science, 1965
- Dynamic Programming Treatment of the Travelling Salesman ProblemJournal of the ACM, 1962
- On Grouping for Maximum HomogeneityJournal of the American Statistical Association, 1958