Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.11851/744
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kuyzu, Gültekin | - |
dc.contributor.author | Olcaytu, Evren | - |
dc.date.accessioned | 2019-03-18T12:34:42Z | - |
dc.date.available | 2019-03-18T12:34:42Z | - |
dc.date.issued | 2018-03-09 | - |
dc.identifier.citation | Olcaytu, E., & Kuyzu, G. (2018). Synergy-based Bidding Method for Simultaneous Freight Transportation Auctions. Transportation research procedia, 30, 295-303. | en_US |
dc.identifier.issn | 23521457 | - |
dc.identifier.uri | https://doi.org/10.1016/j.trpro.2018.09.032 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.11851/744 | - |
dc.description.abstract | The tremendous use of the Internet has led freight transportation procurement websites to become an effective marketplaces that bring together several carriers and shippers. These websites enable transportation of goods in a more cost effective and safer way. From the carriers' point of view, this situation gives rise to the bid price determination problem in an auction based fast procurement process. Carriers place bids in multiple auctions simultaneously without knowing the lanes they win until the end of the auctions. This leads to uncertainty in the calculation of the lane bid price quotes at the beginning of the auctions. Kuyzu et al. (2015) proposed a stochastic bid price optimization model for addressing the uncertainty in simultaneous procurement auctions. However, their model is a non-concave maximization problem that requires historical data and solving an exponential number of NP-Hard optimization problems. In real-life situations, several auctions may need to be priced simultaneously. In this study, we propose a simpler approach so that the bid prices can be determined simultaneously with less computational effort. We develop an efficient synergy-based method to calculate a full truckload carrier's bid prices so that the carrier can compete with other carriers and win the tendered lanes in a profitable way. We validate the effectiveness of the synergy-based method through computational experiments involving simulations of a virtual transportation procurement auction marketplace. | en_US |
dc.description.uri | https://www.sciencedirect.com/science/article/pii/S2352146518301054?via%3Dihub | - |
dc.language.iso | en | en_US |
dc.publisher | Elsevier B.V. | en_US |
dc.relation.ispartof | Transportation Research Procedia | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | Auctions | en_US |
dc.subject | Bidding strategy | en_US |
dc.subject | Freight transportation | en_US |
dc.subject | Synergy | en_US |
dc.title | Synergy-Based Bidding Method for Simultaneous Freight Transportation Auctions | en_US |
dc.type | Conference Object | en_US |
dc.department | TOBB ETÜ | en_US |
dc.identifier.volume | 30 | - |
dc.identifier.startpage | 295 | - |
dc.identifier.endpage | 303 | - |
dc.authorid | Kuyzu, Gültekin [19092] | - |
dc.authorid | Kuyzu, Gültekin [0000-0002-1997-306X] | - |
dc.identifier.scopus | 2-s2.0-85054072645 | en_US |
dc.institutionauthor | Kuyzu, Gültekin | - |
dc.identifier.doi | 10.1016/j.trpro.2018.09.032 | - |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
dc.identifier.scopusquality | - | - |
item.openairetype | Conference Object | - |
item.languageiso639-1 | en | - |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
crisitem.author.dept | 02.4. Department of Industrial Engineering | - |
Appears in Collections: | Endüstri Mühendisliği Bölümü / Department of Industrial Engineering Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection |
CORE Recommender
SCOPUSTM
Citations
3
checked on Dec 21, 2024
Page view(s)
60
checked on Dec 23, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.