Titlebook: Metaheuristic Optimization via Memory and Evolution; Tabu Search and Scat Ramesh Sharda,Stefan Vo?,Bahram Alidaee Book 2005 Springer-Verlag

揭發(fā)

書目名稱Metaheuristic Optimization via Memory and Evolution影響因子(影響力)




書目名稱Metaheuristic Optimization via Memory and Evolution影響因子(影響力)學(xué)科排名




書目名稱Metaheuristic Optimization via Memory and Evolution網(wǎng)絡(luò)公開度




書目名稱Metaheuristic Optimization via Memory and Evolution網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Metaheuristic Optimization via Memory and Evolution被引頻次




書目名稱Metaheuristic Optimization via Memory and Evolution被引頻次學(xué)科排名




書目名稱Metaheuristic Optimization via Memory and Evolution年度引用




書目名稱Metaheuristic Optimization via Memory and Evolution年度引用學(xué)科排名




書目名稱Metaheuristic Optimization via Memory and Evolution讀者反饋




書目名稱Metaheuristic Optimization via Memory and Evolution讀者反饋學(xué)科排名

看法等

Book 2005aving "adaptive memory programming" as a primary focus. Individual chapters identify useful new implementations or new ways to integrate and apply the principles of TS and SS, or that prove new theoretical results, or describe the successful application of these methods to real world problems..

Aviary

Feigned

A Tabu Search Heuristic for the Uncapacitated Facility Location Problemms with known optimal solutions from the literature. Solutions obtained with this tabu search procedure completely dominate those obtained with the Lagrangian method for randomly generated test problems.

coalition

Adaptive Memory Search Guidance for Satisfiability Problemsaintaining extra memory search guidance structures and the potential benefit they have on the search. Computational results on a portfolio of satisfiability problems from SATLIB illustrating these tradeoffs are presented.

消瘦

Controlled Pool Maintenance for Metaheuristicse focusing on controlled input and output operations. We analyze the main pool components for metaheuristics and present a review of the literature on relevant strategies in tabu search, scatter search, and path relinking. Additionally, we provide a synthesis of the literature that highlights the critical aspects of effective pool maintenance.

dry-eye

Scatter Search Methods for the Covering Tour Problem every vertex not in the cycle lies within a given distance from at least one node in the cycle. Being a generalization of the TSP, CTP is NP-hard. This paper presents three original Scatter Search heuristic algorithms for the CTP. Computational results are reported.

厭倦嗎你

和諧

badinage