找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Hybrid Metaheuristics; 6th International Wo María J. Blesa,Christian Blum,Andrea Schaerf Conference proceedings 2009 Springer-Verlag Berlin

[复制链接]
查看: 28563|回复: 50
发表于 2025-3-21 19:59:35 | 显示全部楼层 |阅读模式
书目名称Hybrid Metaheuristics
副标题6th International Wo
编辑María J. Blesa,Christian Blum,Andrea Schaerf
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Hybrid Metaheuristics; 6th International Wo María J. Blesa,Christian Blum,Andrea Schaerf Conference proceedings 2009 Springer-Verlag Berlin
描述The International Workshop on Hybrid Metaheuristics was established with the aim of providing researchers and scholars with a forum for discussing new ideas and research on metaheuristics and their integration with techniques typical of other ?elds. The papers accepted for the sixth workshop con?rm that such a combination is indeed e?ective and that several research areas can be put together.Slowlybut surely,thisprocesshasbeen promotingproductivedialogue amongresearcherswithdi?erentexpertiseanderodingbarriersbetweenresearch areas. The papers in this volume give a representativesample of current researchin hybrid metaheuristics. It is worth emphasizing that this year, a large number of papers demonstrated how metaheuristics can be integrated with integer linear programmingandotheroperationsresearchtechniques.Constraintprogramming is also featured, which is a notable representative of arti?cial intelligence solving methods. Most of these papers are not only a proof of concept – which can be valuable by itself – but also show that the hybrid techniques presented tackle di?cult and relevant problems. In keeping with the tradition of this workshop, special care was exercised in the revi
出版日期Conference proceedings 2009
关键词Permutation; Scheduling; algorithmics; algorithms; ant colony optimization; approximation algorithms; clus
版次1
doihttps://doi.org/10.1007/978-3-642-04918-7
isbn_softcover978-3-642-04917-0
isbn_ebook978-3-642-04918-7Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2009
The information of publication is updating

书目名称Hybrid Metaheuristics影响因子(影响力)




书目名称Hybrid Metaheuristics影响因子(影响力)学科排名




书目名称Hybrid Metaheuristics网络公开度




书目名称Hybrid Metaheuristics网络公开度学科排名




书目名称Hybrid Metaheuristics被引频次




书目名称Hybrid Metaheuristics被引频次学科排名




书目名称Hybrid Metaheuristics年度引用




书目名称Hybrid Metaheuristics年度引用学科排名




书目名称Hybrid Metaheuristics读者反馈




书目名称Hybrid Metaheuristics读者反馈学科排名




单选投票, 共有 1 人参与投票
 

0票 0.00%

Perfect with Aesthetics

 

1票 100.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 23:54:48 | 显示全部楼层
Hybridizing Beam-ACO with Constraint Programming for Single Machine Job Scheduling,on of ant colony optimization known as Beam-ACO. The idea is to reduce the time spent for constraint propagation by parallelizing the solution construction process as done in Beam-ACO. The results of the proposed algorithm show indeed that it is currently the best performing algorithm for the above mentioned single machine job scheduling problem.
发表于 2025-3-22 03:49:48 | 显示全部楼层
Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Nhborhood structures searched using the MIP approach and by efficiently calculating cyclic exchanges, respectively. While the MIP approach alone is only able to obtain good solutions for instances involving few servers, the hybrid VNS performs well especially also on larger instances.
发表于 2025-3-22 06:52:18 | 显示全部楼层
发表于 2025-3-22 09:14:25 | 显示全部楼层
A Hybrid Solver for Large Neighborhood Search: Mixing , and ,,,uristics improve the standard CP search, in terms of both goodness of the solution reached and execution time. . will be integrated into a more general tool to solve Constraint Satisfaction/Optimization Problems. Moreover, it can be seen as a new library for approximate and efficient searching in ..
发表于 2025-3-22 13:24:20 | 显示全部楼层
Multi-neighborhood Local Search for the Patient Admission Problem,maximum-cardinality matching problem on a bipartite graph. The outcome is that our results compare favorably with the previous work on the problem, improving on all the available instances, and are also quite close to the computed lower bounds.
发表于 2025-3-22 19:21:07 | 显示全部楼层
发表于 2025-3-23 00:20:01 | 显示全部楼层
Hybrid Metaheuristic for the Assembly Line Worker Assignment and Balancing Problem,uch as Iterated Local Search, and clustering them into clusters that are then explored further with local search heuristics. Computational results considering instances available in the literature are presented to demonstrate the efficacy of the CS.
发表于 2025-3-23 04:45:34 | 显示全部楼层
发表于 2025-3-23 08:56:21 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-10 03:22
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表