✦ LIBER ✦

Hybrid genetic algorithms for constrained placement problems

✍ Scribed by Schnecke, V.; Vornberger, O.

Book ID: 117878828
Publisher: IEEE
Year: 1997
Tongue: English
Weight: 273 KB
Volume: 1
Category: Article
ISSN: 1089-778X
DOI: 10.1109/4235.687887

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A hybrid genetic algorithm for the resou

A hybrid genetic algorithm for the resource-constrained project scheduling problem

✍ Vicente Valls; Francisco Ballestín; Sacramento Quintanilla 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 236 KB

A novel hybrid genetic algorithm for con

A novel hybrid genetic algorithm for constrained optimization

✍ Kusum Deep, Kedar Nath Das 📂 Article 📅 2013 🏛 Springer-Verlag 🌐 English ⚖ 411 KB

Optimal measurement placement for securi

Optimal measurement placement for security constrained state estimation using hybrid genetic algorithm and simulated annealing

✍ T. Kerdchuen; W. Ongsakul 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB

A hybrid algorithm for linearly constrai

A hybrid algorithm for linearly constrained minimax problems

✍ Wang, Fusheng 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 777 KB

Genetic algorithm approach for precedenc

Genetic algorithm approach for precedence-constrained sequencing problems

✍ YoungSu Yun; Chiung Moon 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 912 KB

Hybrid Genetic Algorithms for a Rosterin

Hybrid Genetic Algorithms for a Rostering Problem

✍ A. Monfroglio 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 676 KB

Hybrid Genetic Algorithms are described for a large-size real-life rostering problem (railway workers' job scheduling and roster optimization). The new algorithm uses an order-based representation which encodes as a chromosome the list of job units to schedule. First, a greedy algorithm is considere