{"repository":{"description":"This is a project in which I am using genetic algorithm to find suboptimal solutions to the traveling salesman problem. Traveling Salesman Probelm is NP-hard problem and finding approximately optimal (even though not optimal) solution in reasonable time is of interest. ","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":0,"owner":"eiPi-1","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"created_at":"2013-08-11T17:35:34-07:00","pushed_at":"2013-08-11T17:35:34-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Mariyan Stoyanov","blog":"https://sites.google.com/site/moetomiyasto/experiments","location":"New York","email":"9da7430ed51c5d152380119fcc140cc774dc4345@gmail.com"},"url":"https://github.com/eiPi-1/tsp-genalgo"}