Solving a dynamic combinatorial auctions problem by a hybrid metaheuristic based on a fuzzy dominance relation

DOI10.1051/RO/2018051zbMATH Open1414.90300OpenAlexW2811436444WikidataQ129648521 ScholiaQ129648521MaRDI QIDQ5380972FDOQ5380972

El-Ghazali Talbi, Meziane Aider, Larbi Asli

Publication date: 7 June 2019

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/20.500.12210/22296

Recommendations

• A hybrid method to solve the multi-objective combinatorial auctions
• Metaheuristic approaches for the winner determination problem in combinatorial auction
• A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction
• A differential evolution algorithm for the winner determination problem in combinatorial auctions
• On heuristics for solving winner determination problem in combinatorial auctions
• scientific article; zbMATH DE number 6907181
• A heuristic algorithm based on weight-coded GA for WDP of combinatorial auctions
• Metaheuristics for dynamic combinatorial optimization problems
• scientific article; zbMATH DE number 2080503

zbMATH Keywords

winner determination problemdynamic modelfuzzy dominanceexercise periodmulti-objective combinatorial auctions

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)

Cited In (1)

• Fuzzy formulation of auctions and optimal sequencing for multiple auctions.

This page was built for publication: Solving a dynamic combinatorial auctions problem by a hybrid metaheuristic based on a fuzzy dominance relation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5380972)