一种求解组合拍卖胜者决定问题的局部搜索算法
[Abstract]:An auction is a form of bidding. The traditional auction is the transfer of specific goods or property rights to the highest bidder. Combinatorial auction is different from traditional auction. Combinatorial auction allows bidders to combine freely in multiple auction items and give the total price as a bid instead of giving the price of the items. Combinatorial auctions have applications in e-commerce, space allocation, cloud computing and so on. The decision of winner is one of the core problems in the field of combinatorial auction, which has important theoretical significance and practical application value. However, the winner decision problem has been proved to be a NP problem in theory, and no exact algorithm can be found to solve it in polynomial time. Although the exact algorithm can prove the optimality of the output solution, with the expansion of the scale of the problem, the solving time it needs will increase exponentially, so it is difficult to deal with complex large-scale examples in acceptable time. This kind of NP problem usually needs to be solved by heuristic algorithm, so that it can be applied in practice. As an important heuristic algorithm, local search is simple and efficient. Local search algorithms have excellent performance in solving various NP problems. Although it can not give the optimal solution and prove its optimality just like the exact algorithm, the local search algorithm can usually give a high quality approximate solution in a shorter time. The winner decision problem is very important in practical application and has received much attention. In this paper, we design and implement a local search algorithm to solve the winner decision problem, which is used to solve large scale examples in a short time and to improve the quality of the solution as much as possible. The proposed algorithm named WDPLS.WDPLS is based on an efficient and concise local search framework with three techniques: pattern detection free bid and pseudo-juxtaposition. Pattern detection is a very efficient backtracking strategy for local search algorithms. For the winner decision problem, we design a pattern definition for WDPLS to prevent the backtracking of greedy search algorithm. Free bids may appear when the algorithm searches. This is a special bid, WDPLS preferred free bid to quickly improve the quality of the solution. In addition, the search process may encounter quality (score) very similar defeat bid. For these bids, pseudo-juxtaposition prevents the algorithm from choosing the highest score bid too greedily, thus providing other high-quality bids with the possibility of being selected, further increasing the diversity of understanding. A large number of experiments on LG datasets show that WDPLS is ahead of the published advanced algorithms in solving quality and time. In particular, although WDPLS is implemented as a single-threaded program in our experiments, it still has a significant advantage over the multithreaded algorithm CARA and the commercial solver CPLEX. At the same time, the experiments also show that the above three main technologies have a positive effect on the performance of WDPLS, which proves their effectiveness.
【学位授予单位】:东北师范大学
【学位级别】:硕士
【学位授予年份】:2017
【分类号】:F713.359;TP18
【相似文献】
相关期刊论文 前10条
1 梁小毅;唐屹;;k-匿名映射的一种局部搜索算法[J];计算机应用与软件;2009年12期
2 张雁;黄永宣;魏明海;;一种求解最大团问题的自适应过滤局部搜索算法[J];信息与控制;2011年04期
3 肖进杰,朱大铭,马绍汉,潘锐;多服务中心设置问题局部搜索算法的分析与实验[J];计算机工程;2005年12期
4 谢啸虎;黄樟灿;焉炳艳;;多目标遗传局部搜索算法的研究进展[J];武汉理工大学学报(信息与管理工程版);2006年12期
5 潘锐;朱大铭;董林光;董颖;;求解k中间点问题的新局部搜索算法[J];计算机工程与应用;2008年04期
6 詹青青;;启发式局部搜索算法在电路划分中的应用[J];福建电脑;2010年04期
7 韦炜;藤村茂;席裕庚;;求解旅行锦标赛问题的改进混合局部搜索算法[J];计算机仿真;2012年10期
8 吴贵芳,徐科,徐金梧;边界局部搜索算法与应用[J];计算机应用;2005年02期
9 肖进杰;谢青松;牛翠霞;;设备定位问题局部搜索算法的实验[J];计算机工程与应用;2010年02期
10 陈萍;黄厚宽;董兴业;;基于多邻域的车辆路径优化迭代局部搜索算法[J];北京交通大学学报;2009年02期
相关会议论文 前4条
1 钱巍;冯玉强;呼大永;;基于关联函数确定组合拍卖商品的可行组合空间[A];第十三届中国管理科学学术年会论文集[C];2011年
2 齐洁;郑珉楠;;采用极值优化算法求解动态组合拍卖问题[A];2009年中国智能自动化会议论文集(第七分册)[南京理工大学学报(增刊)][C];2009年
3 王雅娟;王先甲;;关联价值下最优在线组合拍卖机制[A];中国系统工程学会第十八届学术年会论文集——A01系统工程[C];2014年
4 刘心报;叶强;;基于模块设计的蚁群算法研究综述[A];'2008系统仿真技术及其应用学术会议论文集[C];2008年
相关博士学位论文 前3条
1 李睿智;基于局部搜索策略的若干组合优化问题求解算法研究[D];东北师范大学;2017年
2 钱巍;组合拍卖中竞胜标自动确定问题研究[D];哈尔滨工业大学;2012年
3 祁宁;网络采购的逆向组合拍卖模型与优化方法研究[D];东北大学;2012年
相关硕士学位论文 前10条
1 张皓辰;一种求解组合拍卖胜者决定问题的局部搜索算法[D];东北师范大学;2017年
2 吴越钟;改进的Lin-Kernighan局部搜索算法和杂交算法在旅行商问题中的应用[D];中国科学技术大学;2016年
3 张峥华;SAT求解局部搜索行为分析与概率控制策略[D];华中科技大学;2014年
4 徐斌;基于索引调制的宽带MIMO-OFDM无线传输技术研究[D];电子科技大学;2016年
5 李双星;改进迭代局部搜索算法求解需求拆分的校车路径问题[D];河南大学;2016年
6 刘伟臣;改进的Ejection Chain局部搜索算法与混合算法求解旅行商问题[D];中国科学技术大学;2017年
7 咸爱勇;合取范式最大不全满足与最大可满足问题的局部搜索算法研究[D];山东大学;2012年
8 高超;随机局部搜索算法及其应用研究[D];中国科学技术大学;2015年
9 殷茜;基于局部搜索的最小可满足问题求解算法研究[D];东北师范大学;2015年
10 赵轩;求解RCPSP问题的迭代局部搜索算法研究[D];北京交通大学;2016年
,本文编号:2299017
本文链接:https://www.wllwen.com/jingjilunwen/dianzishangwulunwen/2299017.html