Made available in DSpace on 2014-07-29T15:08:18Z (GMT). No. of bitstreams: 1 Dissertacao Sistemas Hidrotermicos.pdf: 1921130 bytes, checksum: 988097a7877583ede959085e07eade65 (MD5) Previous issue date: 2012-06-21 / Particle Swarm Optimization has been widely used to solve real-world problems, including the operation planning of hydrothermal generation systems, where the main goal is to achieve rational strategies of operation. This can be accomplished by minimizing the high-cost thermoelectric generation, while maximizing the low-cost hydroelectric generation. The optimization process must consider a set of complex constrains. This work presents the application of some recently proposed Particle Swarm Optimizers for a group of hydroelectric power plants of the Brazilian interconnected system, using real data from existing plants. There were performed some tests by using the standard PSO, PSO-TVAC, Clan PSO, Clan PSO with migration, Center PSO, and one approach proposed in this work, called Center Clan PSO, over three different mid-term periods. All PSO approaches were compared to the results achieved by a Non-linear Programming algorithm (NLP). Furthermore, another approach was proposed, based on Center PSO, named Extended Center PSO. It was observed that the PSO approaches presented as promising solutions to the problem, even better than NLP in some cases. / A Otimização por Enxame de Partículas tem sido amplamente utilizada na solução de problemas do mundo real, inclusive para o problema do planejamento da operação de sistemas de geração hidrotérmicos, em que o principal objetivo é encontrar estratégias racionais de operação. A solução é obtida através da minimização da geração térmica, alto custo, enquanto maximiza-se a geração hidrelétrica, que é de baixo custo. O processo de otimização deve considerar um conjunto complexo de restrições. Este trabalho apresenta a aplicação de uma abordagem recente chamada de Otimização por Enxame de Partículas para o problema com um grupo de usinas hidrelétricas do sistema interligado brasileiro, utilizando dados reais das usinas existentes. Foram realizados testes usando o PSO original, PSO-TVAC, Clan PSO, Clan PSO com a migração, Center PSO, e uma abordagem proposta neste trabalho, denominada Center Clan PSO, ao longo de três diferentes períodos de médio prazo. Todas as abordagens PSO foram comparadas com os resultados obtidos por um algoritmo de programação não linear (NLP). Além disso, uma outra abordagem foi proposta, com base no algoritmo Center PSO, chamada Extended Center PSO. Observou-se que as abordagens PSO apresentaram resultados promissores na solução do problema, com resultados até mesmo melhores, em alguns casos, que os obtidos pelo NLP.

FundaÃÃo Cearense de Apoio ao Desenvolvimento Cientifico e TecnolÃgico / Universidade Federal do Cearà / O atendimento da demanda de transporte de carga està relacionado ao processo de alocaÃÃo do vagÃo, que por sua vez, està associado à maneira pela qual a decisÃo à tomada. A distribuiÃÃo dos vagÃes aos terminais de carregamento depende do planejamento e da movimentaÃÃo dos vagÃes vazios, sendo a viagem deste, a parcela de maior impacto financeiro sobre o sistema ferroviÃrio. Desta forma, um mecanismo eficiente de distribuiÃÃo de vagÃo à vital para as estradas de ferro, pois proporciona importantes ganhos operacionais e de custos. Assim, o propÃsito deste trabalho à analisar o problema relacionado à distribuiÃÃo dos vagÃes de carga e desenvolver modelos em ProgramaÃÃo Linear Inteira, que ofereÃam ao analista a oportunidade de conhecer em detalhes, (em um nÃvel tÃtico e operacional), as dificuldades enfrentadas pela ferrovia, bem como avaliar a proposiÃÃo de metas dos tempos de retenÃÃo em pÃtios, tempos de deslocamento, nÃmero de vagÃes retidos para manutenÃÃo, necessidade do aumento da frota e, atà mesmo, a rentabilidade das demandas ou a viabilidade de execuÃÃo do programa de transporte diante das premissas operacionais em vigor / Load transportation attendance for demand is related to the process of wagon allocation that in its turn, is associated with the way by which the decision is taken. The distribution of the wagons to the shipment terminals depends on the planning and movement of the empty wagons, being the trip of the empty wagon the parcel with bigger financial impact on the railroad system. In such a way, an efficient mechanism for wagon distribution is vital for the railroads, therefore providing important operational gains and cost savings. Thus, the purpose of this study is to analyze the problem related to the distribution of freight wagons and develop models in integer linear programming that will offer the analyst the opportunity to know in detail (in a tactical and operational level) the difficulties faced by the railroad, and to evaluate the setting of goals for retention times in rail yards, transit time, number of cars retained for maintenance, need to increase the fleet and even the profitability of the request or the feasibility for the implementation of the transport towards the operational assumptions in place

Realizar a análise econômica de uma produção agropecuária não é algo trivial, seja pela enorme heterogeneidade entre cada unidade produtiva, seja porque utiliza muitos recursos naturais, alguns de difícil mensuração. Há diversos métodos disponíveis para o cálculo do custo de produção, que é o indicador chave para a análise da viabilidade de um empreendimento. O desafio é permitir que a projeção da atividade no horizonte produtivo seja a mais real e dinâmica possível. A simulação computacional é atualmente uma das mais poderosas ferramentas de análise disponível para o planejamento, projeto e controle de sistemas complexos, e vem sendo cada vez mais utilizada e difundida. Simular compreende a elaboração de um método de experimentação que, através da construção de modelos de um sistema real, procura descrever comportamentos, construir teorias ou hipóteses por meio do observado e predizer comportamentos futuros. O uso de modelos de simulação, que incorporem o risco e a probabilidade dentro produção animal, pode ser uma alternativa tanto técnica - auxiliando na tomada de decisão, gestão e planejamento pecuário, quanto científica - permitindo a avaliação de efeitos de resultados da pesquisa e identificação de limitantes que podem incentivar o desenvolvimento de pesquisas futuras. O modelo de simulação híbrido - baseado em simulação de eventos discretos e baseado em agentes, aqui proposto - visou identificar coeficientes zootécnicos e os critérios de manejo que mais impactam a produção de ovinos de corte. Esse modelo de simulação computacional híbrido possui caráter dinâmico e probabilístico, com eventos marcados no tempo (estação de monta, gestação, parição, desmame, engorda, abate, entre outras) e complexos o suficiente para que seus agentes sofram alterações tanto no tempo quanto em resposta a ocorrência ou não das variáveis ligadas a eles. Os resultados dos experimentos e dos cenários estudados revelaram que dentre os índices zootécnicos das matrizes, a ocorrência de aborto gera maior impacto na taxa de abate e financeiramente na margem líquida operacional. Contudo, analisando as variáveis tanto para matrizes como para cordeiros, a mortalidade neonatal, até os cinco dias de vida dos cordeiros, demonstrou ser o ponto fundamental para a lucratividade da atividade. A estabilização do rebanho foi mais afetada pela presença de matrizes adultas no plantel, que culminaram no aumento no número de cordeiros por matriz. Os resultados da análise dos fluxos de caixa de 30 anos, a uma taxa mínima de atratividade de 6,17% aa, permitiram constatar que iniciar a atividade com número muito reduzido de matrizes é o cenário menos interessantes, com taxa interna de retorno negativa para o período de análise. O estudo do fluxo de caixa permitiu atribuir a 200 matrizes como o tamanho de rebanho inicial mais interessante (TIR = 3,30% aa). Assim, o uso de simuladores híbridos baseados em simulação de eventos discretos e baseados em agentes, para estudos na pecuária nacional, apresentou-se como ferramenta com grande potencial de contribuição, no sentido de permitir conhecer os resultados possíveis das diferentes combinações tecnológicas disponíveis. O modelo ainda permite ser utilizado como ferramenta de estudo e análise para a cadeia produtiva, contribuindo na orientação aos cientistas, auxiliando no direcionamento de seus esforços no desenvolvimento de futuras pesquisas / Conduct an economic analysis of agricultural production is not trivial, either by its enormous heterogeneity between each production unit, or because it uses many natural resources, some of which are difficult to measure. There are several methods available for calculating the cost of production, which is the key indicator for assessing the feasibility of a project. The challenge is to allow the projection of activity in the productive horizon in the most real and dynamic form as possible. The computer simulation is currently one of the most powerful analysis tools available for planning, design and control of complex systems and is being increasingly used and disseminated. Simulate includes the development of a method of testing by building models of a real system, that seeks to describe behaviors, build theories or hypotheses through noted and predicted future behaviors. The use of simulation models that incorporate uncertainty and probability in animal production can be both an alternative technique - assisting in decision-making, management and livestock planning; as scientific - allowing the evaluation of the research results of effects and identification of limiting that may encourage the development of future research. The model of hybrid simulation - based on discrete event simulation and on agent-based, proposed here - aimed to identify factors husbandry and management criteria that most affect the production of meat sheep. The model of hybrid computer simulation have dynamic and probabilistic characteristics, with events scheduled in time (breeding season, pregnancy, parturition, weaning, fattening, slaughter, etc.) and enough complexity that its agents be adversely affected both in time and in response to the occurrence or not of variables linked to them. The results of the experiments and the scenarios studied showed that among the zootechnical indexes of the sheep, the occurrence of abortion generates a greater impact on the slaughter rate and financially in the net operating margin. However, analyzing the variables for both sheep and lambs, neonatal mortality, up to the lambs\' five days of life, proved to be the fundamental point for the profitability of the activity. The stabilization of the herd was more affected by the presence of adult sheep in the herd, which culminated increasing the number of lambs per sheep. The results of the analysis of the 30-year cash flows, at a minimum attractiveness rate of 6.17% per year, showed that starting the activity with a very small number of sheep was the least interesting scenario, with a negative internal rate of return for the analysis period. The study of the cash flow allowed to assign to 200 sheep as the most interesting initial herd size (IRR = 3.30% per year). Thus, the use of hybrid simulators, based on discrete event simulation and agent-based for studies in national livestock, is presented as a tool with great potential to contribute, to allow knowing the possible outcomes of different combinations of available technology. The model also allows to be used as a study tool and assessment of different technological combinations for the production chain, contributing to the guidance of scientists, assisting their efforts in the development of future research

In this dissertation we focus on two main topics. Under the first topic, we develop a new framework for stochastic network interdiction problem to address ambiguity in the defender risk preferences. The second topic is dedicated to computational studies of two-stage stochastic integer programs. More specifically, we consider two cases. First, we develop some solution methods for two-stage stochastic integer programs with continuous recourse; second, we study some computational strategies for two-stage stochastic integer programs with integer recourse. We study a class of stochastic network interdiction problems where the defender has incomplete (ambiguous) preferences. Specifically, we focus on the shortest path network interdiction modeled as a Stackelberg game, where the defender (leader) makes an interdiction decision first, then the attacker (follower) selects a shortest path after the observation of random arc costs and interdiction effects in the network. We take a decision-analytic perspective in addressing probabilistic risk over network parameters, assuming that the defender's risk preferences over exogenously given probabilities can be summarized by the expected utility theory. Although the exact form of the utility function is ambiguous to the defender, we assume that a set of historical data on some pairwise comparisons made by the defender is available, which can be used to restrict the shape of the utility function. We use two different approaches to tackle this problem. The first approach conducts utility estimation and optimization separately, by first finding the best fit for a piecewise linear concave utility function according to the available data, and then optimizing the expected utility. The second approach integrates utility estimation and optimization, by modeling the utility ambiguity under a robust optimization framework following \cite{armbruster2015decision} and \cite{Hu}. We conduct extensive computational experiments to evaluate the performances of these approaches on the stochastic shortest path network interdiction problem. In third chapter, we propose partition-based decomposition algorithms for solving two-stage stochastic integer program with continuous recourse. The partition-based decomposition method enhance the classical decomposition methods (such as Benders decomposition) by utilizing the inexact cuts (coarse cuts) induced by a scenario partition. Coarse cut generation can be much less expensive than the standard Benders cuts, when the partition size is relatively small compared to the total number of scenarios. We conduct an extensive computational study to illustrate the advantage of the proposed partition-based decomposition algorithms compared with the state-of-the-art approaches. In chapter four, we concentrate on computational methods for two-stage stochastic integer program with integer recourse. We consider the partition-based relaxation framework integrated with a scenario decomposition algorithm in order to develop strategies which provide a better lower bound on the optimal objective value, within a tight time limit.

Dans les dernières décennies, l'augmentation de la consommation des services de soins et la croissance de la population ont fait de l'élimination du gaspillage et l'amélioration continue de la productivité de plus en plus cruciale pour les hôpitaux. La productivité et l'efficacité d'un hôpital dépendent des conditions de travail des soignants qui sont influencés fortement par l'organisation des lieux de travail et des installations [Dares (2013)]. L’agencement des installations consiste à "déterminer l'organisation physique d'un système de production et de trouver l’arrangement le plus efficace de ‘n’ installations dans ‘n’ positions" [Singh et Sharma (2006)]. L’agencement des installations a un grand impact sur la productivité et l'efficacité du fonctionnement d'un hôpital. Etant conscient de ce besoin, le travail que nous présentons vise à trouver une solution à l’agencement des salles du Bloc Opératoire "le coeur de l'hôpital", ainsi que les salles annexes en proposant un outil intelligent que nous mettons à la disposition des maitres d’ouvrages pour optimiser leur conception du bloc opératoire. Les méthodes que nous avons explorées pour la réalisation de ce travail sont les méthodes exactes, les heuristiques, les métaheuristiques et les méthodes intelligentes, ce qui nous a permis de comparer les différentes approches afin de fournir la meilleure solution pour différents scénarios de problèmes. Nous présentons les contributions majeures de notre travail, à commencer par l'application de la programmation mathématique en nombres entiers mixtes (Mixed Integer Programming (MIP)) pour résoudre le problème d’agencement du bloc opératoire (Operating Theater Layout Problem (OTLP)) comme la première contribution scientifique. Ce travail considère trois structures différentes (multi-section, multi-étage et multi-rangé) dans deux types d'environnement différents, tout en optimisant deux fonctions objectifs différents. La combinaison de ces différentes composantes donne lieu à neuf modèles MIP pour résoudre l’OTLP pour lesquels une solution optimale a été atteinte pour des problèmes avec jusqu'à quarante salles. L'utilisation de Systèmes Multi-Agents (MAS) pour résoudre le problème d’agencement des installations est la deuxième contribution scientifique que nous présentons dans le cinquième chapitre. Dans la littérature, on retrouve un seul travail [Tarkesh et al., (2009)] ayant appliqué le MAS pour résoudre des problèmes de petites tailles, ce qui rend notre travail, le premier adoptant MAS pour répondre à la fois le FLP sous environnement statique et dynamique pour des problèmes de grande taille en utilisant un algorithme en trois étapes pour résoudre OTLP. La plate-forme multi-agents développée exploite les trois différents protocoles de communication d’agents, à savoir la coordination, la coopération et la négociation pour concevoir différentes architectures d’agents afin de faire face à l’OTLP statique et dynamique. La dernière contribution consistant en l'utilisation de l’optimisation par essaim de particules (Particle Swarm Optimization (PSO)) sous une représentation continue de l’espace de recherche pour résoudre le problème d’agencement multi-rangée est présentée dans le sixième chapitre. Puisque la PSO est généralement utilisé pour résoudre les problèmes d’affectation ou les FLP avec une représentation discrète, la formulation actuelle est parmi les rares travaux traitant la représentation continue du FLP. Nous avons conçu une nouvelle technique de codage des particules et des heuristiques appropriées pour générer des solutions initiales et pour effectuer la procédure de recherche locale. Une autre nouveauté est liée à l'application de la PSO à un problème de structure multi-rangé, qui n'a pas été abordé auparavant car à notre connaissance, les travaux avec la PSO ont formulé le FLP comme une structure d’une seule rangée ou dans le meilleur des scénarios, comme une structure à deux rangées / In the last decades, the important increasing consumption of health care and the growing of population make elimination of waste and continuous productivity improvement more and more critical for hospitals to provide their care services effectively and efficiently. The productivity and efficiency of a hospital depends on the caregivers working conditions, which are impacted greatly by the work place and the facilities organization [Dares (2013)]. Facilities planning “determines the physical organization of a production system and finding the most efficient arrangement of ‘n’ indivisible facilities in ‘n’ locations” [Singh & Sharma (2006)]. Thus, facilities planning has a great impact on the productivity and efficiency of running a hospital. Being aware of this need, the work we present aims to find a solution to facilities planning for the Operating Theater “the heart of hospital” by proposing an intelligent tool we make available to decision makers for optimizing their operating theater design. Our research work focuses on the use of operational research methods in order to find a solution for this optimization problem. Methods we explored for the realization of this work were variant, namely exact algorithm, heuristics, metaheuristics and intelligent methods, which allow us to compare different issues in order to provide the best solution to different scenarios of problems. Thus, in this dissertation we present the major contribution of our work, starting with the application of Mixed Integer Programming (MIP) to solve Operating Theater Layout Problem (OTLP) as the first scientific contribution. This work considers three different formulations (i.e. the multi-sections, the multi-floors and the multi-rows) in two different environment types (i.e. static and dynamic) while optimizing two different objective functions (i.e. to minimize the total traveling cost and to maximize the total adjacency rate). The combination of these different components gives rise to nine MIP models to solve the OTLP for which optimal solution was provided to problems with until forty facilities. These contributions are presented in the third and fourth chapters. The use of Multi-Agent System (MAS) to solve Facility Layout Problem (FLP) is the second scientific contribution we present in chapter five. In literature, only one work [Tarkesh et al., (2009)] applied the MAS to solve small sized problems, which makes our work the first one adopting MAS to address both the static and dynamic FLP for large sized problems using a novel algorithm running in three steps to solve OTLP. The developed multi-agent platform exploit the three different agents’ protocols of communication, namely coordination, cooperation and negotiation to conceive different agents’ architectures to deal with the static and dynamic OTLP. The last contribution consisting on the use of Particle Swarm Optimization (PSO) under continuous layout representation to solve multi-rows FLP is presented in chapter six. Since the PSO is generally used to solve assignment problems or discrete FLP, the actual formulation is among the few works dealing with the continuous one. This leads us to conceive a novel encoding technique and the appropriate heuristics to generate initial solutions and to perform the local search procedure. Another novelty is related to the application of PSO to a multi-rows layout problem, which was not addressed before. To the best of our knowledge, PSO works usually formulate the FLP as a single row or in the best of scenarios, as a double-rows problem

Un système de systèmes est un système dont les composants sont eux-mêmes des systèmes indépendants, tous communiquant pour atteindre un objectif commun. Lorsque ces systèmes sont mobiles, il peut être difficile d'établir des connexions de bout-en-bout. L'architecture mise en place dans de telles situations est appelée réseau tolérant aux délais. Les données sont transmises d'un système à l'autre – selon les opportunités de communication, appelées contacts, qui apparaissent lorsque deux systèmes sont proches – et disséminées dans l'ensemble du réseau avec l'espoir que chaque message atteigne sa destination. Si une donnée est trop volumineuse, elle est découpée. Chaque fragment est alors transmis séparément.Nous supposons ici que la séquence des contacts est connue. On s'intéresse donc à des applications où la mobilité des systèmes est prédictible (les réseaux de satellites par exemple). Nous cherchons à exploiter cette connaissance pour acheminer efficacement des informations depuis leurs sources jusqu'à leurs destinataires. Nous devons répondre à la question : « Quels éléments de données doivent être transférés lors de chaque contact pour minimiser le temps de dissémination » ?Nous formalisons tout d'abord ce problème, appelé problème de dissémination, et montrons qu'il est NP-difficile au sens fort. Nous proposons ensuite des algorithmes pour le résoudre. Ces derniers reposent sur des règles de dominance, des procédures de prétraitement, la programmation linéaire en nombres entiers, et la programmation par contraintes. Une partie est dédiée à la recherche de solutions robustes. Enfin, nous rapportons des résultats numériques montrant l'efficacité de nos algorithmes. / Systems of systems are supersystems comprising elements which are themselves independent operational systems, all interacting to achieve a common goal. When the subsystems are mobile, these may suffer from a lack of continuous end-to-end connectivity. To address the technical issues in such networks, the common approach is termed delay-tolerant networking. Routing relies on a store-forward mechanism. Data are sent from one system to another – depending on the communication opportunities, termed contacts, that arise when two systems are close – and stored throughout the network in hope that all messages will reach their destination. If data are too large, these must be split. Each fragment is then transmitted separately.In this work, we assume that the sequence of contacts is known. Thus, we focus on applications where it is possible to make realistic predictions about system mobility (e.g. satellite networks). We study the problem of making the best use of knowledge about possibilities for communication when data need to be routed from a set of systems to another within a given time horizon. The fundamental question is: "Which elements of the information should be transferred during each contact so that the dissemination length is minimized"?We first formalize the so-called dissemination problem, and prove this is strongly NP-Hard. We then propose algorithms to solve it. These relies on different dominance rules, preprocessing procedures, integer-linear programming, and constraint programming. A chapter is dedicated to the search for robust solutions. Finally experimental results are reported to show the efficiency of our algorithms in practice.

De nombreuses applications informatiques nécessitent de résoudre des problèmes de décision qui sont difficiles d’un point de vue mathématique. La programmation par contraintes permet de modéliser et résoudre certains de ces problèmes, parfois définis sur des graphes. Au delà des difficultés intrinsèques aux problèmes étudiés, la taille des instances à traiter contribue à la difficulté de la résolution. Cette thèse traite de l’utilisation des graphes en programmation par contraintes, dans le but d’en améliorer la capacité de passage à l’échelle. Une première partie porte sur l’utilisation de contraintes pour résoudre des problèmes de graphes impliquant la recherche d’arbres, de chemins et de cycles Hamiltoniens. Ce sont des problèmes importants que l’on retrouve dans de nombreuses applications industrielles. Nous étudions à la fois le filtrage et les stratégies d’exploration de l’espace de recherche. Nous chercherons ensuite à nous extraire progressivement des problèmes classiquement définis sur les graphes pour exploiter ce concept sur des problèmes définis sur les entiers, voire les réels. Une seconde partie porte ainsi sur l’utilisation des graphes pour le filtrage de contraintes globales très répandues. Nous proposerons entre autres d’utiliser des graphes comme support pour décomposer dynamiquement des algorithmes de filtrage, de manière générique. Le fil conducteur de ces travaux sera d’une part l’utilisation du concept de graphe à la base de chaque raisonnement et d’autre part, la volonté pratique d’augmenter la taille des problèmes pouvant être traités en programmation par contraintes. / Many IT applications require to solve decision problems which are hard from a mathematical point of view. Constraint-programming enables to model and solve some of these problems. Among them, some are defined over graphs. Beyond the difficulty stemming from each of these problems, the size of the instance to solve increases the difficulty of the task. This PhD thesis is about the use of graphs within constraint programming, in order to improve its scalability. First, we study the use of constraint-programming to solve some graph problems involving the computation of trees and Hamiltonian paths and cycles. These problems are important and can be found in many industrial applications. Both filtering and search are investigated. Next, we move on problems which are no longer defined in terms of graph properties. We then study the use of graphs to propagate global constraints. In particular, we suggest a generic schema, relying ona graph structure, to dynamically decompose filtering algorithms. The central theme in this work is the use of graph concepts at the origin of every reasoning and the practical will to increase the size of problems that can be addressed in constraint-programming.

Ce manuscrit aborde des problèmes d’ordonnancement et de transport avec une modélisation explicite du transport. De tels problèmes se modélisent communément sous forme de graphes qui sont évalués afin d’obtenir les dates de début des opérations.Les évaluations classiques des graphes sont effectuées au moyen d’algorithmes de plus long chemin permettant d’obtenir une solution semi-active, où toutes les dates des opérations sont au plus tôt. Néanmoins, ces évaluations permettent généralement de ne prendre en compte que des critères de temps ou de distance à minimiser. Les travaux présentés dans ce manuscrit proposent de tenir compte de critères de qualité de service dans la fonction objectif. Cette prise en considération nécessite de nouvelles fonctions d’évaluation du graphe afin d’obtenir des solutions non nécessairement semi-actives permettant de maximiser la qualité de service. En effet, une solution semi-active propose rarement une qualité de service optimale. Les critères de qualité de service adoptés portent sur les ordonnancements et sur le transport.Trois problèmes intégrés sont successivement traités. Le premier problème est un problème de Job-shop avec transport et qualité de service, appelé Job-shop Scheduling Problem with Routing (JSPR). Des pièces, définies par une succession d’opérations, sont à fabriquer sur différentes machines, et entre deux opérations, la pièce doit être transportée de machine en machine. Le critère de qualité de service dans ce problème est dépendant des délais entre, d’une part les différentes opérations sur les machines, et d’autre part entre les différentes opérations de transport. Les gammes opératoires et les opérations de transport sont dépendantes les unes des autres.Le second problème est un problème de Workforce Scheduling and Routing Problem (WSRP), assimilable à un problème de planification de visites à domicile par un ensemble d’employés, et où le transport est pris en compte. Pour ce problème, le critère de qualité de service dépend des dates de début des visites. Les tournées sont indépendantes les unes des autres.Le troisième problème est le Generalised Workforce Scheduling and Routing Problem (GWSRP), qui prend en compte des contraintes de coordination entre les employés. Les tournées de ces derniers sont dépendantes les unes des autres. Elles nécessitent d’être toutes considérées simultanément pour évaluer les dates des visites respectant les contraintes de coordination et maximisant la qualité de service.Pour chaque problème, une nouvelle fonction d’évaluation est proposée. Pour le JSPR, cette fonction est basée sur l’algorithme de (Cordeau and Laporte, 2003) qui est initialement prévu pour le Dial-A-Ride Problem, ainsi que sur l’insertion de time-lags dans le graphe disjonctif du JSPR. Cette évaluation est incluse dans une métaheuristique. Pour le WSRP, la fonction d’évaluation est basée sur un algorithme de calcul du plus court chemin avec un algorithme de type programmation dynamique à labels. Elle est généralisée pour être utilisée dans une génération de colonnes. Et enfin, pour le GWSRP, l’évaluation est effectuée par un modèle PPC qui combiné à une génération de colonnes définissent tous deux un schéma d’optimisation global. / This manuscript addresses scheduling and transport problems where the transport is explicitly taken into account. Such problems are commonly modelled by graphs that are evaluated to obtain the starting times of operations.Classic graph evaluations are performed using longer path algorithms to obtain a semi-active solution, where all operations are left shifted. Nevertheless, these evaluations generally allow only time or distance criteria to be taken into account. The work presented in this thesis propose to take the quality of service criteria into account in the objective function. These considerations require new graph evaluation functions in order to obtain non-semi-active solutions that maximise the quality of service. Indeed, a semi-active solution rarely offers maximum quality of service. Three integrated problems are successively addressed. The first problem is a Job-shop Scheduling Problem with transport and quality of service, referred to as Job-shop Scheduling Problem with Routing (JSPR). Jobs, defined by a succession of operations, are to be performed on different machines, and between two operations, the job must be transported from a machine to another machine. The quality of service criterion in this problem depends on the delay between, on the one hand, the different operations belonging to the same job, and on the other hand, between the different transport operations. Machine-operations and transport-operations are dependent.The second problem is a Workforce Scheduling and Routing Problem (WSRP), which is similar to a problem of planning home services by a set of employees, and where transport is taken into account. For this problem, the quality of service criterion depends on the starting times of the visits. The trips of employees are independent.The third problem is the Generalised Workforce Scheduling and Routing Problem (GWSRP), which takes coordination constraints between employees into account. The trips are dependent on each other. The evaluation function of the starting times must consider simultaneously all trips in order to respect all coordination constraints and to maximise the service quality.For each problem, a new evaluation function is proposed. For the JSPR, this function is based on the algorithm of (Cordeau and Laporte, 2003) which is introduced first for the Dial-A-Ride Problem. The evaluation function, for the JSPR, is based on the insertion of time-lags in the disjunctive graph. This evaluation is included in a metaheuristic. For the WSRP, the evaluation function is based on the dynamic labelling algorithm used for an Elementary Shortest Path Problem With Resource Constraints. This function is generalised in order to be included in a column generation scheme. Finally, for the GWSRP, the evaluation is performed by a PPC model combined with a generation of columns and both define an overall optimisation scheme.

A majority of current leadership programs are failing to deliver a comprehensive approach to leadership development by not providing middle and frontline managers the skills to enhance their potential to develop others. In failing to generate a comprehensive system, animosity towards all types of leadership has been festering for over 40 years as first identified by Greenleaf in 1977. The purpose of the study was to establish a link between the theoretical paradigms of servant leadership and self-leadership using the lens of emotional intelligence to generate an integral leadership development framework. The conceptual framework used Goleman et al.'s version of emotional intelligence, Spears's model of servant leadership, and Manz's concepts of self-leadership. The research question examined the interrelationship between the three theoretical paradigms and used the analysis to create a theoretical framework. A paradigm and systematic word search phrase yielded an initial sample of 1356 research articles. Using text scrutinization to achieve saturation, I used 342 articles to evaluate the gap between the three theoretical paradigms. The analysis of the secondary data used Edwards's approach to metatheory-building. The results yielded the beginnings of a new theory of self-perpetuating leadership style called sustainable leadership. Also noted based on the literature a serious absence of ethics, morality, or spirituality in leadership development. This study is important because it uses a holistic framework based on development techniques found in three theoretical leadership paradigms to help aspiring leaders to develop others. The positive social change that may result is an improvement in leadership skills, over time, through a comprehensive approach to leadership development for aspiring leaders.

The rise of market globalization creates challenges for business executives seeking to pursue foreign direct investment (FDI) in least developed countries (LDC), such as Afghanistan. Multinational corporate (MNC) executives need strategies that will improve the timely delivery of minerals for mining projects in LDCs. Guided by the force field analysis theory, the purpose of this holistic, single-case study was to explore the strategy that 5 MNC executives in Beijing, China, used to improve the timely delivery of minerals associated with the Aynak copper mine project in Afghanistan. Semistructured interviews were used to elicit detailed narratives from MNC executives about their experiences to develop strategies for mining projects in LDCs. A review of company documents, as well as member-checking of initial interview transcripts, helped to bolster the trustworthiness of final interpretations. Study results included 2 themes. Theme 1 was determinants of mine investment strategies in LDCs that included an exploration of driving forces, restraining forces, neutral forces, and the effect of those forces. Theme 2 was FDI strategies for copper mine projects in LDCs that included the comparison of cost leadership strategy, differentiation strategy, and combination of cost leadership and differentiation strategies. By implementing a cost leadership strategy and best practices, MNC executives were able to achieve greater success to improve timely delivery of minerals associated with FDI copper mine projects in LDCs. Social implications include ongoing efforts of Afghan government leaders to implement effective economic policies that decrease unemployment while reducing poverty.