This graph shows which files directly or indirectly include this file:
Functions | |
int | par_get (char *i) |
Parses a string and sets genetic parameters. | |
void | par_print () |
Variables | |
int | par_popsize |
Population size. | |
int | par_toursize |
Tournament size. | |
int | par_mutatepart |
Part of the population that mutates per generation. | |
int | par_randpart |
Part of the population that is randomized per generation. | |
int | par_maxequal |
Maximum number of timetables with equal fitness values that will be tolerated in a generation. | |
int | par_finish |
How many generations must pass without improvement to finish processing. | |
int | par_migrtime |
How many generations must pass between two migrations between neighboring nodes. | |
int | par_migrpart |
Part of the population that will migrate to the next node. | |
int | par_localtresh |
How many generations must pass without improvement to begin local searching. | |
int | par_localstep |
Initial step for local search algorithm. | |
int | par_pophint |
Percent of hinted timetables in the population. |
|
Parses a string and sets genetic parameters.
|
|
brief Prints a debug message with values of genetic parameters. |
|
Initial step for local search algorithm. Larger values mean more exhaustive and slower local search. |
|
Part of the population that will migrate to the next node. For example: 10 means that 1/10 of the population will migrate. |
|
Part of the population that mutates per generation. For example: 4 means that 1/4 of the population will mutate. |
|
Percent of hinted timetables in the population. If the user has loaded an XML file that already contains a partial or a full solution, then some timetables in the population can be initialized with this solution. This parameter defines the percentage of the timetables in the population that will be initialized (other timetables will be initialized with random values). Values must be between 0 and 100. Larger values mean that the solution given in the XML file will have a greater possibility of being included in the final solution. If there is no solution in the XML file then this parameter has no effect. |
|
Population size. Number of timetables in the population of one node. Higher numbers mean faster population convergence and more CPU time required per generation per node. |
|
Part of the population that is randomized per generation. For example: 4 means that 1/4 of the population will mutate. |
|
Tournament size. Size of the tournament when choosing mates. Higher numbers mean that timetables with lower fitness values have less chance of producing offspring. |