David Meignan

David Meignan

Auto-generated profile, based on publicly available information

David Meignan

Universität Osnabrück, Osnabrück, Deutschland

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 September 2015 in ACM Transactions on Interactive Intelligent Systems
Verified
Journal Article
Open access
DMDavid Meignan
David Meignan
SKSigrid Knust
Sigrid Knust
JFJean-Marc Frayret
Jean-Marc Frayret
GPGilles Pesant
Gilles Pesant
NGNicolas Gaud
Nicolas Gaud
This article presents a review and a classification of interactive optimization methods. These interactive methods are used for solving optimization problems. The interaction with an end user or decision maker aims at improving the efficiency of the optimization procedure, enriching the optimization model, or informing the user regarding the solutions proposed by the optimization system. First, we present the challenges of using optimization methods as a tool for supporting decision making, and we justify the integration of the user in the optimization process. This integration is generally achieved via a dynamic interaction between the user and the system. Next, the different classes of interactive optimization approaches are presented. This detailed review includes trial and error, interactive reoptimization, interactive multiobjective optimization, interactive evolutionary algorithms, human-guided search, and other approaches that are less well covered in the research literature. On the basis of this review, we propose a classification that aims to better describe and compare interaction mechanisms. This classification offers two complementary views on interactive optimization methods. The first perspective focuses on the user’s contribution to the optimization process, and the second concerns the components of interactive optimization systems. Finally, on the basis of this review and classification, we identify some open issues and potential perspectives for interactive optimization methods.

25 February 2007 in Simulation Modelling Practice and Theory
Verified
Journal Article
Closed access
DMDavid Meignan
David Meignan
OSOlivier Simonin
Olivier Simonin
Abderrafiaa KoukamAbderrafiaa Koukam
Abderrafiaa Koukam

9 December 2009 in Journal of Heuristics
Verified
Journal Article
Closed access
PDF file
DMDavid Meignan
David Meignan
Abderrafiaa KoukamAbderrafiaa Koukam
Abderrafiaa Koukam
JCJean-Charles Créput
Jean-Charles Créput

1 December 2019 in European Journal of Operational Research
Verified
Journal Article
Closed access
DMDavid Meignan
David Meignan
SKSigrid Knust
Sigrid Knust

1 December 2012 in Canadian Journal of Forest Research
Verified
Journal Article
Closed access
DMDavid Meignan
David Meignan
JFJean-Marc Frayret
Jean-Marc Frayret
GPGilles Pesant
Gilles Pesant
MBMathieu Blouin
Mathieu Blouin

1 June 2008
Verified
Conference Paper
Closed access
DMDavid Meignan
David Meignan
JCJean-Charles Creput
Jean-Charles Creput
Abderrafiaa KoukamAbderrafiaa Koukam
Abderrafiaa Koukam
This paper presents a population based Metaheuristic adopting the metaphor of social autonomous agents. In this context, agents cooperate and self-adapt in order to collectively solve a given optimization problem. From an evolutionary computation point of view, mechanisms driving the search consist of combining intensification operators and diversification operators, such as local search and mutation or recombination. The multiagent paradigm mainly focuses on the adaptive capabilities of individual agents evolving in a context of decentralized control and asynchronous communication. In the proposed metaheuristic, the agentpsilas behavior is guided by a decision process for the operatorspsilachoice which is dynamically adapted during the search using reinforcement learning and mimetism learning between agents. The approach is called Coalition-Based Metaheuristic (CBM) to refer to the strong autonomy conferred to the agents. This approach is applied to the Vehicle Routing Problem to emphasize the performance of learning and cooperation mechanisms.