You are viewing a plain text version of this content. The canonical link for it is here.
Posted to issues@ignite.apache.org by "Maxim Muzafarov (Jira)" <ji...@apache.org> on 2019/10/08 11:15:00 UTC
[jira] [Commented] (IGNITE-8850) Add a GA example that solves
'Traveling Salesman Problem'
[ https://issues.apache.org/jira/browse/IGNITE-8850?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=16946726#comment-16946726 ]
Maxim Muzafarov commented on IGNITE-8850:
-----------------------------------------
Moved to 2.9 due to inactivity. Please, feel free to move it back if you will be able to complete the ticket by 2.8 code freeze date, December 2, 2019.
> Add a GA example that solves 'Traveling Salesman Problem'
> ---------------------------------------------------------
>
> Key: IGNITE-8850
> URL: https://issues.apache.org/jira/browse/IGNITE-8850
> Project: Ignite
> Issue Type: New Feature
> Components: ml
> Reporter: Turik Campbell
> Assignee: Turik Campbell
> Priority: Minor
> Fix For: 2.8
>
>
> The Travelling Salesman Problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to the origin city?
> Additional Information:
> https://en.wikipedia.org/wiki/Travelling_salesman_problem
--
This message was sent by Atlassian Jira
(v8.3.4#803005)