An heuristic approach for optimal location of gas supply units in transportation system

The best places to locate the Gas Supply Units (GSUs) on a natural gas systems and their optimal allocation to loads are the key factors to organize an efficient upstream gas infrastructure. The number of GSUs and their optimal location in a gas network is a decision problem that can be formulated as a linear programming problem. Our emphasis is on the formulation and use of a suitable location model, reflecting real-world operations and constraints of a natural gas system. This paper presents a heuristic model, based on lagrangean approach, developed for finding the optimal GSUs location on a natural gas network, minimizing expenses and maximizing throughput and security of supply.The location model is applied to the Iberian high pressure natural gas network, a system modelised with 65 demand nodes. These nodes are linked by physical and virtual pipelines – road trucks with gas in liquefied form. The location model result shows the best places to locate, with the optimal demand allocation and the most economical gas transport mode: by pipeline or by road truck.

Optimization model for medium term natural gas commitment

In this paper we study the optimal natural gas commitment for a known demand scenario. This study implies the best location of GSUs to supply all demands and the optimal allocation from sources to gas loads, through an appropriate transportation mode, in order to minimize total system costs. Our emphasis is on the formulation and use of a suitable optimization model, reflecting real-world operations and the constraints of natural gas systems. The mathematical model is based on a Lagrangean heuristic, using the Lagrangean relaxation, an efficient approach to solve the problem. Computational results are presented for Iberian and American natural gas systems, geographically organized in 65 and 88 load nodes, respectively. The location model results, supported by the computational application GasView, show the optimal location and allocation solution, system total costs and suggest a suitable gas transportation mode, presented in both numerical and graphic supports.

Natural gas system operation: lagrangean optimization techniques

To comply with natural gas demand growth patterns and Europe´s import dependency, the gas industry needs to organize an efficient upstream infrastructure. The best location of Gas Supply Units – GSUs and the alternative transportation mode – by phisical or virtual pipelines, are the key of a successful industry. In this work we study the optimal location of GSUs, as well as determining the most efficient allocation from gas loads to sources, selecting the best transportation mode, observing specific technical restrictions and minimizing system total costs. For the location of GSUs on system we use the P-median problem, for assigning gas demands nodes to source facilities we use the classical transportation problem. The developed model is an optimisation-based approach, based on a Lagrangean heuristic, using Lagrangean relaxation for P-median problems – Simple Lagrangean Heuristic. The solution of this heuristic can be improved by adding a local search procedure - the Lagrangean Reallocation Heuristic. These two heuristics, Simple Lagrangean and Lagrangean Reallocation, were tested on a realistic network - the primary Iberian natural gas network, organized with 65 nodes, connected by physical and virtual pipelines. Computational results are presented for both approaches, showing the location gas sources and allocation loads arrangement, system total costs and gas transportation mode.

A eficácia entre duas intervenções na Síndrome do Canal Cárpico

A Síndrome do Canal Cárpico (SCC) é a neuropatia compressiva mais comum do membro superior, causada pela compressão direta sobre o nervo mediano no interior do canal cárpico.Os resultados deste estudo mostram em cada um dos grupos, após a intervenção, uma melhoria estatisticamente significativa da sintomatologia no G-AFN (p=0,02) e no GTRN/ EAA (p=0,004) e uma melhoria estatisticamente significativa do estado funcional no G-AFN (p=0,022). Verificamos também em cada um dos grupos, após a intervenção, uma melhoria estatisticamente significativa na “Força de preensão” (p=0,005), na “Pinça polegar/dedo indicador” (p=0,021), na “Pinça polegar/dedo médio” (p=0,026) e “Pinça polegar/dedo anular” (p=0,026) no G-AFN, e uma melhoria estatisticamente significativa na “Pinça polegar/indicador” (p=0,016), na “Pinça polegar/dedo médio” (p=0,035), na “Pinça polegar/dedo anular” (p=0,010), na “Pinça trípode” (p=0,005) e na “Pinça lateral” (p=0,051) no G-TRN/EAA. Após a intervenção, não verificamos diferenças estatisticamente significativas nos valores das escalas de gravidade de sintomas (p=0,853) e de estado funcional (p=0,148) entre os grupos, mas diferenças estatisticamente significativas nos valores dos testes neurofisiológicos (p=0,047) e força de preensão da mão (p=0,005). Do estudo, concluímos que a utilização da intervenção articular/fascial/neural (AFN) e a intervenção com tala de repouso noturna e exercícios de auto alongamento (TRN/EAA), beneficia os indivíduos com SCC não severa, como nos casos incipientes, ligeiros ou moderados. Os indivíduos com esta condição clínica apresentam sintomatologia caraterística de dor, parestesia, especialmente noturna e disfunção muscular da mão. Tais manifestações originam perda funcional com implicações nas áreas de desempenho ocupacional, nomeadamente, nas atividades da vida diária, produtivas e de lazer. O tratamento conservador na SCC não severa, como nos casos incipientes, ligeiros e moderados, apesar de controverso, é recomendado. O tema suscita o nosso interesse, razão pela qual nos propomos realizar um estudo experimental em indivíduos com o diagnóstico clínico de SCC não severa e aplicar num grupo a intervenção articular, fascial e neural (AFN) e noutro grupo a intervenção com tala de repouso noturna e exercícios de auto alongamento (TRN/EAA). O estudo tem como principais objetivos, por um lado, verificar o impacto das intervenções em cada um dos grupos e, por outro lado, comparar o seu impacto entre os grupos, no que respeita à gravidade de sintomas, ao estado funcional, à força de preensão da mão e força de pinças finas. Fomos também comparar os resultados dos testes neurofisiológicos (Velocidade de Condução Motora) antes e depois da intervenção AFN e da intervenção com TRN/EAA, e averiguar o seu impacto nos valores da latência motora distal e da velocidade de condução sensitiva, entre os grupos. Identificamos também quais as variáveis sócio demográficas e as que caraterizam a patologia que estão relacionadas com o problema em estudo e com os valores obtidos com as escalas do Boston Carpal Tunnel Questionnaire (BCTQ), no grupo articular, fascial e neural (G-AFN) e no grupo com tala de repouso noturna e exercícios de auto alongamento (G-TRN/EAA). Para a concretização do estudo, recorremos a uma amostra de 23 indivíduos de ambos os sexos do Hospital Curry Cabral, Empresa Pública Empresarial -Centro Hospitalar de Lisboa Central (HCC, EPE -CHLC).

Analysis of the domain of applicability of an algorithm for a resources system selection problem for Distributed/Agile/Virtual Enterprises integration

The process of resources systems selection takes an important part in Distributed/Agile/Virtual Enterprises (D/A/V Es) integration. However, the resources systems selection is still a difficult matter to solve in a D/A/VE, as it is pointed out in this paper. Globally, we can say that the selection problem has been equated from different aspects, originating different kinds of models/algorithms to solve it. In order to assist the development of a web prototype tool (broker tool), intelligent and flexible, that integrates all the selection model activities and tools, and with the capacity to adequate to each D/A/V E project or instance (this is the major goal of our final project), we intend in this paper to show: a formulation of a kind of resources selection problem and the limitations of the algorithms proposed to solve it. We formulate a particular case of the problem as an integer programming, which is solved using simplex and branch and bound algorithms, and identify their performance limitations (in terms of processing time) based on simulation results. These limitations depend on the number of processing tasks and on the number of pre-selected resources per processing tasks, defining the domain of applicability of the algorithms for the problem studied. The limitations detected open the necessity of the application of other kind of algorithms (approximate solution algorithms) outside the domain of applicability founded for the algorithms simulated. However, for a broker tool it is very important the knowledge of algorithms limitations, in order to, based on problem features, develop and select the most suitable algorithm that guarantees a good performance.

A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions

The container loading problem (CLP) is a combinatorial optimization problem for the spatial arrangement of cargo inside containers so as to maximize the usage of space. The algorithms for this problem are of limited practical applicability if real-world constraints are not considered, one of the most important of which is deemed to be stability. This paper addresses static stability, as opposed to dynamic stability, looking at the stability of the cargo during container loading. This paper proposes two algorithms. The first is a static stability algorithm based on static mechanical equilibrium conditions that can be used as a stability evaluation function embedded in CLP algorithms (e.g. constructive heuristics, metaheuristics). The second proposed algorithm is a physical packing sequence algorithm that, given a container loading arrangement, generates the actual sequence by which each box is placed inside the container, considering static stability and loading operation efficiency constraints.

Dynamic stability metrics for the container loading problem

The Container Loading Problem (CLP) literature has traditionally evaluated the dynamic stability of cargo by applying two metrics to box arrangements: the mean number of boxes supporting the items excluding those placed directly on the floor (M1) and the percentage of boxes with insufficient lateral support (M2). However, these metrics, that aim to be proxies for cargo stability during transportation, fail to translate real-world cargo conditions of dynamic stability. In this paper two new performance indicators are proposed to evaluate the dynamic stability of cargo arrangements: the number of fallen boxes (NFB) and the number of boxes within the Damage Boundary Curve fragility test (NB_DBC). Using 1500 solutions for well-known problem instances found in the literature, these new performance indicators are evaluated using a physics simulation tool (StableCargo), replacing the real-world transportation by a truck with a simulation of the dynamic behaviour of container loading arrangements. Two new dynamic stability metrics that can be integrated within any container loading algorithm are also proposed. The metrics are analytical models of the proposed stability performance indicators, computed by multiple linear regression. Pearson’s r correlation coefficient was used as an evaluation parameter for the performance of the models. The extensive computational results show that the proposed metrics are better proxies for dynamic stability in the CLP than the previous widely used metrics.