找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Evolutionary Computation in Combinatorial Optimization; 5th European Confere Günther R. Raidl,Jens Gottlieb Conference proceedings 2005 Spr

[复制链接]
楼主: DUMMY
发表于 2025-3-26 04:56:54 | 显示全部楼层
Giandomenico Falcon,Daria de Pretisknown to be NP-hard due to it’s combinatorial nature. In this paper, two meta-heuristics algorithms – Tabu Search and Simulated Annealing – are proposed. To investigate the effect of control parameters to the performance of tabu search and simulated annealing algorithms, a general factorial design o
发表于 2025-3-26 11:56:30 | 显示全部楼层
发表于 2025-3-26 15:23:08 | 显示全部楼层
https://doi.org/10.1007/b107115Variable; algorithms; ant colony optimization; calculus; combinatorial optimization; constraint satisfact
发表于 2025-3-26 18:36:09 | 显示全部楼层
发表于 2025-3-26 21:17:15 | 显示全部楼层
The Bulgarian Rejoinder to Youth Guaranteeor two variants of the Lin-Kernighan algorithm. Then we analyse the instances in those sets to guide us towards deferring general knowledge about the efficiency of the two variants in relation to structural properties of the symmetric travelling salesman problem.
发表于 2025-3-27 01:26:30 | 显示全部楼层
Centralizing Banking Resolution,strategies employ heuristics that exploit information about the partial colouring in an aim to improve performance. An evolutionary algorithm is used to drive the search. We compare the different strategies to each other on several very hard benchmarks and on generated problem instances, and show where the novel strategies improve the efficiency.
发表于 2025-3-27 07:58:27 | 显示全部楼层
Estimation of Distribution Algorithms with Mutation, of the next generation, instead of conventional crossover and mutation operations. In this paper, we propose new EDAs which incorporate mutation operator to conventional EDAs in order to keep the diversities in EDA populations. Empirical experiments carried out this paper confirm us the effectiveness of the proposed methods.
发表于 2025-3-27 10:49:14 | 显示全部楼层
发表于 2025-3-27 17:35:36 | 显示全部楼层
发表于 2025-3-27 19:17:49 | 显示全部楼层
https://doi.org/10.1007/978-3-319-60258-5g similar to a first-fit heuristic. The results presented are encouraging, demonstrating that GE in conjunction with attribute grammars can provide an improvement over the standard context-free mapping process for problems in this domain.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-22 03:16
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表