A Genetic Algorithm for aBi-Objective Winner-Determination Problem in aTransportation-Procurement Auction

This paper introduces a bi-objective winner-determination problem and presents a multiobjectivegenetic algorithm to solve it. The problem examined arises in the procurement of transportation contractsvia combinatorial auctions. It is modeled as an extension to the set-covering problem and considersthe minimization of the total procurement costs and the maximization of the service-quality level ofthe execution of all transportation contracts tendered. To solve the problem, a multiobjective geneticalgorithm is used. Different operators for population initialization, mutation and repair are applied.Eight variants of the algorithm are tested using a set of 30 new benchmark instances.[...]