Research on Maximal Covering Problem Based on Cost and Customer Satisfaction Degree
Xiuyan Wang, Ying Qu, Chunyou Wu
Available Online November 2015.
- https://doi.org/10.2991/tmcm-15.2015.38How to use a DOI?
- customer satisfaction; cost; maximal covering problem; service center; service center; the normalized normal constraint method
- 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.
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 - Proceedings of the 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 -