It is well-documented that leaders' conceptual complexity can affect their decision-making, but what about its broader effects on political violence? While Hermann & Sakiev (2011) and Conway & Conway (2011) have examined terrorists' conceptual complexity before attacks, this study generates a more extensive analysis by examining weapon types and target types. This research explored the connection between a terrorist leader's level of conceptual complexity and the violent attacks their organizations commit, arguing that complexity lowers before an attack and after the 9/11 terrorist attacks. It employed a content analysis of Osama bin Laden's rhetoric from 1999 to 2003 to discern levels of conceptual complexity. Out of more than 150 relevant pieces of rhetoric, 15 speeches, interviews, and statements were hand-coded, then compared to the total number, type, and magnitude of terrorist attacks committed during the correlating time frames using data from the Global Terrorism Database. Results show that bin Laden's conceptual complexity levels rose before an attack and more than doubled after 9/11. The potential impact of this research is notable. At a theoretical level, it supports previous findings on terrorist complexity while providing a new dimension of weapon type and target type. However, it would have an equally significant impact at the professional level by providing a method to implement specific security policies according to identify trends. Thus, giving counterterrorism professionals another potential tool to prevent harm.

In dieser Arbeit untersuchen wir Algorithmen für Scheduling-Probleme. Wir betrachten semi-online Makespan-Scheduling und generalisiertes Bin Covering. Im online Makespan- Scheduling-Problem sind m Maschinen und n Jobs gegeben, wobei letztere jeweils eine individuelle Bearbeitungszeit haben. Es wird zu jedem Zeitpunkt ein Job offengelegt und muss sofort und unwiderruflich einer Maschine zugewiesen werden, ohne Wissen über zukünftige Jobs. Die Last einer Maschine wird als die Summe der Bearbeitungszeiten der ihr zugewiesenen Jobs definiert. Das Ziel ist es, eine Zuweisung von Jobs zu Maschinen zu finden, sodass die höchste Last einer Maschine minimiert wird. Im semi-online Scheduling-Modell wird dieses strikte Szenario relaxiert. Wir untersuchen drei verschied- ene Modelle. Im ersten ist uns die kumulierte Bearbeitungszeit der Jobs vor Ankunft der einzelnen Jobs bekannt. Im zweiten Modell dürfen wir bis zu einem gewissen Grade bereits zugewiesene Jobs anderen Maschinen neu zuordnen.Im dritten semi-online Scheduling-Modell darf ein Algorithmus mehrere Lösungen parallel konstruieren, von denen die beste ausgegeben wird. Beim generalisierten Bin Covering sind uns m Bintypen und n Objekte gegeben. Ein Bintyp Mj hat einen Bedarf dj und einen Profit rj. Jedes Objekt Jt hat eine Größe pt. Ein Bin vom Typ Mj heißt abgedeckt, wenn die Summe der Größen der ihm zugewiesenen Objekte mindestens dj ist. Wenn ein Bin vom Typ Mj abgedeckt ist, erzielen wir einen Profit von rj. Ziel ist es, die Objekte Bins zuzuweisen, sodass der erzielte Gesamtprofit maximiert wird. Wir untersuchen zwei Modelle, die sich in der Verfügbarkeit von Bintypen unterscheiden. Im Unit-Supply-Modell steht uns von jedem Bintyp genau ein Bin zur Verfügung. Im Gegensatz dazu stehen uns im Infinite-Supply-Modell von jedem Bintyp beliebig viele Bins zur Verfügung. Das Unit-Supply-Modell ist daher eine Verallgemeinerung des Infinite-Supply-Modells. Für alle Modelle zeigen wir beinahe scharfe obere und untere Schranken. / In this thesis we study algorithms for scheduling problems. We investigate semi-online minimum makespan scheduling and generalized bin covering. In online minimum makespan scheduling we are given a set of m machines and n jobs, where each job Jt is specified by a processing time. The jobs arrive one by one and we have to assign them to the machines without any knowledge about future incoming jobs. The load of a machine is defined to be total processing time of the assigned jobs. The goal is to place the jobs on the machines such that the maximum load of a machine is minimized. In semi-online minimum makespan scheduling this strict setting is softened. We investigate three different models. In the first setting an algorithm is given an advice on the total processing time of the jobs. In the second setting we may reassign jobs upto a limited amount. The third semi-online setting we study is minimum makespan scheduling with parallel schedules. In this problem an algorithm may maintain several schedules, the best of which is output after the arrival of the entire job sequence. In generalized bin covering we are given m bin types and n items. Each bin type Mj is specified by a demand dj and a revenue rj. Each item Jt has a size pj. A bin of type Mj is said to be covered if the total size of the assigned items is at least the demand dj. Then the revenue rj is earned. The goal is to find an assignment of items to bins maximizing the total obtained revenue. We study two models of bin supply. In the unit supply model there is only one bin of each type available. By contrast in the infinite supply model each bin type is available arbitrarily often, and hence the former is a generalization of the latter. We provide nearly tight upper and lower bounds for all models.

Esta pesquisa trata da aplicação de meta-heurísticas baseadas em busca em vizinhança variável em problemas de operação de transportes. Desta forma, buscou-se encontrar problemas complexos durante a operação de sistemas de transportes, nas grandes cidades, que possam ser resolvidos com a aplicação de meta-heurística baseada em busca em vizinhança variável. Este trabalho aborda dois diferentes problemas de planejamento e operação de transportes. O primeiro problema abordado neste trabalho é o Problema de Programação da Tabela de Horários, de Veículos e de Tripulantes de Ônibus, no qual as viagens que comporão a tabela de horários, os veículos que executarão as viagens e as tripulações que operarão os veículos são alocadas simultaneamente e de maneira integrada. O segundo problema a ser abordado é o problema de distribuição física, o qual envolve o agrupamento e a alocação de entregas a uma frota de veículos visando minimizar o frete total. Uma abordagem para a modelagem matemática deste problema é modelar como um problema de bin-packing, com bins de tamanho variável unidimensional (do inglês Variable Sized Bin-Packing Problem - VSBPP), ou seja, uma generalização do tradicional problema de bin-packing no qual bins (veículos) de diferentes capacidades e custos estão disponíveis para a alocação de um conjunto de objetos (cargas), de modo que o custo total dos bins (veículos) utilizados seja mínimo. A outra abordagem proposta para o problema de distribuição física é modelar o problema como um problema de bin-packing, com bins de tamanho variável bidimensional (do inglês Bidimensional Variable Sized Bin-Packing Problem BiD-VSBPP). Assim sendo, trata-se de uma expansão do problema de bin-packing com bins de tamanho variável unidimensional (VSBPP), no qual bins (veículos) de diferentes capacidades (capacidade volumétrica e capacidade de carga) e custos estão disponíveis para a alocação de um conjunto de objetos (cargas), os quais possuem as dimensões peso e volume, de modo que o custo total dos bins (veículos) utilizados seja mínimo. Durante a realização deste trabalho, foi desenvolvido um programa computacional em C++, o qual implementa a meta-heurística Busca em Vizinhança Variável (VNS) e duas meta-heurísticas baseadas em VNS. São apresentados resultados de experimentos computacionais com dados reais e dados benchmarking. Os resultados obtidos comprovam a eficácia das meta-heurísticas propostas. / This work approaches variable neighborhood search meta-heuristic applicate on transport operation problems. This way, we sought find complex transport operation problems in large cities that can be solved with the variable neighborhood search meta-heuristic application. This work approaches two different transport planning and operation problems. The first problem approached in this paper is the Bus Timetable Vehicle Crew Scheduling Problem, in which timetabling, bus and crew schedules are simultaneously determined in an integrated approach. The second problem to be approached is the physical distribution problem which comprises grouping and assigning deliveries to a heterogeneous fleet of vehicles aiming to minimize the total freight cost. The problem can be mathematical modeled as one-dimensional Variable Sized Bin-Packing Problem (VSBPP), a generalization of the traditional bin-packing problem, in which bins (vehicles) with different sizes and costs are available for the assignment of the objects (deliveries) such that the total cost of the used bins (vehicles) is minimized. Another proposed approach to the problem of physical distribution is model as two dimensional Variable Sized Bin-Packing Problem (BiD-VSBPP). Therefore, it is an expansion of the bin-packing problem with bins variable-length-dimensional (VSBPP), in which bins (vehicle) of different capacity (capacity and load carrying capacity) and costs are available for allocation a set of objects (loads), which have the dimensions weight and volume, so that minimized the total cost of bins (vehicle). In this work, was developed a C++ software implemented, which was implemented a meta-heuristic Variable Neighborhood Search (VNS) and two others meta-heuristics based on VNS. Computational results for real-world problems and benchmarking problems are presented, showing the effectiveness of these proposed meta-heuristics.

Cette thèse étudie les approches de classification automatique basées sur les modèles de mélange gaussiens et les critères de choix de modèles pour la classification automatique de données discrétisées. Quatorze algorithmes binned-EM et quatorze algorithmes bin-EM-CEM sont développés pour quatorze modèles de mélange gaussiens parcimonieux. Ces nouveaux algorithmes combinent les avantages des données discrétisées en termes de réduction du temps d’exécution et les avantages des modèles de mélange gaussiens parcimonieux en termes de simplification de l'estimation des paramètres. Les complexités des algorithmes binned-EM et bin-EM-CEM sont calculées et comparées aux complexités des algorithmes EM et CEM respectivement. Afin de choisir le bon modèle qui s'adapte bien aux données et qui satisfait les exigences de précision en classification avec un temps de calcul raisonnable, les critères AIC, BIC, ICL, NEC et AWE sont étendus à la classification automatique de données discrétisées lorsque l'on utilise les algorithmes binned-EM et bin-EM-CEM proposés. Les avantages des différentes méthodes proposées sont illustrés par des études expérimentales. / This thesis studies the Gaussian mixture model-based clustering approaches and the criteria of model selection for binned data clustering. Fourteen binned-EM algorithms and fourteen bin-EM-CEM algorithms are developed for fourteen parsimonious Gaussian mixture models. These new algorithms combine the advantages in computation time reduction of binning data and the advantages in parameters estimation simplification of parsimonious Gaussian mixture models. The complexities of the binned-EM and the bin-EM-CEM algorithms are calculated and compared to the complexities of the EM and the CEM algorithms respectively. In order to select the right model which fits well the data and satisfies the clustering precision requirements with a reasonable computation time, AIC, BIC, ICL, NEC, and AWE criteria, are extended to binned data clustering when the proposed binned-EM and bin-EM-CEM algorithms are used. The advantages of the different proposed methods are illustrated through experimental studies.

<p>This thesis presents a method of measuring the distribution of fiber bonding ability in mechanical pulp furnishes. The method is intended for industrial use, where today only average values are used to describe fiber bonding ability, despite the differences in morphology of the fibers entering the mill. Fiber bonding ability in this paper refers to the mechanical fiber’s flexibility and ability to form large contact areas to other fibers, characteristics required for good paper surfaces and strength.</p><p> </p><p>Five mechanical pulps (Pulps A-E), all produced in different processes from Norway spruce (<em>Picea Abies)</em> were fractionated in hydrocyclones with respect to the fiber bonding ability. Five streams were formed from the hydrocyclone fractionation, Streams 1-5. Each stream plus the feed (Stream 0) was fractionated according to fiber length in a Bauer McNett classifier to compare the fibers at equal fiber lengths (Bauer McNett screens 16, 30, 50, and 100 mesh were used).</p><p> </p><p>Stream 1 was found to have the highest fiber bonding ability, evaluated as tensile strength and apparent density of long fiber laboratory sheets. External fibrillation and collapse resistance index measured in FiberLab^TM, an optical measurement device, also showed this result. Stream 5 was found to have the lowest fiber bonding ability, with a consecutively falling scale between Stream 1 and Stream 5. The results from acoustic emission measurements and cross-sectional scanning electron microscopy analysis concluded the same pattern. The amount of fibers in each hydrocyclone stream was also regarded as a measure of the fibers’ bonding ability in each pulp.</p><p> </p><p>The equation for predicted Bonding Indicator (BIN) was calculated by combining, through linear regression, the collapse resistance index and external fibrillation of the P16/R30 fractions for Pulps A and B. Predicted Bonding Indicator was found to correlate well with measured tensile strength. The BIN-equation was then applied also to the data for Pulps C-E, P16/R30, and Pulp A-E, P30/R50, and predicted Bonding Indicator showed good correlations with tensile strength also for these fibers.</p><p> </p><p>From the fiber raw data measured by the FiberLab^TM instrument, the BIN-equation was used for each individual fiber. This made it possible to calculate a BIN-distribution of the fibers, that is, a distribution of fiber bonding ability.</p><p> </p><p>The thesis also shows how the BIN-distributions of fibers can be derived from FiberLab^TM measurements of the entire pulp without mechanically separating the fibers by length first, for example in a Bauer McNett classifier. This is of great importance, as the method is intended for industrial use, and possibly as an online-method. Hopefully, the BIN-method will become a useful tool for process evaluations and optimizations in the future.</p> / <p>Den här studien presenterar en metod för att mäta fördelning av fiberbindning i mekaniska massor. Metoden hoppas kunna användas industriellt, där i dagsläget enbart medelvärden används för att mäta fiberbindnings-fördelning, trots råvarans (fibrernas) morfologiska skillnader.</p><p> </p><p>Fem mekaniska massor (Massa A-E) från olika massaprocesser men från samma råvara, norsk gran (<em>Picea Abies</em>), har fraktionerats i hydrocykloner med avseende på fiberbindningsförmåga. Från hydrocyklon-fraktioneringen bildades fem strömmar, Ström 1-5. Varje ström plus injektet (Ström 0) fraktionerades också med avseende på fiberlängd i en Bauer McNett för att kunna jämföra fibrerna vid samma fiberlängd (Bauer McNett silplåtarna 16, 30, 50 och 100 mesh användes).</p><p> </p><p>Fiberbindingsförmåga i den här studien härrör till fiberns flexibilitet och förmåga att skapa stora kontaktytor med andra fibrer, vilket bidrar till papprets yt- och styrkeegenskaper.</p><p> </p><p>Ström 1 visade sig ha den högsta fiberbindningsförmågan, utvärderat som dragstyrka och densitet av långfiberark, samt yttre fibrillering och kollaps resistans index mätt i den optiska analysatorn FiberLab^TM. Akustisk emission och tvärsnittsanalyser visade samma resultat. Ström 5 visade sig ha den lägsta fiberbindningsförmågan, med en avtagande skala från Ström 1 till Ström 5. Andelen fibrer från injektet som gick ut med varje hydrocyklon-ström ansågs också vara ett mått på fibrernas bindningsförmåga i varje massa.</p><p> </p><p>Genom att kombinera fiberegenskaperna kollaps resistans och yttre fibrillering från den optiska mätningen på varje fiber genom linjär regression, kunde Bindnings Indikator (BIN) predikteras. Medelvärdet av Bindnings Indikator för varje hydrocyklon-ström korrelerar med dragstyrka för långfiber-labark.</p><p> </p><p>Det visade sig att predikterad Bindnings Indikator inte bara fungerade för Massa A och Massa B P16/R30 fraktionen, som var de fraktioner som användes i den linjära regressionen, utan även för Massa C-E, P16/R30, och Massa A-E P30/R50 som också visade goda korrelationer med långfiber-dragstyrka när de sattes in i BIN-formeln.</p><p> </p><p>BIN-formeln användes sedan för varje enskild fiber, i den rådata som levererats från FiberLab^TM. Detta gjorde det möjligt att få en BIN-distribution av fibrerna, d.v.s. en fördelning av fiberbindningsförmåga.</p><p> </p><p>Den här rapporten visar också hur det går att få BIN-distributioner också från mätningar på hela massan, för valbara fiberlängder, utan att först mekaniskt separera massan efter fiberlängd. Det är viktigt, då metoden är tänkt att användas som en industriell metod, och eventuellt som en online-metod. Förhoppningsvis kommer BIN-metoden att bli ett användbart verktyg för processutveckling- och optimering i framtiden.</p> / FSCN – Fibre Science and Communication Network / Bonding ability distribution of fibers in mechanical pulp furnishes

This thesis presents a method of measuring the distribution of fiber bonding ability in mechanical pulp furnishes. The method is intended for industrial use, where today only average values are used to describe fiber bonding ability, despite the differences in morphology of the fibers entering the mill. Fiber bonding ability in this paper refers to the mechanical fiber’s flexibility and ability to form large contact areas to other fibers, characteristics required for good paper surfaces and strength.   Five mechanical pulps (Pulps A-E), all produced in different processes from Norway spruce (Picea Abies) were fractionated in hydrocyclones with respect to the fiber bonding ability. Five streams were formed from the hydrocyclone fractionation, Streams 1-5. Each stream plus the feed (Stream 0) was fractionated according to fiber length in a Bauer McNett classifier to compare the fibers at equal fiber lengths (Bauer McNett screens 16, 30, 50, and 100 mesh were used).   Stream 1 was found to have the highest fiber bonding ability, evaluated as tensile strength and apparent density of long fiber laboratory sheets. External fibrillation and collapse resistance index measured in FiberLabTM, an optical measurement device, also showed this result. Stream 5 was found to have the lowest fiber bonding ability, with a consecutively falling scale between Stream 1 and Stream 5. The results from acoustic emission measurements and cross-sectional scanning electron microscopy analysis concluded the same pattern. The amount of fibers in each hydrocyclone stream was also regarded as a measure of the fibers’ bonding ability in each pulp.   The equation for predicted Bonding Indicator (BIN) was calculated by combining, through linear regression, the collapse resistance index and external fibrillation of the P16/R30 fractions for Pulps A and B. Predicted Bonding Indicator was found to correlate well with measured tensile strength. The BIN-equation was then applied also to the data for Pulps C-E, P16/R30, and Pulp A-E, P30/R50, and predicted Bonding Indicator showed good correlations with tensile strength also for these fibers.   From the fiber raw data measured by the FiberLabTM instrument, the BIN-equation was used for each individual fiber. This made it possible to calculate a BIN-distribution of the fibers, that is, a distribution of fiber bonding ability.   The thesis also shows how the BIN-distributions of fibers can be derived from FiberLabTM measurements of the entire pulp without mechanically separating the fibers by length first, for example in a Bauer McNett classifier. This is of great importance, as the method is intended for industrial use, and possibly as an online-method. Hopefully, the BIN-method will become a useful tool for process evaluations and optimizations in the future. / Den här studien presenterar en metod för att mäta fördelning av fiberbindning i mekaniska massor. Metoden hoppas kunna användas industriellt, där i dagsläget enbart medelvärden används för att mäta fiberbindnings-fördelning, trots råvarans (fibrernas) morfologiska skillnader.   Fem mekaniska massor (Massa A-E) från olika massaprocesser men från samma råvara, norsk gran (Picea Abies), har fraktionerats i hydrocykloner med avseende på fiberbindningsförmåga. Från hydrocyklon-fraktioneringen bildades fem strömmar, Ström 1-5. Varje ström plus injektet (Ström 0) fraktionerades också med avseende på fiberlängd i en Bauer McNett för att kunna jämföra fibrerna vid samma fiberlängd (Bauer McNett silplåtarna 16, 30, 50 och 100 mesh användes).   Fiberbindingsförmåga i den här studien härrör till fiberns flexibilitet och förmåga att skapa stora kontaktytor med andra fibrer, vilket bidrar till papprets yt- och styrkeegenskaper.   Ström 1 visade sig ha den högsta fiberbindningsförmågan, utvärderat som dragstyrka och densitet av långfiberark, samt yttre fibrillering och kollaps resistans index mätt i den optiska analysatorn FiberLabTM. Akustisk emission och tvärsnittsanalyser visade samma resultat. Ström 5 visade sig ha den lägsta fiberbindningsförmågan, med en avtagande skala från Ström 1 till Ström 5. Andelen fibrer från injektet som gick ut med varje hydrocyklon-ström ansågs också vara ett mått på fibrernas bindningsförmåga i varje massa.   Genom att kombinera fiberegenskaperna kollaps resistans och yttre fibrillering från den optiska mätningen på varje fiber genom linjär regression, kunde Bindnings Indikator (BIN) predikteras. Medelvärdet av Bindnings Indikator för varje hydrocyklon-ström korrelerar med dragstyrka för långfiber-labark.   Det visade sig att predikterad Bindnings Indikator inte bara fungerade för Massa A och Massa B P16/R30 fraktionen, som var de fraktioner som användes i den linjära regressionen, utan även för Massa C-E, P16/R30, och Massa A-E P30/R50 som också visade goda korrelationer med långfiber-dragstyrka när de sattes in i BIN-formeln.   BIN-formeln användes sedan för varje enskild fiber, i den rådata som levererats från FiberLabTM. Detta gjorde det möjligt att få en BIN-distribution av fibrerna, d.v.s. en fördelning av fiberbindningsförmåga.   Den här rapporten visar också hur det går att få BIN-distributioner också från mätningar på hela massan, för valbara fiberlängder, utan att först mekaniskt separera massan efter fiberlängd. Det är viktigt, då metoden är tänkt att användas som en industriell metod, och eventuellt som en online-metod. Förhoppningsvis kommer BIN-metoden att bli ett användbart verktyg för processutveckling- och optimering i framtiden. / FSCN – Fibre Science and Communication Network / Bonding ability distribution of fibers in mechanical pulp furnishes

本論文為探索性的個案研究架構，從「知識管理活動」觀點來看工廠的知識管理作法。並經由「知識管理關鍵因子」與「知識管理活動」相互關連性來探討「知識管理關鍵因子」對於個案LED廠的「知識管理活動」之影響。 對於知識管理流程的運作得到的結論有： （一）、外部知識與內隱知識同為個案企業在知識取得及創造重要來源 但由個案探討發現要讓知識取得及創造能更有效果的方法，有賴激勵制度及高階主管全力支持以促使團隊合作發展才能達到目的。 （二）、由個案跨國企業知識蓄積及分享而言，IT及網際網路科技應用是必要且影響甚鉅的，但必須搭配資深或技術人員為載體，知識蓄積及分享效果才為顯著。 （三）、教育、評核及激勵制度推動師徒制及專案團隊與跨廠區、部門合作，促進知識流通、移轉及轉換。 對於知識管理關鍵因子與知識管理流程關聯性得到結論有： 1. IT及網際網路可協助知識管理活動更加有效率及組織化。 2. 科技產品的應用對遠距離、跨區域公司的知識管理式可收事半功倍之效果。 3. 信任與自私為一體兩面，沒有相對高階的絕對支持及相對資源投入，就無以產生絕對信任。知識導入及轉移至同化是否能達效果，此為一大主因。 4. 高階主管的認知及全力支持是知識管理落實、有效執行的關鍵。 5. 相同制度用在不同地區未必可得到一致效果，因地制宜因勢利導方可收知識管理之功效。 6. 使命與榮譽感需配合評核及有效激勵制度才能成為知識傳承重要動力。 / The thesis architecture is base on exploratory case study . Base on the point view of Knowledge management to discuss the activities of factories . Base on the inter-related “ key factors of knowledge management ” and “knowledge management activities ” . We try to find the impact from“ key factors of knowledge management ” to " knowledge management activities ”in the case study. The conclusion of the knowledge management process: 1. External knowledge and implicit knowledge are equal important resource for the case company in the knowledge acquisition and creation. However, the case study found that to make knowledge acquisition and the creation can be more effective is depends on the incentive system and top managers full support to promote the development of teamwork to achieve the purpose. 2. For knowledge accumulation and sharing of multinational enterprises , IT and Internet technology application is necessary and a great influence .It will be more powerful if senior technical staff as a carrier of knowledge accumulation and sharing . 3. Education、assessment and incentive system encourage apprenticeship and project teams to work more powerful in cross-plant .That promote the circulation of knowledge, transfer and conversion. We study the relationship between key factors of knowledge management and knowledge management process . Conclusion as following： 1. IT and Internet can make knowledge management activities more efficient and organized. 2. the application of technology products on the type of long-distance, inter-regional knowledge management can get maximum effect. 3. Trust and selfishness is two side of the same coin. If there is no absolute support and the relative resources from top managers . There will be no absolute trust . It’s the main key point of knowledge import 、transfer 、 assimilation . 4. Top managers awareness and fully support to knowledge management will be the key to effective implementation. 5. The same system in different regions may not be obtained consistent results. Capitalize on the trend will be the best efficacy of knowledge management. 6. Mission and sense of honor must comply with the assessment and effective incentive system in order to become an important driving force of knowledge transmission.

Esta pesquisa trata da aplicação de meta-heurísticas baseadas em busca em vizinhança variável em problemas de operação de transportes. Desta forma, buscou-se encontrar problemas complexos durante a operação de sistemas de transportes, nas grandes cidades, que possam ser resolvidos com a aplicação de meta-heurística baseada em busca em vizinhança variável. Este trabalho aborda dois diferentes problemas de planejamento e operação de transportes. O primeiro problema abordado neste trabalho é o Problema de Programação da Tabela de Horários, de Veículos e de Tripulantes de Ônibus, no qual as viagens que comporão a tabela de horários, os veículos que executarão as viagens e as tripulações que operarão os veículos são alocadas simultaneamente e de maneira integrada. O segundo problema a ser abordado é o problema de distribuição física, o qual envolve o agrupamento e a alocação de entregas a uma frota de veículos visando minimizar o frete total. Uma abordagem para a modelagem matemática deste problema é modelar como um problema de bin-packing, com bins de tamanho variável unidimensional (do inglês Variable Sized Bin-Packing Problem - VSBPP), ou seja, uma generalização do tradicional problema de bin-packing no qual bins (veículos) de diferentes capacidades e custos estão disponíveis para a alocação de um conjunto de objetos (cargas), de modo que o custo total dos bins (veículos) utilizados seja mínimo. A outra abordagem proposta para o problema de distribuição física é modelar o problema como um problema de bin-packing, com bins de tamanho variável bidimensional (do inglês Bidimensional Variable Sized Bin-Packing Problem BiD-VSBPP). Assim sendo, trata-se de uma expansão do problema de bin-packing com bins de tamanho variável unidimensional (VSBPP), no qual bins (veículos) de diferentes capacidades (capacidade volumétrica e capacidade de carga) e custos estão disponíveis para a alocação de um conjunto de objetos (cargas), os quais possuem as dimensões peso e volume, de modo que o custo total dos bins (veículos) utilizados seja mínimo. Durante a realização deste trabalho, foi desenvolvido um programa computacional em C++, o qual implementa a meta-heurística Busca em Vizinhança Variável (VNS) e duas meta-heurísticas baseadas em VNS. São apresentados resultados de experimentos computacionais com dados reais e dados benchmarking. Os resultados obtidos comprovam a eficácia das meta-heurísticas propostas. / This work approaches variable neighborhood search meta-heuristic applicate on transport operation problems. This way, we sought find complex transport operation problems in large cities that can be solved with the variable neighborhood search meta-heuristic application. This work approaches two different transport planning and operation problems. The first problem approached in this paper is the Bus Timetable Vehicle Crew Scheduling Problem, in which timetabling, bus and crew schedules are simultaneously determined in an integrated approach. The second problem to be approached is the physical distribution problem which comprises grouping and assigning deliveries to a heterogeneous fleet of vehicles aiming to minimize the total freight cost. The problem can be mathematical modeled as one-dimensional Variable Sized Bin-Packing Problem (VSBPP), a generalization of the traditional bin-packing problem, in which bins (vehicles) with different sizes and costs are available for the assignment of the objects (deliveries) such that the total cost of the used bins (vehicles) is minimized. Another proposed approach to the problem of physical distribution is model as two dimensional Variable Sized Bin-Packing Problem (BiD-VSBPP). Therefore, it is an expansion of the bin-packing problem with bins variable-length-dimensional (VSBPP), in which bins (vehicle) of different capacity (capacity and load carrying capacity) and costs are available for allocation a set of objects (loads), which have the dimensions weight and volume, so that minimized the total cost of bins (vehicle). In this work, was developed a C++ software implemented, which was implemented a meta-heuristic Variable Neighborhood Search (VNS) and two others meta-heuristics based on VNS. Computational results for real-world problems and benchmarking problems are presented, showing the effectiveness of these proposed meta-heuristics.

Les travaux de thèse présentés s’intéressent à l’optimisation des activités d’un bloc opératoire. Ces activités concernent les interventions chirurgicales à planifier et les interventions de maintenance préventive sur les équipements dans les salles d’opération. Une solution est la synchronisation de ces activités lors de la construction du planning opératoire au niveau opératoire. Nous dissocions deux stratégies de programmation opératoire : programmation ouverte et programmation avec allocation préalable des plages horaires aux chirurgiens. Pour chacune des stratégies, nous considérons deux cas : le cas où l’heure de début d’une intervention de maintenance dans la salle est fixée, ladite intervention précédant l’affection des interventions chirurgicales dans les salles. Le second cas étant celui où l’heure de début de maintenance varie dans un intervalle entre une heure de début minimum et une heure de début maximum, avec l’intervention de maintenance placée a posteriori.Nous faisons plusieurs propositions de méthodes (exactes et approchées), y compris une méthode hybride, qui repose sur le couplage entre une métaheuristique et une heuristique. Les résultats obtenus sur des instances générées en concertation avec le monde hospitalier sont intéressants. / The presented dissertation is about the optimization of hospital systems, more precisely the optimization of the activities of an operation theatre. These activities showcase the surgical procedures to be planned and the preventive maintenance interventions on the equipment in the operating rooms. One solution is the synchronization of these activities during the construction of the operational planning at the operational level.We dissociate two operating programming strategies: Open Scheduling or Open programming and Block Scheduling or Programming with prior allocation of times to surgeons. For each strategy two cases are considered: the first case is where the time of beginning of a maintenance intervention in the room is fixed - this intervention preceding the affection of the surgical interventions in the rooms. The second case is where the maintenance start time varies in the interval between a minimum start time and a maximum start time, with the maintenance intervention placed beforehand. We make several proposition’s methods (exact and approximate), including a hybrid method, which is based on the coupling between a metaheuristic and a heuristic. The results obtained on bodies generated in consultation with the hospital’s world are interesting.

Les travaux de thèse présentés s’intéressent à l’optimisation des systèmes hospitaliers. Une solution existante est la mutualisation de ressources au sein d’un même territoire. Cela peut passer par différentes formes de coopération dont la Communauté Hospitalière de Territoire. Différents problèmes sont définis en fonction du niveau de décision : stratégique, tactique ou opérationnel ; et du niveau de modélisation : macroscopique, mesoscopique et microscopique. Des problèmes de dimensionnement, de planification et d’ordonnancement peuvent être considérés. Nous définissons notamment le problème de planification d’activités avec affectation de ressources. Plusieurs cas sont dissociés : soit les ressources humaines sont à capacité infinie, soit elles sont à capacité limitée et leur affectation sur site est une donnée, soit elles sont à capacité limitée et leur affectation sur site est une variable. Ces problèmes sont spécifiés et formalisés mathématiquement. Tous ces problèmes sont comparés à un problème de bin packing : le problème du bin packing de base pour le problème où les ressources humaines sont à capacité infinie, le problème du bin packing avec interdépendances dans les deux autres cas. Le problème du bin packing avec incompatibilités est ainsi défini. De nombreuses méthodes de résolution ont déjà été proposées pour le problème du bin packing. Nous faisons plusieurs propositions dont un couplage hiérarchique entre une heuristique et une métaheuristique. Des métaheuristiques basées individu et une métaheuristique basée population, l’optimisation par essaim particulaire, sont utilisées. Cette proposition nécessite un nouveau codage inspiré des problèmes de permutation d’ordonnancement. Cette méthode donne de très bons résultats sur les instances du problème du bin packing. Elle est simple à appliquer : elle couple des méthodes déjà connues. Grâce au couplage proposé, les nouvelles contraintes à considérer nécessitent d’être intégrées uniquement au niveau de l’heuristique. Le fonctionnement de la métaheuristique reste le même. Ainsi, notre méthode est facilement adaptable au problème de planification d’activités avec affectation de ressources. Pour les instances de grande taille, le solveur utilisé comme référence ne donne qu’un intervalle de solutions. Les résultats de notre méthode sont une fois encore très prometteurs : les solutions obtenues sont meilleures que la borne supérieure retournée par le solveur. Il est envisageable d’adapter notre méthode sur d’autres problèmes plus complexes par intégration dans l’heuristique des nouvelles contraintes à considérer. Il serait notamment intéressant de tester ces méthodes sur de réelles instances hospitalières afin d’évaluer leur portée. / The presented work is about optimization of the hospital system. An existing solution is the pooling of resources within the same territory. This may involve different forms of cooperation between several hospitals. Various problems are defined at the decision level : strategic, tactical or operational ; and at the modeling level : macroscopic, mesoscopic and microscopic. Problems of sizing, planning and scheduling may be considered. We define the problem of activities planning with resource allocation. Several cases are dissociated : either human resources are under infinite capacity, or they are under limited capacity and their assignment on a place is given, or they are under limited capacity and their assignment is a variable. These problems are specified and mathematically formalized. All thes problems are compared to a bin packing problem : the classical problem of bin packing is used for the problem where human resources are under infinite capacity, the bin packing problem with interdependencies is used in the two other cases. The bin packing problem with incompatibilities is defined. Many resolution methods have been proposed for the bin packing problem. We make several propositions including a hierarchical coupling between heuristic and metaheuristic. Single based metaheuristics and a population based metaheuristic, the particle swarm optimization, are used. This proposition requires a new encoding inspired by permutation problems. This method gives very good results to solve instances of the bin packing problem. It is easy to apply : it combines already known methods. With the proposed coupling, the new constraints to be considered need to be integrated only on the heuristic level. The running of the metaheuristic is the same. Thus, our method is easily adaptable to the problem of activities planning with resource allocation. For big instances, the solver used as a reference returns only an interval of solutions. The results of our method are once again very promising : the obtained solutions are better than the upper limit returned by the solver. It is possible to adapt our method on more complex issues through integration into the heuristic of the new constraints to consider. It would be particularly interesting to test these methods on real hospital authorities to assess their significance.