| 基于改进QPSO算法的逢低买入最优定价研究 |
| |
| 引用本文： | 阳成虎,杜文. 基于改进QPSO算法的逢低买入最优定价研究[J]. 计算机工程与应用, 2008, 44(8): 210-211. DOI: 10.3778/j.issn.1002-8331.2008.08.062 |
| |
| 作者姓名： | 阳成虎 杜文 |
| |
| 作者单位： | 西南交通大学,交通运输学院,成都,610031;西南交通大学,交通运输学院,成都,610031 |
| |
| 基金项目： | 四川省教育厅青年基金项目(No.2005B025) |
| |
| 摘 要： | 研究逢低买入拍卖中最优定价问题。由于逢低买入拍卖中卖方期望收益函数异常复杂，常规函数极值法具有极大局限性，无法获得最优价格策略，提出一种带极值扰动算子的QPSO（Quantum-behaved Particle Swarm Optimization）算法对模型进行优化和数值计算。算例表明该算法可以快速有效地找到最优价格策略，且具有较好的全局收敛能力。
|
| 关 键 词： | 逢低买入 QPS0 极值扰动 |
| 文章编号： | 1002-8331（2008）08-0210-02 |
| 收稿时间： | 2007-07-05 |
| 修稿时间： | 2007-08-29 |
Optimal pricing with group-buying auction based on modified QPSO |
| |
| YANG Cheng-hu,DU Wen. Optimal pricing with group-buying auction based on modified QPSO[J]. Computer Engineering and Applications, 2008, 44(8): 210-211. DOI: 10.3778/j.issn.1002-8331.2008.08.062 |
| |
| Authors: | YANG Cheng-hu DU Wen |
| |
| Affiliation: | School of Traffic and Transportation，Southwest Jiaotong University，Chengdu 610031，China |
| |
| Abstract: | The optimal pricing problem with the group-buying auction is mainly studied.Since the function of seller’s expected revenue is difficult for the normal function optimization methods to solve，the QPSO with the extremum disturbed arithmetic operators is introduced to settle it.Then the program scheme is designed and the numerical example is provided，which indicates that the algorithm is able to derive optimal prices quickly and effectively，and the global convergence property of the algorithm is proved. |
| |
| Keywords: | group-buying QPSO disturbed extremum |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载免费的PDF全文 |
