[SciPy-User] "Order of items" optimization

[Thiago Franco Moraes]

On Tue, Nov 10, 2015 at 7:09 AM Daπid <davidmenhur at gmail.com> wrote:

> On 10 November 2015 at 07:07, Andrea Gavana <andrea.gavana at gmail.com>
> wrote:
>
>>
>> I thought about that, the only problem is that I don't have an initial
>> "city", i.e., all the events can be the first point. That would mean
>> solving a TSP problem for each event as starting point - a few
>> optimizations...
>>
>
> Your starting point can be a "virtual" city that is equidistant to all the
> others. This distance just has to be large enough so you don't take that
> path back.
>
>

You could try to generate a minimun spanning tree since MST is an
aproximation to the traveling salesman problem [1]

[1] - https://www.ics.uci.edu/~eppstein/161/960206.html
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.scipy.org/pipermail/scipy-user/attachments/20151110/0acdd924/attachment.html>