C++ edaMpiWorkflow类代码示例

OGeek|极客世界-中国程序员成长平台 › 门户 › 编程› C++›C++教程

原作者: [db:作者] 来自: [db:来源] 收藏邀请

本文整理汇总了C++中edaMpiWorkflow类的典型用法代码示例。如果您正苦于以下问题：C++ edaMpiWorkflow类的具体用法？C++ edaMpiWorkflow怎么用？C++ edaMpiWorkflow使用的例子？那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。

在下文中一共展示了edaMpiWorkflow类的8个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于我们的系统推荐出更棒的C++代码示例。

示例1: main

int main(int argc, char** argv)
{    
    EDAMetasearchStart(argc, argv);
    if (argc != 2)
    {
      std::cerr << "Usage : ./" <<  __progname
                << " [instance]" << std::endl;
    }
    else
    {
        tspProblem graph(argv[1]); 
        tspSolution route(graph);          
        edaExpCoolingSchedule sched(0, N, 0.98);        
        tsp2Opt opt;

        edaPopulation pop;
        pop.init(route, N);

        edaTimeCondition crit( N );
        edaSA sa(opt, sched, crit);
        workflow.set(graph);
        workflow.insertVertex(sa);
        workflow.search(pop);
        
        tspSolution& result = *(tspSolution*) pop[pop.best()];
        cout << "[Route] " << result << endl;
        cout << "[Fitness] " << result.evaluate () << endl;
        
    }
    EDAMetasearchStop();
    return 0;
}

开发者ID:mohcicin，项目名称:metaheuristics，代码行数:32，代码来源:tspSASearch.cpp

示例2: main

int main(int argc, char** argv)
{    
    EDAMetasearchStart(argc, argv);
    if (argc != 2)
    {
      std::cerr << "Usage : ./" <<  __progname
                << " [instance]" << std::endl;
    }
    else
    {
        unsigned int N = 40;
        tspProblem graph(argv[1]); 
        tspSolution route(graph);
        edaBestAspirCrit aspir; 
        edaStaticTabu tabu(1200);
        tsp2Opt opt;

        edaPopulation pop;
        pop.init(route, N);

        edaLoopCondition crit( 15);
        edaTS ts(opt, aspir, tabu, crit);
        
        workflow.set(graph);
        workflow.insertVertex(ts);
        workflow.search(pop);
        
        tspSolution& result = *(tspSolution*) pop[pop.best()];
        cout << "[Route] " << result << endl;
        cout << "[Fitness] " << result.evaluate () << endl;        
    }
    EDAMetasearchStop();
    return 0;
}

开发者ID:nghiabui，项目名称:Metaheuristic，代码行数:34，代码来源:tspTSSearch.cpp

示例3: main

int main(int argc, char** argv)
{    
    EDAMetasearchStart(argc, argv);
    if (argc != 2)
    {
      std::cerr << "Usage : ./" <<  __progname
                << " [instance]" << std::endl;
    }
    else
    {
        unsigned int N = 40;
        schedProblem graph(argv[1]); 
        schedSolution route(graph);  
        edaFirstImprovement stgy;
        sched2Opt opt;

        edaPopulation pop;
        pop.init(route, N);

        edaLoopCondition crit(1500);
        edaHC hc(opt, stgy, crit);
        
        workflow.set(graph);
        workflow.insertVertex(hc);
        workflow.search(pop);
		
        schedSolution& result = *(schedSolution*) pop[pop.best()];
        cout << "[Route] " << result << endl;
        cout << "[Fitness] " << result.evaluate () << endl;
        
    }
    EDAMetasearchStop();
    return 0;
}

开发者ID:nghiabui，项目名称:Metaheuristic，代码行数:34，代码来源:schedHCSearch.cpp

示例4: main

int main(int argc, char** argv)
{
    EDAMetasearchStart(argc, argv);
    if (argc != 2)
    {
        std::cerr << "Usage : ./" <<  __progname
                  << " [instance]" << std::endl;
    }
    else
    {
        tspProblem graph(argv[1]);
        tspSolution route(graph);

        edaBestImprovement stgy;
        edaExpCoolingSchedule sched(0, N, 0.98);
        edaBestAspirCrit aspir;
        edaStaticTabu tabu(N);

        edaRankSelection rank;
        edaPMCrossover cross;
        cross.set( N / 20 );
        edaRandSwapMutation mute;

        tsp2Opt opt;
        edaPopulation pop;
        pop.init(route, N);
        edaTimeCondition crit( N/7. );

        edaSA saSearch(opt, sched, crit);
        edaTS tsSearch(opt, aspir, tabu, crit);
        edaHC hcSearch(opt, stgy, crit);
        edaGA gaSearch(rank, cross, mute, crit);

        unsigned int said0 = workflow.insertVertex (saSearch);
        unsigned int said1 = workflow.insertVertex (saSearch);
        unsigned int tsid2 = workflow.insertVertex (tsSearch);
        unsigned int tsid3 = workflow.insertVertex (tsSearch);
        unsigned int hcid4 = workflow.insertVertex (hcSearch);
        unsigned int hcid5 = workflow.insertVertex (hcSearch);
        unsigned int gaid6 = workflow.insertVertex (gaSearch);

        workflow.insertEdge(said0, hcid4);
        workflow.insertEdge(hcid4, tsid2);
        workflow.insertEdge(said1, hcid5);
        workflow.insertEdge(hcid5, tsid3);
        workflow.insertEdge(tsid3, gaid6);
        workflow.insertEdge(tsid2, gaid6);

        workflow.set(graph);
        workflow.search(pop);

        tspSolution& result = *(tspSolution*) pop[pop.best()];
        cout << "[Route] " << result << endl;
        cout << "[Fitness] " << result.evaluate () << endl;

    }
    EDAMetasearchStop();
    return 0;
}

开发者ID:tanthmjvn，项目名称:meta-heuristics-1.3，代码行数:59，代码来源:tspWF01Search.cpp

示例5: main

int main(int argc, char** argv)
{
    EDAMetasearchStart(argc, argv);
    if (argc != 2)
    {
        std::cerr << "Usage : ./" <<  __progname
                  << " [instance]" << std::endl;
    }
    else
    {
        schedProblem graph(argv[1]);
        schedSolution route(graph);

        edaExpCoolingSchedule sched(0, N, 0.98);

        sched2Opt opt;
        edaPopulation pop;
        pop.init(route, 1);
        edaTimeCondition crit( N/21. );

        edaRankSelection rank;
        edaPMCrossover cross;
        cross.set( N / 20 );
        edaRandSwapMutation mute;

        edaSA saSearch(opt, sched, crit);
        edaGA gaSearch(rank, cross, mute, crit);

        unsigned int said[N], gaid;

        for(unsigned int i = 0; i < N; i++)
        {
            said[i] = workflow.insertVertex (saSearch);
        }
        gaid = workflow.insertVertex (gaSearch);

        for(unsigned int i = 0; i < N; i++)
        {
            workflow.insertEdge(said[i], gaid);
        }

        workflow.set(graph);
        workflow.search(pop);

        schedSolution& result = *(schedSolution*) pop[pop.best()];
        cout << "[Route] " << result << endl;
        cout << "[Fitness] " << result.evaluate () << endl;

    }
    EDAMetasearchStop();
    return 0;
}

开发者ID:nghiabui，项目名称:Metaheuristic，代码行数:52，代码来源:tspWF04Search.cpp

示例6: main

int main(int argc, char** argv)
{    
    EDAMetasearchStart(argc, argv);
    if (argc != 2)
    {
      std::cerr << "Usage : ./" <<  __progname
                << " [instance]" << std::endl;
    }
    else
    {
        unsigned int N = 40;
        schedProblem graph(argv[1]); 
        schedSolution route(graph);   
        
        edaBestImprovement stgy;
        edaExpCoolingSchedule sched(0, 50, 0.98);   
        edaBestAspirCrit aspir; 
        edaStaticTabu tabu(1200);
        
        
        sched2Opt opt;
        edaPopulation pop;
        pop.init(route, N);
        edaLoopCondition crit( 1500 );   
        edaLoopCondition loop(1);   
        edaEliteCollect elite;
        
        edaSA saSearch(opt, sched, crit);
        edaTS tsSearch(opt, aspir, tabu, crit);
        edaHC hcSearch(opt, stgy, crit);
        
        
        unsigned int tsid0 = workflow.insertVertex (tsSearch);
        unsigned int said1 = workflow.insertVertex (saSearch);   
        unsigned int said2 = workflow.insertVertex (saSearch);  
        unsigned int said3 = workflow.insertVertex (saSearch);  
        unsigned int hcid4 = workflow.insertVertex (hcSearch, elite);
       
        workflow.insertEdge(tsid0, said1);
        workflow.insertEdge(tsid0, said2);
        workflow.insertEdge(tsid0, said3);
        workflow.insertEdge(said1, hcid4);
        workflow.insertEdge(said2, hcid4);
        workflow.insertEdge(said3, hcid4);
        workflow.insertLoop(hcid4, tsid0, loop);
        
        workflow.set(graph);
        workflow.search(pop);
        
        schedSolution& result = *(schedSolution*) pop[pop.best()];
        cout << "[Route] " << result << endl;
        cout << "[Fitness] " << result.evaluate () << endl;  
        
    }
    EDAMetasearchStop();
    return 0;
}

开发者ID:nghiabui，项目名称:Metaheuristic，代码行数:57，代码来源:schedWF03Search.cpp

示例7: main

int main(int argc, char** argv)
{    
    EDAMetasearchStart(argc, argv);
    if (argc != 2)
    {
      std::cerr << "Usage : ./" <<  __progname
                << " [instance]" << std::endl;
    }
    else
    {
        unsigned int N = 40;
        tspProblem graph(argv[1]); 
        tspSolution route(graph);
        
        edaRankSelection rank;        
        edaPMCrossover cross;
        edaRandSwapMutation mute;
        edaLoopCondition crit( 1500 );        

        edaPopulation pop;
        pop.init(route, N);        

        edaGA ga(rank, cross, mute, crit); 
        
        workflow.set(graph);
        workflow.insertVertex(ga);
        workflow.search(pop);

        tspSolution& result = *(tspSolution*) pop[pop.best()];
        cout << "[Route] " << result << endl;
        cout << "[Fitness] " << result.evaluate () << endl;
        
    }
    EDAMetasearchStop();
    return 0;
}

开发者ID:nghiabui，项目名称:Metaheuristic，代码行数:36，代码来源:tspGASearch.cpp

示例8: main

int main(int argc, char** argv)
{    
    EDAMetasearchStart(argc, argv);
    if (argc != 2)
    {
      std::cerr << "Usage : ./" <<  __progname
                << " [instance]" << std::endl;
    }
    else
    {

        tspProblem graph(argv[1]); 
        tspSolution route(graph);
        edaBestImprovement stgy;      
        edaLoopCondition loop; 
        tsp2Opt opt;
        
        edaHC hcSearch(opt, stgy, loop);
        
        edaTimeCondition crit(N);  
        edaRankSelection rank;        
        edaPMCrossover cross;
        edaRandSwapMutation mute;          
        cross.set( N / 20 );
        edaPopulation pop;
        pop.init(route, N);  
        #if COMM_MPI
    
            edaLoopCondition noLoop(0); 
            edaLoopCondition oneLoop(1); 


            edaHC trash(opt, stgy, noLoop);
            edaGA gaSearch(rank, cross, mute, oneLoop);         

            unsigned int trashid, hcid[N], gaid;

            trashid = workflow.insertVertex(trash);
            for(unsigned int i = 0; i < N; i++) 
            {
                edaIDCollect clect(i);
                hcid[i] = workflow.insertVertex (hcSearch, clect);                         
            }
            gaid = workflow.insertVertex (gaSearch); 

            for(unsigned int i = 0; i < N; i++) {
                workflow.insertEdge(trashid, hcid[i]);
                workflow.insertEdge(hcid[i], gaid);
            }

            workflow.insertLoop(gaid, trashid, crit);

            
        #else               
            edaRateAdapt adapt(hcSearch);
            edaMA ma(rank, cross, mute, adapt, crit); 
            workflow.insertVertex(ma);
     
        #endif

        workflow.set(graph);
        workflow.search(pop);
            
        tspSolution& result = *(tspSolution*) pop[pop.best()];
        cout << "[Route] " << result << endl;
        cout << "[Fitness] " << result.evaluate () << endl;    
            
    }
    EDAMetasearchStop();
    return 0;
}

开发者ID:nghiabui，项目名称:Metaheuristic，代码行数:71，代码来源:tspMASearch.cpp

注：本文中的edaMpiWorkflow类示例由纯净天空整理自Github/MSDocs等源码及文档管理平台，相关代码片段筛选自各路编程大神贡献的开源项目，源码版权归原作者所有，传播和使用请参考对应项目的License；未经允许，请勿转载。

鲜花

握手

雷人

路过

鸡蛋

该文章已有0人参与评论

请发表评论

全部评论

专题导读

More+

10-27 六六分期app的软件客服如何联系？(六六分期

11-06 可心卡盟:win10系统火狐flash插件崩溃怎么

11-06 亲亲特价:怎么删除回收站图标

11-06 济南大学虚拟社区:鲁大师节能降温的具体办

11-06 xlueops.exe:无线网络安装向导

11-06 女斗合众国:win7系统cf与主机连接不稳定怎

11-06 0xc000022-[cf烟雾头]cf怎么调烟雾头

11-06 qizideyouhuo:应用程序无法正常启动0xc0000

11-06 ipz-185:win7系统vcf文件怎么打开

11-06 傻哥蹦迪:win10系统s4怎么打开usb调试

11-06 八神浩树gtaste:回收站清空了怎么恢复

11-06 妖尾之黑色守护:win10系统电脑没有1440x900

11-06 校园至尊魔王小说:win7系统浏览网页时字体

11-06 女斗合众国:win10系统访问共享文件夹提示请

11-06 tokyo hot n0654:恢复win7系统默认字体一招

11-06 雨酷仙境:设置win7系统转移临时文件夹腾出

11-06 阿穆纳伊之杖:win7系统开始菜单在右边还原

11-06 tunespotting:win10系统火狐flash插件总是

11-06 甘尔葛分析师：计谋网站seo关键词暴涨有什

11-06 蔡贵霖: 计谋网站seo关键词暴涨有什么秘密

11-06 博益网首页:ao3网页版进入不了解决方法

11-06 漏斗子专栏: 网站数据分析小白易懂精华篇

11-06 见证双虹怎么做:win7系统开启telnet命令的

11-06 颾狐蝶蜋:系统资源不足无法完成请求的服务

11-06 国光中学校歌:提交网站到alexa查询详细步骤

11-06 西安有情天:静态网页和动态网页的区别

11-06 红木雅尚斋:外部链接构造对网站的好处

11-06 前官礼遇：防止域名劫持–增强域安全性的10

11-06 密传二转答案: 中文分词算法有哪些

11-06 金泉家园邮编:百度快照劫持的表现及应对方

C++ edge类代码示例发布时间：2022-05-31

C++ ec_secret类代码示例发布时间：2022-05-31

剪的笔顺,诠释剪的笔画,认识剪的部首

1 六六分期app的软件客服如何联系？(六六分期

六六分期app的软件客服如何联系？不知道吗？加qq群【895510560】即可！标题：六六分期

阅读：18257|2023-10-27

2 可心卡盟:win10系统火狐flash插件崩溃怎么

今天小编告诉大家如何处理win10系统火狐flash插件总是崩溃的问题，可能很多用户都不知

阅读：9673|2022-11-06

3 亲亲特价:怎么删除回收站图标

今天小编告诉大家如何对win10系统删除桌面回收站图标进行设置，可能很多用户都不知道

阅读：8175|2022-11-06

4 济南大学虚拟社区:鲁大师节能降温的具体办

今天小编告诉大家如何对win10系统电脑设置节能降温的设置方法，想必大家都遇到过需要

阅读：8547|2022-11-06

5 xlueops.exe:无线网络安装向导

我们在使用xp系统的过程中,经常需要对xp系统无线网络安装向导设置进行设置，可能很多

阅读：8455|2022-11-06

6 女斗合众国:win7系统cf与主机连接不稳定怎

今天小编告诉大家如何处理win7系统玩cf老是与主机连接不稳定的问题，可能很多用户都不

阅读：9387|2022-11-06

7 0xc000022-[cf烟雾头]cf怎么调烟雾头

电脑对日常生活的重要性小编就不多说了，可是一旦碰到win7系统设置cf烟雾头的问题，很

阅读：8427|2022-11-06

8 qizideyouhuo:应用程序无法正常启动0xc0000

我们在日常使用电脑的时候，有的小伙伴们可能在打开应用的时候会遇见提示应用程序无法

阅读：7861|2022-11-06

9 ipz-185:win7系统vcf文件怎么打开

今天小编告诉大家如何对win7系统打开vcf文件进行设置，可能很多用户都不知道怎么对win

阅读：8411|2022-11-06

10 傻哥蹦迪:win10系统s4怎么打开usb调试

今天小编告诉大家如何对win10系统s4开启USB调试模式进行设置，可能很多用户都不知道怎

阅读：7394|2022-11-06

客服电话

电子邮件

C++ edaMpiWorkflow类代码示例

示例1: main

示例2: main

示例3: main

示例4: main

示例5: main

示例6: main

示例7: main

示例8: main

请发表评论

全部评论

上一篇：

下一篇：

GitbookIO/gitbook:

juleswhite/mobile-cloud-asgn1

颜的笔顺,诠释颜的笔画,聊聊颜的部首

kyamagu/matlab-json: Use official API: h

墙壁眼睛膝盖

剪的笔顺,诠释剪的笔画,认识剪的部首

六六分期app的软件客服如何联系？(六六分期

florent37/ViewAnimator: A fluent Android

florent37/Shrine-MaterialDesign2: implem

CVE-2020-36276

SimpleSoftwareIO/simple-sms: Send and re

关于我们

产品与服务

解决方案

139-2527-9053