Literatura científica selecionada sobre o tema "Terminaux ferroviaires"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Terminaux ferroviaires".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Teses / dissertações sobre o assunto "Terminaux ferroviaires":
Kamenga, Franck. "Optimisation combinatoire intégrée de la gestion du matériel roulant et de la circulation ferroviaire dans les gares de passagers". Thesis, Lille 1, 2020. http://www.theses.fr/2020LIL1I068.
Railway stations that concentrates most of starts and ends of train journeys structure most of the passenger lines operations. Indeed, rolling stock preparation operations (cleaning, trains coupling…) which are called “shunting” are scheduled there. These operations are essential to ensure service quality. However, these operations require train movement and parking.This thesis tackles an integration of shunting operation planning and capacity management in railway stations. The Generalized Train Unit Shunting Problem (G-TUSP) is introduced to consider this integration. In the G-TUSP we assign trains which arrive in a railway station to a departure and parking tracks and we schedule their maintenance operations and their movements. These decisions respect constraints due to rolling stock and infrastructure characteristics or related the nature of the operations carried out. The G-TUSP includes four sub-problems, often considered independently in literature. This thesis aims at propose optimization algorithms as decision support for shunting planners.A mixed integer linear programming formulation which considers a detailed representation of G-TUSP aspects is set. The formulation is tested on Metz-Ville station real instances and relevant results are obtained within an hour of calculation. We propose then algorithms in which we consider different combinations for the integrated or sequential solutions of the G-TUSP sub-problems. In a thorough experimental analysis, based on Metz-Ville station instances, we study the contribution of each sub-problem to the difficulty of the G-TUSP, and we identify the best algorithm. This algorithm returns very satisfying results in less than 20 minutes
Antoniazzi, Federico. "La rationalisation des flux de marchandises à travers les terminaux intermodaux". Phd thesis, Université Lumière - Lyon II, 2011. http://tel.archives-ouvertes.fr/tel-00814724.
Kharbech, Sofiane. "Application de la radio intelligente dans le contexte ferroviaire : identification aveugle du type de modulation pour les canaux à grandes vitesses". Thesis, Valenciennes, 2015. http://www.theses.fr/2015VALE0010.
Any intelligent railway transport system is mainly characterized by its autonomy in making decisions in terms of its external conditions. In order to improve its cognition and autonomy, this new generation of transport systems integrates multiple technologies and standards of communication and information processing. The integration of these technologies allows rail operators to reduce operational and maintenance costs and attracts more passengers by making easier rail transport access and use while offering new services on board. However, using multiple communication standards and increasing traffic (number of passengers and vehicles in service) trigger an unprecedented need for radio resources, particularly frequency spectrum. Indeed, with the growing of radio resources demand, Cognitive Radio (CR) is an emerging technology that improves the performance of existing radio systems by the integration of artificial intelligence and software defined radio (SDR)
Bouallegue, Kaïs. "Contribution à la radio intelligente à forte mobilité : adaptation spectrale et allocation dynamique des ressources". Thesis, Valenciennes, 2017. http://www.theses.fr/2017VALE0023.
The main objectives of railway operators are to increase safety, reduce operating and maintenance costs, increase attractiveness and profit by offering new services to customers. These objectives will be achieved through a huge increase of data fluxes between existing infrastructure and the technologies currently used on the train. Spectral efficiency, optimization of radio resources, interoperability and reliability of communications are major elements for railway applications. These constraints and the sporadic use of available frequency bands have gave rise to cognitive radio. Cognitive radio is an emerging technology that improves the performance of existing radio systems by integrating artificial intelligence with software radio. A cognitive radio system is defined by its ability to be aware of its radio environment. Indeed, to optimize as much as possible the available spectral opportunities, the cognitive radio device must be able to transmit on free bands while performing a spectrum sensing to not interfere with users having priority on the band and to detect other vacant frequencies. As part of this thesis, we propose to focus on the problem of spectrum detection in a highly mobile environment. Some constraints should be considered, such as speed. Added to this, there are regulatory constraints on detection criteria, such as the IEEE 802.22 WRAN standard, which stipulates that detection of a priority user must be performed at -21 dB within a period of 2 seconds. The objective is therefore to design an intelligent radio terminal in the physical and regulatory conditions of transmission in a railway environment
Mantovani, Serena. "The load planning problem for double-stack intermodal trains". Thesis, 2020. http://hdl.handle.net/1866/24326.
Double-stack trains are an important component of the railroad transport network for containerized cargo in specific markets such as North America. The load planning problem embodies an operational problem commonly faced in rail terminals by operators. It consists in optimizing the assignment of containers to specific locations on the train. The work in this thesis is centered around a scientific paper on the optimization on load planning problem for double stack-trains, published in the European Journal of Operation Research (Volume 267, Issue 1, Pages 1-398) on 16 May 2018. In the paper, we formulated an ILP model and made a number of contributions. First, we proposed a general methodology that can deal with double- or single-stack railcars with arbitrary loading patterns. The patterns account for loading dependencies between the platforms on a given railcar. Second, we modeled Center of gravity (COG) restrictions, stacking rules and a number of technical loading restrictions associated with certain types of containers and/or goods. Results show that we can solve realistic size instances in reasonable time using a commercial ILP solver and we illustrate that failing to account for containers-to-cars matching as well as COG restrictions may lead to an overestimation of the available train capacity.
Goyette, Kyle. "On two sequential problems : the load planning and sequencing problem and the non-normal recurrent neural network". Thesis, 2020. http://hdl.handle.net/1866/24314.
Le travail de cette thèse est divisé en deux parties. La première partie traite du problème de planification et de séquencement des chargements de conteneurs sur des wagons, un problème opérationnel rencontré dans de nombreux terminaux ferroviaires intermodaux. Dans ce problème, les conteneurs doivent être affectés à une plate-forme sur laquelle un ou deux conteneurs seront chargés et l'ordre de chargement doit être déterminé. Ces décisions sont prises dans le but de minimiser les coûts associés à la manutention des conteneurs, ainsi que de minimiser le coût des conteneurs non chargés. La version déterministe du problème peut être formulé comme un problème de plus court chemin sur un graphe ordonné. Ce problème est difficile à résoudre en raison de la grande taille du graphe. Nous proposons une heuristique en deux étapes basée sur l'algorithme Iterative Deepening A* pour calculer des solutions au problème de planification et de séquencement de la charge dans un budget de cinq minutes. Ensuite, nous illustrons également comment un algorithme d'apprentissage Deep Q peut être utilisé pour résoudre heuristiquement le même problème. La deuxième partie de cette thèse examine les modèles séquentiels en apprentissage profond. Une stratégie récente pour contourner le problème de gradient qui explose et disparaît dans les réseaux de neurones récurrents (RNN) consiste à imposer des matrices de poids récurrentes orthogonales ou unitaires. Bien que cela assure une dynamique stable pendant l'entraînement, cela se fait au prix d'une expressivité réduite en raison de la variété limitée des transformations orthogonales. Nous proposons une paramétrisation des RNN, basée sur la décomposition de Schur, qui atténue les problèmes de gradient, tout en permettant des matrices de poids récurrentes non orthogonales dans le modèle.