| Summary: | 碩士 === 東海大學 === 資訊工程與科學系碩士在職專班 === 92 === Region planning has been an important issue around our societal activities. Before the invention of computer, we solved this tedious problem manually. Nowadays, the computer-aided region planning techniques have been applied widely on many planning practices, such as school district, convenience store location, range of police patrol, and irrigation area of farmland and public facilities. In the past, some solutions proposed might provide “acceptable” results, for example, the popular Voronoi method. But those techniques only focused on generating the location information of the regional center, and failed to include the spatial constraints, such as street width, river dimension or railroad barriers. Therefore, they may not suitable for some applications that require strong consideration of the cost of travel and safety problems. Suppose, we have a young kid dwelled along a street of 100 meters wide, with school A just across the street and school B about 500 meters far but in the same side of the road, should we assign the kid to school A or school B? Normally the kid was assigned to school A initially by a computer-aided software, since the travel distance is shorter. Latter with safety problem, the kid may reassign by hand to school B by the request of the parents. During our research process, we proposed a new “Terrace algorithm” that automatically counts the location of the regional center and its surround environment, so that it is more appropriate for solving similar problems as described on the above situation. Besides, we developed some criteria in comparing the suitability of some proposed techniques. In case of school district planning, the comparison is based on the cost and dangerous indexes of crossing over huge blockades.
|
|---|
