Efficient auctions for distributed transportation procurement

Xu, Su Xiu; Huang, George Q.

doi:10.1016/j.trb.2014.03.005

Cited by 57 publications

(31 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…, Demange et al. , Xu and Huang ) is not suitable for our case. This study will reconstruct the PD algorithm by introducing a new concept, called the universally unsatisfied set (section , Definition 3).…”

Section: A Primal‐dual Algorithmmentioning

confidence: 86%

“…, Xu and Huang ) is not suitable for our case. Fourth, the proposed auctions in this study generate the VCG‐like outcome for general valuations, while the condition of seller‐submodularity is presumed in Xu and Huang ().…”

Section: Literature Reviewmentioning

confidence: 98%

“…() consider the ELP with transaction costs, and minimize total logistics chain cost that is the sum of 3PLs’ costs and shipper's transaction costs. They effectively incorporate transaction costs into combinatorial auctions and hence extend the work by Xu and Huang () to more general settings. By computational study, Xu et al.…”

Section: Literature Reviewmentioning

confidence: 99%

“…However, those PD algorithms (Bikhchandani andOstroy 2006, de Vries et al 2007) do not hold for the multi-attribute multi-unit procurement. For example, the concept of minimally oversupplied set (de Vries et al 2007, Demange et al 1986, Xu and Huang 2014 is not suitable for our case. This study will reconstruct the PD algorithm by introducing a new concept, called the universally unsatisfied set (section 5.2, Definition 3).…”

Section: Linear Programming Formulationmentioning

confidence: 99%

See 3 more Smart Citations

Efficient Multi‐Attribute Multi‐Unit Auctions for B2B E‐Commerce Logistics

Huang

2017

Production and Operations Management

Self Cite

View full text Add to dashboard Cite

This study is the first proposing allocatively efficient multi‐attribute auctions for the procurement of multiple items. In the B2B e‐commerce logistics problem (ELP), the e‐commerce platform is the shipper generating a large number of online orders between product sellers and buyers, and third‐party logistics (3PL) providers are carriers that can deliver these online orders. This study focuses on the ELP with multiple attributes (ELP‐MA), which is generally the problem of matching the shipper's online orders and 3PL providers given that price and other attributes are jointly evaluated. We develop a one‐sided Vickrey–Clarke–Groves (O‐VCG) auction for the ELP‐MA. The O‐VCG auction leads to incentive compatibility (on the sell side), allocative efficiency, budget balance, and individual rationality. We next introduce the concept of universally unsatisfied set to construct a primal‐dual algorithm, also called the primal‐dual Vickrey (PDV) auction. We prove that the O‐VCG auction can be viewed as a single‐attribute multi‐unit forward Vickrey (SA‐MFV) auction. Both PDV and SA‐MFV auctions realize VCG payments and truthful bidding for general valuations. This result reveals the underlying link not only between single‐attribute and multi‐attribute auctions, but between static and dynamic auctions in a multi‐attribute setting.

show abstract

Section: A Primal‐dual Algorithmmentioning

confidence: 86%

Section: Literature Reviewmentioning

confidence: 98%

Section: Literature Reviewmentioning

confidence: 99%

Section: Linear Programming Formulationmentioning

confidence: 99%

See 2 more Smart Citations

Efficient Multi‐Attribute Multi‐Unit Auctions for B2B E‐Commerce Logistics

Huang

2017

Production and Operations Management

Self Cite

View full text Add to dashboard Cite

show abstract

“…Therefore, for transportation service procurement, CA has attracted increasing attention because of the synergies available on the transportation pathways [3][4][5][6][7] as it allows carriers to submit bids to the shipper for the transportation loads they prefer which are grouped into packages or bundles of loads of various products [8,9]. Generally, there are three CA stages needed for transportation service procurement.…”

Section: Introductionmentioning

confidence: 99%

Transportation Service Procurement Bid Construction Problem from Less Than Truckload Perspective

Yan

et al. 2018

Mathematical Problems in Engineering

View full text Add to dashboard Cite

This paper presents mixed integer programming for a transportation service procurement bid construction problem from a less than full truckload perspective, in which the bidders (carriers) generate their best bid (package) using a bundled price to maximize their utility and increase the chance of winning the business. The models are developed from both the carriers and shippers perspectives to establish a relationship between the quoted price and the likelihood of winning to assist the carriers in balancing the potential benefits and the possibility of winning the bid. An intelligent algorithm based on Particle Swarm Optimization is then designed to solve the proposed model and hypothetical data sets are used to test the effectiveness and efficiency of the proposed model and algorithm.

show abstract

Purchasing Transportation Services from Ocean Carriers

Lai

2014

International Series in Operations Research &Amp; Management Science

View full text Add to dashboard Cite

Efficient auctions for distributed transportation procurement

Cited by 57 publications

References 34 publications

Efficient Multi‐Attribute Multi‐Unit Auctions for B2B E‐Commerce Logistics

Efficient Multi‐Attribute Multi‐Unit Auctions for B2B E‐Commerce Logistics

Transportation Service Procurement Bid Construction Problem from Less Than Truckload Perspective

Purchasing Transportation Services from Ocean Carriers

Contact Info

Product

Resources

About