WorldCat Identities

Kedad Sidhoum, Safia (19..-....).

Overview
Works: 41 works in 41 publications in 2 languages and 55 library holdings
Roles: Other, Opponent, Thesis advisor, Author, Contributor, Editor
Classifications: QA76.9.A43, 005.1
Publication Timeline
.
Most widely held works by Safia Kedad Sidhoum
Exercices et problèmes d'algorithmique 155 énoncés avec solutions détaillées by Bruno Baynat( )

1 edition published in 2010 in French and held by 4 WorldCat member libraries worldwide

Ce livre propose des activités et des sujets d'examen. Il présente les rédactions complètes des démonstrations et des algorithmes exprimés selon un formalisme proche de celui des langages de programmation impératifs comme C++, Java ou Pascal.--[Memento]
Résolution de problèmes de partitionnement généralisé par des méthodes d'optimisation globale à base de déplacements stochastiques : application à l'ordonnancement à machines parallèles by Safia Kedad Sidhoum( Book )

1 edition published in 1997 in French and held by 3 WorldCat member libraries worldwide

L'affectation de ressources à des activités compte parmi les sujets les plus vastes de l'optimisation combinatoire, de nombreux problèmes relèvent de cette thématique selon l'abstraction faite des entités ressources et activités, des contraintes imposées et des objectifs visés. L'ordonnancement de taches à machines parallèles sans relation avec contraintes additionnelles relève de cette problématique générale. Nous nous intéressons au problème de minimisation des temps de lancement dépendants de la séquence sous contraintes de capacité, de préaffectations des taches aux machines et de fenêtres de temps. Ce problème est modélisé sous forme de problème de partitionnement généralisé. Cette classe de problèmes considérée générale, découle d'une taxonomie que nous avons établie pour les problèmes d'optimisation combinatoire selon la caractéristique de répétitivité d'exécution de l'activité selon le formalisme des hypergraphes. Le problème défini est un problème NP-dur. L'existence d'une solution est liée au nombre de stabilité d'un graphe défini par des variables d'état et des relations d'exclusion binaires. Pour la résolution du problème d'optimisation, nous avons développé une heuristique parallèle en deux phases de construction et d'amélioration itérative. A l'issue de cette expérimentation et dans le souci d'élargir l'exploration du domaine de solutions, nous avons développé des méthodes d'optimisation globale à base de déplacements stochastiques à savoir une méthode de recherche tabou, une méthode de recuit simule, une méthode évolutionniste et des algorithmes génétiques à codages gray et binaire. Nous avons intégré ces modules dans un environnement d'études et d'expérimentation <<<>LOOPS<>>>. La résolution d'un ensemble de problèmes tests nous conduit à définir des tendances d'évolution qualitative permettant la mise en œuvre d'algorithmes hybrides. Une extension importante apportée au modèle est la prise en compte d'éléments stochastiques tels les pannes et les arrêts sur les machines
Programmation par contraintes pour le dimensionnement de lots de production by Grigori German( )

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

In this thesis we investigate the potential use of constraint programming to develop a production planning solver. We focus on lot-sizing problems that are crucial and challenging problems of the tactical level of production planning and use one of the main strengths of constraint programming, namely global constraints. The goal of this work is to set the grounds of a constraint programming framework for solving complex lot-sizing problems. We define a LotSizing global constraint based on a generic single-item, single-level lot-sizing problem that considers production and inventory capacities, unitary production and inventory costs and setup costs. This global constraint is an intuitive modeling tool for complex lot-sizing problems as it can model the nodes of lot-sizing networks. We use classical dynamic programming techniques of the lot-sizing field to develop powerful filtering algorithms for the global constraint. Furthermore we model multi-item problems that are natural extensions of the core problem.Finally we introduce a new generic filtering algorithm based on linear programming. We show that arc consistency can be achieved with only one call to a linear programming solver when the global constraint has an ideal formulation and adapt the result to provide partial filtering when no restriction is made on the constraints. This technique can be useful to tackle polynomial lot-sizing underlying flow and sequence sub-problems
ROADEF/EURO Challenge 2012 on the Machine Reassignment Problem by ROADEF/EURO Challenge on the Machine Reassignment Problem( Book )

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

Machine reassignment problem: the ROADEF/EURO challenge 2012 by Murat Afsar Hasan( )

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

Trains do not vanish: the ROADEF/EURO challenge 2014 by Christian Artigues( )

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

Contributions théoriques et pratiques à l'ordonnancement d'observations d'objets célestes by Florian Fontan( )

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

Il existe peu de grands téléscopes et le temps d'observation est une ressource précieuse sujette à une forte pression de la part d'une communauté concurrentielle. En outre, un nombre croissant de projets astronomiques nécessitent l'observation d'un grand nombre d'objets célestes pendant des runs discontinus répartis sur plusieurs mois ou années. Cette thèse est le fruit d'une collaboration entre des chercheurs en recherche opérationnelle du laboration G-SCOP et des astrophysiciens de l'unité de recherche IPAG. Son but était d'optimiser l'ordonnancement d'observations d'étoiles sur les téléscopes, en particulier, sur le Très Grand Télescope. Le premier chapitre contient une étude théorique de la complexité de plusieurs variantes de problèmes d'ordonnancement de maximization de profits dépendants du temps d'exécution. Ces problèmes apparaissent entre autres comme sous-problèmes du problème réel d'ordonnancement d'observations d'étoiles étudié dans le deuxième chapitre, pour lequel nous avons développé une recherche locale à voisinage large rapide et efficace. Le troisième chapitre ne concerne pas le problème d'ordonnancement d'observations d'étoiles. Il décrit l'algorithme de recherche arborescente que nous avons développé pour le problème de découpe de verre posé par l'entreprise Saint-Gobain pour le challenge ROADEF/EURO 2018
Arbitrer coût et flexibilité dans la Supply Chain by Etienne Gaillard de Saint Germain( )

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

This thesis develops optimization methods for Supply Chain Management and is focused on the flexibility defined as the ability to deliver a service or a product to a costumer in an uncertain environment. The research was conducted throughout a partnership between Argon Consulting, which is an independent consulting firm in Supply Chain Operations and the École des Ponts ParisTech. In this thesis, we explore three topics that are encountered by Argon Consulting and its clients and that correspond to three different levels of decision (long-term, mid-term and short-term).When companies expand their product portfolio, they must decide in which plants to produce each item. This is a long-term decision since once it is decided, it cannot be easily changed. More than a assignment problem where one item is produced by a single plant, this problem consists in deciding if some items should be produced on several plants and by which plants. This is motivated by a highly uncertain demand. So, in order to satisfy the demand, the assignment must be able to balance the workload between plants. We call this problem the multi-sourcing of production. Since it is not a repeated problem, it is essential to take into account the risk when making the multi-sourcing decision. We propose a generic model that includes the technical constraints of the assignment and a risk-averse constraint based on risk measures from financial theory. We develop an algorithm and a heuristic based on standard tools from Operations Research and Stochastic Optimization to solve the multi-sourcing problem and we test their efficiency on real datasets.Before planning the production, some macroscopic indicators must be decided at mid-term level such as the quantity of raw materials to order or the size of produced lots. Continuous-time inventory models are used by some companies but these models often rely on a trade-off between holding costs and setups costs. These latters are fixed costs paid when production is launched and are hard to estimate in practice. On the other hand, at mid-term level, flexibility of the means of production is already fixed and companies easily estimate the maximal number of setups. Motivated by this observation, we propose extensions of some classical continuous-time inventory models with no setup costs and with a bound on the number of setups. We used standard tools from Continuous Optimization to compute the optimal macroscopic indicators.Finally, planning the production is a short-term decision consisting in deciding which items must be produced by the assembly line during the current period. This problem belongs to the well-studied class of Lot-Sizing Problems. As for mid-term decisions, these problems often rely on a trade-off between holding and setup costs. Basing our model on industrial considerations, we keep the same point of view (no setup cost and a bound on the number of setups) and propose a new model. Although these are short-term decisions, production decisions must take future demand into account, which remains uncertain. We solve our production planning problem using standard tools from Operations Research and Stochastic Optimization, test the efficiency on real datasets, and compare it to heuristics used by Argon Consulting's clients
Optimisation d'ensembles de capteurs pour le suivi et la recherche de cibles by Florian Delavernhe( )

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

In this thesis, we address two target tracking problems and a search problem, using sensors. The first contribution is an extension of a previous work on target tracking, where the target trajectories are estimated under temporal uncertainty. A robust schedule for cases with more than one target, data transfer to a base station and energetic considerations is computed. A dynamic method is introduced as a second contribution to detect deviations and take online actions when the robust schedule is no longer feasible. It offers dynamic performance guarantees measured by a dynamic stability radius. The third contribution is related to the search problem, where an extension of the planning of the search effort is proposed,but where traveling costs are taken into account. The proposed approach builds a solution step-by-step using a linear approximation of the objective function. The contributions to the three problems addressed in this thesis are tested on numerous instances
Single-machine common due date total earliness/tardiness scheduling with machine unavailability by Kerem Bülbül( )

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

Ordonnancement de ressources de transports : flow-shops robotisés circulaires et un problème pratique de gestion ferroviaire by Florence Thiard( )

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

La première partie de ce travail concerne la production cyclique pour l'optimisation du taux de production dans les flowshops robotisés, où un robot est chargé du transport des pièces. Les cellules robotisées peuvent être disposées de façon linéaire ou circulaire. Les principaux résultats théoriques concernant la disposition linéaire ne peuvent être étendus à la configuration circulaire. En particulier, trouver le meilleur cycle de production de une pièce (1-cycle) est un problème polynomial dans le cas des cellules linéaires additives, mais NP-difficile pour la configuration correspondante circulaire.Nous nous concentrons principalement sur le cas des cellules circulaires équilibrées, où le temps d'usinage est identique sur toutes les machines. Après avoir présentés des outils pour l'analyse cyclique dans les cellules circulaires, nous établissons des propriétés nécessaires des 1-cycles performants, ce qui permet de conclure sur le problème du meilleur 1-cycle jusqu'à 8 machines. Toutefois, nous fournissons un contre-exemple pour 6 machines à la conjecture classique des 1-cycles, toujours ouverte dans cette configuration.Ensuite, nous étudions la structure des 1-cycles performants pour des cellules circulaires équilibrées arbitrairement grandes. Nous définissons et étudions les propriétés d'une nouvelle famille de cycles basée sur cette structure et formulons une conjecture sur sa dominance sur les 1-cycles qui conduirait à un algorithme polynomial pour le problème du meilleur 1-cycle dans ce cas. Cette structure permet de déterminer le meilleur 1-cycle jusqu'à 11 machines.Dans la deuxième partie, nous présentons le travail réalisé sur un problème industriel proposé par la SNCF dans le cadre du challenge ROADEF/EURO. Nous proposons un algorithme glouton pour ce problème combinant divers aspects de la gestion des trains au sein d'une gare
Coordination des décisions de planification dans une chaîne logistique by Siao-Leu Phouratsamay( )

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

This thesis focus on the coordination of planning decisions in a two-level supply chain composed of one supplier and one retailer. Each actor wants to minimize his own cost. The planning decisions independently took by the actors can lead to a poor performance in terms of costs, hence the necessity of coordination. We study cost sharing mechanisms between the actors by designing contracts. In this work, we consider the case where the retailer (resp. supplier) can impose his optimal production plan to the supplier (resp. retailer). Different cost sharing hypothesis, as well as the asymmetric information problem are taking into account in this thesis. We also perform an experimental analysis in order to evaluate the decrease of the supply chain cost obtained when the actors cooperate. This context leads us to study new lot-sizing problems for which we propose a complexity analysis and dynamic programming algorithms in order to solve them. We also propose a theoritical study of two-level lot-sizing problems with inventory bounds
Solving repeated optimization problems by Machine Learning by Marc Etheve( )

1 edition published in 2021 in English and held by 1 WorldCat member library worldwide

This thesis aims at using machine learning techniques in the context of Mixed Integer LinearProgramming instances generated by stochastic data. Rather than solve these instances independentlyusing the Branch and Bound algorithm (B&B), we propose to leverage the similarities between instancesby learning inner strategies of this algorithm, such as node selection and branching.The main approach developed in this work is to use reinforcement learning to discover by trials-and-errorsstrategies which minimize the B&B tree size. To properly adapt to the B&B environment, we definea new kind of tree-based transitions, and elaborate on different cost models in the correspondingMarkov Decision Processes. We prove the optimality of the unitary cost model under both classical andtree-based transitions, either for branching or node selection. However, we experimentally show that itmay be beneficial to bias the cost so as to improve the learning stability. Regarding node selection, weformally exhibit an optimal strategy which can be more efficiently learnt directly by supervised learning.In addition, we propose to exploit the structure of the studied problems. To this end, we propose adecomposition-coordination methodology, a branching heuristic based on a graph representation of aB&B node and finally an approach for learning to disrupt the objective function
Modélisation et optimisation bi-objectif et multi-période avec anticipation d'une place de marché de prospects Internet : adéquation offre/demande by Manel Maamar( )

1 edition published in 2015 in French and held by 1 WorldCat member library worldwide

The work that we present in this thesis focuses on the assignment problem in a marketplace of Internet prospects. More precisely, this work aims to address the problem of matching offers and demands in a context characterized by a continuous flows. These latter evolve inreal time the set of available offers and demands to satisfy. To do this, we propose initially a mono-period model which optimizes the assignment problem at a given instant and taking into account asingle period of time while allowing the instantaneous consideration of new offers and demands and their adequacy in real time. This model considers two objectives to optimize, namely: maximization of turnover as well as clients satisfaction.Thereafter, we propose to extend this model over several future time periods in order to take into account the real time aspect of the marketplace activity and so the fact that a continuous flows evolve in real time the set of offers en demands. The objective is to take advantage of knowledge about this evolution, through the integration of a forecasting model in a multi-period optimization model. Thus,we propose a multi-period optimization model for considering at agiven instant assignments over several future time periods. Also, we propose a forecasting model for new flows while considering the characteristics of the multi-period optimization model.Building a forecasting model requires defining the data before considering any forecasting method. In other words, we have to choose the parameters of the forecasting model, namely the appropriate historical data, the forecasting time step and the forecasting horizon. The challenge is to define the parameters of the forecasting model which agree with the functioning the multi-period optimization model.Furthermore, a feature of the marketplace is the temporality of its system. Thus, we propose an algorithm ensuring real-time aspect and so the fact that assignments are made every minute. The proposed algorithm works continuously all day long while optimizing every instant the offer/demand adequacy of Internet prospects and instantly considering the continuous flux of Internet prospects as well as the regular updating demand. Finally, in order to show the efficiency and the benefits that the marketplace can reap by the use of the proposed models, we conducted tests and various experiments on real data. These tests have allowed us to validate the proposed models and evaluate the quality of the results.The aim is twofold, giving a strong and formal framework to address the issue of the marketplace of Internet prospects but also proposing a generic framework to solve any problem similar to that of the marketplace of Internet prospects
Optimisation et aide à la décision pour la planification de production opérationnelle en fabrication de semi-conducteurs by Quentin Christ( )

1 edition published in 2020 in French and held by 1 WorldCat member library worldwide

In today's connected societies, computers, sensors, data centers, automotive electronics and portable devices have become ubiquitous. At the heart of these products are semiconductors, whose current production systems are among the most complex in the world. In this thesis, we address the problem of operational production planning, whose objective is to link tactical production planning, which defines the delivery and launch plans for products in the plant, to detailed production scheduling. Due to the complexity of production systems in semiconductor manufacturing, this essential frontier problem remains under-researched. After having formalized the studied problem and shown that it is NP-Difficile, an experimental study is carried out in order to show the impossibility of solving the problem in an exact way for industrial instances, justifying the use of approached methods. We present a three-step heuristic initially in place in the production system and highlight some of its limitations. We introduce new methods aimed at improving the quality of the solutions provided by the decision support tool according to the users' needs. As this thesis was carried out in a company, the objective was both to make progress on the scientific aspects, but also to think about the integration of these methods in the industrial system
Approches par décomposition pour des problèmes réels de planification et de tournées de véhicules by Bilal Messaoudi( )

1 edition published in 2020 in French and held by 1 WorldCat member library worldwide

Différents acteurs du monde de l'industrie rencontrent quotidiennement des problèmes d'optimisation impliquant des décisions à prendre soit à un niveau tactique, comme pour déterminer le meilleur emplacement d'entrepôts à installer pour couvrir une zone géographique donnée, ou bien à un niveau opérationnel, comme pour améliorer le rendement d'un processus de production. L'objectif de cette thèse Cifre est de proposer des approches de résolution en se focalisant sur des problèmes de planification et de tournées de véhicules issus de clients industriels. Dans un premier temps, nous mettrons en lumière les principales difficultés que l'on peut rencontrer dans le processus d'aide à la décision avec le client industriel, pour ensuite aborder trois cas concrets de problématiques complexes que nous avons traités durant cette thèse. Nous utilisons essentiellement des approches par décomposition pour résoudre ces problèmes au vu de leur complexité et à la taille des instances industrielles traitées. Pour valider l'efficacité de certaines méthodes de résolution, nous les comparons aux meilleures bornes obtenues en relaxant certaines contraintes et aux solutions optimales de problèmes similaires existants dans la littérature lorsque cela s'avère possible
Le problème de flot insécable : application à la gestion des communications d'une constellation de satellites by François Lamothe( )

1 edition published in 2021 in French and held by 1 WorldCat member library worldwide

The problem of the transmission of indivisible resources through a network is a generic problem present in many applications. Indeed, this type of problem is found in industries such as freight transport or telecommunications (optical networks, satellite communications, etc.). The improvement of the methods of resolution for this problem therefore represents an important stake, in particular in the industrial application which motivates this thesis: the constellation of Telesat telecommunications satellites. Indeed, this industry tends to build constellations containing more and more satellites in order to increase the internet speed that the system is able to transmit. Along with the increase in the number of satellites, there is also an increase in the number of users of these constellations. This is explained both by the increase in the wealth of the population, the rise of new applications such as internet access in planes or boats, but also quite simply by the increase in capacity and quality of satellite telecommunications services. The combination of these factors tends to create resource transmission problems that are increasingly difficult to solve, which requires more efficient resolution algorithms.In this thesis, we are interested in the problem of transmission of the indivisible resource that is the speed of users in a constellation. This problem corresponds to a problem classically studied in the literature of flow problems, under the name of unsplittable flow problem. Although its theoretical properties are well known and many resolution approaches exist, the proposed resolution methods lack efficiency when the size of the problem is large. We try to fill this gap by proposing algorithms with good performance on large instances of this problem. On the other hand, the introduction of the dynamics of the constellation in the problem leads us to be interested in the problem of unsplittable dynamic flow. This problem is little studied in the literature, this is why we extend the set of resolution methods tested on this problem by proposing different approaches and by comparing them experimentally on sets of instances that we propose. Finally, we study decomposition methods allowing to reinforce the linear relaxation of the unsplittable flow problem. Indeed, this linear relaxation is at the base of most of the resolution method proposed in the literature. The computation of a powerful relaxation is therefore a stake in the resolution of the unsplittable flow problem. After having presented and reimplemented two methods from the literature, we propose a new decomposition method inspired by the two previous methods. An empirical study shows that the new method proposed has an important competitive advantage over large instances of the unsplittable flow problem
Optimal Energy Storage System Management in Telecommunications Networks under Energy Market Incentives by Isaias Faria silva( )

1 edition published in 2021 in English and held by 1 WorldCat member library worldwide

L'utilisation de batteries de secours en cas de coupure de courant est fréquente dans les réseaux de télécommunications, car ils fournissent des services critiques et doivent rester en ligne en permanence. Ces batteries sont utilisées en conjonction avec des antennes et d'autres équipements, et des règles strictes de sécurité d'utilisation doivent être prises en compte afin de garantir qu'elles soient toujours disponibles en cas de coupure de courant. En outre, l'opérateur de télécommunications pourrait utiliser ces batteries afin de participer au marché de l'électricité à condition que le réseau soit suffisamment fiable et que les règles de sécurité d'utilisation soient respectées. En effet, puisque le prix de l'énergie varie dans le temps, les batteries peuvent être utilisées pour éviter d'acheter de l'énergie lorsque ce prix est élevé, et être rechargées lorsque le prix de l'énergie est plus bas, un comportement appelé stratégie d'écrêtement des pointes (peak-shaving en anglais). Une deuxième façon rentable pour une entreprise d'utiliser ses batteries est d'effectuer des effacements de charge. En effet, lorsque la demande d'électricité d'un pays est supérieure à la production, le gestionnaire du réseau de transport doit prendre des mesures afin de stabiliser le réseau, par exemple en demandant aux centrales électriques de produire davantage d'énergie. Un autre moyen est de demander aux consommateurs intensifs en énergie de réduire leur consommation pendant une période donnée (on dit alors qu'ils effectuent un effacement de charge), en leur offrant une récompense en échange. Dans cette thèse, nous considérons le problème de l'optimisation des coûts totaux de l'énergie en utilisant des batteries installées pour la sauvegarde afin de participer au marché de l'énergie en effectuant des écrêtements de pointe et des effacements de charge, avec l'aide d'une gestion appropriée des batteries. Notre objectif est de réduire les dépenses totales d'exploitation de l'énergie pour l'entreprise, et de maximiser les récompenses reçues en effectuant des effacements de charge. Une étude de l'architecture du marché de l'électricité en France est d'abord menée pour comprendre les mécanismes de flexibilité de la demande et comment les contraintes opérationnelles dans l'utilisation des batteries d'un opérateur de télécommunications interagissent avec le marché de l'énergie. Nous avons identifié différents défis qui ont été explorés individuellement pour mieux comprendre les caractéristiques du problème d'optimisation sous-jacent et ainsi développer des méthodes de résolution plus efficaces. Pour chacun d'entre eux, des programmes linéaires en nombres entiers mixtes et des heuristiques sont ensuite proposés pour résoudre le problème correspondant. Après avoir exploré et compris les défis individuels, nous avons proposé des programmes linéaires en nombres entiers mixtes et des heuristiques pour le problème principal de cette thèse, que nous prouvons être NP-Dur, en incorporant les prix de l'énergie du marché et la disponibilité des batteries. Enfin, des simulations basées sur des données réalistes provenant de l'opérateur de télécommunications français Orange montrent la pertinence des modèles et de l'heuristique proposés : ceux-ci se montrent efficaces en termes de calcul pour résoudre des instances à grande échelle, et des économies et des revenus significatifs peuvent être générés grâce aux politiques optimisées de gestion du stockage d'énergie à plusieurs batteries
Problèmes de production avec transport des composants by Carlos Heitor Pereira Liberalino( )

1 edition published in 2012 in French and held by 1 WorldCat member library worldwide

In this work we consider some problems of scheduling both a production distributed on several sites and the transportation of items between those sites. By doing so, the objective is to synchronize the two components and to build a better overall solution. The production system on each site is modeled as a Capacitated Lot-Sizing Problem where stock both on resources and produced items is available. The inter-site items transportation is a simplified version of the Vehicle Routing Problem where time is discretized. We first propose a mixed integer linear programming formulation that we call “The Lot-Sizing and Vehicle Routing Problem” (LSVRP). Then we present two particular cases : The Single-item LSVRP (S-LSVRP) and The Single-level LSVRP (1-LSVRP). All those cases are treated here by the six heuristics we develloped. Four of those methods are MIP based heuristics and take in account the the linear relaxation of some variables of the problem. They rely on partial decision tree exploration along with variable fixing. The other two are specifics for the two particular cases. The one who treats the S-LSVRP is based on production order propagation over the sites. Then, at each iteration, it computes a compatible transportation schedule and it tries to improve the solution by modifying the production on the sites. The other method consists in a lagrangian relaxation that works with an adaptation of the 1-LSVRP into a flow problem. Computational results and analysis are presented to evaluate the efficiency of those heuristics
Transférabilité d'une modélisation-simulation multi-agents : le comportement inter-gares des voyageurs de la SNCF lors des échanges quai-train by Fatma Elleuch( )

1 edition published in 2019 in French and held by 1 WorldCat member library worldwide

This thesis focuses on the definition and the validation of a crowd-simulation modeling method. This method allows transferring principles and measurements established in a source observation context to a target one. From the observation of pedestrian behavior in a social and urban context, our approach infers rules and motivations in order to model and simulate the individual pedestrian behavior in this source context. This allows, in a second step, to evaluate the transferability of the model to a given target context. Our work is based on a real case: the simulation of the passenger's behavior while boarding and alighting trains (platform-train exchange) in a high-traffic station (dense situation). Starting from the state of the art of theories, models and types of simulation, we choose an approach based on the microscopic simulation of social agent's motivation. This choice relies mainly on the fact that, compared to a classic crowd simulation, it has, a priori, a better transferability potential. The goal of this type of simulation is to study the architectural evolutions of the stations that could allow to control or shorten train dwell times
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  General Special  
Audience level: 0.00 (from 0.00 for Exercices ... to 0.00 for Exercices ...)

Associated Subjects
Languages
French (10)

English (10)