شماره ركورد كنفرانس :
5432
عنوان مقاله :
Combinatorial Auctions in Logistics under Stochastic Travel Times and Stochastic Clearing Prices
پديدآورندگان :
KESKİN Muhammed Emre emre.keskin@atauni.edu.tr Department of Industrial Engineering, Engineering Faculty, Atatürk University, Erzurum 25240, Türkiye , TRIKI Chefi c.triki@kent.ac.uk Kent Business School, University of Kent, Canterbury Kent CT2 7FS, UK , BALDACCI Roberto rbaldacci@hbku.edu.qa Department of Engineering Management Decision Sciences, College of Science Engineering Hamad bin Khalifa University , Zhang Yu y.zhang@swufe.edu.cn Department of Logistics Management, Southwestern University of Finance and Economics
كليدواژه :
Combinatorial Auction , Stochastic Travel Times , Stochastic Clearing Prices , Chance Constraints
عنوان كنفرانس :
شانزدهمين كنفرانس بين المللي انجمن ايراني تحقيق در عمليات
چكيده فارسي :
We are dealing with a situation of a firm in which multiple trucks with known locations are to be routed to serve full truckload demands called loads with known origin and destination points. On the other hand, in order to avoid empty maneuvers of the trucks and to gain profit, firm tries to get loads from spot market by the help of a combinatorial auction in which more than one load can be bided on simultaneously. Loads are assumed to have known time windows limitations, i.e., loads have to be served within specific time frames. In this study, we take travel times of the trucks as stochastic which makes complying with time window constraints a difficult problem. We also consider that the clearing price of each auctioned load to be a stochastic random variable. A mathematical programming with chance constraints are developed first, and then it is linearized and solved for extensive numerical instances.
