{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T07:10:09Z","timestamp":1750749009065,"version":"3.37.3"},"reference-count":25,"publisher":"EDP Sciences","issue":"2","license":[{"start":{"date-parts":[[2023,4,28]],"date-time":"2023-04-28T00:00:00Z","timestamp":1682640000000},"content-version":"vor","delay-in-days":58,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2023,2,16]]},"published-print":{"date-parts":[[2023,3]]},"abstract":"<jats:p>In this study we develop a decision support tool to help carriers in defining their bids when participating in transportation combinatorial auctions. In this way, they can avoid many of their empty movements and ensure additional business through the spot market. We propose three algorithms that quantify the synergy as a key concept to measure the complementarity between the carrier\u2019s existing network and the contracts to be included in the bundles to be submitted as bids. The algorithms are validated on a real-life application and our results emphasized their superiority compared to previous studies.<\/jats:p>","DOI":"10.1051\/ro\/2023022","type":"journal-article","created":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T20:03:26Z","timestamp":1676837006000},"page":"677-695","source":"Crossref","is-referenced-by-count":4,"title":["Fast synergy approximation in transportation procurement with combinatorial auctions"],"prefix":"10.1051","volume":"57","author":[{"given":"Muhammed Emre","family":"Keskin","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8750-2470","authenticated-orcid":false,"given":"Chefi","family":"Triki","sequence":"additional","affiliation":[]},{"given":"Adel","family":"Elomri","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2023,4,28]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"984","DOI":"10.1016\/j.jclepro.2019.06.156","volume":"234","author":"Al Hla","year":"2019","journal-title":"J. Cleaner Prod."},{"key":"R2","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1057\/palgrave.rpm.5170119","volume":"3","author":"An","year":"2005","journal-title":"J. Revenue Pricing Manage."},{"key":"R3","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1016\/j.trb.2008.09.003","volume":"43","author":"Chang","year":"2009","journal-title":"Transp. Res. Part B: Methodol."},{"key":"R4","unstructured":"CT Team Cloud Trucks, Trucking industry trends & statistics of 2021 (2022). https:\/\/www.cloudtrucks.com\/blog-post\/trucking-trends::text=In%202021%2C%20the%20total%20market,%2C%20and%20finding%2Fretaining%20customers."},{"key":"R5","doi-asserted-by":"crossref","first-page":"145","DOI":"10.3390\/su11010145","volume":"11","author":"Gatta","year":"2018","journal-title":"Sustainability"},{"key":"R6","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1080\/09720529.2008.10698167","volume":"11","author":"Ghiani","year":"2008","journal-title":"J. Discrete Math. Sci. Cryptography"},{"key":"R7","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/j.trb.2021.04.010","volume":"149","author":"Hammami","year":"2021","journal-title":"Transp. Res. Part B: Methodol."},{"key":"R8","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.trb.2014.11.012","volume":"73","author":"Kuyzu","year":"2015","journal-title":"Transp. Res. Part B: Methodol."},{"key":"R9","unstructured":"Kwon R.H., Lee C.G. and Ma Z., An integrated combinatorial auction mechanism for truckload transportation procurement, Working Paper. University of Toronto (2005). http:\/\/www.mie.utoronto.ca\/labs\/ilr\/MultiRound.pdf."},{"key":"R10","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1016\/j.ejor.2013.02.034","volume":"229","author":"Lozano","year":"2013","journal-title":"Eur. J. Oper. Res."},{"key":"R11","unstructured":"Ma Z., Combinatorial auctions for truckload transportation procurement, Doctoral dissertation (2008)."},{"key":"R12","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1108\/JMTM-06-2012-0065","volume":"25","author":"Marchet","year":"2014","journal-title":"J. Manuf. Technol. Manage."},{"key":"R13","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.tre.2015.06.002","volume":"81","author":"Mesa-Arango","year":"2015","journal-title":"Transp. Res. Part E: Logistics Transp. Rev."},{"key":"R14","first-page":"295","volume":"30","author":"Olcaytu","year":"2018","journal-title":"Transp. Res. Proc."},{"key":"R15","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s11590-020-01608-w","volume":"15","author":"Olcaytu","year":"2021","journal-title":"Optim. Lett."},{"key":"R16","doi-asserted-by":"crossref","unstructured":"Palacios-Huerta I., Parkes D.C. and Steinberg R., Combinatorial auctions in practice. Available at SSRN 3844338 (2022). DOI: 10.2139\/ssrn.3844338.","DOI":"10.2139\/ssrn.3844338"},{"key":"R17","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1287\/inte.1040.0075","volume":"34","author":"Sheffi","year":"2004","journal-title":"Interfaces"},{"key":"R18","first-page":"40","volume":"2003","author":"Song","year":"1833","journal-title":"Transp. Res. Record"},{"key":"R19","doi-asserted-by":"crossref","first-page":"914","DOI":"10.1016\/j.trb.2004.11.003","volume":"39","author":"Song","year":"2005","journal-title":"Transp. Res. Part B"},{"key":"R20","doi-asserted-by":"crossref","first-page":"1125","DOI":"10.1007\/s11590-015-0909-0","volume":"10","author":"Triki","year":"2016","journal-title":"Optim. Lett."},{"key":"R21","doi-asserted-by":"crossref","first-page":"127057","DOI":"10.1016\/j.jclepro.2021.127057","volume":"304","author":"Triki","year":"2021","journal-title":"J. Cleaner Prod."},{"key":"R22","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1016\/j.ejor.2013.06.013","volume":"236","author":"Triki","year":"2014","journal-title":"Eur. J. Oper. Res."},{"key":"R23","doi-asserted-by":"crossref","unstructured":"Triki C., Akil J. and Al-Asmakh H., Optimization models for the procurement through reverse combinatorial auctions in the logistics and food industries. To appear on J. Procure Manage. (2023).","DOI":"10.1504\/IJPM.2023.129555"},{"key":"R24","first-page":"189","volume":"2005","author":"Wang","year":"1923","journal-title":"Transp. Res. Record"},{"key":"R25","first-page":"493","volume":"33","author":"Yan","year":"2020","journal-title":"Asia Pac. J. Marketing Logistics"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2023022\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,28]],"date-time":"2023-04-28T08:14:31Z","timestamp":1682669671000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2023022"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3]]},"references-count":25,"journal-issue":{"issue":"2"},"alternative-id":["ro220524"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2023022","relation":{},"ISSN":["0399-0559","2804-7303"],"issn-type":[{"type":"print","value":"0399-0559"},{"type":"electronic","value":"2804-7303"}],"subject":[],"published":{"date-parts":[[2023,3]]}}}