Heuristic algorithms for the terminal assignment problem

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Heuristic algorithms for the terminal assignment problem

Full text

Pdf (508 KB)

Source

Symposium on Applied Computing archive
Proceedings of the 1997 ACM symposium on Applied computing table of contents

San Jose, California, United States

Pages: 247 - 251

Year of Publication: 1997

ISBN:0-89791-850-9

Authors

Sami Khuri	Department of Mathematics and Computer Science, San José State University, One Washington Square, San José, CA
Teresa Chiu	Department of Mathematics and Computer Science, San José State University, One Washington Square, San José, CA

Sponsors

SIGCUE: ACM Special Interest Group on Computer Uses In Education
SIGADA: ACM Special Interest Group on Ada Programming Language
SIGAPP: ACM Special Interest Group on Applied Computing
SIGBIO: ACM Special Interest Group on Biomedical Computing

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 34, Citation Count: 10

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/331697.331748 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	Faris N. Abuali , Dale A. Schoenefeld , Roger L. Wainwright, Terminal assignment in a communications network using genetic algorithms, Proceedings of the 22nd annual ACM computer science conference on Scaling up : meeting the challenge of complexity in real-world computing applications: meeting the challenge of complexity in real-world computing applications, p.74-81, March 08-10, 1994, Phoenix, Arizona, United States [doi>10.1145/197530.197559]
	2	B~ick, T. (1992). GENEsYs 1.0. Software distribution and installation notes, Systems Analysis Research Group, LSXI, University of Dortmund, Dortmund, Germany.
	3	Arthur L. Corcoran , Roger L. Wainwright, LibGA: a user-friendly workbench for order-based genetic algorithm research, Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice, p.111-117, February 14-16, 1993, Indianapolis, Indiana, United States [doi>10.1145/162754.162828]
	4	Falkenauer, E. (1994). A New Representation and Operators for Genetic Algorithms Applied to Grouping Problems. Evolutionary Computation, pp. 123-144. The MIT Press, Massachusetts.
	5	Grefenstette, J. (1984). GENESIS: A System for Using Genetic Search Procedures. Proceedings of the Conference on Intelligent Systems and Machines, pp. 161-165.
	6	Aaron Kershenbaum, Telecommunications network design algorithms, McGraw-Hill, Inc., New York, NY, 1993
	7	Sami Khuri , Thomas Bäck , Jörg Heitkötter, An evolutionary approach to combinatorial optimization problems, Proceedings of the 22nd annual ACM computer science conference on Scaling up : meeting the challenge of complexity in real-world computing applications: meeting the challenge of complexity in real-world computing applications, p.66-73, March 08-10, 1994, Phoenix, Arizona, United States [doi>10.1145/197530.197558]
	8	Sami Khuri , Thomas Bäck , Jörg Heitkötter, The zero/one multiple knapsack problem and genetic algorithms, Proceedings of the 1994 ACM symposium on Applied computing, p.188-193, March 06-08, 1994, Phoenix, Arizona, United States [doi>10.1145/326619.326694]
	9	Bernard M. E. Moret , Henry D. Shapiro, Algorithms from P to NP (vol. 1): design and efficiency, Benjamin-Cummings Publishing Co., Inc., Redwood City, CA, 1991
	10	Christos H. Papadimitriou , Kenneth Steiglitz, Combinatorial optimization: algorithms and complexity, Prentice-Hall, Inc., Upper Saddle River, NJ, 1982
	11	Jon T. Richardson , Mark R. Palmer , Gunar E. Liepins , Mike Hilliard, Some guidelines for genetic algorithms with penalty functions, Proceedings of the third international conference on Genetic algorithms, p.191-197, December 1989, George Mason University, United States
	12	Stinson, D. (1987). An Introduction to the Design and Analysis of Algorithms. The Charles Babbage Research Center, Manitoba, Canada. 2nd edition.

CITED BY 10

	Sami Khuri , Tim Walters , Yanti Sugono, A grouping genetic algorithm for coloring the edges of graphs, Proceedings of the 2000 ACM symposium on Applied computing, p.422-427, March 2000, Como, Italy
	Sancho Salcedo-Sanz , Yong Xu , Xin Yao, Hybrid meta-heuristics algorithms for task assignment in heterogeneous computing systems, Computers and Operations Research, v.33 n.3, p.820-835, March 2006
	El-Sayed M. El-Alfy, Applications of genetic algorithms to optimal multilevel design of MPLS-based networks, Computer Communications, v.30 n.9, p.2010-2020, June, 2007
	Bryant A. Julstrom, Evolutionary codings and operators for the terminal assignment problem, Proceedings of the 11th Annual conference on Genetic and evolutionary computation, July 08-12, 2009, Montreal, Québec, Canada
	Sancho Salcedo-Sanz , Yong Xu , Xin Yao, Meta-Heuristic Algorithms for FPGA Segmented Channel Routing Problems with Non-standard Cost Functions, Genetic Programming and Evolvable Machines, v.6 n.4, p.359-379, December 2005
	Duong Nguyen Binh Ta , Suiping Zhou , Haifeng Shen Shen, Greedy Algorithms for Client Assignment in Large-Scale Distributed Virtual Environments, Proceedings of the 20th Workshop on Principles of Advanced and Distributed Simulation, p.103-110, May 24-26, 2006
	Sancho Salcedo-Sanz , Xin Yao, Assignment of cells to switches in a cellular mobile network using a hybrid Hopfield network-genetic algorithm approach, Applied Soft Computing, v.8 n.1, p.216-224, January, 2008
	Duong Nguyen Binh Ta , Suiping Zhou , Haifeng Shen, Greedy Algorithms for Client Assignment in Large-Scale Distributed Virtual Environments, Simulation, v.84 n.10-11, p.521-533, October 2008
	Sancho Salcedo-Sanz , Jose A. Portilla-Figueras , Emilio G. Ortiz-García , Angel M. Pérez-Bellido , Christopher Thraves , Antonio Fernández-Anta , Xin Yao, Optimal switch location in mobile communication networks using hybrid genetic algorithms, Applied Soft Computing, v.8 n.4, p.1486-1497, September, 2008
	Zengnian Zhang , Xudong Ke, Solving terminal allocation problem using simulated annealing arithmetic, WSEAS TRANSACTIONS on SYSTEMS, v.7 n.12, p.1412-1422, December 2008