A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction
From MaRDI portal
(Redirected from Publication:336792)
Abstract: 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 in B consisting of a bidding carrier c_b, a bid price p_b, and a set tau_b 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 subset 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 with a two-stage candidate component selection procedure, large neighborhood search, and self-adaptive parameter setting in order to find a competitive set of non-dominated solutions. The heuristic outperforms all existing approaches. For seven small benchmark instances, the heuristic is the sole approach that finds all Pareto-optimal solutions. For 28 out of 30 large instances, none of the existing approaches is able to compute a solution that dominates a solution found by the proposed heuristic.
Recommendations
- Multiobjective combinatorial auctions in transportation procurement
- Metaheuristic approaches for the winner determination problem in combinatorial auction
- On heuristics for solving winner determination problem in combinatorial auctions
- Solving a dynamic combinatorial auctions problem by a hybrid metaheuristic based on a fuzzy dominance relation
- A hybrid method to solve the multi-objective combinatorial auctions
Cites work
- scientific article; zbMATH DE number 1594569 (Why is no real title available?)
- scientific article; zbMATH DE number 4070651 (Why is no real title available?)
- scientific article; zbMATH DE number 1487912 (Why is no real title available?)
- A Greedy Heuristic for the Set-Covering Problem
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm
- An effective and simple heuristic for the set covering problem
- An optimal multiprocessor combinatorial auction solver
- CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
- Combinatorial auctions
- Combinatorial auctions. Foreword by Vernon L. Smith.
- Combinatorial auctions: a survey
- Engineering stochastic local search algorithms. Designing, implementing and analyzing effective heuristics. Second international workshop, SLS 2009, Brussels, Belgium, September 3--4, 2009. Proceedings
- Exact algorithms for the matrix bid auction
- Greedy randomized adaptive search procedures
- Reducibility among combinatorial problems
- Solving multiple scenarios in a combinatorial auction
- TTT plots: a perl program to create time-to-target plots
- Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
Cited in
(7)- Bi-objective optimization method and application of mechanism design based on pigs' payoff game behavior
- Multiobjective combinatorial auctions in transportation procurement
- Influence of non-price and environmental sustainability factors on truckload procurement process
- A survey of adaptive large neighborhood search algorithms and applications
- Solving a dynamic combinatorial auctions problem by a hybrid metaheuristic based on a fuzzy dominance relation
- An exact method for the combinatorial bids generation problem with uncertainty on clearing prices, bids success, and contracts materialization
- Leader-based diffusion optimization model in transportation service procurement under heterogeneous drivers' collaboration networks
This page was built for publication: A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336792)
