Алгоритм Кроссовера при решении задачи построения расписания в вузе при помощи генетического алгоритма
| Parent link: | Технологии Microsoft в теории и практике программирования.— 2014.— [С. 232-234] |
|---|---|
| Autore principale: | |
| Ente Autore: | |
| Altri autori: | |
| Riassunto: | Заглавие с титульного листа. University schedule is a hard problem. There are a lot of constraints that must not be ignored to get feasible solution and that is the reason why genetic algorithm is applied. This article describes the crossover operation using as a basis our previous work about creating of initial population of solutions. |
| Lingua: | russo |
| Pubblicazione: |
2014
|
| Serie: | Технологии разработки и проектирования информационных систем |
| Soggetti: | |
| Accesso online: | http://www.lib.tpu.ru/fulltext/c/2014/C28/090.pdf |
| Natura: | Elettronico Capitolo di libro |
| KOHA link: | https://koha.lib.tpu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=609577 |
| Riassunto: | Заглавие с титульного листа. University schedule is a hard problem. There are a lot of constraints that must not be ignored to get feasible solution and that is the reason why genetic algorithm is applied. This article describes the crossover operation using as a basis our previous work about creating of initial population of solutions. |
|---|