You are viewing a plain text version of this content. The canonical link for it is here.

Posted to issues@ignite.apache.org by "Nikolay Izhikov (JIRA)" <ji...@apache.org> on 2018/09/21 12:53: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=16623559#comment-16623559 ] 

Nikolay Izhikov commented on IGNITE-8850:
-----------------------------------------

[~netmille] Do we have a chance to resolve this ticket until the code freeze of 2.7?

> 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.7
>
>
> 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
(v7.6.3#76005)