𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Genetic Algorithms and grouping problems

✍ Scribed by Mark Nicholson

Publisher
John Wiley and Sons
Year
1998
Tongue
English
Weight
18 KB
Volume
28
Category
Article
ISSN
0038-0644

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Genetic algorithms for ambiguous labelli
Genetic algorithms for ambiguous labelling problems
✍ Richard Myers; Edwin R. Hancock πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 684 KB

Consistent labelling problems frequently have more than one solution. Most work in the "eld has aimed at disambiguating early in the interpretation process, using only local evidence. This paper starts with a review of the literature on labelling problems and ambiguity. Based on this review, we prop

Solving structural optimization problems
Solving structural optimization problems with genetic algorithms and simulated annealing
✍ Salvador Botello; Jose L. Marroquin; Eugenio OΓ±ate; Johan Van Horebeek πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 142 KB πŸ‘ 2 views

In this paper we study the performance of two stochastic search methods: Genetic Algorithms and Simulated Annealing, applied to the optimization of pin-jointed steel bar structures. We show that it is possible to embed these two schemes into a single parametric family of algorithms, and that optimal

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