Solving combinatorial optimization problems using parallel simulated annealing and parallel genetic algorithms

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Solving combinatorial optimization problems using parallel simulated annealing and parallel genetic algorithms

Full text

Pdf (862 KB)

Source

Symposium on Applied Computing archive
Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's table of contents

Kansas City, Missouri, United States

Pages: 1031 - 1038

Year of Publication: 1992

ISBN:0-89791-502-X

Authors

Pooja P. Mutalik	Department of Mathematical and Computer Sciences, The University of Tulsa
Leslie R. Knight	Department of Mathematical and Computer Sciences, The University of Tulsa
Joe L. Blanton	Department of Mathematical and Computer Sciences, The University of Tulsa
Roger L. Wainwright	Department of Mathematical and Computer Sciences, The University of Tulsa

Sponsor

SIGAPP: ACM Special Interest Group on Applied Computing

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 20, Downloads (12 Months): 85, Citation Count: 5

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/130069.130127 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	Alfred V. Aho , John E. Hopcroft , Jeffrey Ullman , J. D. Ullman , J. E. Hopcroft, Data Structures and Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1983
	2	J. Allwright and D. Carpenter, A Distributed implementation of Simulated Annealing for the Traveling Salesman Problem, Parallel Computing 10 (1989) 335-338.
	3	B. Braschi, Solving the Traveling Salesman Problem Using The Simulated Annealing on a Hypercube, Proceedings of the Fourth Conference on Hypercubes, Concurrent Computers, and Applications, M~ch, 1989.
	4	Donald E. Brown , Christopher L. Huntley , Andrew R. Spillane, A parallel genetic heuristic for the quadratic assignment problem, Proceedings of the third international conference on Genetic algorithms, p.406-415, December 1989, George Mason University, United States
	5	J. P. Cohoon , S. U. Hegde , W. N. Martin , D. Richards, Punctuated equilibria: a parallel genetic algorithm, Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application, p.148-154, October 1987, Cambridge, Massachusetts, United States
	6	L. Davis, ed., Handbook of Genetic Algorithms, Van Nostrand Reinhold, 1991.
	7	Lawrence Davis, Genetic Algorithms and Simulated Annealing, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1987
	8	Kenneth A. De Jong , William M. Spears, Using genetic algorithms to solve NP-complete problems, Proceedings of the third international conference on Genetic algorithms, p.124-132, December 1989, George Mason University, United States
	9	E. Felton, $. Kazlin and S. Otto, The Traveling Salesman Problem on st Hypearcubic, MIMD Computer, Proceedings of the 1985 International Conference on Parallel Process. /ng, August, 1985.
	10	David E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1989
	11	Martina Gorges-Schleuter, ASPARAGOS an asynchronous parallel genetic optimization strategy, Proceedings of the third international conference on Genetic algorithms, p.422-427, December 1989, George Mason University, United States
	12	J. Grefenstette, GENESIS, Navy Center for Applied Research in Artificial intelligence, Navy research Lab., Wash. D.C. 20375-5000.
	13	John H. Holland, Adaptation in natural and artificial systems, MIT Press, Cambridge, MA, 1992
	14	Ellis Horowitz , Sartaj Sahni, Fundamentals of Computer Alori, W. H. Freeman & Co., New York, NY, 1978
	15	T. C. Hu , M. T. Shing , Y. S. Kuo, Combinatorial Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1982
	16	S. Kirktnttrick, C.D. Oelatt It. and M.P. Vecchi, Optimization by Simulated Annealing, Science, May, 1983, vol. 220, lap 671-680.
	17	L. Knight and R. Wainwright, "HYPERGEN: A Distributed Genetic Algorithm on a H~be", submitted.
	18	L. Knmsjo, "Computational Complexity of Sequential and Parallel Algorithms", John Wiley, 1985.
	19	D.R. Mallampati, P.P. Mutalik and R.L. Wainwright, "A Parallel Multi-Stage Implementation of Simulated Annealing for the Traveling Salesman Problem", Proceedings of the Sixth Distributed Memory Computing Conference, April 28 - May 2, 1991.
	20	Bernard Manderick , Piet Spiessens, Fine-grained parallel genetic algorithms, Proceedings of the third international conference on Genetic algorithms, p.428-433, December 1989, George Mason University, United States
	21	N. Metropolis, A.W. Rosenbluth, M.N. Ro~mbluth, A.H. Teller, E. Teller, Equation of State Calculation by Fast Computing Machines J. Chem. Phys. voL 21, 1953, p. 1087.
	22	H. Mühlenbein, Parallel genetic algorithms, population genetics and combinatorial optimization, Proceedings of the third international conference on Genetic algorithms, p.416-421, December 1989, George Mason University, United States
	23	S. Nahar, S.S. Sahni, and E. Shragowitz, "Simulated Annealing and Computational Optimization", Internat/onal Journal of Computer Aided VLSI Design, vol. 1, pp. 1- 23, 1989.
	24	Gregory J.E. Rawlins, Foundations of genetic algorithms, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1992
	25	P, Spiessens and B. Manderick, "A Massively Parallel Genetic Algorithm implementation and First Analysis", Proceedings of the Fourth International Conference on Genetic Algorithms, Morgan Kaufinam~ 1991.
	26	T. Starkweather , L. Darrell Whitley , Keith E. Mathias, Optimization Using Distributed Genetic Algorithms, Proceedings of the 1st Workshop on Parallel Problem Solving from Nature, p.176-185, October 01-03, 1990
	27	Reiko Tanese, Distributed genetic algorithms, Proceedings of the third international conference on Genetic algorithms, p.434-439, December 1989, George Mason University, United States
	28	D. Whitney and J. Kauth, GENYFOR: A Different Genetic Algorithm, Proceedings of the Rocky Mountain Conference on Artificial Intelligence, Denver, Co., 1988, pp. 118-130.
	29	Darrell Whitley , Timothy Starkweather , D'Ann Fuquay, Scheduling problems and traveling salesman: the genetic edge recombination, Proceedings of the third international conference on Genetic algorithms, p.133-140, December 1989, George Mason University, United States
	30	Darrell Whitley , Timothy Starkweather, GENITOR II.: a distributed genetic algorithm, Journal of Experimental & Theoretical Artificial Intelligence, v.2 n.3, p.189-214, July/Sept. 1990 [doi>10.1080/09528139008953723]

CITED BY 5

	D. Ansa Sekharan , Roger L. Wainwright, Manipulating subpopulations of feasible and infeasible solutions in genetic algorithms, Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice, p.118-125, February 14-16, 1993, Indianapolis, Indiana, United States
	Roger L. Wainwright, A family of genetic algorithm packages on a workstation for solving combinatorial optimization problems, ACM SIGICE Bulletin, v.19 n.3, p.30-36, Feb. 1994
	Robert M. Patton , Barbara Beckerman , Thomas E. Potok, Analysis of mammography reports using maximum variation sampling, Proceedings of the 2008 GECCO conference companion on Genetic and evolutionary computation, July 12-16, 2008, Atlanta, GA, USA
	Robert M. Patton , Thomas E. Potok, Characterizing large text corpora using a maximum variation sampling genetic algorithm, Proceedings of the 8th annual conference on Genetic and evolutionary computation, July 08-12, 2006, Seattle, Washington, USA
	Upavan Gupta , Nagarajan Ranganathan, Multievent Crisis Management Using Noncooperative Multistep Games, IEEE Transactions on Computers, v.56 n.5, p.577-589, May 2007