Constructive Heuristics for the Minimum Labelling Spanning Tree Problem: a preliminary comparison

This report studies constructive heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is to find a spanning tree that uses edges that are as similar as possible. Given an undirected labeled connected graph (i.e., with a label or color for each edge), the minimum labeling spanning tree problem seeks a spanning tree whose edges have the smallest possible number of distinct labels. The model can represent many real-world problems in telecommunication networks, electric networks, and multimodal transportation networks, among others, and the problem has been shown to be NP-complete even for complete graphs. A primary heuristic, named the maximum vertex covering algorithm has been proposed. Several versions of this constructive heuristic have been proposed to improve its efficiency. Here we describe the problem, review the literature and compare some variants of this algorithm

Solving the minimum labelling spanning tree problem using hybrid local search

Given a connected, undirected graph whose edges are labelled (or coloured), the minimum labelling spanning tree (MLST) problem seeks a spanning tree whose edges have the smallest number of distinct labels (or colours). In recent work, the MLST problem has been shown to be NP-hard and some effective heuristics (Modified Genetic Algorithm (MGA) and Pilot Method (PILOT)) have been proposed and analyzed. A hybrid local search method, that we call Group-Swap Variable Neighbourhood Search (GS-VNS), is proposed in this paper. It is obtained by combining two classic metaheuristics: Variable Neighbourhood Search (VNS) and Simulated Annealing (SA). Computational experiments show that GS-VNS outperforms MGA and PILOT. Furthermore, a comparison with the results provided by an exact approach shows that we may quickly obtain optimal or near-optimal solutions with the proposed heuristic

Pooling problem: Alternate formulations and solution methods

Copyright @ 2004 INFORMSThe pooling problem, which is fundamental to the petroleum industry, describes a situation in which products possessing different attribute qualities are mixed in a series of pools in such a way that the attribute qualities of the blended products of the end pools must satisfy given requirements. It is well known that the pooling problem can be modeled through bilinear and nonconvex quadratic programming. In this paper, we investigate how best to apply a new branch-and-cut quadratic programming algorithm to solve the pooling problem. To this effect, we consider two standard models: One is based primarily on flow variables, and the other relies on the proportion. of flows entering pools. A hybrid of these two models is proposed for general pooling problems. Comparison of the computational properties of flow and proportion models is made on several problem instances taken from the literature. Moreover, a simple alternating procedure and a variable neighborhood search heuristic are developed to solve large instances and compared with the well-known method of successive linear programming. Solution of difficult test problems from the literature is substantially accelerated, and larger ones are solved exactly or approximately.This project was funded by Ultramar Canada and Luc Massé. The work of C. Audet was supported by NSERC (Natural Sciences and Engineering Research Council) fellowship PDF-207432-1998 and by CRPC (Center for Research on Parallel Computation). The work of J. Brimberg was supported by NSERC grant #OGP205041. The work of P. Hansen was supported by FCAR(Fonds pour la Formation des Chercheurs et l’Aide à la Recherche) grant #95ER1048, and NSERC grant #GP0105574

Mejora de la exploración y la explotación de las heurísticas constructivas para el MLSTP

En este trabajo se proponen dos mejoras para aumentar la explotación y la exploración del clásico algoritmo constructivo MVCA para el problema del árbol generador etiquetado mínimo (Minimum Labelling Spanning Tree Problem; MLSTP). Se describe la aplicación de contrastes de hipótesis no paramétricos para contrastar tales mejoras. En el MLSTP se parte de un grafo conexo con aristas de distinto tipo y se trata de encontrar el árbol generador con las aristas más parecidas posible. Cada tipo de arista viene identificado por un color o etiqueta y el árbol generador óptimo es aquel que usa el menor número de colores. Los tiempos y soluciones obtenidas son comparables a los mejores resultados aparecidos en la literatura para el MLSTP

Piston middle position test, Variable Stator Vane Actuator of engine CFM56-3 /-5 /-7

Compressor is surely the most complex part of engine, and during projecting of engine, ensure safe operation of the compressor is very difficult job. In support of this is the fact that the most of accessories (sensors and actuators) are in connection with compressor, but two most important systems are VBV and VSV systems. In this work, we will observe VSV system, respectively VSV Actuator. Our research have a quest to decrees some remarked problems which occur during work on VSV Actuator, and of course we will offer a solution for remarked problem in term of adding another one point in test. Also, our suggestion is creating incoming inspection, pre-test inspection with the points to be listed in below

Electrochemical and wetting behavior of as-cast Sn-Zn-Sb lead free solders alloys

Ternary alloys SnZn12Sb8, SnZn10Sb10, SnZn8Sb12, SnZn6Sb14, and SnZn2Sb18 were prepared by induction melting. Electrochemical behavior and wetting (contact angle) of prepared as-cast samples were investigated using open circuit potential measurement and sessile drop technique. The results of electrochemical investigation show that open-circuit potential, few seconds after immersing of electrodes, shifts toward more negative values, indicating a relatively smaller rate of dissolution during the spontaneous dissolution process under the curentless conditions. After that period, the values of potential tend to be constant with time. It was found that all investigated alloys have poor wettability on copper substrate and the contact angle values decrease with increasing superheat temperature

Modifikacija strukture smektita sumpornom kiselinom i karakteristike modifikovanih smektita

Bentonite samples from Petrovac and Aleksinac were treated with sulfuric acid of different molarities. Differences in structure and texture of the initial and modified bentonite were determined by chemical analysis and Xraypowder diffraction (XRPD), infra-red spectroscopy (FTIR), scanning electron microscopy (SEM) and physisorption nitrogen at -196°C. Sulfuric acid caused an exchange of Al3+, Fe3+ and Mg2+ with H+ ions which led to a modification of the smectite crystalline structure. The Mg and Fe substitution in the octahedral sheet promoted the dispersion of those layers and forming of amorphous silicon. The sequence according to which the cations left the octahedral sheets was as follows: Mg2+>Fe3+>Al3+. The sulfuric acid activated bentonites exhibiting a lower cation exchange capacity (CEC) and a change of specific surface area (SBET) from 6 to 387 for bentonite from Petrovac and from 44 to 1784 m2 g-1 for bentonite from Aleksinac, positioning them as an excellent absorber in wine technology and in the protection of soil and environment.Uzorci bentonita iz Petrovca i Aleksinca tretirani su različitim molaritetima sumporne kiseline. Promene u strukturi i teksturi polaznih i modifikovanih bentonita utvrđene su hemijskom i analizom rendgenske difrakcije praha X-zraka (XRPD), infra crvenom spektroskopijom (FTIR), skening elektronskom mikroskopijom (SEM) i fizisorpcijom azota na -196°C. Dejstvo H2SO4 kiseline izazvalo je zamenu Al3+, Fe3+ i Mg2+ sa H+ jonima što je dovelo do modifikacije kristalne strukture smektita. Supstitucija Mg i Fe u oktaedarskom listu smektita promovisala je raspuštanje tih slojeva i formiranje silikatne faze. Redosled kojim su ovi katjoni napuštali oktaedarske listove bio je sledeći: Mg2+>Fe3+>Al3+. Sumpornom kiselinom aktivirani bentoniti pokazali su niži kapacitet katjonske izmene (CEC) i promenu specifične površine (SBET), od 6 na 387 kod bentonita Petrovca i od 44 na 1784 m2 g-1 kod bentonita Aleksinca, što ih svrstava u odlične absorbente u tehnologiji vina, zaštiti zemljišta i životne sredine

Numerical analysis of thermal stresses in welded joint made of steels x20 and x22

Stress calculation of steam pipeline is presented, focused on the welded joint. Numerical calculation was peiformed using the finite element method to obtain stress distribution in the welded joint made while replacing the valve chamber. Dissimilar materials were used, namely steel 10CrMoV9-10 according to EN 10216-2 for the valve chamber, the rest of steam pipeline was steel X20, whereas the transition piece material was steel X22. Residual stresses were calculated, in addition to design stresses, indicating critical regions and necessity for post-weld heat treatment

A SUGGESTION FOR PROACTIVE CARDIOLOGIC APPROACH TO CUSHING’S SYNDROME OR DISEASE

Numerous studies and reviews agree about the increased cardiovascular risk in Cushing’s syn-drome. Therefore, the aim of the paper is to suggest a few common diagnostic and therapeutic cardiologic preferences for the majority of Cushing’s syndrome/Cushing’s disease (CS/CD) pa-tients which are not yet routine but have the rationale to become standard procedures. This may serve as an initial working document, to be improved by the experts in the field. A narrative review is used to present synthesis and deduction of several approaches in cardiology regarding the actu-al topic. Results are systematized as the risk factors or co-morbidities list (prevalent in CS/CD) coupled with current and adapted cardiologic suggestions for practice

The Incremental Cooperative Design of Preventive Healthcare Networks

This document is the Accepted Manuscript version of the following article: Soheil Davari, 'The incremental cooperative design of preventive healthcare networks', Annals of Operations Research, first published online 27 June 2017. Under embargo. Embargo end date: 27 June 2018. The final publication is available at Springer via http://dx.doi.org/10.1007/s10479-017-2569-1.In the Preventive Healthcare Network Design Problem (PHNDP), one seeks to locate facilities in a way that the uptake of services is maximised given certain constraints such as congestion considerations. We introduce the incremental and cooperative version of the problem, IC-PHNDP for short, in which facilities are added incrementally to the network (one at a time), contributing to the service levels. We first develop a general non-linear model of this problem and then present a method to make it linear. As the problem is of a combinatorial nature, an efficient Variable Neighbourhood Search (VNS) algorithm is proposed to solve it. In order to gain insight into the problem, the computational studies were performed with randomly generated instances of different settings. Results clearly show that VNS performs well in solving IC-PHNDP with errors not more than 1.54%.Peer reviewe