找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heur; International Worksh Thomas Stützle,M

[复制链接]
楼主: legerdemain
发表于 2025-3-25 05:41:19 | 显示全部楼层
A Study on Dominance-Based Local Search Approaches for Multiobjective Combinatorial Optimizationmethods based on the iterative improvement of the nondominated set by means of a neighborhood operator. Next, the effect of current solutions selection and of neighborhood exploration techniques for such purpose is studied. Experiments are conducted on a permutation flowshop scheduling problem in a two- and a three-objective variant.
发表于 2025-3-25 09:25:40 | 显示全部楼层
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/310968.jpg
发表于 2025-3-25 13:58:57 | 显示全部楼层
发表于 2025-3-25 16:43:05 | 显示全部楼层
发表于 2025-3-25 23:25:44 | 显示全部楼层
发表于 2025-3-26 02:30:35 | 显示全部楼层
Autonomous Control Approach for Local SearchWe propose here an approach for the autonomous control of a local search algorithm, which has several moves operators, whose efficiency can be diverse and whose application is adjusted according to the observation of the current status of search, in order to adapt to the balance between exploitation and exploration of search space.
发表于 2025-3-26 04:20:31 | 显示全部楼层
发表于 2025-3-26 09:21:41 | 显示全部楼层
Mixed-Effects Modeling of Optimisation Algorithm PerformanceThe learning curves of optimisation algorithms, plotting the evolution of the objective vs. runtime spent. can be viewed as a sample of . data. In this paper we describe . modeling, a standard technique in longitudinal data analysis, and give an example of its application to algorithm performance modeling.
发表于 2025-3-26 15:39:10 | 显示全部楼层
发表于 2025-3-26 17:04:28 | 显示全部楼层
On the Use of Run Time Distributions to Evaluate and Compare Stochastic Local Search Algorithmsmization. We further explore run time distributions and describe a new tool to compare two algorithms based on stochastic local search. For the case where the running times of both algorithms fit exponential distributions, we derive a closed form index that gives the probability that one of them fin
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-2 00:39
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表