Un Algorithme Évolutionnaire pour Trouver des Politiques Optimales avec un Simulateur Multi-Agent

International audienceIn this paper, we introduce a new agent-based method to build a decision-aid tool aimed to improve policy design. In our approach, a policy is defined as a set of levers, modelling the set of actions, the means to impact a complex system. Our method is generic, as it could be applied to any domain, and be coupled with any agent-based simulator. We could deal not only with simple levers (a single variable whose value is modified) but also complex ones (multiple variable modifications, qualitative effects, ...), unlike most optimization methods. It is based on the evolutionary algorithm CMA-ES, coupled with a normalized and aggregated fitness function. The fitness is normalized using estimated Ideal (best policy) and Nadir (worst policy) values, these values being dynamically computed during the execution of CMA-ES through a Pareto Front estimated with the ABM simulation. Moreover , to deal with complex levers, we introduce the FSM-branching algorithm, where a Finite State Machine (FSM) determines whether a complex policy can potentially be improved or has to be aborted. We tested our method with Economic Policies on the French Labor Market (FLM), allowing the modification of multiple elements of the FLM, and we compared the results to the reference, the FLM without any policy applied. The policies studied here comprise simple and complex levers. This experience shows the viability of our approach, the efficiency of our algorithms and illustrates how this combination of evolutionary optimization, multi-criteria aggregation and agent-based simulation could help any policy-maker to design better policies

Search for Compromise Solutions in Multiobjective State Space Graphs

The aim of this paper is to introduce and solve new search problems in multiobjective state space graphs. Although most of the studies concentrate on the determination of the entire set of Pareto optimal solution paths, the size of which can be, in worst case, exponential in the number of nodes, we consider here more specialized problems where the search is focused on Pareto solutions achieving a well-balanced compromise between the conflicting objectives. After introducing a formal definition of the compromise search problem, we discuss computational issues and the complexity of the problem. Then, we introduce two algorithms to find the best compromise solution-paths in a state space graph. Finally, we report various numerical tests showing that, as far as compromise search is concerned, both algorithms are very efficient (compared to MOA*) but they present contrasted advantages discussed in the conclusion.ouinonouirechercheInternationa

Search for Compromise Solutions in Multiobjective State Space Graphs

International audienceThe aim of this paper is to introduce and solve new search problems in multiobjective state space graphs. Although most of the studies concentrate on the determination of the entire set of Pareto optimal solution paths, the size of which can be, in worst case, exponential in the number of nodes, we consider here more specialized problems where the search is focused on Pareto solutions achieving a well-balanced compromise between the conflicting objectives. After introducing a formal definition of the compromise search problem, we discuss computational issues and the complexity of the problem. Then, we introduce two algorithms to find the best compromise solution-paths in a state space graph. Finally, we report various numerical tests showing that, as far as compromise search is concerned, both algorithms are very efficient (compared to MOA*) but they present contrasted advantages discussed in the conclusion

Search for Compromise Solutions in Multiobjective State Space Graphs

Abstract. The aim of this paper is to introduce and solve new search problems in multiobjective state space graphs. Although most of the studies concentrate on the determination of the entire set of Pareto optimal solution paths, the size of which can be, in worst case, exponential in the number of nodes, we consider here more specialized problems where the search is focused on Pareto solutions achieving a well-balanced compromise between the conflicting objectives. After introducing a formal definition of the compromise search problem, we discuss computational issues and the complexity of the problem. Then, we introduce two algorithms to find the best compromise solution-paths in a state space graph. Finally, we report various numerical tests showing that, as far as compromise search is concerned, both algorithms are very efficient (compared to MOA*) but they present contrasted advantages discussed in the conclusion.