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

文化修養(yǎng)

書目名稱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é)科排名

Optometrist

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.

預(yù)示

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.

兇兆

Flat-Feet

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 ..

公司

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.

FACT

Generator

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.

Fermentation

CHASE