计算机学报
計算機學報
계산궤학보
CHINESE JOURNAL OF COMPUTERS
2010年
4期
755-767
,共13页
应伟勤%李元香%SHEU Phillip C-Y%吴昱%余法红
應偉勤%李元香%SHEU Phillip C-Y%吳昱%餘法紅
응위근%리원향%SHEU Phillip C-Y%오욱%여법홍
多目标优化%演化算法%热力学替换%角度熵%距离能量
多目標優化%縯化算法%熱力學替換%角度熵%距離能量
다목표우화%연화산법%열역학체환%각도적%거리능량
multi-objective optimization%evolutionary algorithms%thermodynamical replacement%angle entropy%distance energy
热力学遗传算法(Thermodynamical Genetic Algorithms,TDGAs)借鉴热力学中的自由能极小过程来统一处理多目标优化在逼近性和多样性两方面的任务.为提高TDGA的运行效率和解集分布均匀性,提出了一种几何热力学选择.在该选择中首先定义角度熵通过扇形采样来度量种群逼近方向的多样性.然后利用距离精英定义距离能量来度量种群的逼近程度,避免了耗时的非劣分层操作.此外,引入分量热力学替换规则以较低计算代价驱动种群的几何自由能快速下降.在多目标0/1背包问题上的实验结果表明,几何热力学选择极大地提高了TDGA的运行效率和解集分布均匀性;采用该选择的TDGA算法可生成与NSGA-Ⅱ在逼近性和分布多样性上性能相当的解,但在运行效率上明显优于NSGA-Ⅱ.
熱力學遺傳算法(Thermodynamical Genetic Algorithms,TDGAs)藉鑒熱力學中的自由能極小過程來統一處理多目標優化在逼近性和多樣性兩方麵的任務.為提高TDGA的運行效率和解集分佈均勻性,提齣瞭一種幾何熱力學選擇.在該選擇中首先定義角度熵通過扇形採樣來度量種群逼近方嚮的多樣性.然後利用距離精英定義距離能量來度量種群的逼近程度,避免瞭耗時的非劣分層操作.此外,引入分量熱力學替換規則以較低計算代價驅動種群的幾何自由能快速下降.在多目標0/1揹包問題上的實驗結果錶明,幾何熱力學選擇極大地提高瞭TDGA的運行效率和解集分佈均勻性;採用該選擇的TDGA算法可生成與NSGA-Ⅱ在逼近性和分佈多樣性上性能相噹的解,但在運行效率上明顯優于NSGA-Ⅱ.
열역학유전산법(Thermodynamical Genetic Algorithms,TDGAs)차감열역학중적자유능겁소과정래통일처리다목표우화재핍근성화다양성량방면적임무.위제고TDGA적운행효솔화해집분포균균성,제출료일충궤하열역학선택.재해선택중수선정의각도적통과선형채양래도량충군핍근방향적다양성.연후이용거리정영정의거리능량래도량충군적핍근정도,피면료모시적비렬분층조작.차외,인입분량열역학체환규칙이교저계산대개구동충군적궤하자유능쾌속하강.재다목표0/1배포문제상적실험결과표명,궤하열역학선택겁대지제고료TDGA적운행효솔화해집분포균균성;채용해선택적TDGA산법가생성여NSGA-Ⅱ재핍근성화분포다양성상성능상당적해,단재운행효솔상명현우우NSGA-Ⅱ.
Thermodynamical genetic algorithms(TDGAs) simulate the minimization of free energy in thermodynamics to deal simultaneously with both convergence and diversity in multi-objective optimization. A geometric thermodynamical selection(GTS) is proposed to improve the running efficiency and the distribution uniformity of solutions of TDGA. In GTS, an angle entropy is introduced to measure the diversity of convergent directions by sector sampling and then a distance energy is presented to measure the extent of convergence by distance elitist rather than the expensive non-dominated sorting. In addition, a component thermodynamical replacement rule is used to force the geometric free energy of population to steeply descend with low computational costs. Experimental results on multi-objective 0/1 knapsack problems show that GTS remarkably improves the running efficiency and the distribution uniformity of solutions of TDGA. At the same time, TDGA with GTS produces a perfect convergence and spread of solutions as well as NSGA-Ⅱ, while its running efficiency is much higher than that of NSGA-Ⅱ.