✦ LIBER ✦

Initial design domain reset method for genetic algorithm with parallel processing

✍ Scribed by Lim, O-Kaung ;Hong, Keum-Shik ;Lee, Hyuk-Soo ;Choi, Eun-Ho

Publisher: Springer-Verlag
Year: 2004
Tongue: Korean
Weight: 545 KB
Volume: 18
Category: Article
ISSN: 1226-4865
DOI: 10.1007/bf02983286

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Genetic algorithms for the job-shop sche

Genetic algorithms for the job-shop scheduling problem with unrelated parallel constraints: Heuristic mixing method machines and precedence

✍ Fatima Ghedjati 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 360 KB

In this paper, we are interested in job-shop scheduling problems with several unrelated parallel machines and precedence constraints between the operations of the jobs (with either linear or non-linear process routings). The objective is to minimize the maximum completion time (Cmax). We propose an

Method for design of program systems wit

Method for design of program systems with special reference to debugging of the programs of parallel file-processing language

✍ V. S. Protsenko; S. P. Rodimin; A. B. Stavrovskii; A. A. Khizhnyak; V. V. Yurchi 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 861 KB

A solution method for a resistance circu

A solution method for a resistance circuit network design with optimal power consumption problem by using genetic algorithms

✍ Lixin Zheng; Takao Yokota; Mitsuo Gen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 246 KB

In this paper, we formulate a resistance circuit network design problem with optimal power consumption for a constrained electric current as a nonlinear integer programming (NIP) problem and solve it directly by keeping the nonlinear constraint based on genetic algorithms (GA). We discuss the effic