GEP Book
Home
News
Author
Q&A
Tutorials
Downloads
GEP Biblio
Contacts
Visit Gepsoft
|
C. FERREIRA |
In J. M. Santos and A. Zapico, eds., Proceedings of the Argentine Symposium on Artificial Intelligence, pages 160-174, Santa Fe, Argentina, 2002.
|
|
|
Combinatorial Optimization by Gene Expression Programming: Inversion Revisited
|
|
Bibliography |
|
Ambati, B. K., J. Ambati, and M. M. Mokhtar, 1991. Heuristic Combinatorial Optimization by Simulated Darwinian Evolution: A Polynomial Time Algorithm for the Traveling Salesman Problem.
Biological Cybernetics, 65: 31-35.
Bagley, J. D., The Behavior of Adaptive Systems which Employ Genetic and Correlation
Algorithms, Doctoral Dissertation, University of Michigan, 1967.
Banzhaf, W., 1990. The “Molecular” Traveling Salesman Problem.
Biological Cybernetics, 64: 7-14.
Beyer, H.-G., Some Aspects of the “Evolution Strategy” for Solving TSP-Like Optimization Problems Appearing at the Design Studies of the 0.5 TeVe+e--Linear Collider. In R. Männer and B. Manderick, eds.,
Parallel Problem Solving From Nature II, 461-470, Amsterdam, North-Holland, 1992.
Bonachea, D., E. Ingerman, J. Levy, and S. McPeak, An Improved Adaptive Multi-Start Approach to Finding Near-Optimal Solutions to the Euclidean TSP. In D. Whitley, D. Goldberg, E. Cantu-Paz, L. Spector, I. Parmee, and H.-G. Beyer, eds.,
Proceedings of the Genetic and Evolutionary Computation
Conference, 143-150, Las Vegas, Nevada, Morgan Kaufmann, 2000.
Davis, L., Applying Adaptive Algorithms to Epistatic Domains. In
Proceedings of the International Joint Conference on Artificial
Intelligence, 162-164, 1985.
Ferreira, C., 2001. Gene Expression Programming: A New Adaptive Algorithm for Solving Problems.
Complex Systems, 13 (2): 87-129.
Ferreira, C., Mutation, Transposition, and Recombination: An Analysis of the Evolutionary Dynamics. In H. J. Caulfield, S.-H. Chen, H.-D. Cheng, R. Duro, V. Honavar, E. E. Kerre, M. Lu, M. G. Romay, T. K. Shih, D. Ventura, P. P. Wang, Y. Yang, eds.,
Proceedings of the 6th Joint Conference on Information Sciences, 4th International Workshop on Frontiers in Evolutionary
Algorithms, pages 614-617, Research Triangle Park, North Carolina, USA, 2002.
Fogel, D. B., 1988. An Evolutionary Approach to the Traveling Salesman Problem.
Biological Cybernetics, 60: 139-144.
Fogel, D. B., A Parallel Processing Approach to a Multiple Traveling Salesman Problem Using Evolutionary Programming. In L. Canter, ed.,
Proceedings of the Fourth Annual Parallel Processing Symposium, 318-326, Fullerton, CA, 1990.
Fogel, D. B., 1993. Applying Evolutionary Programming to Selected Traveling Salesman Problems.
Cybernetics and Systems, 24: 27-36.
Goldberg, D. E. and R. Lingle, Alleles, Loci and the Traveling Salesman Problem. In J. J. Grefenstette, ed.,
Proceedings of the First International Conference on Genetic Algorithms and Their
Applications, Lawrence Erlbaum, 154-159, 1985.
Goldberg, D. E., Genetic Algorithms in Search, Optimization, and Machine
Learning. Addison-Wesley, 1989.
Grefenstette, J. J., R. Gopal, B. Rosmaita, and D. van Gucht, Genetic Algorithms for the Traveling Salesman Problem. In J. J. Grefenstette, ed.,
Proceedings of the First International Conference on Genetic Algorithms and Their
Applications, 160-165, Lawrence Erlbaum, 1985.
Grefenstette, J. J., Incorporating Problem Specific Knowledge into Genetic Algorithms. In L. Davis, ed.,
Genetic Algorithms and Simulated Annealing, 42-60, Los Altos, CA, Morgan Kaufmann, 1987.
Haupt, R. L. and S. E. Haupt, Practical Genetic
Algorithms. Wiley-Interscience, 1998.
Herdy, M., Application of the Evolutionstrategie to Discrete Optimization Problems. In H.-P. Schwefel and R. Männer, eds.,
Parallel Problem Solving from Nature, Lecture Notes in Computer
Science, 496: 188-192, Springer-Verlag, 1991.
Holland, J. H., Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial
Intelligence, University of Michigan Press, 1975 (second edition: MIT Press, 1992).
Hsu, W. W. and C.-C. Hsu, The Spontaneous Evolution Genetic Algorithm for Solving the Traveling Salesman Problem. In L. Spector, E. D. Goodman, A. Wu, W. B. Langdon, H.-M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M. H. Garzon, and E. Burke, eds.,
Proceedings of the Genetic and Evolutionary Computation
Conference, 359-366, San Francisco, California, Morgan Kaufmann, 2001.
Jog, P., J. Y. Suh, and D. van Gucht, The Effects of Population Size, Heuristic Crossover and Local Improvement on a Genetic Algorithm for the Traveling Salesman Problem. In J. Schaffer, ed.,
Proceedings of the Third International Conference on Genetic
Algorithms, 110-115, Los Altos, CA, Morgan Kaufmann, 1989.
Johnson, D. S. and L. A. McGeoch, The Traveling Salesman Problem: A Case Study. In E. H. L. Aarts and J. K. Lenstra, eds.,
Local Search in Combinatorial Optimization, 215-310, Wiley & Sons, New York, 1997.
Katayama, K. and H. Narihisa, Iterated Local Search Approach Using Gene Transformation to the Traveling Salesman Problem. In W. Banzhaf, ed.,
Proceedings of the Genetic and Evolutionary Computation
Conference, 321-328, Morgan Kaufmann, 1999.
Larrañaga, P., C. M. H. Kuijpers, and R. H. Murga, Tackling the Traveling Salesman Problem: Representations and Operators,
Technical Report, 1998.
Liepins, G. E., M. R. Hilliard, M. Palmer, and M. Morrow, Greedy Genetics. In J. J. Grefenstette, ed.,
Genetic Algorithms and Their Applications: Proceedings of the Second International
Conference, 90-99, Lawrence Erlbaum, 1987.
Lin, S., 1965. Computer Solutions on the Traveling Salesman Problem.
Bell Systems Techn. J., 44: 2245-2269.
Merz, P. and B. Freisleben, Genetic Local Search for the TSP: New Results. In T. Bäck, Z. Michalewicz, and X. Yao, eds.,
Proceedings of the 1997 IEEE International Conference on Evolutionary
Computation, 159-164, Piscataway, NJ, IEEE Press, 1997.
Michalewicz, Z., Genetic Algorithms + Data Structures = Evolution
Programs. Springer Verlag, Berlin, 1992 (3rd edition: 1996).
Mitchell, M., An Introduction to Genetic
Algorithms. MIT Press, 1996.
Mühlenbein, H., M. Gorges-Schleuter, and O. Krämer, 1988. Evolution Algorithms in Combinatorial Optimization.
Parallel Computing, 7: 65-85.
Mühlenbein, H., Parallel Genetic Algorithms, Population Genetics and Combinatorial Optimization. In J. Schaffer, ed.,
Proceedings of the Third International Conference on Genetic
Algorithms, 416-421, Los Altos, CA, Morgan Kaufmann, 1989.
Nagata, Y. and S. Kobayashi, Edge Assembly Crossover: A High-Power Genetic Algorithm for the Traveling Salesman Problem. In T. Bäck, ed.,
Proceedings of the 7th International Conference on Genetic
Algorithms, 450-457, Morgan Kaufmann, 1997.
Oliver, I. M., D. J. Smith, and J. R. C. Holland, A Study of Permutation Crossover Operators on the Traveling Salesman Problem. In J. J. Grefenstette, ed.,
Genetic Algorithms and Their Applications: Proceedings of the Second International
Conference, 224-230, Lawrence Erlbaum, 1987.
Papadimitriou, C. H. and K. Steiglitz, Combinatorial
Optimization, Prentice Hall, 1982.
Reinelt, G., The Traveling Salesman: Computational Solutions for TSP Applications.
Lecture Notes in Computer Science, 496: 188-192, Springer-Verlag, Berlin, Germany, 1994.
Suh, J. Y. and D. van Gucht, Incorporating Heuristic Information into Genetic Search. In J. J. Grefenstette, ed.,
Genetic Algorithms and Their Applications: Proceedings of the Second International
Conference, 100-107, Lawrence Erlbaum, 1987.
Syswerda, G., Schedule Optimization Using Genetic Algorithms. In L. Davis, ed.,
Handbook of Genetic Algorithms, 332-349, Van Nostrand Reinhold, New York, 1991.
Tank, D. W. and J. J. Hopfield, 1987. Collective Computation in Neuronlike Circuits.
Scientific American, 257 (6): 104-114.
Tao, G. and Z. Michalewicz, Inver-Over Operator for the TSP. In A.-E. Eiben, T. Bäck, M. Schoenauer, and H.-P. Schwefel, eds.,
Proceedings of the 5th International Conference on Parallel Problem Solving from Nature, Lecture Notes in Computer
Science, 1498: 803-812, Springer Verlag, 1998.
Ulder, N. L. J., E. H. L. Aarts, H.-J. Bandelt, P. J. M. van Laarhoven, and E. Pesch, Genetic Local Search Algorithms for the Traveling Salesman Problem. In
Parallel Problem Solving from Nature, 106-116, Springer Verlag, 1990.
Whitley, D., T. Starkweather, and D. Fuquay, Scheduling Problems and Traveling Salesman: The Genetic Edge Recombination Operator. In J. Schaffer, ed.,
Proceedings of the Third International Conference on Genetic
Algorithms, 133-140, Los Altos, CA, Morgan Kaufmann, 1989.
Whitley, D., T. Starkweather, and D. Shaner, The Traveling Salesman and Sequence Scheduling: Quality Solutions Using Genetic Edge Recombination. In L. Davis, ed.,
Handbook of Genetic Algorithms, 350-372, Van Nostrand Reinhold, New York, 1991.
|
|
Home
|
Contents
| Previous
|
|