Reputation‐based winner determination problem for combinatorial transportation procurement auctions

Reputation‐based winner determination problem for combinatorial transportation procurement auctions

0.00 Avg rating0 Votes
Article ID: iaor20125254
Volume: 63
Issue: 10
Start Page Number: 1400
End Page Number: 1409
Publication Date: Oct 2012
Journal: Journal of the Operational Research Society
Authors: ,
Keywords: combinatorial optimization, supply & supply chains
Abstract:

This paper proposes a reputation‐based winner determination problem for transportation procurement auctions where the allocation of long‐term contracts to carriers is decided with respect to both bid ask‐prices and carriers reputation. The objective is to manage the trade‐off between transport costs and the quality of service during operations. Carriers reputation is translated into unexpected hidden cost that represents the possible additional cost that the shipper may incur when dealing with a set of winning carriers. This cost depends essentially on the carriers reputation as evaluated by the shipper running the auction. To evaluate carriers reputations, the shipper uses a number of service attributes with different weights depending on shipping contracts.

Reviews

Required fields are marked *. Your email address will not be published.