bz51 / geneticalgorithm Goto Github PK

Contributors

Stargazers

Forkers

w019746 feigebaqi godxkey hujumping waffcloud wangningxiaomogu tree96 githublovered lrjxaint xiaolaozai chrisyang121 kevinyzy1 whyaqc croceit xuehongjiao emmaying amber11211 redpoppet mrluin www1996 linengier earthsaver lovealbeni loger9567 libinbinbinbin fxma zhulinhai1996 levid-gc xujiachen xbcdbc leural gyyfifafans sundice asyura33 166001738 gaintyhorm orangecolar zyouzz ocde xylewis sanmy911 hungrykonata mylovetop liuyifei0615 neuwzk cjinchen creatorcen seek-knowledge 2333333-546 bupt-lrc xionglian302 gh202011 wsearl getsum-zero a1410110122 zmm-sunny-ai yamahah sydboys qyc1997 nirosed zhangshaocong258 uqqq lin-wen-jun roboticsandcloud lovetheworldaways rose-orchid itcastpygit lxyg06 jisuz guanguanok hmrg-grmh ni11235 lzp8o23 quincynickyoung chongtianfeiyu mwsssxu krissyyan lichunyan3 szdidi starlightinfinite wuxiuga peiyubin zhoushaojun wantbook-book rtosep 2644556969 swpsgithub mengtc seanbit lajiaboer linfeng521 lipxisi hiwedo gbkus123 xpzssa reverie24 cyt1984 chenyang48671155 wlylwy jlongguo

function calAdaptability(chromosomeMatrix) {
    adaptability = [];

    // 计算每条染色体的任务长度
    for (var chromosomeIndex=0; chromosomeIndex<chromosomeNum; chromosomeIndex++) {
        var maxLength = Number.MIN_VALUE;
        for (var nodeIndex=0; nodeIndex<nodeNum; nodeIndex++) {
            var sumLength = 0;
            for (var taskIndex=0; taskIndex<taskNum; taskIndex++) {
                if (chromosomeMatrix[chromosomeIndex][taskIndex] == nodeIndex) {
                    sumLength += timeMatrix[taskIndex][nodeIndex];
                }
            }

            if (sumLength > maxLength) {
                maxLength = sumLength;
            }
        }

        // 适应度 = 1/任务长度
        adaptability.push(1/maxLength);
    }
}

var maxLength = Number.MIN_VALUE;
var sumLength = 0;
for (var taskIndex=0; taskIndex<taskNum; taskIndex++) {
    var nodeIndex = chromosomeMatrix[chromosomeIndex][taskIndex]
    sumLength += timeMatrix[taskIndex][nodeIndex];
}

if (sumLength > maxLength) {
    maxLength = sumLength;
}