4 resultados para large transportation network

em QSpace: Queen's University - Canada


Relevância:

90.00% 90.00%

Publicador:

Resumo:

This paper is concerned with strategic optimization of a typical industrial chemical supply chain, which involves a material purchase and transportation network, several manufacturing plants with on-site material and product inventories, a product transportation network and several regional markets. In order to address large uncertainties in customer demands at the different regional markets, a novel robust scenario formulation, which has been developed by the authors recently, is tailored and applied for the strategic optimization. Case study results show that the robust scenario formulation works well for this real industrial supply chain system, and it outperforms the deterministic formulation and the classical scenario-based stochastic programming formulation by generating better expected economic performance and solutions that are guaranteed to be feasible for all uncertainty realizations. The robust scenario problem exhibits a decomposable structure that can be taken advantage of by Benders decomposition for efficient solution, so the application of Benders decomposition to the solution of the strategic optimization is also discussed. The case study results show that Benders decomposition can reduce the solution time by almost an order of magnitude when the number of scenarios in the problem is large.

Relevância:

90.00% 90.00%

Publicador:

Resumo:

Bridges are a critical part of North America’s transportation network that need to be assessed frequently to inform bridge management decision making. Visual inspections are usually implemented for this purpose, during which inspectors must observe and report any excess displacements or vibrations. Unfortunately, these visual inspections are subjective and often highly variable and so a monitoring technology that can provide quantitative measurements to supplement inspections is needed. Digital Image Correlation (DIC) is a novel monitoring technology that uses digital images to measure displacement fields without any contact with the bridge. In this research, DIC and accelerometers were used to investigate the dynamic response of a railway bridge reported to experience large lateral displacements. Displacements were estimated using accelerometer measurements and were compared to DIC measurements. It was shown that accelerometers can provide reasonable estimates of displacement for zero-mean lateral displacements. By comparing measurements in the girder and in the piers, it was shown that for the bridge monitored, the large lateral displacements originated in the steel casting bearings positioned above the piers, and not in the piers themselves. The use of DIC for evaluating the effectiveness of rehabilitation of the LaSalle Causeway lift bridge in Kingston, Ontario was also investigated. Vertical displacements were measured at midspan and at the lifting end of the bridge during a static test and under dynamic live loading. The bridge displacements were well within the operating limits, however a gap at the lifting end of the bridge was identified. Rehabilitation of the bridge was conducted and by comparing measurements before and after rehabilitation, it was shown that the gap was successfully closed. Finally, DIC was used to monitor the midspan vertical and lateral displacements in a monitoring campaign of five steel rail bridges. DIC was also used to evaluate the effectiveness of structural rehabilitation of the lateral bracing of a bridge. Simple finite element models are developed using DIC measurements of displacement. Several lessons learned throughout this monitoring campaign are discussed in the hope of aiding future researchers.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

A scenario-based two-stage stochastic programming model for gas production network planning under uncertainty is usually a large-scale nonconvex mixed-integer nonlinear programme (MINLP), which can be efficiently solved to global optimality with nonconvex generalized Benders decomposition (NGBD). This paper is concerned with the parallelization of NGBD to exploit multiple available computing resources. Three parallelization strategies are proposed, namely, naive scenario parallelization, adaptive scenario parallelization, and adaptive scenario and bounding parallelization. Case study of two industrial natural gas production network planning problems shows that, while the NGBD without parallelization is already faster than a state-of-the-art global optimization solver by an order of magnitude, the parallelization can improve the efficiency by several times on computers with multicore processors. The adaptive scenario and bounding parallelization achieves the best overall performance among the three proposed parallelization strategies.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Aberrant behavior of biological signaling pathways has been implicated in diseases such as cancers. Therapies have been developed to target proteins in these networks in the hope of curing the illness or bringing about remission. However, identifying targets for drug inhibition that exhibit good therapeutic index has proven to be challenging since signaling pathways have a large number of components and many interconnections such as feedback, crosstalk, and divergence. Unfortunately, some characteristics of these pathways such as redundancy, feedback, and drug resistance reduce the efficacy of single drug target therapy and necessitate the employment of more than one drug to target multiple nodes in the system. However, choosing multiple targets with high therapeutic index poses more challenges since the combinatorial search space could be huge. To cope with the complexity of these systems, computational tools such as ordinary differential equations have been used to successfully model some of these pathways. Regrettably, for building these models, experimentally-measured initial concentrations of the components and rates of reactions are needed which are difficult to obtain, and in very large networks, they may not be available at the moment. Fortunately, there exist other modeling tools, though not as powerful as ordinary differential equations, which do not need the rates and initial conditions to model signaling pathways. Petri net and graph theory are among these tools. In this thesis, we introduce a methodology based on Petri net siphon analysis and graph network centrality measures for identifying prospective targets for single and multiple drug therapies. In this methodology, first, potential targets are identified in the Petri net model of a signaling pathway using siphon analysis. Then, the graph-theoretic centrality measures are employed to prioritize the candidate targets. Also, an algorithm is developed to check whether the candidate targets are able to disable the intended outputs in the graph model of the system or not. We implement structural and dynamical models of ErbB1-Ras-MAPK pathways and use them to assess and evaluate this methodology. The identified drug-targets, single and multiple, correspond to clinically relevant drugs. Overall, the results suggest that this methodology, using siphons and centrality measures, shows promise in identifying and ranking drugs. Since this methodology only uses the structural information of the signaling pathways and does not need initial conditions and dynamical rates, it can be utilized in larger networks.