View article

The bi-objective winner determination problem (2WDP-SC) of a combinatorial procurement auction for transport contracts is characterized by a set B of bundle bids, with each bundle bid b∈ B consisting of a bidding carrier c b, a bid price p b, and a set τ b of transport contracts which is a subset of the set T of tendered transport contracts. Additionally, the transport quality q t, c b is given which is expected to be realized when a transport contract t is executed by a carrier c b. The task of the auctioneer is to find a set X of winning bids (X⊆ B), such that each transport contract is part of at least one winning bid, the total procurement costs are minimized, and the total transport quality is maximized. This paper presents a metaheuristic approach for the 2WDP-SC which integrates the greedy randomized adaptive search procedure with a two-stage candidate component selection procedure, large neighborhood search, and …