Description: 1, has completed the function
(1) short distance in most cases you can choose the shortest path to move
(2) joined the elite selection optimization algorithm
(3) regardless of the size of the map can be drawn a certain path
(4) Click on the path obstructions can be drawn
3, code improvements
The original two categories (Widget, Geno) split into three categories (Widget, Handle, Geno),
Widget: display interface and other visual elements, to obtain the shortest path and display the movement
Handle: optimal path, draw the shortest path, the communication module will be added later
Geno: up to a certain number of calculated path
4, the algorithm described
(1) genetic algorithm:
According to arrive at the starting point of the Manhattan distance about the length of the chromosome, preferably slightly larger than the Manhattan distance.
If in the calculation process can not come up the path (if not equal to 1 adaptability scores) will automatically increase the
To Search:
File list (Check if you may need any files):
FindRouteGUI\findroutealg.h
............\FindRouteGUI.pro
............\FindRouteGUI.pro.user
............\geno.cpp
............\genome.cpp
............\handle.cpp
............\handle.h
............\main.cpp
............\route.qrc
............\routemap.cpp
............\widget.cpp
............\widget.h
............\widget.ui
FindRouteGUI
Download