A hybrid genetic algorithm for the Three-Index Assignment Problem
暂无分享,去创建一个
[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[2] Yves Crama,et al. Approximation algorithms for three-dimensional assignment problems with triangle inequalities , 1992 .
[3] D. E. Goldberg,et al. Genetic Algorithms in Search , 1989 .
[4] Panos M. Pardalos,et al. GRASP With Path Relinking For The Three-Index Assignment Problem , 2000 .
[5] William P. Pierskalla,et al. Letter to the Editor - The Multidimensional Assignment Problem , 1968, Oper. Res..
[6] Lawrence. Davis,et al. Handbook Of Genetic Algorithms , 1990 .
[7] Kenneth C. Gilbert,et al. MULTIDIMENSIONAL ASSIGNMENT PROBLEMS , 1988 .
[8] Eugene L. Lawler,et al. Traveling Salesman Problem , 2016 .
[9] Egon Balas,et al. An Algorithm for the Three-Index Assignment Problem , 1991, Oper. Res..
[10] R. Burkard,et al. Computational investigations on 3-dimensional axial assignment problems , 1993 .
[11] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[12] David E. Goldberg,et al. Alleles, loci and the traveling salesman problem , 1985 .
[13] G. Syswerda,et al. Schedule Optimization Using Genetic Algorithms , 1991 .
[14] Nostrand Reinhold,et al. the utility of using the genetic algorithm approach on the problem of Davis, L. (1991), Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York. , 1991 .
[15] Pedro Larrañaga,et al. Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators , 1999, Artificial Intelligence Review.
[16] Gerhard J. Woeginger,et al. Three-dimensional Axial Assignment Problems with Decomposable Cost Coefficients , 1996, Discret. Appl. Math..
[17] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .