A man-machine approach toward solving the traveling salesman problem

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A man-machine approach toward solving the traveling salesman problem

Full text

Pdf (897 KB)

Source

Communications of the ACM archive
Volume 14 , Issue 5 (May 1971) table of contents

Pages: 327 - 334

Year of Publication: 1971

ISSN:0001-0782

Authors

Patrick Krolak	Vanderbilt Univ., Nashville, TN
Wayne Felts	Vanderbilt Univ., Nashville, TN
George Marble	Washington Univ., St. Louis, MO

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 35, Citation Count: 9

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/362588.362593 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Little, M. D. C., Murty, K. G., Sweeney, D. W., and Karel, c. An algorithm for the traveling salesman problem. Operations Res. 11 (1963), 979-989.
	2	Donald M. Shapiro, Algorithms for the solution of the optimal cost and bottle-neck travelingsalesman problems., 1966
	3	Oberuc, Richard E. A practical algorithm for finding solutions to the traveling salesman problem. 34th ORSA Nat. Meeting, Denver, Col., Nov. 1968.
	4	Bellmore, M., and Newhauser, G.L. The traveling salesman problem: A survey. Operations Res. 17,3 (May 1968), 538-557.
	5	Michie, D., Fleming, J. G., and Oldfield, J. V. A comparison of heuristic interactive, and unhided methods of solving a shortest-route problem, in machine Intelligence, D. Michie, (Ed.), American Elsevser, New York, 1968, p. 245.
	6	Bellmore, M., and Malone, J. C. Pathology of traveling salesman algorithms, Johs Hopkins U. Rep., Baltimore, Md., 1969.
	7	Krolak, P., Felts, W., and Marble, G. Heuristics for solving the traveling salesman problem and various related scheduling problems. 7th Mathematical Programming Symp., The Hague, The Netherlands, Sept., 1970.
	8	Guha, D. K. A method for solving the traveling salesman problem. 34th ORSA Nat. Meeting. Denver, Col., 1968.

CITED BY 9

	A. J. Goldstein , A. B. Lesk, Common feature techniques for discrete optimization, Proceedings of the 13th conference on Design automation, p.232-244, June 28-30, 1976, San Francisco, California, United States
	Christopher C. Skiścim , Bruce L. Golden, Optimization by simulated annealing: A preliminary computational study for the TSP, Proceedings of the 15th conference on Winter Simulation, p.523-535, December 12-14, 1983, Arlington, Virginia, United States
	A. T. Berztiss, A Backtrack Procedure for Isomorphism of Directed Graphs, Journal of the ACM (JACM), v.20 n.3, p.365-377, July 1973
	Byrant A. Julstrom, Very greedy crossover in a genetic algorithm for the traveling salesman problem, Proceedings of the 1995 ACM symposium on Applied computing, p.324-328, February 26-28, 1995, Nashville, Tennessee, United States
	V Kevin M. Whitney , Dixon R. Doll, A database system for the management and design of telecommunication networks, Proceedings of the third ACM symposium on Data communications and Data networks: Analysis and design, p.141-147, January 1973
	Pedro S. de Souza , Sarosh N. Talukdar, Asynchronous organizations for multi-algorithm problems, Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice, p.286-293, February 14-16, 1993, Indianapolis, Indiana, United States
	Hao Chen , Nicholas S. Flann , Daniel W. Watson, Parallel Genetic Simulated Annealing: A Massively Parallel SIMD Algorithm, IEEE Transactions on Parallel and Distributed Systems, v.9 n.2, p.126-136, February 1998
	Christophe Philemotte , Hugues Bersini, A gestalt genetic algorithm: less details for better search, Proceedings of the 9th annual conference on Genetic and evolutionary computation, July 07-11, 2007, London, England
	Sarosh Talukdar , Lars Baerentzen , Andrew Gove , Pedro De Souza, Asynchronous Teams: Cooperation Schemes for Autonomous Agents, Journal of Heuristics, v.4 n.4, p.295-321, December 1998

INDEX TERMS

Keywords:
artificial intelligence, assignment problem, computer-aided heuristic technique, heuristic procedures, interaction process, man-machine interaction, mask of the assignment, rubber band tour generator, traveling salesman problem

Collaborative Colleagues:

Patrick Krolak: colleagues

Wayne Felts: colleagues

George Marble: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player