Titlebook: Hybrid Metaheuristics; Second International María J. Blesa,Christian Blum,Michael Sampels Conference proceedings 2005 Springer-Verlag Berli

惡化

書目名稱Hybrid Metaheuristics影響因子(影響力)




書目名稱Hybrid Metaheuristics影響因子(影響力)學(xué)科排名




書目名稱Hybrid Metaheuristics網(wǎng)絡(luò)公開度




書目名稱Hybrid Metaheuristics網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Hybrid Metaheuristics被引頻次




書目名稱Hybrid Metaheuristics被引頻次學(xué)科排名




書目名稱Hybrid Metaheuristics年度引用




書目名稱Hybrid Metaheuristics年度引用學(xué)科排名




書目名稱Hybrid Metaheuristics讀者反饋




書目名稱Hybrid Metaheuristics讀者反饋學(xué)科排名

Junction

Frisky

審問,審訊

A Taxonomy of Cooperative Search Algorithms,llel meta-heuristics, hybrid meta-heuristic, and cooperative search algorithms. Different taxonomies have been proposed in the literature for parallel and hybrid meta-heuristics. In these taxonomies, one can realize that cooperative search algorithms lie somewhere in between. This paper looks at coo

神化怪物

A Hybrid Genetic and Variable Neighborhood Descent for Probabilistic SAT Problem,m approach with variable neighborhood descent. Our hybrid compares favorable with previous pure genetic algorithm. Computational experiences show that problems with 200 propositional letters can be solved. They are, to the best of our knowledge, the largest PSAT-problems reported in the literature.

背書

公共汽車

crescendo

Fast Ejection Chain Algorithms for Vehicle Routing with Time Windows,aints (VRPTW). Ejection chains create powerful compound moves within Local Search algorithms. Their potential to yield state of the art algorithms has been validated for the traveling salesman problem (TSP), for example. We show how ejection chains can be used to tackle the more general VRPTW as wel

Adenoma

3D Inter-subject Medical Image Registration by Scatter Search,ent conditions. Point matching is an image registration approach based on searching for the right pairing of points between the two images. From this matching, the registration transformation we are searching, can be inferred by means of numerical methods..In this paper, we propose a scatter search

CURT