Constrained Optimal Routes in 3D Space

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

Given a set of constraints, what is an optimal travel route between given points? Such problems are usually posed in 2D or on a surface; for example, finding the shortest path through a set of points on the surface of Earth. This Demonstration highlights a subset of such optimization problems in 3D, as might be needed in outer space or under water.

[more]

Imagine you need to travel on a spaceship to land on several different planets, exactly once each. This would be the traveling salesman problem if you were not subject to a constraint. For example, the more fuel you carry the less cargo you can have, so it is advantageous to limit the ship’s carrying fuel capacity. Therefore you might have to refuel on different planets, but remote planets might not be accessible. You will be able to traverse only a so-called "percolation network," where an edge exists only between planets close enough to travel between without refueling. An optimal tour on such a network is different (if possible at all) from the traveling salesman tour. This Demonstration visualizes the difference between these cases.

In the limit, for very large settings of the "range" control, the routes on the percolation network and traveling salesman route coincide.

[less]

Contributed by: Vitaliy Kaurov (July 2015)
Open content licensed under CC BY-NC-SA


Snapshots


Details

Controls

“range” sets how far the spaceship can travel without refueling. Hence it defines which planets can be reached from a given one.

“new” generates a new random set of planets.

“number” defines how many planets are on the route.

“constrained” shows the shortest tour on the percolation network. If there is no route shown even with the control checked, then it does not exist.

“optimal” shows the traveling salesman route.

“network” shows the percolation network or distances between nearest-neighbor planets that you can travel to without refueling.

“nodes” shows the nodes of the network, in this case planets.



Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
Send