A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction

DOI10.1016/j.cor.2013.04.004zbMath1348.90534arXiv1201.4342OpenAlexW2133961610MaRDI QIDQ336792

Herbert Kopfer, Tobias Buer

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.4342

zbMATH Keywords

GRASPcombinatorial auctionALNSmulti-criteria winner determinationPareto optimization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items

Influence of non-price and environmental sustainability factors on truckload procurement process ⋮ A survey of adaptive large neighborhood search algorithms and applications ⋮ 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

Uses Software

• PERL
• SPEA2
• TTTPLOTS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm
• Engineering stochastic local search algorithms. Designing, implementing and analyzing effective heuristics. Second international workshop, SLS 2009, Brussels, Belgium, September 3--4, 2009. Proceedings
• An effective and simple heuristic for the set covering problem
• An optimal multiprocessor combinatorial auction solver
• Exact algorithms for the matrix bid auction
• Solving multiple scenarios in a combinatorial auction
• Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
• Greedy randomized adaptive search procedures
• TTT plots: a perl program to create time-to-target plots
• Combinatorial auctions
• Combinatorial Auctions: A Survey
• CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
• A Greedy Heuristic for the Set-Covering Problem
• A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
• Reducibility among Combinatorial Problems

This page was built for publication: A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction