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

推荐订阅源

cs.AI updates on arXiv.org
cs.AI updates on arXiv.org
H
Hackread – Cybersecurity News, Data Breaches, AI and More
酷 壳 – CoolShell
酷 壳 – CoolShell
小众软件
小众软件
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
有赞技术团队
有赞技术团队
大猫的无限游戏
大猫的无限游戏
Security Latest
Security Latest
V
V2EX
Hugging Face - Blog
Hugging Face - Blog
IT之家
IT之家
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
月光博客
月光博客
博客园 - Franky
Threat Intelligence Blog | Flashpoint
Threat Intelligence Blog | Flashpoint
Simon Willison's Weblog
Simon Willison's Weblog
S
Securelist
T
Threatpost
Last Week in AI
Last Week in AI
P
Privacy International News Feed
S
SegmentFault 最新的问题
aimingoo的专栏
aimingoo的专栏
CTFtime.org: upcoming CTF events
CTFtime.org: upcoming CTF events
MyScale Blog
MyScale Blog
P
Palo Alto Networks Blog
Cisco Talos Blog
Cisco Talos Blog
T
Tailwind CSS Blog
Blog — PlanetScale
Blog — PlanetScale
G
GRAHAM CLULEY
GbyAI
GbyAI
G
Google Developers Blog
cs.CL updates on arXiv.org
cs.CL updates on arXiv.org
B
Blog RSS Feed
A
About on SuperTechFans
H
Help Net Security
T
Threat Research - Cisco Blogs
C
Check Point Blog
S
Schneier on Security
Google DeepMind News
Google DeepMind News
T
The Exploit Database - CXSecurity.com
博客园 - 叶小钗
Scott Helme
Scott Helme
博客园 - 司徒正美
美团技术团队
W
WeLiveSecurity
O
OpenAI News
Exploit-DB.com RSS Feed
Exploit-DB.com RSS Feed
AWS News Blog
AWS News Blog
I
InfoQ

博客园 - 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])