Final Report for CS5611 (Fuzzy Sets: Theory and Applications):

Mine Dredger

§d¿ü³ó(g853907, ¹qºÓ¤@)
ªL¥Ã±ö(g853904, ¹qºÓ¤@)
³¯ÂE¸R(g853902, ¹qºÓ¤@)


Table of Contents

Abstract Problem Definition Data Set Description Our Approach
Simulation Results Conclusions Computer Programs Division of labor
References


Abstract

"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.

Problem Definition

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.

Data Set Description

Approach

Our approach to this problem can be explained in two aspects:

Simulation Results

* :mine o:center

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.