Solution for the multilple traveling salesman problem using genetic algorithm, all written from scratch in python. Random targets are generated inside the working area of two industrial robots, the targets are then distributed between the two robots and arranged in an order with minimized execution time. I used and modified ABB_Open for communication with ABB RobotStudio.
-
Notifications
You must be signed in to change notification settings - Fork 0
botka1998/GA_MTSP
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
multilple traveling salesman problem using genetic algorithm
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published