惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

酷 壳 – CoolShell
酷 壳 – CoolShell
H
Hacker News: Front Page
P
Palo Alto Networks Blog
T
ThreatConnect
Apple Machine Learning Research
Apple Machine Learning Research
博客园_首页
T
True Tiger Recordings
P
Privacy & Cybersecurity Law Blog
B
Blog
IT之家
IT之家
Last Week in AI
Last Week in AI
F
Full Disclosure
Hacker News: Ask HN
Hacker News: Ask HN
C
Comments on: Blog
Microsoft Azure Blog
Microsoft Azure Blog
C
Cybersecurity and Infrastructure Security Agency CISA
Microsoft Security Blog
Microsoft Security Blog
博客园 - 【当耐特】
N
News and Events Feed by Topic
NISL@THU
NISL@THU
腾讯CDC
雷峰网
雷峰网
Security Latest
Security Latest
李成银的技术随笔
M
Microsoft Research Blog - Microsoft Research
L
LangChain Blog
L
Lohrmann on Cybersecurity
cs.CL updates on arXiv.org
cs.CL updates on arXiv.org
C
Check Point Blog
Y
Y Combinator Blog
Recent Announcements
Recent Announcements
博客园 - Franky
N
News | PayPal Newsroom
V
V2EX
A
About on SuperTechFans
The Register - Security
The Register - Security
月光博客
月光博客
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
Google Online Security Blog
Google Online Security Blog
MyScale Blog
MyScale Blog
Cisco Talos Blog
Cisco Talos Blog
Vercel News
Vercel News
WordPress大学
WordPress大学
C
Cyber Attacks, Cyber Crime and Cyber Security
The Hacker News
The Hacker News
IntelliJ IDEA : IntelliJ IDEA – the Leading IDE for Professional Development in Java and Kotlin | The JetBrains Blog
IntelliJ IDEA : IntelliJ IDEA – the Leading IDE for Professional Development in Java and Kotlin | The JetBrains Blog
爱范儿
爱范儿
A
Arctic Wolf
L
LINUX DO - 最新话题
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More

博客园 - Goodspeed

几种常见的函数 Caesar cipher Transport scheme NOT recognized: [stomp] error running git Canvas 旋转的图片 canvas时钟 火箭起飞 让图标转起来 Tomcat启动脚本 Task中的异常处理 Parallel的陷阱 用Task代替TheadPool 使用ThreadPool代替Thread 正确停止线程 线程同步中使用信号量AutoResetEvent 异步和多线程的区别 C#和.NET Framework的关系 为什么泛型不支持协变性? 可空值类型与值类型这间的转换
遗传算法之背包问题
Goodspeed · 2019-10-12 · via 博客园 - Goodspeed
def gen():
    #print(gen_grade([0, 1, 1, 0, 1, 1]))
    seeds = [[1,0,0,1,1,0], [0,0,1,1,1,0],[0,1,0,1,0,0],[0,1,1,0,0,1]]
    count_down = 1000
    while count_down > 0:
        grade_table = [(seed,gen_grade(seed)) for seed in seeds]
        best = max(grade_table,key = lambda x:x[1])
        print(best)
        # print(seeds)
        dad = survival(grade_table)
        mom = survival([(s,g) for s,g in grade_table if s != dad])
        seeds = [dad, mom] + off_spring(dad, mom) +[best[0]]
        # print(seeds)
        count_down -= 1


def off_spring(dad, mom):
    bro, sis = dad[:3] + mom[3:],mom[:3] + dad[3:]
    #变异
    r =  random.randint(0,5)
    monster = bro.copy()
    # print(r, monster)
    monster[r] = 1 if monster[r] == 0 else 0
    # print(monster)
    return [bro, sis, monster]

def survival(grade_table):
    total = sum([g for s,g, in grade_table])
    r = random.randint(0,total)
    total = 0
    for seed, g in grade_table:
        total += g
        if r <= total:
            return seed
    print (r, grade_table)



def gen_grade(chromosome):
    grade_table = [(15,15),(3,7),(2,10),(5,5),(9,8),(20,17)]
    grades = [grade_table[i] for i,x in enumerate(chromosome) if x > 0]
    if sum([w for w,s in grades]) > 30:
        return 0
    return sum([s for w,s in grades])