基于用户满意公平性的多设备最优收费算法

Jisoo Choi, Hyunggon Park
{"title":"基于用户满意公平性的多设备最优收费算法","authors":"Jisoo Choi, Hyunggon Park","doi":"10.1109/APNOMS.2015.7275378","DOIUrl":null,"url":null,"abstract":"In this paper, we present an optimal charging algorithm for multiple devices in the perspective of user satisfaction fairness. The proposed algorithm can maximize the total sum of the increment of user satisfaction levels in a finite charging scheduling period. In order to develop the algorithm, we define an objective function that includes the characteristics of charging capacity behaviors for the associated devices and formulate the problem as a convex optimization problem. Therefore, the proposed algorithm can be efficiently implemented in a very low complexity. Simulation results confirm that the proposed algorithm can achieve the maximum sum of the increment of user satisfaction levels compared to existing conventional approaches (e.g., equal allocation), thereby leading to an improved performance.","PeriodicalId":269263,"journal":{"name":"2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"User satisfaction fairness based optimal charging algorithm for multiple devices\",\"authors\":\"Jisoo Choi, Hyunggon Park\",\"doi\":\"10.1109/APNOMS.2015.7275378\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present an optimal charging algorithm for multiple devices in the perspective of user satisfaction fairness. The proposed algorithm can maximize the total sum of the increment of user satisfaction levels in a finite charging scheduling period. In order to develop the algorithm, we define an objective function that includes the characteristics of charging capacity behaviors for the associated devices and formulate the problem as a convex optimization problem. Therefore, the proposed algorithm can be efficiently implemented in a very low complexity. Simulation results confirm that the proposed algorithm can achieve the maximum sum of the increment of user satisfaction levels compared to existing conventional approaches (e.g., equal allocation), thereby leading to an improved performance.\",\"PeriodicalId\":269263,\"journal\":{\"name\":\"2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APNOMS.2015.7275378\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APNOMS.2015.7275378","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文从用户满意公平性的角度出发,提出了一种多设备的最优收费算法。该算法能在有限的收费调度周期内使用户满意度增量的总和最大化。为了开发该算法,我们定义了包含相关设备充电容量行为特征的目标函数,并将该问题表述为凸优化问题。因此,该算法可以在非常低的复杂度下有效地实现。仿真结果表明,与现有的传统方法(如平均分配)相比,所提出的算法可以实现用户满意度水平增量的最大总和,从而提高了性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
User satisfaction fairness based optimal charging algorithm for multiple devices
In this paper, we present an optimal charging algorithm for multiple devices in the perspective of user satisfaction fairness. The proposed algorithm can maximize the total sum of the increment of user satisfaction levels in a finite charging scheduling period. In order to develop the algorithm, we define an objective function that includes the characteristics of charging capacity behaviors for the associated devices and formulate the problem as a convex optimization problem. Therefore, the proposed algorithm can be efficiently implemented in a very low complexity. Simulation results confirm that the proposed algorithm can achieve the maximum sum of the increment of user satisfaction levels compared to existing conventional approaches (e.g., equal allocation), thereby leading to an improved performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信