Abstract | Problem Definition | Data Set Description | Our Approach |
Simulation Results | Conclusions | Computer Programs | Division of labor |
References |
"Traveling salesperson problem" is a typical problem for searching the optimal path to reach each desired point . In some cases , we must not be passing through each point exactly , instead of being close to some accepted distance . This is a new trial to find a optimal path to make each point be in a accepted distance.
Today , we are asked to sweep 50 mines that are randomly distributed in the sea plane. And our mine dredger has a magnetic equipment to clear all the mines which are in the circle area ( the center of the circle is located in the mine dredger and the radius is r). Then, we try to find a ring path to cover all the points.
Our approach to this problem can be explained in two aspects:
This involves forming a grid on the data space where the intersections of the grid lines constitute the candidates for centers. A finer gridding increases the number of poential centers,but it also increases the compution required.
* :mine o:center
Extending traveling salesperson problem to solve some routine work is achived.
The path ,shown as follows, uses TSP program that only the centers
be selected .
So a concept of shortening the path by just passing by the mine is shown as the following.