运输服务采购中的多轮组合拍卖研究

论文摘要

近年来,运输采购软件的发展使得托运人可以在拍卖当中开放所有的路线,同时也使得承运人能够基于不同路线间的协同效应来进行投标。正是由于运输网络中各路线内在的协同效应,组合拍卖开始被应用在运输服务采购活动当中,以组织更为有效的运输活动。组合拍卖是多物品分配中有较高分配效率的拍卖之一,它允许每个投标人同时提交多个不同的拍卖物品。组合拍卖能够确保采购活动针对不同承运人的不同网络优势而展开,进而承运人可以提交多个包含一条或多条路线标的投标集合来提高运营效率。本文在运输服务采购和组合拍卖理论已有研究的基础上,通过比较分析现有组合拍卖机制提出了能够将组合投标机制应用在运输服采购活动中的多轮组合拍卖框架。论文各章节的主要内容为：第一章主要介绍了研究背景,研究意义和研究路线；第二章介绍了运输服务采购的概念和组合拍卖理论,并对这两种理论的已有研究进行了综述,分析了其中还存在的问题；第三章在综合比较各种已有组合拍卖机制的基础上,提出了适用于运输服务采购活动的拍卖机制和拍卖流程；第四章分别阐述了承运人和托运人的优化策略模型。其中为承运人方建立了考虑已有收益的最优投标模型,而托运方的竞胜标分配模型仍沿用经典的WDP模型,最后拓展了价格更新模型,使之能够适应本文准备讨论的多个标的一起投标的情况。第五章进行了算例分析,并比较了不同拍卖机制的结果,进而给出了应用组合拍卖的一些建议；第六章为研究总结和对未来研究方向的展望。

论文目录

• Acknowledgement
• Abstract
• 摘要
• CHAPTER 1 INTRODUCTION
• 1.1 RESEARCH BACKGROUND
• 1.2 SIGNIFICANCE OF RESEARCH
• 1.3 RESEARCH THREAD
• CHAPTER 2 OVERVIEW OF TRANSPORTATION PROCUREMENT ANDCOMBINATORIAL AUCTIONS
• 2.1 TRANSPORTATION PROCUREMENT OVERVIEW
• 2.1.1 Literature review
• 2.1.2 The general transportation procurement process
• 2.2 COMBINATORIAL AUCTIONS OVERVIEW
• 2.3 CURRENT STUDY STATUS ON COMBINATORIAL AUCTIONS
• 2.3.1 Winner Determination Problem
• 2.3.2 Mechanism design problem
• 2.3.3 Other problems with the combinatorial auctions
• 2.3.4 Combinatorial auctions in transportation procurement
• CHAPTER 3 COMBINATORIAL AUCTIONS MECHANISMS DESIGN
• 3.1 AUCTION MECHANISMS FUNDAMENTAL
• 3.1.1 Desirable properties of auction mechanisms
• 3.1.2 Present problem of existing combinatorial auction mechanisms
• 3.2 IMPLEMENTATION FACTORS FOR COMBINATORIAL AUCTION
• 3.2.1 Bidding for transportation procurement
• 3.2.2 The integer optimization based solution
• 3.2.3 Complexity of auction design
• 3.3 AUCTIONS MECHANISMS DESIGN FOR TRANSPORTATION PROCUREMENT
• 3.3.1 Assumptions and notation
• 3.3.2 The main auction steps
• 3.3.3 Efficiency guarantees
• 3.3.4 Iterative combinatorial descending auction framework
• CHAPTER 4 APPLICATION OF ITERATIVE COMBINATORIAL AUCTIONS INTRANSPORTATION PROCUREMENT
• 4.1 OPTIMAL BIDDING STRATEGY
• 4.1.1 Notation,definitions and assumptions
• 4.1.2 Assumptions
• 4.1.3 Problem description
• 4.2 WINNER DETERMINATION PROBLEM
• 4.3 PRICE UPDATE MODEL
• CHAPTER 5 COMPUTATIONAL ANALYSIS
• 5.1 FRAMEWORK OF ITERATIVE COMBINATORIALAUCTIONS
• 5.2 DATA PROCESSING
• 5.2.1 Data of shipper
• 5.2.2 Data of carrier
• 5.3 Single-bidding packages in iterative combinatorial auctions
• 5.4 MECHANISM THAT ALLOWING MULTI-BIDDING PACKAGES
• 5.5 ITERATIVE AUCTIONS FOR SINGLE LANE
• 5.6 ONE-SHOT COMBINATORIAL AUCTIONS
• 5.7 COMPARATIVE ANALYSIS
• 5.7.1 Auction efficiency analysis
• 5.7.2 Deficiency analysis
• CHAPTER 6 SUMMARY AND DISCUSSION
• REFERENCES