The Multi-service Location Problems

Hung I. Yu*, Mong Jen Kao, D. T. Lee

*此作品的通信作者

研究成果: Conference contribution同行評審

摘要

In this paper, we aim to provide a general study on the framework of Multi-Service Location Problems from a broader perspective and provide systematic methodologies for this category of problems to obtain approximate solutions. In this category of problems, we are to decide the location of a fixed number of facilities providing different types of services, so as to optimize certain distance measures of interest regarding how well the clients are served. Specifically, we are to provide p types of services by locating k ≥ p facilities. Each client has a demanding list for the p types of services, and evaluates its service quality by its service distance, defined as its total transportation cost to those facilities offering the demanded services. Under this framework, we address two kinds of distance measures, the maximum service distance and the average service distance of all clients, and define the p-service k-center problem and the p-service k-median problem, according to the minimax and the minisum criteria, respectively. We develop a general approach for multi-service location problems, and propose a (2p)-approximation and a 4-approximation to the two problems, respectively.

原文English
主出版物標題New Trends in Computer Technologies and Applications - 23rd International Computer Symposium, ICS 2018, Revised Selected Papers
編輯Chuan-Yu Chang, Chien-Chou Lin, Horng-Horng Lin
發行者Springer Verlag
頁面507-515
頁數9
ISBN(列印)9789811391897
DOIs
出版狀態Published - 2019
事件23rd International Computer Symposium, ICS 2018 - Yunlin, Taiwan
持續時間: 20 12月 201822 12月 2018

出版系列

名字Communications in Computer and Information Science
1013
ISSN(列印)1865-0929
ISSN(電子)1865-0937

Conference

Conference23rd International Computer Symposium, ICS 2018
國家/地區Taiwan
城市Yunlin
期間20/12/1822/12/18

指紋

深入研究「The Multi-service Location Problems」主題。共同形成了獨特的指紋。

引用此