Good day all.

My particular question concerns a Traveling Salesman-type problem.

Suppose I wish to move along the x-y plane and visit specific nodes (see the attached worksheet).

Starting at the origin, A, I intend to visit four locations, B to E, and finally return to the origin point. These nodes may be visited in any order - but, my total distance travelled must be a minimum.
However, my direction of travel is restricted; namely:

1. Movement is limited to the x and y-directions only (up and down as well as left and right)
2. Horizontal (left or right) movement is permitten only at y=1 and y=10

This second rule restricts me from turning left or right in between y= 1 and 10.
The Traveling Salesman routine (attached) is constructed to select a tour that is confined to orthogonal movement but it does not observe the second restriction (i.e. move left or right when you reach y=1 or y=10).

Is there any way in which I can build this condition into the routine so that the movement along the circuit observes the restrictions? 

If so - is it possible to graphically illustrate the order of travel (using arrows from point-to-point) on a point plot?

I appreciate you taking the time to read this.

MaplePrimes_May_6.mw

Good day.

When I export an animated 3D (surface contour) plot to a gif format, the image is incomplete (please see attached file).

Can anyone suggest a way to reformulate the expressions so the animated plot can be exported to Powerpoint intact?

Thanks for reading!

MaplePrimes_Dec_5.mw 

Good day!

I would welcome any help to explain how to plot a simple function, z, of two variables, (x, y) so that I can show the relationships between variables.

Basically, I need to plot a family of z-curves for varying x and y values and also would like to understand how to display the z-y and z-x plots. 

Thanks for reading!

MaplePrimes_Nov_29.mw

Good day all.

If I generate a list containing (say) 100 elements or more, and each element is an ordered pair - is it possible to assign a letter to each element? The first 26 elements will have equal A to Z, the next 26 will take A1 to Z1, and so on.

For example if the list is [ [5,3], [2,5], ..., [3,1]], how do I construct it to become [A=[5,3], B=[2,5], ..., V3=[3,1]]?

Please see attached.

Thank's a lot for your time.

MaplePrimes_Label_Lists.mw

Good day. 

I am wrestling a simple network (maze-type) problem and I hope someone can assist.

Given a standard x-y framework with several nodes whose locations are known, I would like to visit each node by starting from the origin, (0,0), and returning to that same point, A. (see attached)

However, I am permitted only to move horizontally and vertically within the maze.

Given that restriction, is there a routine that allows me to visit all locations, B, C, D, and E, such that the rectilinear distance is a minimum?

If there is a solution to this problem, can the distance also be given and order of visits specified?

Thanks for reading!

MaplePrimes_Path.mw