%0 Journal Article
%T GRASP with Hybrid Path Relinking for Bi-Objective Winner Determination in Combinatorial Transportation Auctions
%A Tobias Buer
%A Giselher Pankratz
%J BuR : Business Research
%D 2010
%I Verband der Hochschullehrer f¨¹r Betriebswirtschaft e.V.
%X The procurement of transportation services via large-scale combinatorial auctions involves a couple of complex decisions whose outcome highly influences the performance of the tender process. This paper examines the shipper's task of selecting a subset of the submitted bids which efficiently trades off total procurement cost against expected carrier performance. To solve this bi-objective winner determination problem, we propose a Pareto-based greedy randomized adaptive search procedure (GRASP). As a post-optimizer we use a path relinking procedure which is hybridized with branch-and-bound. Several variants of this algorithm are evaluated by means of artificial test instances which comply with important real-world characteristics. The two best variants prove superior to a previously published Pareto-based evolutionary algorithm.
%K combinatorial auction
%K transportation procurement
%K set covering problem
%K multi-criteria decision making
%K Pareto optimization
%K GRASP
%U http://www.business-research.org/2010/2/operations-and-information-systems/2685/hihrig1288341592.5.pdf