English  |  正體中文  |  简体中文  |  Items with full text/Total items : 28611/40649
Visitors : 634136      Online Users : 41
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/37003

Title: An efficient method for single-facility location and path-connecting problems in a cell map
Authors: K. Y. Chang;C. M. Su;G. E. Jan;C. P. Chen
Contributors: 國立臺灣海洋大學:商船學系
Keywords: facility location problem;maze router;Weber point;weighted region
Date: 2013
Issue Date: 2015-12-17T02:30:29Z
Publisher: International Journal of Geographical Information Science
Abstract: Abstract:This article presents an efficient method for simultaneously finding both the Weber cell and optimal connective paths in a grid. As numerous barriers of arbitrary shape and weighted regions are distributed in the cell map of this research, the problem scenario is similar to working out a real-life facility location selection and path-routing problems in a geographical map. In this study, the Weber problem of finding a single-facility location from an accumulation cost table is generated by a grid wave propagation method (higher-geometry maze router). After finding the Weber point (cell), optimal connective paths with minimum total weighted cost are backtracked between the Weber location cell and the demand cells. This new computation algorithm with linear time and space complexity can be integrated as a spatial analytical function within GIS.
Relation: 27(10), pp.2060-2076
URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/37003
Appears in Collections:[商船學系] 期刊論文

Files in This Item:

File Description SizeFormat

All items in NTOUR are protected by copyright, with all rights reserved.


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback