Titlebook: Hybrid Metaheuristics; Third International Francisco Almeida,María J. Blesa Aguilera,Michael Conference proceedings 2006 Springer-Verlag

angiotensin-I

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

半身雕像

A Multi-population Parallel Genetic Algorithm for Highly Constrained Continuous Galvanizing Line Sc planning department, and the due date information of each steel coil. If the final schedule includes the violations of some constraints, phase two repairs these violations by using a secondary WIP inventory of steel coils. The developed scheduling system is currently being used in a steel making company with encouraging preliminary results.

周年紀(jì)念日

Using Memory to Improve the VNS Metaheuristic for the Design of SDH/WDM Networks,commercial solver. The problem instances cover a large variety of networks and demand patterns. The analysis carried out in this paper corroborates that there are significant differences between the variable neighborhood search and the hybrid approach.

貨物

A Reactive Greedy Randomized Variable Neighborhood Tabu Search for the Vehicle Routing Problem withhood Tabu Search hybrid metaheuristic for intensification search. Experimental results on well known benchmark instances show that the suggested method is both efficient and robust in terms of the quality of the solutions produced.

rods366

Granular

Atrium

Conference proceedings 2006ns was a clear indication that the research community on metaheuristics and related areas felt the need for a forum to discuss speci?c aspects of hybridization of metaheuristics. The selection of papers for HM 2006 consolidated some of the mainstream issues that have emerged from the past editions.

Militia

An Iterated Local Search Heuristic for a Capacitated Hub Location Problem,an Iterated Local Search scheme. The heuristic turns out to be very effective and the results of the computational experiments show that near-optimal solutions can be derived rapidly for instances of large size.

一罵死割除

ADJ

Packing Problems with Soft Rectangles,. To find good sequence pairs, we then resort to local search techniques. This is therefore a hybrid of local search and mathematical programming. The resulting algorithm can solve problem instances with up to 50 rectangles in reasonable amount of time.