Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

Re: Asymmetric TSP on digraph by Evolutionary Algorithm?

by gregor42 (Parson)
on Mar 11, 2008 at 13:15 UTC ( [id://673486]=note: print w/replies, xml ) Need Help??

in reply to Asymmetric TSP on digraph by Evolutionary Algorithm?

Just found out this problem is called Asymmetric TSP. I'm going to do some reading on this topic.

A quick google search pointed me to: Inver-over Operator for the TSP which seems to be exactly what you're talking about.

It sounds to me like you're trying to write map searching software and you've noticed that the Travelling Salesman Problem when applied in the real world also has to account for one-way roads. You are looking to solve this by representing the problem space as a Directed Graph?

Rather than mutating the data structure to have different distances in either direction, why not redefine the linking structure to support one-way connections? Wouldn't this allow the current path-searching/choosing routines to continue to be used without modification?

Wait! This isn't a Parachute, this is a Backpack!
  • Comment on Re: Asymmetric TSP on digraph by Evolutionary Algorithm?

Log In?

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://673486]
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others chanting in the Monastery: (2)
As of 2024-06-22 02:23 GMT
Find Nodes?
    Voting Booth?

    No recent polls found

    erzuuli‥ 🛈The London Perl and Raku Workshop takes place on 26th Oct 2024. If your company depends on Perl, please consider sponsoring and/or attending.