[1]D Hochbaum, et al. Approximation algorithms for NP-hard problems[M]. Boston:PWS Publishing, 1996, 46-93.
[2]Andrea Lodi,Silvano Martello,Daniele Vigo.Approximation algorithms for the oriented twodimensional bin packing problem[J]. European Journal of Operational Research, 1999, 112: 158-166.
[3]Garey M R,Johnson D S. Computer arid Intractability:A guide to the theory of NPCompleteness[M].New York Freeman, 1979.
[4]Holland J H. Adaptation in natural and artificial system[M].MIT Press,1992.
[5]Goldberg D E. Genetic algorithms in search, optimization and machine learning[M]. Wesley: Addison, 1989.
[6]Kirkpatrick S, Gellatt C D, Vechi M R. Optimization by simulated annealing[J]. Science, 1983, 220: 671-680.
[7]王海龙. 并行遗传算法在装箱问题中的应用研究[D].上海: 同济大学, 2008. [WANG H L. Research of parallel genetic algorithm in the packing problem [D]. Shanghai: Tongji University, 2008.]
[8]王亚英,邵惠鹤,田雅杰.一种平板车装载问题的启发式算法[J]. 计算机工程, 2007, 27(4):87-89. [WANG Y Y, SHAO H H, TIAN Y J. A heuristic algorithm of flatbed loading problem[J]. Computer Engineering , 2007, 27(4):87-89.]
[9]井祥鹤. 陆路物流物资配载及输送路径优化问题的模型与算法[D]. 南京:南京理工大学. 2007. [JING X H. Model and algorithm of material loading and transmission path in land logistics[D]. Nanjing: Nanjing University of Technology and Engineering. 2007.] |