comment on

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!

In reply to Re: Asymmetric TSP on digraph by Evolutionary Algorithm? by gregor42
in thread Asymmetric TSP on digraph by Evolutionary Algorithm? by zli034

Are you posting in the right place? Check out Where do I post X? to know for sure.
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big> <blockquote> <br /> <dd> <dl> <dt> <em> <font> <h1> <h2> <h3> <h4> <h5> <h6> <hr /> <i> <li> <nbsp> <ol> <p> <small> <strike> <strong> <sub> <sup> <table> <td> <th> <tr> <tt> <u> <ul>
Snippets of code should be wrapped in <code> tags not <pre> tags. In fact, <pre> tags should generally be avoided. If they must be used, extreme care should be taken to ensure that their contents do not have long lines (<70 chars), in order to prevent horizontal scrolling (and possible janitor intervention).
Want more info? How to link or How to display code and escape characters are good places to start.


Syntactic Confectionery Delight
	PerlMonks