A Multi-Agent based Hyper-Heuristic Algorithm for the Winner Determination Problem | Zendy

Ines Sghir | Zendy; Inès Ben Jaâfar | Zendy; Khaled Ghédira | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Multi-Agent based Hyper-Heuristic Algorithm for the Winner Determination Problem

Author(s) -

Ines Sghir,

Inès Ben Jaâfar,

Khaled Ghédira

Publication year - 2017

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2017.08.183

Subject(s) - computer science , benchmark (surveying) , reinforcement learning , set (abstract data type) , heuristic , mathematical optimization , algorithm , local search (optimization) , evolutionary algorithm , artificial intelligence , mathematics , geodesy , programming language , geography

In this paper, we propose a Multi-Agent based Hyper-Heuristic algorithm for the Winner Determination Problem named MA H 2 -WDP. This algorithm explores a set of cooperating agents to select the appropriate operation using learning techniques. MA H 2 -WDP is specialized for local search methods and evolutionary methods where the following agents are seeking to improve the search within reinforcement learning: the mediator agent, two local search agents, the perturbation agent and two recombination agents. Our computational study shows that the proposed algorithm performs well on the tested benchmark instances in terms of solution quality.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research