WorldCat Identities

Vanderpooten, Daniel

Overview
Works: 32 works in 55 publications in 2 languages and 218 library holdings
Roles: Thesis advisor, Author, Opponent, Other, Contributor
Classifications: T57.95, 658.403
Publication Timeline
.
Most widely held works by Daniel Vanderpooten
Aide à la décision : une approche par les cas by Philippe Vallin( Book )

5 editions published between 2000 and 2002 in French and held by 96 WorldCat member libraries worldwide

Toute prise de décision réfléchie repose sur un modèle explicite ou non. Cet ouvrage présente la démarche de modélisation et de résolution de problématiques d'aide à la décision par l'analyse et le commentaire de cas provenant, pour la majorité, de problèmes réels. Les domaines abordés couvrent la logistique, la gestion de production, la gestion des ressources humaines, le marketing, la finance. L'originalité de cet ouvrage est l'éclairage mis sur l'analyse et le processus de modélisation (conception du modèle). Pour accompagner le lecteur non spécialiste, chaque cas est traité intégralement, de l'analyse à la résolution de chaque problème. Les difficultés sont présentées graduellement, le recours à un ouvrage théorique spécialisé n'est donc pas nécessaire. Les outils présentés sont la théorie des graphes (chemins, flots, arbres), la programmation linéaire (continue et en nombres entiers), l'ordonnancement et la gestion des stocks, la théorie de la décision et l'analyse multicritère. Les résultats obtenus sont analysés et commentés en termes de décisions concrètes pour expliquer les apports et les limites de la modélisation mathématique. Les auteurs transmettent leur expérience de l'aide à la décision en réunissant rigueur scientifique et démarche pragmatique. Sont concernés par cet ouvrage : les étudiants (formation initiale et continue) en gestion, mathématiques appliquées, informatique, des universités, écoles de commerce et d'ingénieurs, les professionnels confrontés aux problématiques de prise de décision dans les diverses fonctions de l'entreprise (études stratégiques, systèmes d'information, logistique, production, finance, marketing, relations humaines). Ils y trouveront la présentation des éléments et des raisonnements clés pour la compréhension et la maîtrise d'une démarche rigoureuse dans la prise de décision s'appuyant sur les modèles mathématiques et informatiques
Aiding decisions with multiple criteria : essays in honor of Bernard Roy by D Bouyssou( )

2 editions published in 2002 in English and held by 63 WorldCat member libraries worldwide

Aiding Decisions With Multiple Criteria: Essays in Honor of Bernard Roy is organized around two broad themes: Graph Theory with path-breaking contributions on the theory of flows in networks and project scheduling, Multiple Criteria Decision Aiding with the invention of the family of ELECTRE methods and methodological contribution to decision-aiding which lead to the creation of Multi-Criteria Decision Analysis (MCDA). Professor Bernard Roy has had considerable influence on the development of these two broad areas. £/LIST£ Part one contains papers by Jacques Lesourne, and Dominique de Werra & Pierre Hansen related to the early career of Bernard Roy when he developed many new techniques and concepts in Graph Theory in order to cope with complex real-world problems. Part two of the book is devoted to Philosophy and Epistemology of Decision-Aiding with contributions from Valerie Belton & Jacques Pictet and Jean-Luis Genard & Marc Pirlot. Part three includes contributions based on Theory and Methodology of Multi-Criteria Decision-Aiding based on a general framework for conjoint measurement that allows intrasitive preferences. Denis Bouyssou & Marc Pirlot; Alexis Tsoukiàs, Patrice Perny & Philippe Vincke; Luis Dias & João Clímaco; Daniel Vanderpooten; Michael Doumpos & Constantin Zopounidis; and Marc Roubens offer a considerable range of examinations of this aspect of MCDA. Part four is devoted to Perference Modeling with contributions from Peter Fishburn; Salvatore Greco, Benedetto Matarazzo & Roman Slowinski; Salem Benferhat, Didier Dubois & Henri Prade; Oscar Franzese & Mark McCord; Bertrand Munier; and Raymond Bisdorff. Part five groups Applications of Multi-Criteria Decision-Aiding, and Carlos Henggeler Antunes, Carla Oliveira & João Clímaco; Carlos Bana e Costa, Manuel da Costa-Lobo, Isabel Ramos & Jean-Claude Vansnick; Yannis Siskos & Evangelos Grigoroudis; Jean-Pierre Brans, Pierre Kunsch & Bertrand Mareschal offer a wide variety of application problems. Finally, Part six includes contributions on Multi-Objective Mathematical Programming from Jacques Teghem, Walter Habenicht and Pekka Korhonen
Project ranking using Electre III by J. T Buchanan( Book )

1 edition published in 1999 in English and held by 5 WorldCat member libraries worldwide

L'approche interactive dans l'aide multicritère à la décision : aspects conceptuels, méthodologiques et informatiques by Daniel Vanderpooten( )

3 editions published between 1990 and 2019 in French and held by 4 WorldCat member libraries worldwide

L'évolution des sciences de la décision vers une reconnaissance accrue du rôle du décideur est particulièrement sensible dans le domaine de l'analyse multicritère. Le prolongement d'une telle tendance conduit naturellement à l'idée séduisante de l'intégration du décideur comme élément actif du processus d'aide à la décision. C'est ainsi qu'une nouvelle branche de l'aide multicritère à la décision - l'approche interactive - s'est développée au cours des deux dernières décennies. La multitude de procédures multicritères interactives présentées dans la littérature, le nombre croissant d'applications réelles ainsi même que l'émergence de prises de position critiques traduisent un succès que les tendances actuelles ne semblent guère démentir. S'il parait donc légitime de distinguer une approche spécifique, il est plus difficile de la caractériser dans la mesure où elle regroupe des procédures fondées sur des démarches et des concepts fort variés. L'objet de ce travail est donc de définir un cadre général permettant de mieux caractériser l'approche interactive, de resituer les méthodes jusqu'ici proposées, mais aussi de guider la conception de nouvelles procédures. Les aspects mathématiques, la manière d'intégrer l'information préférentielle progressivement émise par le décideur, la façon de régir l'interaction homme-machine, les considérations liées à l'implémentation informatique, tels sont par ailleurs les points principalement étudiés permettant de dégager certaines exigences ou lignes directrices. C'est sur ces bases qu'une nouvelle procédure a été élaborée, implémentée puis expérimentée
Approximation et résolution des versions min-max et min-max regret de problèmes d'optimisation combinatoire by Hassene Aissi( Book )

3 editions published between 2005 and 2019 in French and held by 3 WorldCat member libraries worldwide

En théorie de la décision, des approches, basées sur la résolution des versions min-max (regret) de problèmes d'optimisation, sont souvent utilisées en vue d'obtenir des solutions qui ont un bon comportement dans le pire cas. La complexité de ces problèmes a été étudiée de manière approfondie au cours de la dernière décennie. Nous présentons certains résultats complémentaires de complexité et nous initions l'étude de l'approximation des versions min-max (regret) de plusieurs problèmes classiques tels que le plus court chemin, l'arbre couvrant et le sac à dos, pour lesquels nous présentons des résultats positifs et négatifs.Outre cette étude théorique, nous nous intéressons à une application du critère de regret maximum et, d'une manière générale, des approches robustes au problème d'association de données. Formellement, le problème peut se modéliser comme un problème d'affectation multidimensionnelle. Compte tenu des diverses sources d'imprécision, le modèle n'est pas souvent pertinent. Nous montrons qu'il est utile d'évaluer les coefficients de la fonction objectif à l'aide d'intervalles au lieu d'utiliser les valeurs les plus vraisemblables. Différentes stratégies sont étudiées pour résoudre ce problème et des exemples numériques sont proposés pour démontrer l'efficacité de notre approche
Etude et résolution d'un problème bi-critère d'ordonnancement par lots by Afef Bouzaiene( )

2 editions published between 2011 and 2019 in French and held by 3 WorldCat member libraries worldwide

We consider the two-machine flowshop serial-batching scheduling problem where the machines have a limited capacity. The processing time of a batch is equal to the sum of total processing time of the jobs contained in it, and the completion time of a job in a batch is defined as the completion time of the batch containing it. Two criteria to be minimized are considered here. The first criterion is the makespan. The second criterion is the number of batches. This criterion reflects a situation where processing of any batch induces a fixed cost, which leads to a total cost proportional to the number of batches. We show that we can restrict our search to efficient schedules having consistent batches.We study the complexity of the problem in a particular case and propose in the general case a linear programming formulation and a polynomial dynamic programming algorithm that can be used for a fixed job sequence. In case of unit sized jobs, we develop two polynomial-time approximation algorithms with a guaranteed performance and also provide exact polynomial-time algorithms and a dominance relation for some particular cases. Finally, we lead an experimental study to compare linear program and dynamic program results
Approximation et énumération des solutions efficaces dans les problèmes d'optimisation combinatoire multi-objectif by Hadrien Hugot( Book )

3 editions published between 2007 and 2019 in French and held by 3 WorldCat member libraries worldwide

This thesis deals with the resolution of multi-objective combinatorial optimization problems. A first step in the resolution of these problems consists in determining the set of efficient solutions. Nevertheless, the number of efficient solutions can be very huge. Approximating the set of efficient solutions for these problems constitutes, then, a major challenge. Existing methods are usually based on approximate methods, such as heuristics or meta-heuristics, that give no guarantee on the quality of the computed solutions. Alternatively, approximation algorithms (with provable guarantee) have been also designed. However, practical implementations of approximation algorithms are cruelly lacking and most of the approximation algorithms proposed in the literature are not efficient in practice. This thesis aims at designing approaches that conciliate on the one hand the qualities of the approximate approaches and on the other hand those of the approximation approaches. We propose, in a general context, where the preference relation used to compare solutions is not necessarily transitive, a Generalized Dynamic Programming (GDP) framework. GDP relies on an extension of the concept of dominance relations. It provides us, in particular, with exact and approximation methods that have been proved to be particularly efficient in practice to solve the 0-1 multi-objective knapsack problem. Finally, a last part of our work deals with the contributions of a multi-criteria modelling for solving, in real context, the data association problem. This led us to study the multi-objective assignment problem and, in particular, the resolution of this problem by the means of our GDP framework
Construction de critères en aide à la décision : aspects méthodologiques, techniques et pratiques by Amine Riad Azibi( Book )

3 editions published between 2003 and 2019 in French and held by 3 WorldCat member libraries worldwide

Cette thèse traite de la construction de critères en aide à la décision. La construction de critères constitue une étape clé du processus d'aide à la décision. Cette étape soulève certaines difficultés techniques liées notamment à la prise en compte d'aspects qualitatifs. Nous nous intéressons dans cette thèse plus particulièrement aux critères agrégeant des conséquences qualitatives, ce qui est notamment le cas de critères fondés sur des conséquences dispersées. Après avoir souligné le parallèle entre la problématique de l'agrégation d'attributs qualitatifs et celle de l'affectation, nous proposons une méthodologie d'aide à la construction d'un système cohérent d'affectation multi-attribut. Nos travaux sont axés sur l'utilisation de règles d'affectation de type " si ... alors ... " afin de respecter le caractère qualitatif des attributs. Notre approche repose sur une démarche itérative d'aide à la construction d'une base de règles. Cette démarche originale, de portée générale, vise à enrichir ou affiner progressivement la base de règles en vue d'aboutir à un modèle d'affectation cohérent. Les tests de cohérence sont fondés sur une correspondance entre la représentation logique des règles et une représentation algébrique équivalente. Cette correspondance permet d'exprimer les règles par des contraintes linéaires et de tester la cohérence du modèle d'affectation par règles en résolvant une série de programmes linéaires en variables 0--1
Détermination des éléments les plus vitaux pour des problèmes de graphes by Sonia Toubaline( Book )

3 editions published between 2010 and 2019 in French and held by 3 WorldCat member libraries worldwide

In this PhD thesis, we consider the k most vital edges (nodes) and min edge (node) blocker versions of different problems of graphs. Given an optimization problem P defined on a weighted graph, the k Most Vital Edges (Nodes) P problem consists of finding a subset of k edges (nodes) whose removal from the graph causes the largest degradation of the optimal value for P. The complementary problem, Min Edge (Node) Blocker P, consists of removing a subset of edges (nodes) of minimum cardinality such that the optimal value for P is, according to the nature of P, less than or equal or greater than or equal to a specified threshold. We study the complexity, approximation and efficient resolution of these four versions for the following problems of graphs: minimum spanning tree, assignment, maximum weighted independent set, minimum weighted vertex cover, 1-median, 1-center and minimum cost flow. Thus, we propose proofs of strong NP-hardness or polynomiality for particular classes of graphs, results of approximation, algorithms of explicit or implicit enumeration to solve these problems and a formulation by a linear programming
Approche multicritère des problèmes de recherche documentaire by Mohamed Farah( Book )

3 editions published between 2006 and 2019 in French and held by 3 WorldCat member libraries worldwide

Research in Information Retrieval shows performance improvement when many sources of evidence are combined to produce a ranking of documents. When documents are evaluated according to some attributes or criteria, most current approaches assess document relevance by computing a single score which aggregates performance values w.r.t. these attributes. When only ranked lists of relevant documents are provided by multiple 'blackbox' methods, most current approaches combine these lists into one single output result set. In both cases, we propose ranking methods within a multiple criteria framework using aggregation mechanisms based on decision rules identifying positive and negative reasons for judging whether a document should get a better ranking than another. The proposed methods deal well with the Information Retrieval distinctive features. Experimental results are reported in both contexts
Approches multicritères pour le traitement des débris spatiaux by Dalal Madakat( Book )

2 editions published in 2014 in French and held by 2 WorldCat member libraries worldwide

Space debris are a threat for the space exploitation and exploration. Their number will continue to increase even if we stop all space activities, making collisions between debris and operational satellites more likely to happen. Debris removal proves necessary to protect active satellites. Since the number of space debris is very high, we should first deal with the most dangerous ones.In the first part of this thesis, we have developed a multicriteria approach to categorize debris depending on their removal priority degree. Debris belonging to the most urgent category will be dealt with during a space mission. The planning of such a space mission is studied in the second part of this thesis.The planning should be designed while optimizing two criteria: mission cost and mission duration
Energy crop supply in France: a min-max regret approach by A. O Kazakçi( )

1 edition published in 2007 in English and held by 2 WorldCat member libraries worldwide

Covers and approximations in multiobjective optimization by Daniel Vanderpooten( )

1 edition published in 2016 in English and held by 2 WorldCat member libraries worldwide

Résolution de problèmes d'optimisation combinatoire mono et multi-objectifs par énumération ordonnée by Lyes Belhoul( Book )

2 editions published in 2014 in French and held by 2 WorldCat member libraries worldwide

Our aim in this thesis is to propose efficient algorithms for solving difficult combinatorial optimization problems. Our algorithms are based on a generic method of ordered enumeration. Initially, we describe the principle of ordered enumeration which consists in generating in a specific order solutions of a relaxed problem associated to the difficult main problem, until meeting a proof of the optimality of a feasible solution. We construct a generic procedure in the general context of combinatorial optimization problems. In a second step we discuss applications of our algorithm on some difficult problems which admit the assignment problem as relaxation. The first special case we study is the search for a compromise solution to the multiobjective assignment problem. The second application is the asymmetric travelling salesman problem, which contains sub-tour constraints in addition to the constraints of the assignment problem
Approches de résolution exacte et approchée en optimisation combinatoire multi-objectif, application au problème de l'arbre couvrant de poids minimal by Renaud Lacour( Book )

2 editions published in 2014 in English and held by 2 WorldCat member libraries worldwide

This thesis deals with several aspects related to solving multi-objective problems, without restriction to the bi-objective case. We consider exact solving, which generates the nondominated set, and approximate solving, which computes an approximation of the nondominated set with a priori guarantee on the quality.We first consider the determination of an explicit representation of the search region. The search region, defined with respect to a set of known feasible points, excludes from the objective space the part which is dominated by these points. Future efforts to find all nondominated points should therefore be concentrated on the search region.Then we review branch and bound and ranking algorithms and we propose a new hybrid approach for the determination of the nondominated set. We show how the proposed method can be adapted to generate an approximation of the nondominated set. This approach is instantiated on the minimum spanning tree problem. We review several properties of this problem which enable us to specialize some procedures of the proposed approach and integrate specific preprocessing rules. This approach is finally supported through experimental results
Sur les aspects théoriques et pratiques des compromis dans les problèmes d'allocation des ressources by Abhinav Srivastav( )

1 edition published in 2017 in French and held by 2 WorldCat member libraries worldwide

The content of this thesis is divided into two parts. The first part of the thesis deals with the study of heuristic based approaches for the approximation Pareto fronts. We propose a new Double Archive Pareto local search algorithm for solving multi-objective combinatorial optimization problems. We embed our technique into a genetic framework where our algorithm restarts with the set of new solutions formed by recombination and mutation of solutions found in the previous run. This method improves upon the existing Pareto local search algorithm for bi-objective and tri-objective quadratic assignment problem.In the second part of the thesis, we focus on non-preemptive scheduling algorithms. Here, we study the online problem of minimizing maximum stretch on a single machine. We present both positive and negative theoretical results. Then, we provide an optimally competitive semi-online algorithm. Furthermore, we study the problem of minimizing stretch on a single machine in a recently proposed rejection model. We show that there exists an O(1)-approximation ratio for minimizing average stretch. We also show that there exists an O(1)-approximation ratio for minimizing average flow time on a single machine. Lastly, we study the weighted average flow time minimization problem in online settings. We present a mathematical programming based framework that unifies multiple resource augmentation. Using the concept of duality, we show that there exists an O(1)-competitive algorithm for solving the weighted average flow time problem on unrelated machines. Furthermore, we proposed that this idea can be extended to minimizing l_k norms of weighted flow problem on unrelated machines
A bi-criteria approach for the data association problem by Hadrien Hugot( )

1 edition published in 2006 in English and held by 2 WorldCat member libraries worldwide

Une nouvelle approche de robustesse : application à quelques problèmes d'optimisation by Rim Kalai-Jemai( )

2 editions published between 2006 and 2019 in French and held by 2 WorldCat member libraries worldwide

The main objective of this thesis is to develop a new robustness approach when uncertainty is modelled by a discrete set of scenarios. A common approach to find robust solutions in such a case is to find the ones which minimize the maximal cost or regret. Nevertheless, these criteria are known to be too conservative. Lexicographic a-robustness, presented in this thesis, compensates for this major drawback. In addition, it takes into account the subjective aspect of robustness by introducing two parameters allowing the decision maker to express his/her point of view. On the other hand, we were interested in applying this approach to some classical operations research problems, that is to say the 1-median and the 1-center location problems, as well as the knapsack and the shortest path problems. We showed, among others, that lexicographic a-robustness does not add much more complexity to the min-max (regret) versions of these problems
Régulation adaptative multi-objectif et multi-mode aux carrefours à feux by Yann Dujardin( Book )

2 editions published in 2013 in French and held by 2 WorldCat member libraries worldwide

In order to answer the multi-objective and multi-mode adaptive traffic control problem, we propose three models of mixed integer linear programming, usable with two multi-objective optimization interactive methods, allowing to adapt a “traffic control policy” iteratively to the current traffic situation. The considered criteria, all of them to be minimized, are the total waiting time and the number of stops for private vehicles and a criterion dedicated to public transports allowing to set a target waiting time for every bus. Experiments showed that one of the three models, called hybrid model, distinguishes itself positively from the others. This model was implemented with one of the two interactive methods, allowing to control a traffic simulated over one hour in different scenarios, and was compared to a semi-adaptive traffic control system
A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size by M. A Aloulou( )

1 edition published in 2013 in English and held by 2 WorldCat member libraries worldwide

 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  General Special  
Audience level: 0.00 (from 0.00 for Aide à la ... to 0.00 for Aide à la ...)

Aiding decisions with multiple criteria : essays in honor of Bernard Roy
Covers
Alternative Names
Vanderpooten, D.

Languages
French (34)

English (9)