Computer Science – Artificial Intelligence
Scientific paper
2012-01-20
Computer Science
Artificial Intelligence
Scientific paper
The bi-objective winner determination problem (2WDP-SC) of a combinatorial procurement auction for transport contracts comes up to a multi-criteria set covering problem. We are given a set B of bundle bids. A bundle bid b in B consists of a bidding carrier c_b, a bid price p_b, and a set tau_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 is subset of 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 article presents a metaheuristic approach for the 2WDP-SC which integrates the greedy randomized adaptive search procedure, large neighborhood search, and self-adaptive parameter setting in order to find a competitive set of non-dominated solutions. The procedure outperforms existing heuristics. Computational experiments performed on a set of benchmark instances show that, for small instances, the presented procedure is the sole approach that succeeds to find all Pareto-optimal solutions. For each of the large benchmark instances, according to common multi-criteria quality indicators of the literature, it attains new best-known solution sets.
Buer Tobias
Kopfer Herbert
No associations
LandOfFree
A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-321217