A carrier’s optimal bid generation problem in combinatorial auctions for transportation procurement

Lee, Chi-Guhn; Kwon, Roy H.; Ma, Zhong

doi:10.1016/j.tre.2005.01.004

Cited by 87 publications

(66 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Lee et al [18] developed a utility maximization decision problem in which the carriers determined the best packages to bid for in a combinatorial auction and presented a column generation approach to solve the underlying nonlinear quadratic integer program. Chang [1] developed a bidding advisor to assist truckload (TL) carriers in overcoming the challenges in the one-shot combinatorial auctions.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Therefore, this paper seeks to establish stochastic mixed integer programming to allow for the proper bundle of loads to be chosen based on price, which could improve the likelihood that carriers can earn their maximum utility. Although the model is proposed based on previous research [1,8,18], the highlights can be summarized as follows:…”

Section: Introductionmentioning

confidence: 99%

“…(iv) It considers the space-time network [18], which is more difficult than common transportation networks.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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

Section: Literature Reviewmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

show abstract

“…In some cases, unit demand is considered for simplification (Guo et al, 2006;Lee et al, 2007;Song and Regan, 2003). Therefore, the total transportation cost is calculated by assuming a single load in each lane.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Also in combinatorial bidding, carriers can submit bids in the form of lane bundles that enable the carrier to bid for combinations of lanes of their own choice with less empty movements. According to Lee et al (2007), repositioning of empty trucks constitutes a substantial portion of operating expenses. Here, there is no risk of getting an incomplete set in the bundle and hence carriers can bid without fear of exposure problems.…”

Section: Introductionmentioning

confidence: 99%

A strategic approach to improve sustainability in transportation service procurement

Basu¹,

Bai

Palaniappan³

2015

Transportation Research Part E: Logistics and Transportation Re

View full text Add to dashboard Cite

Integrating production scheduling and transportation procurement through combinatorial auctions

Triki

Piya

2020

Networks

View full text Add to dashboard Cite

This study uses the winner determination problem (WDP) to integrate auction transportation procurement with decisions related to production scheduling. The basic problem arises when a manufacturer has to clear a combinatorial auction to decide whether to cover transportation needs by using the in‐house fleet or to procure transportation through auction. Thus, the manufacturer should include an additional decision level by integrating the WDP with production scheduling to gain efficiency and achieve savings in the logistics system. To the best of our knowledge, this is the first time production and transportation procurement problems are being solved simultaneously in an integrated manner. The study proposes a mathematical formulation and develops two heuristic approaches for solving the integrated problem. Extensive computational experiments and sensitivity analyses are reported to validate the model, assess the performance of the heuristics, and show the effect of integration on total cost.

show abstract

A carrier’s optimal bid generation problem in combinatorial auctions for transportation procurement

Cited by 87 publications

References 12 publications

Transportation Service Procurement Bid Construction Problem from Less Than Truckload Perspective

Transportation Service Procurement Bid Construction Problem from Less Than Truckload Perspective

A strategic approach to improve sustainability in transportation service procurement

Integrating production scheduling and transportation procurement through combinatorial auctions

Contact Info

Product

Resources

About