✦ LIBER ✦

A Birnbaum-importance based genetic local search algorithm for component assignment problems

✍ Scribed by Yao, Qingzhu; Zhu, Xiaoyan; Kuo, Way

Book ID: 121578422
Publisher: Springer US
Year: 2012
Tongue: English
Weight: 571 KB
Volume: 212
Category: Article
ISSN: 0254-5330
DOI: 10.1007/s10479-012-1223-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient Genetic Algorithms Using Simpl

Efficient Genetic Algorithms Using Simple Genes Exchange Local Search Policy for the Quadratic Assignment Problem

✍ M.H. Lim; Y. Yuan; S. Omatu 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 220 KB

A new local search based hybrid genetic

A new local search based hybrid genetic algorithm for feature selection

✍ Md. Monirul Kabir; Md. Shahjahan; Kazuyuki Murase 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 807 KB

Genetic algorithm with iterated local se

Genetic algorithm with iterated local search for solving a location-routing problem

✍ Houda Derbel; Bassem Jarboui; Saïd Hanafi; Habib Chabchoub 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 728 KB

A hybrid genetic local search algorithm

A hybrid genetic local search algorithm for the permutation flowshop scheduling problem

✍ Lin-Yu Tseng; Ya-Tai Lin 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 250 KB

A multiple-neighborhood-based parallel c

A multiple-neighborhood-based parallel composite local search algorithm for timetable problem

✍ He Yan; Song-nian D. Yu 📂 Article 📅 2004 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 619 KB

Greedy search and a hybrid local optimiz

Greedy search and a hybrid local optimization/genetic algorithm for tree-based inverse scattering

✍ Raymond A. Wildman; Daniel S. Weile 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB

## Abstract A genetic programming‐based geometry optimization method for inverse scattering that uses a tree data structure to encode Boolean combinations of convex shapes has recently been shown to outperform other genetic algorithm‐based techniques. Nonetheless, the genetic algorithms are still i