计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (8): 210-211.

• 工程与应用 • 上一篇    下一篇

基于改进QPSO算法的逢低买入最优定价研究

阳成虎,杜 文   

  1. 西南交通大学 交通运输学院,成都 610031
  • 收稿日期:2007-07-05 修回日期:2007-08-29 出版日期:2008-03-11 发布日期:2008-03-11
  • 通讯作者: 阳成虎

Optimal pricing with group-buying auction based on modified QPSO

YANG Cheng-hu,DU Wen   

  1. School of Traffic and Transportation,Southwest Jiaotong University,Chengdu 610031,China
  • Received:2007-07-05 Revised:2007-08-29 Online:2008-03-11 Published:2008-03-11
  • Contact: YANG Cheng-hu

摘要: 研究逢低买入拍卖中最优定价问题。由于逢低买入拍卖中卖方期望收益函数异常复杂,常规函数极值法具有极大局限性,无法获得最优价格策略,提出一种带极值扰动算子的QPSO(Quantum-behaved Particle Swarm Optimization)算法对模型进行优化和数值计算。算例表明该算法可以快速有效地找到最优价格策略,且具有较好的全局收敛能力。

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.