Firm real time system with Poisson arrival process, iid exponential service times and iid deadlines till the end of service of a job, operated under the First Come First Served (FCFS) scheduling policy is well studied. In this thesis, we present an exact theoretical analysis of a similar (M/M/1 + G queue) system with exact admission control (EAC). We provide an explicit expression for the steady state workload distribution. We use this solution to derive explicit expressions for the loss ratio and the sojourn time distribution. An exact theoretical analysis of the performance of an M/M/1 + G queue with preemptive deadlines till the end of service, operating under the Earliest Deadline First (EDF) scheduling policy, appears to be difficult, and only approximate formulas for the loss ratio are available in the literature. We present in this thesis similar approximate formulas for the loss ratio in the present of an exit control mechanism, which discards a job at the epoch of its getting the server if there is no chance of completing it. We refer to this exit control mechanism as the Early job Discarding Technique (EDT). Monte Carlo simulations of performance indicate that the maximum approximation error is reasonably small for a wide range of arrival rates and mean deadlines. Finally, we compare the loss ratios of the First Come First Served and the Earliest Deadline First scheduling policies with or without admission or exit control mechanism, as well as their counterparts with deterministic deadlines. The results include some formal equalities, inequalities and some counter-examples to establish non-existence of an order. A few relations involving loss ratios are posed as conjectures, and simulation results in support of these are reported. These results lead to a complete picture of dominance and non-dominance relations between pairs of scheduling policies, in terms of loss ratios.

La fission induite par neutron, découverte il y a plus de 70 ans, a de nombreuses applications, par exemple industrielles pour la production d'énergie, et intervient dans la nucléosynthèse. Cependant, sa description microscopique reste un problème ouvert. En effet, les degrés de liberté qui interviennent dans ce processus dynamique sont complexes. De plus, les noyaux fissiles ont un nombre élevé de nucléons en interaction (>200). Il s'agit donc d'un problème à N-corps quantique. Or, une résolution directe de ce dernier n'est pas possible à l'heure actuelle. Dans ce contexte, la description microscopique de la fission considérée ici est la suivante : la première étape consiste à déterminer un ensemble de configurations de champ moyen qui représentent différentes déformations du noyau, incluant ainsi explicitement les degrés de liberté collectifs qui leur sont associés. Dans la seconde étape, la dynamique est décrite dans cet espace de configurations en utilisant la méthode de la coordonnée génératrice dépendante du temps (TDGCM). L'approximation des recouvrements gaussiens (GOA) est alors utilisée. Cependant, elle introduit une erreur de modèle et limite les extensions comme par exemple la prise en compte explicite de degrés de liberté intrinsèques. Ce travail de thèse a pour objectif de décrire le processus de fission avec la TDGCM sans recourir à la GOA. Cela implique de résoudre l'équation de la dynamique en TDGCM appelée équation de Hill-Wheeler dépendante du temps (TD-HW). Les méthodes d'évaluations des matrices des recouvrements et du hamiltonien collectif sont présentées dans le cas d'une interaction de Gogny. La matrice des recouvrements représente la métrique de l'espace des configurations, et la matrice du hamiltonien collectif contient les couplages énergétiques entre les configurations. Les configurations sont exprimées dans des bases de particules deux à deux distinctes, introduisant des instabilités numériques dans les méthodes d'évaluation standard. Un formalisme adapté à ces bases est proposé permettant d'éliminer ces instabilités. Deux méthodes de résolution de TD-HW sont présentées. La première consiste à calculer l'opérateur d'évolution associé à l'équation de Hill-Wheeler dépendante du temps. Elle est adaptée à un faible nombre de configurations. La seconde utilise un schéma de discrétisation en temps permettant l'inclusion d'un plus grand nombre de configurations dans le modèle. Ce formalisme est ensuite appliqué à la description de la réaction de fission induite par neutron sur le plutonium 239, et une comparaison avec la TDGCM+GOA est effectuée. / Nuclear fission, where an atomic nucleus separates into two fragments while emitting a large amount of energy, is at the core of many applications in society (energy production) and national security (deterrence, non-proliferation). It is also a key ingredient of the mechanisms of formation of elements in the universe. Yet, nearly 80 years after its experimental discovery its theoretical description in terms of the basic constituents of the nucleus (protons and neutrons) and their interaction remains a challenge. In this thesis, we describe the fission process as follows. In a first step, we use large supercomputers to compute the deformation properties of the nucleus based on our knowledge of nuclear forces. In a second step, we simulate the time evolution of the system from its ground state up to the fragments separation with a fully quantum-mechanical approach called the time-dependent generator coordinate method (TDGCM). While results are in good qualitative agreement with experimental data, the implementation of the TDGCM so far had been greatly simplified using what is known as the Gaussian overlap approximation (GOA). We also developed the formalism and a numerical implementation of the exact TDGCM - without the GOA. This will allow the first systematic validation of that approximation and an assessment of the resulting theoretical uncertainties. The second chapter presents the description of the neutron induced fission process using the TDGCM+GOA. The third one introduces the developments carried out in this thesis allowing the description of the fission process with the TDGCM without the GOA. The last chapter shows the first results obtained with this approach.

The diploma thesis is focused on solving road bridge situated between Roudno and Razová village over the water basin Slezská Harta. Before the design itself 3 studies were created and compared together. The selected variant is a continuous box girder with inclined walls, post-tensioned by bonded cables. The girder of a total lenght 148,0 m and width 13,6 m is divided into three spans. Height of the girder is 3,3 m. A detailed structural design, including construction limit state assessment, prestress design and time dependent analysis verification is processed. The design and the assessments of temporary and permanent situations are made according to valid standarts and regulations. Drawings and vizualizations are parts of the diploma thesis.

The subject of my diploma thesis is a detailed static calculation of the post-tensioned concrete road bridge across Bystrica creek near Banska Bystrica in Slovakia. The bridge is element of turning ramp a motorway R1. The spatial curvature continuous bridge has 9 fields. It was made a spatial curvature computational model of the bridge for a structural analysis. The model was comparison with a straight computational model of the bridge. It is made comparison effect of the construction bridge in stages on the size of the internal forces too. The load-bearing structure was checked according to CSN EN 1992-1-1, CSN EN 1992-2 and CSN 73 6214.

The subject of this thesis is the design and assessment of the bridge construction across the deep valley on highway traffic. From three variants, which were compared to each other, was the most suitable further examined. The solved structure is made of post-tensioned concrete, and is formed with cell box girder with transverse overhangs, which are supported by prefabricated struts over the length of the bridge. The load was considered by the European Standard EN 1991-2 - Traffic loads on bridges and dimensioning according to EN 1992-2-Design of concrete structures - Concrete bridges - Design and detailing rules.

The aim of this diploma thesis was the design of three possible variants, how to span the wide and deep valley with a bridge. After an evaluation, situation of the highway on the only wide load-bearing structure which is constituted by a box girder with transverse cantilevers supported by prefabricated bar braces, was chosen as an optimal solving. The load- bearing structure made of post- tensioned concrete is going to be incrementally launched and be supported by one-column pillars along an axis of the motorway. The work is composed of a detailed design of this preferred variant, which is processed according to the ultimate and serviceability limit state including the construction stage analysis of the bridge by the construction technology by an incremental launching method.

The aim of diploma thesis is to design a made-up bridge construction over the road network.There were made three studies of bridging which were compared consequently. Two-joint ginder without haunched was selected as the most suitable option and it was designed in details. The construction was assessed according to the ultimate and serviceability limit state.

The subject of diploma thesis is designing multi-span highway bridge over Řepovský potok valley, dirt roads and biocorridor. Three variants of bridge were designed and one of them – box girder 10 span bridge, has been chosen. Bridge deck is made from cast in place post tension prestressed beam. Load-bearing structure is concreting step by step on fixed and moving support. Total length of bridge is 560 m. The analysis of structure was projected on several computational models. They have been made in software Midas Civil and SCIA Engineer 18.1. The assessments of ultimate limit state and serviceability limit state were made in all steps of building in longitudinal and cross direction. In the analysis in longitudinal direction is included the time dependent analysis. Structural design was made in software MS Excel according to valid standards. Finally, drawing documentation and visualization were made.

Diploma thesis deals with design and assessment of a ceiling of a library in Ostrava. The solved beamed ceiling is above the third floor. Static analysis of the structure was calculated by Scia Engineer 20 software. Two variants of ceiling was calculated. Thesis then focuses on prestressed ceiling.

Cette thèse s’intéresse au problème classique de tournées de véhicules avec contraintes de capacité (CVRP pour Capacitated Vehicle Routing Problem) ainsi qu’une variante beaucoup plus complexe, soit le problème de tournées de véhicules dépendant du temps avec fenêtres de temps et points de transfert défini sur un réseau routier (TDVRPTWTP-RN pour Time-Dependent Vehicle Routing Problem with Time Windows and Transfer Points on a Road Network). Dans le premier article, le TDVRPTWTP-RN est résolu en adaptant une métaheuristique qui représente l’état de l’art pour le CVRP, appelé Slack Induction for String Removals (SISR). Cette métaheuristique fait appel au principe “détruire et reconstruire” en retirant des séquences de clients consécutifs dans les routes de la solution courante et en réinsérant ensuite ces clients de façon à créer une nouvelle solution. Le problème est défini sur un réseau routier où différents chemins alternatifs peuvent être utilisés pour se déplacer d’un client à l’autre. De plus, le temps de parcours sur chacun des arcs du réseau n’est pas fixe, mais dépend du moment où le véhicule quitte le sommet origine. S’inspirant de problèmes rencontrés en logistique urbaine, nous considérons également deux types de véhicules, de petite et grande capacité, où les grands véhicules sont interdits de passage au centre-ville. Ainsi, les clients du centre-ville ne peuvent être servis que suite au transfert de leur demande d’un grand à un petit véhicule à un point de transfert. Comme un point de transfert n’a pas de capacité, une problématique de synchronisation apparaît quand un grand véhicule doit y rencontrer un ou plusieurs petits véhicules pour leur transférer une partie de son contenu. Contrairement aux problèmes stricts de tournées de véhicules à deux échelons, les grands véhicules peuvent aussi servir des clients localisés à l’extérieur du centre-ville. Comme le problème abordé est beaucoup plus complexe que le CVRP, des modifications importantes ont dû être apportées à la métaheuristique SISR originale. Pour évaluer la performance de notre algorithme, un ensemble d’instances tests a été généré à partir d’instances existantes pour le TDVRPTW-RN. Les réseaux omt été divisés en trois régions : centre-ville, frontière et extérieur. Le centre-ville et l’extérieur sont respectivemnt les royaumes des petits et grands véhicules, tandis que la frontière (où l’on retrouve les points de transfert) peut être visité par les deux types de véhicules. Les résultats numériques montrent que la métaheuristique proposée exploite les opportunités d’optimiser une solution en déplaçant autant que possible les clients neutres, soit ceux qui peuvent être servis indifféremment par un petit ou un grand véhicule, des routes des petits véhicules vers les routes des grands véhicules, réduisant ainsi les coûteuses visites aux points de transfert. Les deuxième et troisième article s’intéressent à des concepts plus fondamentaux et font appel au problème plus simple du CVRP pour les évaluer. Dans le second article, un étude expérimentale est conçue afin d’examiner l’impact de données (distances) imprécises sur la performance de différents types d’heuristiques, ainsi qu’une méthode exacte, pour le CVRP. À cette fin, différents niveaux d’imprécision ont été introduits dans des instances tests classiques pour le CVRP avec 100 à 1 000 clients. Nous avons observé que les meilleures métaheuristiques demeurent les meilleures, même en présence de hauts niveaux d’imprécision, et qu’elles ne sont pas affectées autant par les imprécisions qu’une heuristique simple. Des expériences avec des instances réelles ont mené aux mêmes conclusions. Le troisième article s’intéresse à l’intégration de l’apprentissage automatique dans la métaheuristique SISR qui représente l’état de l’art pour le CVRP. Dans ce travail, le principe “détruire et reconstruire” au coeur de SISR est hybridé avec une méthode d’apprentissage par renforcement qui s’inspire des systèmes de colonies de fourmis. L’ap- prentissage automatique a pour but d’identifier les arêtes les plus intéressantes, soit celles qui se retrouvent le plus fréquemment dans les solutions de grande qualité précédemment rencontrées au cours de la recherche. L’inclusion de telles arêtes est alors favorisé lors de la réinsertion des clients ayant été retirés de la solution par le mécanisme de destruction. Les instances utilisées pour tester notre approche hybride sont les mêmes que celles du second article. Nous avons observé que notre algorithme ne peut produire que des solutions lé- gèrement meilleures que la métaheuristique SISR originale, celle-ci étant déjà quasi-optimale. / This thesis is concerned both with the classical Capacitated Vehicle Routing Problem (CVRP) and a much more complex variant called the Time-Dependent Vehicle Routing Problem with Time Windows and Transfer Points on a Road Network (TDVRPTWTP-RN ). In the first paper, the TDVRPTWTP RN is solved by adapting a state-of-the-art metaheuris- tic for the CVRP, called Slack Induction for String Removals (SISR). This metaheuristic is based on the ruin and recreate principle and removes strings of consecutive customers in the routes of the current solution and then reinserts the removed customers to create a new solution. The problem is formulated in a full road network where different alternative paths can be used to go from one customer to the next. Also, the travel time on each arc of the road network is not fixed, but depends on the departure time from the origin node. Motivated from city logistics applications, we also consider two types of vehicles, large and small, with large vehicles being forbidden from the downtown area. Thus, downtown customers can only be served through a transfer of their goods from large to small vehicles at designated transfer points. Since transfer points have no capacity, synchronization issues arise when a large vehicle must meet one or more small vehicles to transfer goods. As opposed to strict two-echelon VRPs, large vehicles can also directly serve customers that are outside of the downtown area. Given that the TDVRPTWTP-RN is much more complex than the CVRP, important modifications to the original SISR metaheuristic were required. To evaluate the performance of our algorithm, we generated a set of test instances by extending existing instances of the TDVRPTW-RN . The road networks are divided into three regions: downtown, boundary and outside. The downtown and outside areas are the realm of small and large vehicles, respectively, while the boundary area that contains the transfer points can be visited by both small and large vehicles. The results show that the proposed metaheuristic exploits optimization opportunities by moving as much as possible neutral customers (which can be served by either small or large vehicles) from the routes of small vehicles to those of large vehicles, thus avoiding costly visits to transfer points. The second and third papers examine more fundamental issues, using the classical CVRP as a testbed. In the second paper, an experimental study is designed to examine the impact of inaccurate data (distances) on the performance of different types of heuristics, as well as one exact method, for the CVRP. For this purpose, different levels of distance inaccuracies were introduced into well-known benchmark instances for the CVRP with 100 to 1,000 customers. We observed that the best state-of-the-art metaheuristics remain the best, even in the presence of high inaccuracy levels, and that they are not as much affected by inaccuracies when compared to a simple heuristic. Some experiments performed on real-world instances led to the same conclusions. The third paper focuses on the integration of learning into the state-of-the-art SISR for the CVRP. In this work, the ruin and recreate mechanism at the core of SISR is enhanced by a reinforcement learning technique inspired from ant colony systems. The learning component is aimed at identifying promising edges, namely those that are often found in previously encountered high-quality solutions. The inclusion of these promising edges is then favored during the reinsertion of removed customers. The benchmark instances of the second paper were also used here to test the new hybrid algorithm. We observed that the latter can produce only slightly better solutions than the original SISR, due to the quasi-optimality of the original solutions.