Optimization of the long-term planning of supply chains with decaying performance

This master's thesis addresses the optimization of supply and distribution chains considering the effect that equipment aging may cause over the performance of facilities involved in the process. The decaying performance of the facilities is modeled as an exponential equation and can be either physical or economic, thus giving rise to a novel mixed integer non-linear programming (MINLP) formulation. The optimization model has been developed based on a typical chemical supply chain. Thus, the best long-term investment plan has to be determined given production nodes, their production capacity and expected evolution; aggregated consumption nodes (urban or industrial districts) and their lumped demand (and expected evolution); actual and potential distribution nodes; distances between the nodes of the network; and a time horizon. The model includes the balances in each node, a general decaying performance function, and a cost function, as well as constraints to be satisfied. Hence, the investment plan (decision variables) consists not only on the start-up and shutdown of alternative distribution facilities, but also on the sizing of the lines satisfying the flows. The model has been implemented using GAMS optimization software. Results considering a variety of scenarios have been discussed. In addition, different approaches to the starting point for the model have been compared, showing the importance of initializing the optimization algorithm. The capabilities of the proposed approach have been tested through its application to two case studies: a natural gas network with physical decaying performance and an electricity distribution network with economic decaying performance. Each case study is solved with a different procedure to obtain results. Results demonstrate that overlooking the effect of equipment aging can lead to infeasible (for physical decaying performance) or unrealistic (for economic decaying performance) solutions in practice and show how the proposed model allows overcoming such limitations thus becoming a practical tool to support the decision-making process in the distribution secto

MILP formulation for controlled islanding of power networks

This paper presents a flexible optimization approach to the problem of intentionally forming islands in a power network. A mixed integer linear programming (MILP) formulation is given for the problem of deciding simultaneously on the boundaries of the islands and adjustments to generators, so as to minimize the expected load shed while ensuring no system constraints are violated. The solution of this problem is, within each island, balanced in load and generation and satisfies steady-state DC power flow equations and operating limits. Numerical tests on test networks up to 300 buses show the method is computationally efficient. A subsequent AC optimal load shedding optimization on the islanded network model provides a solution that satisfies AC power flow. Time-domain simulations using second-order models of system dynamics show that if penalties were included in the MILP to discourage disconnecting lines and generators with large flows or outputs, the actions of network splitting and load shedding did not lead to a loss of stability

Energy Cost Optimization for Strongly Stable Multi-Hop Green Cellular Networks

Last decade witnessed the explosive growth in mobile devices and their traffic demand, and hence the significant increase in the energy cost of the cellular service providers. One major component of energy expenditure comes from the operation of base stations. How to reduce energy cost of base stations while satisfying users’ soaring demands has become an imperative yet challenging problem. In this dissertation, we investigate the minimization of the long-term time-averaged expected energy cost while guaranteeing network strong stability. Specifically, considering flow routing, link scheduling, and energy constraints, we formulate a time-coupling stochastic Mixed-Integer Non-Linear Programming (MINLP) problem, which is prohibitively expensive to solve. We reformulate the problem by employing Lyapunov optimization theory and develop a decomposition based algorithm which ensures network strong stability. We obtain the bounds on the optimal result of the original problem and demonstrate the tightness of the bounds and the efficacy of the proposed scheme

Polynomial time algorithms for multicast network code construction

The famous max-flow min-cut theorem states that a source node s can send information through a network (V, E) to a sink node t at a rate determined by the min-cut separating s and t. Recently, it has been shown that this rate can also be achieved for multicasting to several sinks provided that the intermediate nodes are allowed to re-encode the information they receive. We demonstrate examples of networks where the achievable rates obtained by coding at intermediate nodes are arbitrarily larger than if coding is not allowed. We give deterministic polynomial time algorithms and even faster randomized algorithms for designing linear codes for directed acyclic graphs with edges of unit capacity. We extend these algorithms to integer capacities and to codes that are tolerant to edge failures

Applications of fuzzy counterpropagation neural networks to non-linear function approximation and background noise elimination

An adaptive filter which can operate in an unknown environment by performing a learning mechanism that is suitable for the speech enhancement process. This research develops a novel ANN model which incorporates the fuzzy set approach and which can perform a non-linear function approximation. The model is used as the basic structure of an adaptive filter. The learning capability of ANN is expected to be able to reduce the development time and cost of the designing adaptive filters based on fuzzy set approach. A combination of both techniques may result in a learnable system that can tackle the vagueness problem of a changing environment where the adaptive filter operates. This proposed model is called Fuzzy Counterpropagation Network (Fuzzy CPN). It has fast learning capability and self-growing structure. This model is applied to non-linear function approximation, chaotic time series prediction and background noise elimination

Risk-aware Urban Air Mobility Network Design with Overflow Redundancy

Urban Air Mobility (UAM), as envisioned by researchers and practitioners, will be achieved through the use of highly automated aircraft that operate and transport passengers and cargo at low altitudes within urban and suburban areas. To operate in complex urban environment, precise air traffic management, in particular the management of traffic overflows due to operational disruptions will be critical to ensuring system safety and efficiency. To this end, we propose a methodology for the design of UAM networks with reserve capacity, i.e., a design where alternative landing options and flight corridors are explicitly considered as a means of improving contingency management and reducing risk. Similar redundancy considerations are incorporated in the design of many critical infrastructures, yet remain unexploited in the air transportation literature. In our methodology, we first model how disruptions to a given on-demand UAM network might impact on the nominal traffic flow and how this flow might be re-accommodated on an extended network with reserve capacity. Then, through an optimization problem, we select the locations and capacities for the backup vertiports with the maximal expected throughput of the extended network over all possible disruption scenarios, while the throughput is the maximal amount of flights that the network can accommodate per unit of time. We show that we can obtain the solution for the corresponding bi-level and bi-linear optimization problem by solving a mixed-integer linear program. We demonstrate our methodology in the case study using networks from Milwaukee, Atlanta, and Dallas--Fort Worth metropolitan areas and show how the throughput and flexibility of the UAM networks with reserve capacity can outcompete those without.Comment: 43 pages, 10 figure

Building Project Activities/Tasks Time Scheduling using a Linear Programming Model

The problem with the management of construction works is the ability to create a good work breakdown structure (WBS); determine inter-relationship among tasks; determine duration for each of the tasks and to create a workable schedule. Most locally handled construction work always experience such problems as: increase cost of project work; project work not delivered within the expected time (schedule slippage); resource constraint (limitation) etc. This study involves data collection from project supervisor; identification of the activities/tasks in the project; precedence relationship amongst the activities/tasks; developed a network diagram; formulate the Linear programming Model of both the earliest start time (EST) and the latest start time (LST); solve the model using TORA to Obtain the EST and LST of each activity/Task of the Project; determine the activities/tasks which are critical to the timely completion of the project; float for activities/tasks in the project. The result shows that the expected completion time for the project is 210 days (30 weeks) and the critical activities are activity X1-X2-X3-X4-X5-X7-X8-X9-X10-X12-X19-X14-X17-X20 {site clearing; setting out; foundation excavation; blinding; block work to DPC; filling and compaction of DPC; mass concrete slab; block work to final level; roofing/roof covering; ceiling finishing; electrical fittings; floor screeding;   painting internal/external walls; commissioning} The Non critical activities are Construction of isolated column base (X6), Installation of doors and windows frame (X15), Installation of blackboards (X16), Installation of doors and windows (X18) and their “total float” is  4, 3, 7 and 4 days respectively. Keywords: Task time, Precedence relationship, Project scheduling, linear programming method, work breakdown structur