FAST SYNERGY APPROXIMATION IN TRANSPORTATION PROCUREMENT WITH COMBINATORIAL AUCTIONS

Muhammed Emre Keskin; Chefi Triki; Adel Elomri

doi:10.1051/ro/2023022

FAST SYNERGY APPROXIMATION IN TRANSPORTATION PROCUREMENT WITH COMBINATORIAL AUCTIONS

Muhammed Emre Keskin, Chefi Triki^*, Adel Elomri

^*Corresponding author for this work

CSE Engineering Management and Decision Sciences

Research output: Contribution to journal › Article › peer-review

2 Citations (Scopus)

Abstract

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’s 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.

Original language	English
Pages (from-to)	677-695
Number of pages	19
Journal	RAIRO - Operations Research
Volume	57
Issue number	2
DOIs	https://doi.org/10.1051/ro/2023022
Publication status	Published - 1 Mar 2023

Keywords

Transportation networks
combinatorial auctions
synergy approximation

Access to Document

10.1051/ro/2023022

Cite this

@article{28d4ee57186d44878cf567c82312b079,

title = "FAST SYNERGY APPROXIMATION IN TRANSPORTATION PROCUREMENT WITH COMBINATORIAL AUCTIONS",

abstract = "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{\textquoteright}s 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.",

keywords = "Transportation networks, combinatorial auctions, synergy approximation",

author = "Keskin, {Muhammed Emre} and Chefi Triki and Adel Elomri",

note = "Publisher Copyright: {\textcopyright} The authors. Published by EDP Sciences, ROADEF, SMAI 2023.",

year = "2023",

month = mar,

day = "1",

doi = "10.1051/ro/2023022",

language = "English",

volume = "57",

pages = "677--695",

journal = "RAIRO - Operations Research",

issn = "0399-0559",

publisher = "EDP Sciences",

number = "2",

}

TY - JOUR

T1 - FAST SYNERGY APPROXIMATION IN TRANSPORTATION PROCUREMENT WITH COMBINATORIAL AUCTIONS

AU - Keskin, Muhammed Emre

AU - Triki, Chefi

AU - Elomri, Adel

N1 - Publisher Copyright: © The authors. Published by EDP Sciences, ROADEF, SMAI 2023.

PY - 2023/3/1

Y1 - 2023/3/1

N2 - 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’s 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.

AB - 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’s 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.

KW - Transportation networks

KW - combinatorial auctions

KW - synergy approximation

UR - http://www.scopus.com/inward/record.url?scp=85158855138&partnerID=8YFLogxK

U2 - 10.1051/ro/2023022

DO - 10.1051/ro/2023022

M3 - Article

AN - SCOPUS:85158855138

SN - 0399-0559

VL - 57

SP - 677

EP - 695

JO - RAIRO - Operations Research

JF - RAIRO - Operations Research

IS - 2

ER -

FAST SYNERGY APPROXIMATION IN TRANSPORTATION PROCUREMENT WITH COMBINATORIAL AUCTIONS

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this