DocumentCode
2448143
Title
Using voronoi grouping to solve set covering problem - Building an Integrated Delivering System for Taichung City
Author
Shiah, Dah-Ming ; Hung, Chin-Tun ; Huang, Kuang-Hua
Author_Institution
Grad. Inst. of Archit. & Urban Design, Chaoyang Univ. of Technol., Taichung, Taiwan
fYear
2011
fDate
14-16 Oct. 2011
Firstpage
268
Lastpage
273
Abstract
The traditional set covering models did not consider the equity of users that carried by each set. We developed a new method to solve that for the Integrated Delivering System (IDS) in medical service in Taichung city. This method requires grouping the clinics in equal market share in a way that satisfy the equity conditions given. It uses Voronoi blocks as market share for each clinic within the study area and calculates the house and clinic ratios as the equity conditions. For each scan, the selected block merges with one of the adjacent blocks using five conditions with different weights. This process continues until the objective functions are met. This model opens up a new way of thinking for set covering by grouping the block objects to obtain optimal result. The result is workable and can be reproduced by computer program if the same data set existed.
Keywords
computational geometry; geographic information systems; medical information systems; medicine; set theory; Taichung City; Voronoi blocks; Voronoi grouping; computer program; equal market share; geography information system; integrated delivering system; medical service; set covering problem; Cities and towns; Computational modeling; Hospitals; Mathematical model; Pattern recognition; Urban areas; IDS; geography information system; set covering; spatial analysis;
fLanguage
English
Publisher
ieee
Conference_Titel
Soft Computing and Pattern Recognition (SoCPaR), 2011 International Conference of
Conference_Location
Dalian
Print_ISBN
978-1-4577-1195-4
Type
conf
DOI
10.1109/SoCPaR.2011.6089119
Filename
6089119
Link To Document