A numerical program for Railway vehicle-track-structure dynamic interaction using a modal substructuring approach

This work presents a program for simulations of vehicle-track and vehicle-trackstructure dynamic interaction . The method used is computationally efficient in the sense that a reduced number of coordinates is sufficient and doesn’t require high efficiency computers. The method proposes a modal substructuring approach of the system by modelling rails , sleepers and underlying structure with modal coordinates, the vehicle with physical lumped elements coordinates and by introducing interconnection elements between these structures (wheel-rail contact, railpads and ballast) by means of their interaction forces. The Frequency response function (FRF) is also calculated for both cases of track over a structure (a bridge, a viaduct ...) and for the simple vehicle-track program; for each case the vehicle effect on the FRF is then analyzed through the comparison of the FRFs obtained introducing or not a simplified vehicle on the system.

A LES study of a modified Ahmed body geometry

A numerical study using Large Eddy Simulation Coherent Structure Model (LES-CSM), of the flow around a simplified Ahmed body, has been done in this work of thesis. The models used are two salient geometries from the experimental investigation performed in [1], and consist, in particular, in two notch-back body geometries. Six simulation are carried out in total, changing Reynolds number and back-light angle of the model’s rear part. The Reynolds numbers used, based on the height of the models and the free stream velocity, are Re = 10000, Re = 30000 and Re = 50000. The back-light angles of the slanted surface with respect to the horizontal roof surface, that characterizes the vehicle, are taken as B = 31.8◦ and B = 42◦ respectively. The experimental results in [1] have shown that, depending on the parameter B, asymmetric and symmetric averaged flow over the back-light and in the wake for a symmetric geometry can be observed. The aims of the present work of master thesis are principally two. The first aim is to investigate and confirm the influence of the parameter B on the presence of the asymmetry of the averaged flow, and confirm the features described in the experimental results. The second important aspect is to investigate and observe the influence of the second variable, the Reynolds number, in the developing of the asymmetric flow itself. The results have shown the presence of the mentioned asymmetry as well as an influence of the Reynolds number on it.

Exact Algorithms for Different Classes of Vehicle Routing Problems

We deal with five problems arising in the field of logistics: the Asymmetric TSP (ATSP), the TSP with Time Windows (TSPTW), the VRP with Time Windows (VRPTW), the Multi-Trip VRP (MTVRP), and the Two-Echelon Capacitated VRP (2E-CVRP). The ATSP requires finding a lest-cost Hamiltonian tour in a digraph. We survey models and classical relaxations, and describe the most effective exact algorithms from the literature. A survey and analysis of the polynomial formulations is provided. The considered algorithms and formulations are experimentally compared on benchmark instances. The TSPTW requires finding, in a weighted digraph, a least-cost Hamiltonian tour visiting each vertex within a given time window. We propose a new exact method, based on new tour relaxations and dynamic programming. Computational results on benchmark instances show that the proposed algorithm outperforms the state-of-the-art exact methods. In the VRPTW, a fleet of identical capacitated vehicles located at a depot must be optimally routed to supply customers with known demands and time window constraints. Different column generation bounding procedures and an exact algorithm are developed. The new exact method closed four of the five open Solomon instances. The MTVRP is the problem of optimally routing capacitated vehicles located at a depot to supply customers without exceeding maximum driving time constraints. Two set-partitioning-like formulations of the problem are introduced. Lower bounds are derived and embedded into an exact solution method, that can solve benchmark instances with up to 120 customers. The 2E-CVRP requires designing the optimal routing plan to deliver goods from a depot to customers by using intermediate depots. The objective is to minimize the sum of routing and handling costs. A new mathematical formulation is introduced. Valid lower bounds and an exact method are derived. Computational results on benchmark instances show that the new exact algorithm outperforms the state-of-the-art exact methods.

Heuristic algorithms for the Capacitated Location-Routing Problem and the Multi-Depot Vehicle Routing Problem

The Capacitated Location-Routing Problem (CLRP) is a NP-hard problem since it generalizes two well known NP-hard problems: the Capacitated Facility Location Problem (CFLP) and the Capacitated Vehicle Routing Problem (CVRP). The Multi-Depot Vehicle Routing Problem (MDVRP) is known to be a NP-hard since it is a generalization of the well known Vehicle Routing Problem (VRP), arising with one depot. This thesis addresses heuristics algorithms based on the well-know granular search idea introduced by Toth and Vigo (2003) to solve the CLRP and the MDVRP. Extensive computational experiments on benchmark instances for both problems have been performed to determine the effectiveness of the proposed algorithms. This work is organized as follows: Chapter 1 describes a detailed overview and a methodological review of the literature for the the Capacitated Location-Routing Problem (CLRP) and the Multi-Depot Vehicle Routing Problem (MDVRP). Chapter 2 describes a two-phase hybrid heuristic algorithm to solve the CLRP. Chapter 3 shows a computational comparison of heuristic algorithms for the CLRP. Chapter 4 presents a hybrid granular tabu search approach for solving the MDVRP.

Nothing ever ends: il concetto di fine negli universi seriali

L'oggetto principale di questa tesi è il concetto di fine negli universi seriali. Spesso si intende il “The End” in un romanzo o in un film come un momento climatico, e che i finali sono collegati ad una teleologia che guida il testo nel suo insieme. Come risultato di questo modo di approcciare i finale, una delle opinioni più comuni è simile a quella di Henry James [1884] che diceva: “distribution at the last of prizes, pensions, husbands, wives, babies, millions, appended paragraph, and cheerful remarks”. Ma è molto difficile applicare la posizione di James a un romanzo modernista o a un film postmoderno e ancor ameno ai cosiddetti universi narrativi seriali, in cui la storia si sviluppa lungo decenni. Nel nostro contemporaneo panorama mediale, il testo non è più concepito come un'opera, ma deve essere costruito e concepito come un network, un ecosistema in cui nuove connessioni economiche e nuove relazioni bottom-up modellano una struttura inedita. Questa nuova struttura può riconfigurare il senso del finale e della fine, ma anche per le vast narratives spesso si dice che “Il finale non corrispondeva alla spirito della storia”, “il finale era deludente”. Potremmo sostenere che il concetto di finale sia ancora importante, nonostante sia stato superato dal punto di vista teorico. Per analizzare se il finale è costruito in un maniera non-lineare ma percepito come teleologico, la tesi è strutturata in due parti e di quattro capitoli. Prima parte “Storia” [1. Letteratura; 2. Cinema], seconda “Forme/strutture” [3. Transmedia; 4. Remix]

Metodi euristici per il Vehicle Routing Problem

Il problema della consegna di prodotti da un deposito/impianto ai clienti mediante una flotta di automezzi è un problema centrale nella gestione di una catena di produzione e distribuzione (supply chain). Questo problema, noto in letteratura come Vehicle Routing Problem (VRP), nella sua versione più semplice consiste nel disegnare per ogni veicolo disponibile presso un dato deposito aziendale un viaggio (route) di consegna dei prodotti ai clienti, che tali prodotti richiedono, in modo tale che (i) la somma delle quantità richieste dai clienti assegnati ad ogni veicolo non superi la capacità del veicolo, (ii) ogni cliente sia servito una ed una sola volta, (iii) sia minima la somma dei costi dei viaggi effettuati dai veicoli. Il VRP è un problema trasversale ad una molteplicità di settori merceologici dove la distribuzione dei prodotti e/o servizi avviene mediante veicoli su gomma, quali ad esempio: distribuzione di generi alimentari, distribuzione di prodotti petroliferi, raccolta e distribuzione della posta, organizzazione del servizio scuolabus, pianificazione della manutenzione di impianti, raccolta rifiuti, etc. In questa tesi viene considerato il Multi-Trip VRP, in cui ogni veicolo può eseguire un sottoinsieme di percorsi, chiamato vehicle schedule (schedula del veicolo), soggetto a vincoli di durata massima. Nonostante la sua importanza pratica, il MTVRP ha ricevuto poca attenzione in letteratura: sono stati proposti diversi metodi euristici e un solo algoritmo esatto di risoluzione, presentato da Mingozzi, Roberti e Toth. In questa tesi viene presentato un metodo euristico in grado di risolvere istanze di MTVRP in presenza di vincoli reali, quali flotta di veicoli non omogenea e time windows. L’euristico si basa sul modello di Prins. Sono presentati inoltre due approcci di local search per migliorare la soluzione finale. I risultati computazionali evidenziano l’efficienza di tali approcci.

Analysis and design of high performance multiphase electric drives for vehicle and aircraft applications

The first part of this thesis has focused on the construction of a twelve-phase asynchronous machine for More Electric Aircraft (MEA) applications. In fact, the aerospace world has found in electrification the way to improve the efficiency, reliability and maintainability of an aircraft. This idea leads to the aircraft a new management and distribution of electrical services. In this way is possible to remove or to reduce the hydraulic, mechanical and pneumatic systems inside the aircraft. The second part of this dissertation is dedicated on the enhancement of the control range of matrix converters (MCs) operating with non-unity input power factor and, at the same time, on the reduction of the switching power losses. The analysis leads to the determination in closed form of a modulation strategy that features a control range, in terms of output voltage and input power factor, that is greater than that of the traditional strategies under the same operating conditions, and a reduction in the switching power losses.

Analytical model for the prediction of wrinkling of rear pressure bulkheads

In Airbus GmbH (Hamburg) has been developed a new design of Rear Pressure Bulkhead (RPB) for the A320-family. The new model has been formed with vacuum forming technology. During this process the wrinkling phenomenon occurs. In this thesis is described an analytical model for prediction of wrinkling based on the energetic method of Timoshenko. Large deflection theory has been used for analyze two cases of study: a simply supported circular thin plate stamped by a spherical punch and a simply supported circular thin plate formed with vacuum forming technique. If the edges are free to displace radially, thin plates will develop radial wrinkles near the edge at a central deflection approximately equal to four plate thicknesses w0/ℎ≈4 if they’re stamped by a spherical punch and w0/ℎ≈3 if they’re formed with vacuum forming technique. Initially, there are four symmetrical wrinkles, but the number increases if the central deflection is increased. By using experimental results, the “Snaptrhough” phenomenon is described.

Autonomous Vehicle and Internet on Vehicles

In questa tesi mi occupo di spiegare come si comportano i veicoli autonomi per prendere tutte le decisioni e come i dati dei sensori di ogni auto vengono condivisi con la flotta di veicoli

Meccanismi di Gamification per interfacce human-vehicle

L’obiettivo principale di questa tesi è utilizzare le tecniche di gamification più importanti nella progettazione ed implementazione di un’interfaccia Human-Vehicle per creare un software che possa rendere la guida di un’automobile elettrica più efficace ed efficiente da parte del guidatore. Per lo sviluppo del software è stato svolto uno studio specifico sulla gamification, sulle interfacce Human-Vehicle e sulle macchine elettriche attualmente in produzione. Successivamente è stata svolta la fase di progettazione in cui sono stati creati dei mockup relativi all’interfaccia grafica ed è stato svolto un focus group. Infine è stato implementato il vero e proprio software di simulazione EcoGame ed è stato effettuato un test utenti.

Model Predictive Control for Vehicle Stabilization at the Limits of Handling

Recent developments in vehicle steering systems offer new opportunities to measure the steering torque and reliably estimate the vehicle sideslip and the tire-road friction coefficient. This paper presents an approach to vehicle stabilization that leverages these estimates to define state boundaries that exclude unstable vehicle dynamics and utilizes a model predictive envelope controller to bound the vehicle motion within this stable region of the state space. This approach provides a large operating region accessible by the driver and smooth interventions at the stability boundaries. Experimental results obtained with a steer-by-wire vehicle and a proof of envelope invariance demonstrate the efficacy of the envelope controller in controlling the vehicle at the limits of handling.