Transformations of bridging ligands in diiron complexes: unconventional routes to new functionalized multisite bound organic frames

The main scope of this Ph.D. thesis has concerned the possible transformations of bridging ligands in diiron complexes, in order to explore unconventional routes to the synthesis of new functionalized multisite bound organic frames. The results achieved during the Ph.D. can be summarized in the following points: 1) We have extended the assembling between small unsaturated molecules and bridging carbyne ligands in diiron complexes to other species. In particular, we have investigated the coupling between olefins and thiocarbyne, leading to the synthesis of thioallylidene bridging diiron complexes. Then, we have extended the study to the coupling between olefins and aminocarbyne. This result shows that the coupling between activated olefins and heteroatom substituted bridging carbynes has a general character. 2) As we have shown, the coupling of bridging alkylidyne ligands with alkynes and alkenes provides excellent routes to the synthesis of bridging C3 hydrocarbyl ligands. As a possible extension of these results we have examined the synthesis of C4 bridging frames through the combination of bridging alkylidynes with allenes. Also in this case the reaction has a general character. 3) Diiron complexes bearing bridging functionalized C3 organic frames display the presence of donor atoms, such as N and S, potentially able to coordinate unsaturated metal fragments. Thus, we have studied the possibility for these systems to act as ‘organometallic ligands’, in particular towards Pd and Rh. 4) The possibility of releasing the organic frame from the bridging coordination appears particularly appealing in the direction of a metal-assisted organic synthesis. Within this field, we have investigated the possibility of involving the C3 bridging ligand in cycloaddition reactions with alkynes, with the aim of generating variously functionalized five-membered cycles. The [3+2] cyclization does not lead to the complete release of the organic fragment but rather it produces its transformation into a cyclopentadienyl ring, which remains coordinated to one Fe atom. This result introduces a new approach to the formation of polyfunctionalised ferrocenes. 5) Furthermore, I have spent a research period of about six months at the Department of Inorganic Chemistry of the Barcelona University, under the supervision of Prof. Concepción López, with the aim of studying the chemistry of polydentate ferrocenyl ligands and their use in organometallic synthesis.

Evaluation of the effects of insertion of viscous dampers in Moment Resisting Frames

This research work faces the problem of insertion of viscous dampers into Moment Resisiting Frames (MRF) for maximum efficiency in mitigation of the seismic effects. The work would lead to a precise design indication. The fundamental result of the thesis consists in showing that, even for moment-resisting structures, you can design a system of added viscous dampers able to achieve target levels of performances. Ie given the reduction factor in the seismic response, discover the characteristics of the viscous dampers which allow to achieve 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.

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.