✦ LIBER ✦

Genetic algorithms for generating minimum path configurations

✍ Scribed by Peter K. Sharpe; Alan G. Chalmers; Adam Greenwood

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 547 KB
Volume: 19
Category: Article
ISSN: 0141-9331
DOI: 10.1016/0141-9331(95)93083-u

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Constructing minimum path configurations

Constructing minimum path configurations for multiprocessor systems

✍ Alan G Chalmers; Steve Gregory 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 798 KB

A General Algorithm for Finding a Shorte

A General Algorithm for Finding a Shortest Path between two n-Configurations

✍ M.C. Er 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 254 KB

Algorithms for minimum-cost paths in tim

Algorithms for minimum-cost paths in time-dependent networks with waiting policies

✍ Brian C. Dean 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 90 KB

A linear time algorithm for minimum link

A linear time algorithm for minimum link paths inside a simple polygon

✍ Subhash Suri 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 93 KB

A linear time algorithm for minimum link

A linear time algorithm for minimum link paths inside a simple polygon

✍ Subhash Suri 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 827 KB

Genetic algorithms: A robust scheme for

Genetic algorithms: A robust scheme for geometry optimizations and global minimum structure problems

✍ Jordi Mestres; Gustavo E. Scuseria 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 1015 KB

A Genetic Algorithm for Geometry Optimizations (GALGO) program has been developed to study the efficiency of this method of finding global minimum structures. Using a semiempirical tight-binding potential, the behavior of different genetic algorithm (GA) operators has been tested for the linear chai