Using Genetic Algorithms for Large Scale Optimizationof Assignment, Planning and Rescheduling Problems
There has always been a need to solve real-life large-scale problems, suchas efficiently allocating limited resources, and other complex and conflicting situations related to combinatorial optimization genre. A class of combinato- rial optimization problems is NP-hard and, among many well-known, sev...
| Main Author: | |
|---|---|
| Format: | Doctoral Thesis |
| Language: | English |
| Published: |
KTH, Programvaruteknik och Datorsystem, SCS
2014
|
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-143671 http://nbn-resolving.de/urn:isbn:978-91-7595-047-1 |