Heuristic algorithms for the terminal assignment problem

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 1997, Pages 247-251

  Khuri, Sami ^a   Chiu, Teresa ^a  

^a SAN JOSE STATE UNIVERSITY   (United States)

Author keywords

Combinatorial optimization; Genetic algorithms; Grouping genetic algorithms; Terminal assignment problem

Indexed keywords

COMBINATORIAL OPTIMIZATION; GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; HEURISTIC METHODS;

GROUPING GENETIC ALGORITHMS; HARD CONSTRAINTS; HEURISTIC TECHNIQUES; TERMINAL ASSIGNMENT;

CONCENTRATION (PROCESS);

EID: 4344709987     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/331697.331748     Document Type: Conference Paper

References (12)

1. Abuali, F., Schoenefeld, D., and Wainwright, R. (1994). Terminal Assignment in a Communications Network Using Genetic Algorithms. Proceedings of the 22nd Annual ACM Computer Science Conference, pp. 74-81. ACM Press, Arizona.
2. Back, T. (1992). GENEsYs 1.0. Software distribution and installation notes, Systems Analysis Research Group, LSXI, University of Dortmund, Dortmund, Germany.
3. Corcoran, A. and Wainwright, R. (1993). LibGA: A User-Friendly Workbench for Order-Based Genetic Algorithm Research. Proceedings of the 1993 ACM/SIGAPP Symposium on Applied Computing, pp. 111-117. ACM Press, New York.
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. Kershenbaum, A. (1993). Telecommunications Network Design Algorithms. McGraw-Hill.
7. Khuri, S., Back, T., and Heitkotter, J. (1994). An Evolutionary Approach to Combinatorial Optimization Problems. Proceedings of the 22nd A CM Computer Science Conference, pp. 66-73. Phoenix, Arizona.
8. Khuri, S., Back, T., and Heitkotter, J. (1994). The Zero/One Multiple Knapsack Problem and Genetic Algorithms. Proceedings of the 1994 ACM Symposium on Applied Computing, pp. 188-193. Phoenix, Arizona.
9. Moret, B. and Shapiro, H. (1991). Algorithms from P to NP. Volume I: Design and Efficiency. The Benjamin/Cummings Publishing Company, Inc., California.
10. Papadimitriou, C. and Steiglitz, K. (1982). Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Inc., New Jersey.
11. Richardson, J., Palmer, M., Liepins, G., and Hilliard, M. (1989). Some guidelines for Genetic Algorithms with Penalty Functions. Proceedings of the 3rd International Conference on Genetic Algorithms and Their Applications. Morgan Kaufmann Publishers, California.
12. Stinson, D. (1987). An Introduction to the Design and Analysis of Algorithms. The Charles Babbage Research Center, Manitoba, Canada. 2nd edition.