Proceedings of the 2015 International Conference on Test, Measurement and Computational Methods

Research on Maximal Covering Problem Based on Cost and Customer Satisfaction Degree

Authors
Xiuyan Wang, Ying Qu, Chunyou Wu
Corresponding Author
Xiuyan Wang
Available Online November 2015.
DOI
https://doi.org/10.2991/tmcm-15.2015.38How to use a DOI?
Keywords
customer satisfaction; cost; maximal covering problem; service center; service center; the normalized normal constraint method
Abstract
According to cost and customer satisfaction degree, we build a bi-objective maximal covering problem in order to study the influence of central station siting by cost and customer satisfaction degree. During solving this bi-objective maximal covering problem, we use the normalized normal constraint method owing to cost and customer satisfaction degree having different dimensions. Finally, taking Shandong waste electronics recycling as an example, we code and solve by CPLEX, and analyzed the results.
Open Access
This is an open access article distributed under the CC BY-NC license.

Download article (PDF)

Proceedings
2015 International Conference on Test, Measurement and Computational Methods
Part of series
Advances in Computer Science Research
Publication Date
November 2015
ISBN
978-94-6252-132-2
ISSN
2352-538X
DOI
https://doi.org/10.2991/tmcm-15.2015.38How to use a DOI?
Open Access
This is an open access article distributed under the CC BY-NC license.

Cite this article

TY  - CONF
AU  - Xiuyan Wang
AU  - Ying Qu
AU  - Chunyou Wu
PY  - 2015/11
DA  - 2015/11
TI  - Research on Maximal Covering Problem Based on Cost and Customer Satisfaction Degree
BT  - 2015 International Conference on Test, Measurement and Computational Methods
PB  - Atlantis Press
SP  - 153
EP  - 158
SN  - 2352-538X
UR  - https://doi.org/10.2991/tmcm-15.2015.38
DO  - https://doi.org/10.2991/tmcm-15.2015.38
ID  - Wang2015/11
ER  -