下载掌阅APP，畅读海量书库
立即打开
[1] Luenberger D. Linear and Nonlinear Programming[M]. 2nd. Boston: Addison-Wesley, 1984.
[2] Bracken J, McCormick G. Selected Applications of Programming[M]. New York: John Wiley & Sons, 1968.
[3] Gabriete D Ragsdell K. Large scale nonlinear programming using the generalized reduced gradient method[J]. ASME Journal of Mechanical Design, 1980, 102: 566-573.
[4] Holland J H. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Application to Biology, Control, and Artificial Intelligence[M]. 2nd. Cambridge: MIT Press, 1992.
[5] Bagley J D. The behavior of adaptive system which employ genetic and correlation algorithm[D]. Ann Arbor: University the Michigan, 1967.
[6] De Jong K A. An analysis of behavior of a class of genetic adaptive systems[D]. Ann Arbor: University the Michigan, 1975.
[7] Booker L B, Goldberg D E. Classifier systems and genetic algorithm[J]. Artificial Intelligence. 1989, 40: 235-282.
[8] Goldberg D E. Genetic Algorithm in Search, Optimization and Machine Learning[M]. Boston: Addison-Wesley, 1989.
[9] Daris L. Handbook of Genetic Algorithms[M]. New York: van Nostrand Reinhold, 1991.
[10] Homaifar A, Qi C, Lai S. Constrained optimization via genetic algorithm[J]. Simulation, 1994, 62(4): 242-254, 1994.
[11] Gen M, Liu B, Ida K. Evolution program for deterministic and stochastic optimizations[J]. Europe Journal of OR, 1996(94): 618-625.
[12] Gen M, Cheng R. Genetic Algorithms and Engineering Design[M]. New York: John Wiley & Sons, 1997.
[13] Gen M, Liu B. A Genetic Algorithm for Nonlinear Goal Programming[J]. Evolutionary Optimization, 1(1): 65-76, 1999.
[14] Hinterding R. Serial and parallel genetic algorithms as functions optimizers[C]. Proceeding of the 5th International Conference on Genetic Algorithms, 1993, San Mateo, CA: Morgan Kaufmann Publisher: 177-183.
[15] Carter M W, Laporte G, Lee S Y. Examination timetabling: Algorithmic strategies and applications[J]. Journal of the Operational Research Society, 1996: 373-383.
[16] Carter M W. A survey of practical applications of examination timetabling algorithms[J]. Operations Research, 1986, 34(2): 193-202.
[17] Okada S, Gen M. Order Relation Between Intervals and Its Application to Shortest Path Problem[J]. Computers & Industrial Engneering., 1993, 25(1-4): 147-150.
[18] Hinterding R. Serial and parallel genetic algorithms as functions optimizers[C]. Proceeding of the 5th International Conference on Genetic Algorithms, 1993, Morgan Kaufmann Publisher, San Mateo, CA: 177-183.
[19] Hinterding, R. Mapping, order-independent genes and the knapsack problem[C]. Proceeding of the First IEEE Conference on Evolutionary Computation, 1994, Orlando, FL: IEEE Press: 13-17.
[20] Mohr A E. Bit allocation in sub-linear time and the multiple-choice knapsack problem[C]. Proceeding of Data Compression Conference, 2002: 352-361.
[21] Dagtzig G, Fulkerson D, Johnson S. Solution of a large scale traveling salesman problems[J]. Operations Research, 1954(2): 393-410.
[22] Grötschel M. On the symmetric traveling salesman problem: solution of a 120 city problem[J]. Mathematical Programming Studies, 1980, (12): 61-77.
[23] Crowder H, PadbergM. Solving large scale symmetric traveling salesman problems to optimality[J]. Management Science, 1995(22): 15-24.
[24] Padberg M, Rinaldi G. Optimization of 532 city symmetric traveling salesman problem by branch and cut[J]. Operations Research Letters, 1987(6): 1-7.
[25] Grötschel M, Holland O. Solution of large scale symmetric traveling salesman problems[J]. Mathematical Programming Studies, 1991, 51: 141-202.
[26] Padberg M. Rinaldi G. A branch and cut algorithm for the resolution of large scale symmetric traveling salesman problem[J]. SIAM Review, 1991(33): 60-100.
[27] Kapur J N, Sahoo P K, Wong A K C. A new method of gray_level picture thresholding using the entropy of the histogram[J]. Computer Vision, Graphics, and Image Processing, 1985(29): 273-285.
[28] Cook R, McConnell I, Oliver C J, et al. MUM (Merge Using Moments segmentation for SAR images[C]. Proceedings of SPIE-The International Society for Optical Engineering, 1994(2316): 92-103.
[29] Ives R W, Eichel P, Magotra N. Application of pixel segmentation to the low rate compression of complex SAR imagery[C]. International Geoscience and Remote Sensing Symposium, 1998: 1064-1067.
[30] Derin H, Kelly P. Modeling and segmentation of speckled images using complex data[J]. IEEE Trans. on Geosci. Remote Sensing, 1990, 28(1): 76-87.
[31] Dong Y, Forster BC. Segmentation of radar imagery using Gaussian markov random field models and wavelet and transform technique[C]. International Geoscience and Remote Sensing Symposium, 1997: 2054-2056.
[32] Lemarechal C, Fjortoft R, Marthon P, et al. SAR image segmentation by morphological methods[C]. Proceeding of SPIE-The International Society for Optical Engineering, 1998, 3497: 111-121.
[33] Venkatachalam V, Choi H, Baraniuk R G. Multiscale SAR Image Segmentation using Wavelet-domain Hidden Markov Tree Models[C]. Algorithms for Synthetic Aperture Radar Imagery Ⅶ. International Society for Optics and Photonics, 2006.
[34] 周激流，吕航．一种基于新型遗传算法的图像自适应增强算法的研究［J］．计算机学报．2001，24（9）：959-963．
[35] Van Dijk A M, Martens J B. Subjective quality assessment of compressed images[J]. Signal Processing, 1997(58): 235-252.
[36] 杨守义，罗伟雄．一种基于高阶统计量的图像质量客观评价方法［J］．北京理工大学学报．2001，21（5）：610-613．
[37] Rosenfield A, Avinash C K. Digital Picture Processing[M]. New York: Academic Press, 1982.
[38] Celik T. Change Detection in Satellite Images Using a Genetic Algorithm Approach[J]. Geoscience and Remote Sensing Letters, IEEE, 2010, 7(2): 386-390.
[39] Ghosh A, Mishra N S, Ghosh S. Fuzzy clustering algorithms for unsupervised change detection in remote sensing images[J]. Information Sciences, 2011, 181(4): 699-715.
[40] Tian J W, Huang Y X. Histogram constraint based fast FCM cluster image segmentation[C]. IEEE International Symposium on Industrial Electronics, 2007: 1623-1627.
[41] Deb K, Pratap A, Agarwal S, Meyarivan T. A fast and elitist multi-objective genetic algorithm: NSGA-Ⅱ[J]. IEEE Transactions on Evolutionary Computation, 2002, 6(2): 182-197.
[42] Zitzler E, Thiele L. Multi-objective evolutionary algorithms: a comparative case study and the strength Pareto approach[J]. IEEE Transactions on Evolutionary Computation, 1999, 3(4): 257-271.
[43] Deb K. Multi-objective optimization using evolutionary algorithms[M]. Chichester: John Wiley & Sons, 2001.
[44] Srinivas N, Deb K. Multi-objective optimization using non-dominated sorting in genetic algorithms[J]. Evolutionary Computation, 1994, 2(3): 221-248.
[45] Horn J, Nafpliotis N, Goldberg D E. A niched Pareto genetic algorithm for multi-objective optimization[C]. Proceeding of the First IEEE Congress on Evolutionary Computation, 1994. 82-87.
[46] Zhang Q, Li H. MOEA/D: A multiobjective evolutionary algorithm based on decomposition[J]. IEEE Transactions on Evolutionary Computation, 2007, 11(6): 712-731.
[47] Tasgin M, Herdagdelen A, Bingol H. Community detection in complex networks using genetic algorithms[EB/OL]. [2020-06-15]. https://arxiv.org/abs/0711.0491?context=physics.
[48] Handl J, Knowles J. An evolutionary approach to multiobjective clustering[J]. IEEE transactions on Evolutionary Computation, 2007, 11(1): 56-76.
[49] Ma L J, Gong M G, Liu J, et al. Multi-level learning based memetic algorithm for community detection[J]. Applied Soft Computing, 2014(19): 121-133.
[50] Barber M J, Clark J W. Detecting network communities by propagating labels under constraints[J]. Physical Review E, 2009, 80(2): 026129.
[51] Coello C A, Van Veldhuizen D A, Lamont G B. Evolutionary algorithms for solving multi-objective problems[M]. New York: Kluwer Academic Publishers, 2002.