- Output results and fitness after running (1, 5, +inf) minutes
- Try out making a "smarter" finisher in Main
- Test out different GA parameters
- Try adding other mutation / combination methods in
SmarterGenerator
(for instance, would be cool to try out sorting tracks by evaluating them in different ways and using that metric to combine) - Maybe add a breaking condition to the algorithm, which would stop iterating once the solution hasn't improved for some time (or at least make it more diverse). Then you can re-run another instance of the GA.
- Write documentation
-
Notifications
You must be signed in to change notification settings - Fork 0
University work. Research-grade code using genetic algorithms for a variant of the parking space optmization problem.
tkukurin/Lab.HeuristicOptimizationMethods
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
University work. Research-grade code using genetic algorithms for a variant of the parking space optmization problem.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published