Live data from Hacker News

Computer Scientists Break Traveling Salesperson Record

quantamagazine.org

91–100 of 188 posts

Re: Computer Scientists Break Traveling Salesperson Record

#91
post #90

> able to subtract 0.2 billionth of a trillionth of a trillionth of a percent ... > “This is a result I have wanted all my career,” said David Williamson of Cornell University, who has been studying the traveling salesperson problem since the 1980s I love this. Oh to be a theoretician. Here's hoping for a flood of further improvements.

Meanwhile in an agile dev team.... "can you optimize it in the next sprint?"

“so you don’t have anything to demo, then?”

Re: Computer Scientists Break Traveling Salesperson Record

#92
post #87
post #74

Earlier quoted context omitted.

Sex is not very important for a doctor, for an actor is pretty much defines what roles you can play.

Shakespeare might like a word... (Alternatively: then why don't we have separate words for black actors, white actors, native American actors, south-east Asian actors, transgender actors, and so on?)

Because that would be ridiculous.

Re: Computer Scientists Break Traveling Salesperson Record

#93
post #72

Earlier quoted context omitted.

This is great, thanks for sharing! I had good results with genetic algorithms as well.

There are also TSP-specific heuristics that work well in practice on a lot of large instances, often finding the optimal solution pretty quickly (but with no guarantees of optimality). The first I believe was the Lin-Kernighan heuristic from 1973 (the same Kernighan as the 'K' in K&R C, incidentally). There are fast implementations of some modern improved versions, e.g.: http://akira.ruc.dk/~keld/research/LKH/

I coded a version of SA for TSP in the early 90s. I iterated until the probability of a hardware error was greater than having a sub-optimal solution. It took just a couple of seconds, and that speed was due to visually displaying the algorithm as it executed.

Re: Computer Scientists Break Traveling Salesperson Record

#94
Very tangential, I was a physics major, and learned about Traveling Salesperson when in college at UCSD - I looked it up in the library and there was like, an entire hallway of books/research on this problem and it blew my mind. It really put into perspective how much work had gone into that single problem. I think the shelf was larger than the solar physics papers on file in a nearby area.

Re: Computer Scientists Break Traveling Salesperson Record

#95
post #8

The paper is really nicely written: https://arxiv.org/abs/2007.01409 It's lengthy and full of some quite technical sections, but those are interspersed with sections sketching the high-level intuition and proving more informal versions of the technical theorems in simplified cases. An example is on p. 19, section 3.1, "Ideas underlying proof of Theorem 3.1".

Nathan Klein's talk is also nice: https://www.youtube.com/watch?v=TE6puoxv2wY

Re: Computer Scientists Break Traveling Salesperson Record

#96

Earlier quoted context omitted.

> I'm still confused whether it's appropriate to refer to actresses as "actor". It is generally appropriate, and increasingly preferred in many contexts, but not yet generally considered the only acceptable thing. (E.g., "actress" is almost never considered wrong .)

And the oscar for best actor who presently identifies as a woman in a leading role goes to...

*at present ;-)

Re: Computer Scientists Break Traveling Salesperson Record

#97
post #29

> proved that an algorithm devised a decade ago beats Christofides’ 50% factor, though they were only able to subtract 0.2 billionth of a trillionth of a trillionth of a percent. That is 0.0000000000000000000000000000000002% better than the existing solution.

So much less than the 0.01% of the variation in identical computers due to 100ppm crystal variation. Also less than the 0.0001% variation due to the temperature in the room changing 1 degree.

Re: Computer Scientists Break Traveling Salesperson Record

#98

This is kind of a hijack, but it's at least related: Are there any websites/apps that can approximate a solution for road destinations in the real world? For example, given a list of cities, an approximate solution on actual roads to visit all of them once?

https://routific.com/

Re: Computer Scientists Break Traveling Salesperson Record

#99
post #78

If we are renaming things from the past to quell the moderns, it should be renamed Traveling Seller since it rolls off the tongue so much better.

Just stop already. Nobody notices these kinds of things, and if they're offensive to anyone, that's their problem. It's a math problem as old as the 1800s for gods sake. Stop already. Why, out of everything that is important in this world, would you immediately notice the fucking "man", out of all things?

> if they're offensive to anyone, that's their problem.

Nah, if it's offensive to me and you're trying to convince me of something or sell to me, it's clearly your problem.

Post reply on HN