[1] 沈瑜,徐逸清,陈龙翔. 高压配电网优化规划的研究[J]. 电网技术,2011,35(10):70-75. SHEN Yu, XU Yi-qing, CHEN Long-xiang. Studies on optimal planning of high voltage distribution network[J]. Power System Technology, 2011, 35(10): 70-75. [2] 何永秀,杨卫红,李艳,等. 城市电网规划与城市规划协调机制设计与评价[J]. 中国电力,2009,42(12):6-10. HE Yong-xiu, YANG Wei-hong, LI Yan, et al . Coordination mechanism design and evaluation of urban power network planning and urban planning [J]. Electric Power, 2009, 42(12): 6-10. [3] 黄娟娟,钟胜. 三峡近区特高压电网优化[J].中国电力,2010, 43(6):41-45. HUANG Juan-juan, ZHONG Sheng. Optimization of the near region UHV power grid of Three Gorges [J]. Electric Power, 2010, 43(6): 41-45. [4] 周建平,林韩,温步瀛.改进量子遗传算法在输电网规划中的应用[J]. 电力系统保护与控制,2012,40(19):90-95. ZHOU Jian-ping, LIN Han, WEN Bu-ying. Application of improved quantum genetic algorithm in transmission network expansion planning[J]. Power System Protection and Control,2012, 40(19): 90-95. [5] 曹福成,魏志恒,谭忠富. 美国输电规划的准则及其对我国的启示[J]. 中国电力,2006,39(12):76-78. CAO Fu-cheng, WEI Zhi-heng, TAN Zhong-fu. The transmission planning principles of American and illumination to China[J].Electric Power, 2006, 39(12): 76-78. [6] 吴正佳,张利平,王魁. 蚁群算法在一维下料优化问题中的应用[J]. 机械科学与技术,2008,27(12):1681-1684. WU Zheng-jia, ZHANG Li-ping, WANG Kui. An ant colony algorithm for one-dimensional cutting stock problem[J]. Mechanical Science and Technology for Aerospace Engineering,2008, 27(12): 1681-1684. [7] 张晓明. 下料问题中两种启发式算法的比较研究[J]. 福建师范大学学报,2006,22(3):15-19. ZHANG Xiao-ming. Research on comparison of two algorithm of elicitation for cutting stock problem[J]. Journal of Fujian Normal University, 2006, 22(3): 15-19. [8] 刘润涛,陈媛婧. 型材下料问题算法研究[J]. 计算机工程与应用,2009,45(25):215-217. LIU Run-tao, CHEN Yuan-jing. Algorithm research on shaped material cutting problem[J].Computer Engineering and Applications, 2009, 45(25): 215-217. [9] 刘睿,严玄. 一种有效的求解一维下料问题的启发式算法[J].计算机应用,2009,29(4):1180-1181. LIU Rui, YAN Xuan. Efficient heuristic algorithm for one- dimensional cutting stock problem[J]. Journal of Computer Applications, 2009, 29(4): 1180-1181. [10] 郑文,崔耀东,周密. 一种基于递归技术的一维下料算法[J]. 广西科学院学报,2010,26(4):415-417. ZHENG Wen, CUI Yao-dong, ZHOU Mi. A recursive algorithm for one-dimensional cutting stock problem[J]. Journal of Guangxi Academy of Science, 2010, 26(4): 415-417. [11] 吴迪,李长荣,宋广军. 基于蜂群遗传算法的一维优化下料问题[J]. 计算机技术与发展,2010,20(10):82-85. WU Di, LI Chang-rong, SONG Guang-jun. Bee swarm genetic algorithm for one-dimensional cutting problem[J]. Computer Technology And Development, 2010, 20(10): 82-85. [12] 贾志新,殷国富,胡晓兵. 一维下料方案的遗传算法优化[J]. 西安交通大学学报,2002,36(9):967-970. JIA Zhi-xin, YIN Guo-fu, HU Xiao-bing. Optimization for one- dimensional cutting-stock problem based on genetic[J]. Journal of Xi’an Jiaotong University, 2002, 36(9): 967-970. [13] 张公敬,徐熙君. 遗传算法在无重复规格一维下料优化中的应用[J]. 计算机仿真,2008,25(3):275-277. ZHANG Gong-jing, XU Xi-jun. Application of genetic algorithm to optimization of one-dimensional cutting-stock without replicated sizes[J]. Computer Simulation, 2008, 25(3): 275-277. [14] 郑晓军,杨光辉,滕弘飞. 多规格一维下料问题基于满意度模拟退火算法[J]. 大连理工大学学报,2009,49(6):865-871. ZHENG Xiao-jun, YANG Guang-hui, TENG Hong-fei. Simulated annealing algorithm based on satisfaction degree for one- dimensional cutting stock problems with multiple stock lengths[J].Journal of Dalian University of Technology, 2009, 49(6): 865-871. [15] 秦平平,刘文,王兴华. 分支定界算法优化一维下料问题[J]. 科学技术与工程,2008,8(11):2938-2940. QING Ping-ping, LIU Wen, WANG Xing-hua. Branch and bound algorithm for optimization of one-dimensional cutting stock problems[J]. Science Technology and Engineering, 2008, 8(11):2938-2940. |