[1]AIKENS C H.Facility location models for distribution planning[J]. European Journal of Operational Research,1985,22(3):263-279.
[2]KRARUP J, PRUZAN P M. The simple plant location problem:survey and synthesis[J]. European Journal of Operational Research ,1983,12(1):36-41.
[3]SHULMAN A.An algorithm for solving dynamic capacitated plant location problems with discrete expansion sizes[J]. Operations Research,1991,39(10):423-436.
[4]HOKEY M,EMANUEL M. The relocation of a hybrid manufacturing/distribution facility from supply chain perspectives: a case study[J].Omega,1999,27(1):75-85.
[5]EMANUEL M,HOKEY M. The dynamic relocation and phase-out of a hybrid, two-echelon plant/warehousing facility:a multiple objective approach[J]. European Journal of the Operational Research,2000,123(1):1-15.
[6]ZITZLER E,DEB K,THIELE L. Comparison of multiobjective evolutionary algorithms:empirical results[J].Evolutionary Computation,2000,8(3):173-195.
[7]VELDHUIZEN van D A,LAMONT G B. Multiobjective evolutionary algorithms:analyzing the state-of-the-art[J].Evolutionary Computation,2000,8(2):125-147.
[8]DEB K,PRATAP A. A fast and elitist multiobjective genetic algorithm:NSGA-II[J].IEEE Transactions on Evolutionary Computation,2002,6(2):182-197.
[9]YU YANG.Learning based GA and application in packing[J]. Chinese Journal of Computers, 2002,24(12):1242-1249(in Chinese).[于洋.基于学习的遗传算法及其在布局中的应用[J].计算机学报,2002,24(12):1242-1249.]
[10]BARAGLIA R,HIDALGO J I,PEREGO R.A hybrid heuristic for the traveling salesman problem[J]. IEEE Transactions on Evolutionary Computation,2001,5(6):613-622.
[11]HARIK G, LOBO F,GOLDBERG D.The compact genetic algorithm[J]. IEEE Transactions on Evolutionary Computation,1999,3(4):287-297.
[12]WU Yi. Applied statics[M].Changsha: National University of Defence Technology Publishing House,1995(in Chinese).[吴翌.应用统计学[M].长沙:国防科技大学出版社,1995.]
|