A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction
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.
|Date of creation:||19 Jan 2012|
|Date of revision:|
|Contact details of provider:|| Postal: Ludwigstraße 33, D-80539 Munich, Germany|
Web page: https://mpra.ub.uni-muenchen.de
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:36062. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Joachim Winter)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.