Charging cost optimization for EV buses using neural network based energy predictor

NARCIS (Netherlands)

Nageshrao, S.P.; Jacob, J.; Wilkins, S.

2017-01-01

For conventional buses, based on the decades of their operational knowledge, public transport companies are able to optimize their cost of operation. However, with recent trend in the usage of electric buses, cost optimal operation can become challenging. In this paper an offline optimal charging

Cost optimization model and its heuristic genetic algorithms

International Nuclear Information System (INIS)

Liu Wei; Wang Yongqing; Guo Jilin

1999-01-01

Interest and escalation are large quantity in proportion to the cost of nuclear power plant construction. In order to optimize the cost, the mathematics model of cost optimization for nuclear power plant construction was proposed, which takes the maximum net present value as the optimization goal. The model is based on the activity networks of the project and is an NP problem. A heuristic genetic algorithms (HGAs) for the model was introduced. In the algorithms, a solution is represented with a string of numbers each of which denotes the priority of each activity for assigned resources. The HGAs with this encoding method can overcome the difficulty which is harder to get feasible solutions when using the traditional GAs to solve the model. The critical path of the activity networks is figured out with the concept of predecessor matrix. An example was computed with the HGAP programmed in C language. The results indicate that the model is suitable for the objectiveness, the algorithms is effective to solve the model

Optimal design of cluster-based ad-hoc networks using probabilistic solution discovery

International Nuclear Information System (INIS)

Cook, Jason L.; Ramirez-Marquez, Jose Emmanuel

2009-01-01

The reliability of ad-hoc networks is gaining popularity in two areas: as a topic of academic interest and as a key performance parameter for defense systems employing this type of network. The ad-hoc network is dynamic and scalable and these descriptions are what attract its users. However, these descriptions are also synonymous for undefined and unpredictable when considering the impacts to the reliability of the system. The configuration of an ad-hoc network changes continuously and this fact implies that no single mathematical expression or graphical depiction can describe the system reliability-wise. Previous research has used mobility and stochastic models to address this challenge successfully. In this paper, the authors leverage the stochastic approach and build upon it a probabilistic solution discovery (PSD) algorithm to optimize the topology for a cluster-based mobile ad-hoc wireless network (MAWN). Specifically, the membership of nodes within the back-bone network or networks will be assigned in such as way as to maximize reliability subject to a constraint on cost. The constraint may also be considered as a non-monetary cost, such as weight, volume, power, or the like. When a cost is assigned to each component, a maximum cost threshold is assigned to the network, and the method is run; the result is an optimized allocation of the radios enabling back-bone network(s) to provide the most reliable network possible without exceeding the allowable cost. The method is intended for use directly as part of the architectural design process of a cluster-based MAWN to efficiently determine an optimal or near-optimal design solution. It is capable of optimizing the topology based upon all-terminal reliability (ATR), all-operating terminal reliability (AoTR), or two-terminal reliability (2TR)

Robust Optimization of Fourth Party Logistics Network Design under Disruptions

Directory of Open Access Journals (Sweden)

Jia Li

2015-01-01

Full Text Available The Fourth Party Logistics (4PL network faces disruptions of various sorts under the dynamic and complex environment. In order to explore the robustness of the network, the 4PL network design with consideration of random disruptions is studied. The purpose of the research is to construct a 4PL network that can provide satisfactory service to customers at a lower cost when disruptions strike. Based on the definition of β-robustness, a robust optimization model of 4PL network design under disruptions is established. Based on the NP-hard characteristic of the problem, the artificial fish swarm algorithm (AFSA and the genetic algorithm (GA are developed. The effectiveness of the algorithms is tested and compared by simulation examples. By comparing the optimal solutions of the 4PL network for different robustness level, it is indicated that the robust optimization model can evade the market risks effectively and save the cost in the maximum limit when it is applied to 4PL network design.

Improved Cost-Base Design of Water Distribution Networks using Genetic Algorithm

Science.gov (United States)

Moradzadeh Azar, Foad; Abghari, Hirad; Taghi Alami, Mohammad; Weijs, Steven

2010-05-01

Population growth and progressive extension of urbanization in different places of Iran cause an increasing demand for primary needs. The water, this vital liquid is the most important natural need for human life. Providing this natural need is requires the design and construction of water distribution networks, that incur enormous costs on the country's budget. Any reduction in these costs enable more people from society to access extreme profit least cost. Therefore, investment of Municipal councils need to maximize benefits or minimize expenditures. To achieve this purpose, the engineering design depends on the cost optimization techniques. This paper, presents optimization models based on genetic algorithm(GA) to find out the minimum design cost Mahabad City's (North West, Iran) water distribution network. By designing two models and comparing the resulting costs, the abilities of GA were determined. the GA based model could find optimum pipe diameters to reduce the design costs of network. Results show that the water distribution network design using Genetic Algorithm could lead to reduction of at least 7% in project costs in comparison to the classic model. Keywords: Genetic Algorithm, Optimum Design of Water Distribution Network, Mahabad City, Iran.

Effects of cost metric on cost-effectiveness of protected-area network design in urban landscapes.

Science.gov (United States)

Burkhalter, J C; Lockwood, J L; Maslo, B; Fenn, K H; Leu, K

2016-04-01

A common goal in conservation planning is to acquire areas that are critical to realizing biodiversity goals in the most cost-effective manner. The way monetary acquisition costs are represented in such planning is an understudied but vital component to realizing cost efficiencies. We sought to design a protected-area network within a forested urban region that would protect 17 birds of conservation concern. We compared the total costs and spatial structure of the optimal protected-area networks produced using three acquisition-cost surrogates (area, agricultural land value, and tax-assessed land value). Using the tax-assessed land values there was a 73% and 78% cost savings relative to networks derived using area or agricultural land value, respectively. This cost reduction was due to the considerable heterogeneity in acquisition costs revealed in tax-assessed land values, especially for small land parcels, and the corresponding ability of the optimization algorithm to identify lower-cost parcels for inclusion that had equal value to our target species. Tax-assessed land values also reflected the strong spatial differences in acquisition costs (US$0.33/m(2)-$55/m(2)) and thus allowed the algorithm to avoid inclusion of high-cost parcels when possible. Our results add to a nascent but growing literature that suggests conservation planners must consider the cost surrogate they use when designing protected-area networks. We suggest that choosing cost surrogates that capture spatial- and size-dependent heterogeneity in acquisition costs may be relevant to establishing protected areas in urbanizing ecosystems. © 2015 Society for Conservation Biology.

A combined geostatistical-optimization model for the optimal design of a groundwater quality monitoring network

Science.gov (United States)

Kolosionis, Konstantinos; Papadopoulou, Maria P.

2017-04-01

Monitoring networks provide essential information for water resources management especially in areas with significant groundwater exploitation due to extensive agricultural activities. In this work, a simulation-optimization framework is developed based on heuristic optimization methodologies and geostatistical modeling approaches to obtain an optimal design for a groundwater quality monitoring network. Groundwater quantity and quality data obtained from 43 existing observation locations at 3 different hydrological periods in Mires basin in Crete, Greece will be used in the proposed framework in terms of Regression Kriging to develop the spatial distribution of nitrates concentration in the aquifer of interest. Based on the existing groundwater quality mapping, the proposed optimization tool will determine a cost-effective observation wells network that contributes significant information to water managers and authorities. The elimination of observation wells that add little or no beneficial information to groundwater level and quality mapping of the area can be obtain using estimations uncertainty and statistical error metrics without effecting the assessment of the groundwater quality. Given the high maintenance cost of groundwater monitoring networks, the proposed tool could used by water regulators in the decision-making process to obtain a efficient network design that is essential.

Network resilience against intelligent attacks constrained by the degree-dependent node removal cost

International Nuclear Information System (INIS)

Annibale, A; Coolen, A C C; Bianconi, G

2010-01-01

We study the resilience of complex networks against attacks in which nodes are targeted intelligently, but where disabling a node has a cost to the attacker which depends on its degree. Attackers have to meet these costs with limited resources, which constrains their actions. A network's integrity is quantified in terms of the efficacy of the process that it supports. We calculate how the optimal attack strategy and the most attack-resistant network degree statistics depend on the node removal cost function and the attack resources. The resilience of networks against intelligent attacks is found to depend strongly on the node removal cost function faced by the attacker. In particular, if node removal costs increase sufficiently fast with the node degree, power law networks are found to be more resilient than Poissonian ones, even against optimized intelligent attacks. For cost functions increasing quadratically in the node degrees, intelligent attackers cannot damage the network more than random damages would.

Sewer Networks Optimization by Particle Swarm Optimization with Abilities of Fly-Back Mechanism and Harmony Memory

Directory of Open Access Journals (Sweden)

محسن نفیسی

2014-10-01

Full Text Available Lack of an efficient sewer network in urban areas threatens public health and may give rise to contagious diseases. Various optimization methods have been developed for use in designing sewers networks in response to a number of requirements such as the high costs of constructing sewer networks, financial limitations, the presence of both discrete and continuous decision variables, and the nonlinear time complexity of such design problems. In this study, the particle swarm optimization algorithm (PSO with the capability of “fly-back” mechanism equipped with the harmony search (HPSO is used for the optimization of sewers network designs. The objective function consists of minimizing the excavation and embedding costs of commercial pipes. The fly-back mechanism and the harmony memory method are used to prevent leaving out variables from the feasible space of the problem in an attempt to enhance model efficiency. Model constraints are satisfied at two levels, which leads to the desirable convergence of the PSO algorithm as compared to the conventional penalty methods in alternative evolutionary algorithms. In order to determine the admissible decision variables, the Manning equation is used as a hydraulic model. The performance of the proposed algorithm is shown by presenting two examples of sewer networks. Compared to the PSO algorithm used in sewer network optimization models, the proposed model exhibits a tangible improvement in cost reduction and a higher computational stability.

Optimization of municipal pressure pumping station layout and sewage pipe network design

Science.gov (United States)

Tian, Jiandong; Cheng, Jilin; Gong, Yi

2018-03-01

Accelerated urbanization places extraordinary demands on sewer networks; thus optimization research to improve the design of these systems has practical significance. In this article, a subsystem nonlinear programming model is developed to optimize pumping station layout and sewage pipe network design. The subsystem model is expanded into a large-scale complex nonlinear programming system model to find the minimum total annual cost of the pumping station and network of all pipe segments. A comparative analysis is conducted using the sewage network in Taizhou City, China, as an example. The proposed method demonstrated that significant cost savings could have been realized if the studied system had been optimized using the techniques described in this article. Therefore, the method has practical value for optimizing urban sewage projects and provides a reference for theoretical research on optimization of urban drainage pumping station layouts.

Design and Optimization of Capacitated Supply Chain Networks Including Quality Measures

Directory of Open Access Journals (Sweden)

Krystel K. Castillo-Villar

2014-01-01

Full Text Available This paper presents (1 a novel capacitated model for supply chain network design which considers manufacturing, distribution, and quality costs (named SCND-COQ model and (2 five combinatorial optimization methods, based on nonlinear optimization, heuristic, and metaheuristic approaches, which are used to solve realistic instances of practical size. The SCND-COQ model is a mixed-integer nonlinear problem which can be used at a strategic planning level to design a supply chain network that maximizes the total profit subject to meeting an overall quality level of the final product at minimum costs. The SCND-COQ model computes the quality-related costs for the whole supply chain network considering the interdependencies among business entities. The effectiveness of the proposed solution approaches is shown using numerical experiments. These methods allow solving more realistic (capacitated supply chain network design problems including quality-related costs (inspections, rework, opportunity costs, and others within a reasonable computational time.

Optimal Control of Interdependent Epidemics in Complex Networks

OpenAIRE

Chen, Juntao; Zhang, Rui; Zhu, Quanyan

2017-01-01

Optimal control of interdependent epidemics spreading over complex networks is a critical issue. We first establish a framework to capture the coupling between two epidemics, and then analyze the system's equilibrium states by categorizing them into three classes, and deriving their stability conditions. The designed control strategy globally optimizes the trade-off between the control cost and the severity of epidemics in the network. A gradient descent algorithm based on a fixed point itera...

Distributed Optimization based Dynamic Tariff for Congestion Management in Distribution Networks

DEFF Research Database (Denmark)

Huang, Shaojun; Wu, Qiuwei; Zhao, Haoran

2017-01-01

This paper proposes a distributed optimization based dynamic tariff (DDT) method for congestion management in distribution networks with high penetration of electric vehicles (EVs) and heat pumps (HPs). The DDT method employs a decomposition based optimization method to have aggregators explicitly...... is able to minimize the overall energy consumption cost and line loss cost, which is different from previous decomposition-based methods such as multiagent system methods. In addition, a reconditioning method and an integral controller are introduced to improve convergence of the distributed optimization...... where challenges arise due to multiple congestion points, multiple types of flexible demands and network constraints. The case studies demonstrate the efficacy of the DDT method for congestion management in distribution networks....

Optimization of hot water transport and distribution networks by analytical method: OPTAL program

International Nuclear Information System (INIS)

Barreau, Alain; Caizergues, Robert; Moret-Bailly, Jean

1977-06-01

This report presents optimization studies of hot water transport and distribution network by minimizing operating cost. Analytical optimization is used: Lagrange's method of undetermined multipliers. Optimum diameter of each pipe is calculated for minimum network operating cost. The characteristics of the computer program used for calculations, OPTAL, are given in this report. An example of network is calculated and described: 52 branches and 27 customers. Results are discussed [fr

Optimization of transport network in the Basin of Yangtze River with minimization of environmental emission and transport/investment costs

Directory of Open Access Journals (Sweden)

Haiping Shi

2016-08-01

Full Text Available The capacity of the ship-lock at the Three Gorges Dam has become bottleneck of waterway transport and caused serious congestion. In this article, a continual network design model is established to solve the problem with minimizing the transport cost and environmental emission as well as infrastructure construction cost. In this bi-level model, the upper model gives the schemes of ship-lock expansion or construction of pass-dam highway. The lower model assigns the containers in the multi-mode network and calculates the transport cost, environmental emission, and construction investment. The solution algorithm to the model is proposed. In the numerical study, scenario analyses are done to evaluate the schemes and determine the optimal one in the context of different traffic demands. The result shows that expanding the ship-lock is better than constructing pass-dam highway.

Optimal river monitoring network using optimal partition analysis: a case study of Hun River, Northeast China.

Science.gov (United States)

Wang, Hui; Liu, Chunyue; Rong, Luge; Wang, Xiaoxu; Sun, Lina; Luo, Qing; Wu, Hao

2018-01-09

River monitoring networks play an important role in water environmental management and assessment, and it is critical to develop an appropriate method to optimize the monitoring network. In this study, an effective method was proposed based on the attainment rate of National Grade III water quality, optimal partition analysis and Euclidean distance, and Hun River was taken as a method validation case. There were 7 sampling sites in the monitoring network of the Hun River, and 17 monitoring items were analyzed once a month during January 2009 to December 2010. The results showed that the main monitoring items in the surface water of Hun River were ammonia nitrogen (NH 4 + -N), chemical oxygen demand, and biochemical oxygen demand. After optimization, the required number of monitoring sites was reduced from seven to three, and 57% of the cost was saved. In addition, there were no significant differences between non-optimized and optimized monitoring networks, and the optimized monitoring networks could correctly represent the original monitoring network. The duplicate setting degree of monitoring sites decreased after optimization, and the rationality of the monitoring network was improved. Therefore, the optimal method was identified as feasible, efficient, and economic.

Fair Optimization and Networks: A Survey

Directory of Open Access Journals (Sweden)

Wlodzimierz Ogryczak

2014-01-01

Full Text Available Optimization models related to designing and operating complex systems are mainly focused on some efficiency metrics such as response time, queue length, throughput, and cost. However, in systems which serve many entities there is also a need for respecting fairness: each system entity ought to be provided with an adequate share of the system’s services. Still, due to system operations-dependant constraints, fair treatment of the entities does not directly imply that each of them is assigned equal amount of the services. That leads to concepts of fair optimization expressed by the equitable models that represent inequality averse optimization rather than strict inequality minimization; a particular widely applied example of that concept is the so-called lexicographic maximin optimization (max-min fairness. The fair optimization methodology delivers a variety of techniques to generate fair and efficient solutions. This paper reviews fair optimization models and methods applied to systems that are based on some kind of network of connections and dependencies, especially, fair optimization methods for the location problems and for the resource allocation problems in communication networks.

Optimal design of a gas transmission network: A case study of the Turkish natural gas pipeline network system

Science.gov (United States)

Gunes, Ersin Fatih

Turkey is located between Europe, which has increasing demand for natural gas and the geographies of Middle East, Asia and Russia, which have rich and strong natural gas supply. Because of the geographical location, Turkey has strategic importance according to energy sources. To supply this demand, a pipeline network configuration with the optimal and efficient lengths, pressures, diameters and number of compressor stations is extremely needed. Because, Turkey has a currently working and constructed network topology, obtaining an optimal configuration of the pipelines, including an optimal number of compressor stations with optimal locations, is the focus of this study. Identifying a network design with lowest costs is important because of the high maintenance and set-up costs. The quantity of compressor stations, the pipeline segments' lengths, the diameter sizes and pressures at compressor stations, are considered to be decision variables in this study. Two existing optimization models were selected and applied to the case study of Turkey. Because of the fixed cost of investment, both models are formulated as mixed integer nonlinear programs, which require branch and bound combined with the nonlinear programming solution methods. The differences between these two models are related to some factors that can affect the network system of natural gas such as wall thickness, material balance compressor isentropic head and amount of gas to be delivered. The results obtained by these two techniques are compared with each other and with the current system. Major differences between results are costs, pressures and flow rates. These solution techniques are able to find a solution with minimum cost for each model both of which are less than the current cost of the system while satisfying all the constraints on diameter, length, flow rate and pressure. These results give the big picture of an ideal configuration for the future state network for the country of Turkey.

Energy optimization in mobile sensor networks

Science.gov (United States)

Yu, Shengwei

consuming negligible amount of energy for mobility cost. For the second problem, the problem is extended to accommodate mobile robotic nodes with energy harvesting capability, which makes it a non-convex optimization problem. The non-convexity issue is tackled by using the existing sequential convex approximation method, based on which we propose a novel procedure of modified sequential convex approximation that has fast convergence speed. For the third problem, the proposed procedure is used to solve another challenging non-convex problem, which results in utilizing mobility and routing simultaneously in mobile robotic sensor networks to prolong the network lifetime. The results indicate that joint design of mobility and routing has an edge over other methods in prolonging network lifetime, which is also the justification for the use of mobility in mobile sensor networks for energy efficiency purpose. For the fourth problem, we include the dynamics of the robotic nodes in the problem by modeling the networked robotic system using hybrid systems theory. A novel distributed method for the networked hybrid system is used to solve the optimal moving trajectories for robotic nodes and optimal network links, which are not answered by previous approaches. Finally, the fact that mobility is more effective in prolonging network lifetime for a data-intensive network leads us to apply our methods to study mobile visual sensor networks, which are useful in many applications. We investigate the joint design of mobility, data routing, and encoding power to help improving the video quality while maximizing the network lifetime. This study leads to a better understanding of the role mobility can play in data-intensive surveillance sensor networks.

Optimizing the District Heating Primary Network from the Perspective of Economic-Specific Pressure Loss

Directory of Open Access Journals (Sweden)

Haichao Wang

2017-07-01

Full Text Available A district heating (DH system is one of the most important components of infrastructures in cold areas. Proper DH network design should balance the initial investment and the heat distribution cost of the DH network. Currently, this design is often based on a recommended value for specific pressure loss (R = ∆P/L in the main lines. This will result in a feasible network design, but probably not be optimal in most cases. The paper develops a novel optimization model to facilitate the design by considering the initial investment in the pipes and the heat distribution costs. The model will generate all possible network scenarios consisting of different series of diameters for each pipe in the flow direction of the network. Then, the annuity on the initial investment, the heat distribution cost, and the total annual cost will be calculated for each network scenario, taking into account the uncertainties of the material prices and the yearly operating time levels. The model is applied to a sample DH network and the results indicate that the model works quite well, clearly identifying the optimal network design and demonstrating that the heat distribution cost is more important than the initial investment in DH network design.

Multi-Objective Design Of Optimal Greenhouse Gas Observation Networks

Science.gov (United States)

Lucas, D. D.; Bergmann, D. J.; Cameron-Smith, P. J.; Gard, E.; Guilderson, T. P.; Rotman, D.; Stolaroff, J. K.

2010-12-01

One of the primary scientific functions of a Greenhouse Gas Information System (GHGIS) is to infer GHG source emission rates and their uncertainties by combining measurements from an observational network with atmospheric transport modeling. Certain features of the observational networks that serve as inputs to a GHGIS --for example, sampling location and frequency-- can greatly impact the accuracy of the retrieved GHG emissions. Observation System Simulation Experiments (OSSEs) provide a framework to characterize emission uncertainties associated with a given network configuration. By minimizing these uncertainties, OSSEs can be used to determine optimal sampling strategies. Designing a real-world GHGIS observing network, however, will involve multiple, conflicting objectives; there will be trade-offs between sampling density, coverage and measurement costs. To address these issues, we have added multi-objective optimization capabilities to OSSEs. We demonstrate these capabilities by quantifying the trade-offs between retrieval error and measurement costs for a prototype GHGIS, and deriving GHG observing networks that are Pareto optimal. [LLNL-ABS-452333: This work performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under Contract DE-AC52-07NA27344.

District Heating Network Design and Configuration Optimization with Genetic Algorithm

DEFF Research Database (Denmark)

Li, Hongwei; Svendsen, Svend

2013-01-01

In this paper, the configuration of a district heating network which connects from the heating plant to the end users is optimized. Each end user in the network represents a building block. The connections between the heat generation plant and the end users are represented with mixed integer...... and the pipe friction and heat loss formulations are non-linear. In order to find the optimal district heating network configuration, genetic algorithm which handles the mixed integer nonlinear programming problem is chosen. The network configuration is represented with binary and integer encoding...... and it is optimized in terms of the net present cost. The optimization results indicates that the optimal DH network configuration is determined by multiple factors such as the consumer heating load, the distance between the heating plant to the consumer, the design criteria regarding the pressure and temperature...

A bridge network maintenance framework for Pareto optimization of stakeholders/users costs

International Nuclear Information System (INIS)

Orcesi, Andre D.; Cremona, Christian F.

2010-01-01

For managing highway bridges, stakeholders require efficient and practical decision making techniques. In a context of limited bridge management budget, it is crucial to determine the most effective breakdown of financial resources over the different structures of a bridge network. Bridge management systems (BMSs) have been developed for such a purpose. However, they generally rely on an individual approach. The influence of the position of bridges in the transportation network, the consequences of inadequate service for the network users, due to maintenance actions or bridge failure, are not taken into consideration. Therefore, maintenance strategies obtained with current BMSs do not necessarily lead to an optimal level of service (LOS) of the bridge network for the users of the transportation network. Besides, the assessment of the structural performance of highway bridges usually requires the access to the geometrical and mechanical properties of its components. Such information might not be available for all structures in a bridge network for which managers try to schedule and prioritize maintenance strategies. On the contrary, visual inspections are performed regularly and information is generally available for all structures of the bridge network. The objective of this paper is threefold (i) propose an advanced network-level bridge management system considering the position of each bridge in the transportation network, (ii) use information obtained at visual inspections to assess the performance of bridges, and (iii) compare optimal maintenance strategies, obtained with a genetic algorithm, when considering interests of users and bridge owner either separately as conflicting criteria, or simultaneously as a common interest for the whole community. In each case, safety and serviceability aspects are taken into account in the model when determining optimal strategies. The theoretical and numerical developments are applied on a French bridge network.

NLP model and stochastic multi-start optimization approach for heat exchanger networks

International Nuclear Information System (INIS)

Núñez-Serna, Rosa I.; Zamora, Juan M.

2016-01-01

Highlights: • An NLP model for the optimal design of heat exchanger networks is proposed. • The NLP model is developed from a stage-wise grid diagram representation. • A two-phase stochastic multi-start optimization methodology is utilized. • Improved network designs are obtained with different heat load distributions. • Structural changes and reductions in the number of heat exchangers are produced. - Abstract: Heat exchanger network synthesis methodologies frequently identify good network structures, which nevertheless, might be accompanied by suboptimal values of design variables. The objective of this work is to develop a nonlinear programming (NLP) model and an optimization approach that aim at identifying the best values for intermediate temperatures, sub-stream flow rate fractions, heat loads and areas for a given heat exchanger network topology. The NLP model that minimizes the total annual cost of the network is constructed based on a stage-wise grid diagram representation. To improve the possibilities of obtaining global optimal designs, a two-phase stochastic multi-start optimization algorithm is utilized for the solution of the developed model. The effectiveness of the proposed optimization approach is illustrated with the optimization of two network designs proposed in the literature for two well-known benchmark problems. Results show that from the addressed base network topologies it is possible to achieve improved network designs, with redistributions in exchanger heat loads that lead to reductions in total annual costs. The results also show that the optimization of a given network design sometimes leads to structural simplifications and reductions in the total number of heat exchangers of the network, thereby exposing alternative viable network topologies initially not anticipated.

Energy Cost Minimization in Heterogeneous Cellular Networks with Hybrid Energy Supplies

Directory of Open Access Journals (Sweden)

Bang Wang

2016-01-01

Full Text Available The ever increasing data demand has led to the significant increase of energy consumption in cellular mobile networks. Recent advancements in heterogeneous cellular networks and green energy supplied base stations provide promising solutions for cellular communications industry. In this article, we first review the motivations and challenges as well as approaches to address the energy cost minimization problem for such green heterogeneous networks. Owing to the diversities of mobile traffic and renewable energy, the energy cost minimization problem involves both temporal and spatial optimization of resource allocation. We next present a new solution to illustrate how to combine the optimization of the temporal green energy allocation and spatial mobile traffic distribution. The whole optimization problem is decomposed into four subproblems, and correspondingly our proposed solution is divided into four parts: energy consumption estimation, green energy allocation, user association, and green energy reallocation. Simulation results demonstrate that our proposed algorithm can significantly reduce the total energy cost.

Optimal Design of Gravitational Sewer Networks with General Cellular Automata

Directory of Open Access Journals (Sweden)

Mohammad Hadi Afshar

2014-05-01

Full Text Available In this paper, a Cellular Automata method is applied for the optimal design of sewer networks. The solution of sewer network optimization problems requires the determination of pipe diameters and average pipe cover depths, minimizing the total cost of the sewer network subject to operational constraints. In this paper, the network nodes and upstream and downstream pipe cover depths are considered as CA cells and cell states, respectively, and the links around each cell are taken into account as neighborhood. The proposed method is a general and flexible method for the optimization of sewer networks as it can be used to optimally design both gravity and pumped network due to the use of pipe nodal cover depths as the decision variables. The proposed method is tested against two  gravitational sewer networks and the  comparison of results with other methods such as  Genetic algorithm, Cellular Automata, Ant Colony Optimization Algorithm and Particle Swarm Optimization show the efficiency and effectiveness of the proposed method.

Stochastic network interdiction optimization via capacitated network reliability modeling and probabilistic solution discovery

International Nuclear Information System (INIS)

Ramirez-Marquez, Jose Emmanuel; Rocco S, Claudio M.

2009-01-01

This paper introduces an evolutionary optimization approach that can be readily applied to solve stochastic network interdiction problems (SNIP). The network interdiction problem solved considers the minimization of the cost associated with an interdiction strategy such that the maximum flow that can be transmitted between a source node and a sink node for a fixed network design is greater than or equal to a given reliability requirement. Furthermore, the model assumes that the nominal capacity of each network link and the cost associated with their interdiction can change from link to link and that such interdiction has a probability of being successful. This version of the SNIP is for the first time modeled as a capacitated network reliability problem allowing for the implementation of computation and solution techniques previously unavailable. The solution process is based on an evolutionary algorithm that implements: (1) Monte-Carlo simulation, to generate potential network interdiction strategies, (2) capacitated network reliability techniques to analyze strategies' source-sink flow reliability and, (3) an evolutionary optimization technique to define, in probabilistic terms, how likely a link is to appear in the final interdiction strategy. Examples for different sizes of networks are used throughout the paper to illustrate the approach

Optimal Operation of Interdependent Power Systems and Electrified Transportation Networks

Directory of Open Access Journals (Sweden)

M. Hadi Amini

2018-01-01

Full Text Available Electrified transportation and power systems are mutually coupled networks. In this paper, a novel framework is developed for interdependent power and transportation networks. Our approach constitutes solving an iterative least cost vehicle routing process, which utilizes the communication of electrified vehicles (EVs with competing charging stations, to exchange data such as electricity price, energy demand, and time of arrival. The EV routing problem is solved to minimize the total cost of travel using the Dijkstra algorithm with the input from EVs battery management system, electricity price from charging stations, powertrain component efficiencies and transportation network traffic conditions. Through the bidirectional communication of EVs with competing charging stations, EVs’ charging demand estimation is done much more accurately. Then the optimal power flow problem is solved for the power system, to find the locational marginal price at load buses where charging stations are connected. Finally, the electricity prices were communicated from the charging stations to the EVs, and the loop is closed. Locational electricity price acts as the shared parameter between the two optimization problems, i.e., optimal power flow and optimal routing problem. Electricity price depends on the power demand, which is affected by the charging of EVs. On the other hand, location of EV charging stations and their different pricing strategies might affect the routing decisions of the EVs. Our novel approach that combines the electrified transportation with power system operation, holds tremendous potential for solving electrified transportation issues and reducing energy costs. The effectiveness of the proposed approach is demonstrated using Shanghai transportation network and IEEE 9-bus test system. The results verify the cost-savings for both power system and transportation networks.

A theoretical cost optimization model of reused flowback distribution network of regional shale gas development

International Nuclear Information System (INIS)

Li, Huajiao; An, Haizhong; Fang, Wei; Jiang, Meng

2017-01-01

The logistical issues surrounding the timing and transport of flowback generated by each shale gas well to the next is a big challenge. Due to more and more flowback being stored temporarily near the shale gas well and reused in the shale gas development, both transportation cost and storage cost are the heavy burden for the developers. This research proposed a theoretical cost optimization model to get the optimal flowback distribution solution for regional multi shale gas wells in a holistic perspective. Then, we used some empirical data of Marcellus Shale to do the empirical study. In addition, we compared the optimal flowback distribution solution by considering both the transportation cost and storage cost with the flowback distribution solution which only minimized the transportation cost or only minimized the storage cost. - Highlights: • A theoretical cost optimization model to get optimal flowback distribution solution. • An empirical study using the shale gas data in Bradford County of Marcellus Shale. • Visualization of optimal flowback distribution solutions under different scenarios. • Transportation cost is a more important factor for reducing the cost. • Help the developers to cut the storage and transportation cost of reusing flowback.

Sharing cost in social community networks

DEFF Research Database (Denmark)

Pal, Ranjan; Elango, Divya; Wardana, Satya Ardhy

2012-01-01

their deployment in a residential locality. Our proposed mechanism accounts for heterogeneous user preferences towards different router features and comes up with the optimal (feature-set, user costs) router blueprint that satisfies each user in a locality, in turn motivating them to buy routers and thereby improve......Wireless social community networks (WSCNs) is an emerging technology that operate in the unlicensed spectrum and have been created as an alternative to cellular wireless networks for providing low-cost, high speed wireless data access in urban areas. WSCNs is an upcoming idea that is starting...... reflect their slow progress in capturing the WiFi router market. In this paper, we look at a router design and cost sharing problem in WSCNs to improve deployment. We devise a simple to implement, successful, budget-balanced, ex-post efficient, and individually rational auction-based mechanism...

Equipment cost optimization

International Nuclear Information System (INIS)

Ribeiro, E.M.; Farias, M.A.; Dreyer, S.R.B.

1995-01-01

Considering the importance of the cost of material and equipment in the overall cost profile of an oil company, which in the case of Petrobras, represents approximately 23% of the total operational cost or 10% of the sales, an organization for the optimization of such costs has been established within Petrobras. Programs are developed aiming at: optimization of life-cycle cost of material and equipment; optimization of industrial processes costs through material development. This paper describes the methodology used in the management of the development programs and presents some examples of concluded and ongoing programs, which are conducted in permanent cooperation with suppliers, technical laboratories and research institutions and have been showing relevant results

Optimization of investments in gas networks

International Nuclear Information System (INIS)

Andre, J.

2010-09-01

The natural gas networks require very important investments to cope with a still growing demand and to satisfy the new regulatory constraints. The gas market deregulation imposed to the gas network operators, first, transparency rules of a natural monopoly to justify their costs and ultimately their tariffs, and, second, market fluidity objectives in order to facilitate access for competition to the end-users. These major investments are the main reasons for the use of optimization techniques aiming at reducing the costs. Due to the discrete choices (investment location, limited choice of additional capacities, timing) crossed with physical non linear constraints (flow/pressures relations in the pipe or operating ranges of compressors), the programs to solve are Large Mixed Non Linear Programs (MINLP). As these types of programs are known to be hard to solve exactly in polynomial times (NP-hard), advanced optimization methods have to be implemented to obtain realistic results. The objectives of this thesis are threefold. First, one states several investment problems modeling of natural gas networks from industrial world motivations. Second, one identifies the most suitable methods and algorithms to the formulated problems. Third, one exposes the main advantages and drawbacks of these methods with the help of numerical applications on real cases. (author)

Optimization of hydrometric monitoring network in urban drainage systems using information theory.

Science.gov (United States)

Yazdi, J

2017-10-01

Regular and continuous monitoring of urban runoff in both quality and quantity aspects is of great importance for controlling and managing surface runoff. Due to the considerable costs of establishing new gauges, optimization of the monitoring network is essential. This research proposes an approach for site selection of new discharge stations in urban areas, based on entropy theory in conjunction with multi-objective optimization tools and numerical models. The modeling framework provides an optimal trade-off between the maximum possible information content and the minimum shared information among stations. This approach was applied to the main surface-water collection system in Tehran to determine new optimal monitoring points under the cost considerations. Experimental results on this drainage network show that the obtained cost-effective designs noticeably outperform the consulting engineers' proposal in terms of both information contents and shared information. The research also determined the highly frequent sites at the Pareto front which might be important for decision makers to give a priority for gauge installation on those locations of the network.

A method of network topology optimization design considering application process characteristic

Science.gov (United States)

Wang, Chunlin; Huang, Ning; Bai, Yanan; Zhang, Shuo

2018-03-01

Communication networks are designed to meet the usage requirements of users for various network applications. The current studies of network topology optimization design mainly considered network traffic, which is the result of network application operation, but not a design element of communication networks. A network application is a procedure of the usage of services by users with some demanded performance requirements, and has obvious process characteristic. In this paper, we first propose a method to optimize the design of communication network topology considering the application process characteristic. Taking the minimum network delay as objective, and the cost of network design and network connective reliability as constraints, an optimization model of network topology design is formulated, and the optimal solution of network topology design is searched by Genetic Algorithm (GA). Furthermore, we investigate the influence of network topology parameter on network delay under the background of multiple process-oriented applications, which can guide the generation of initial population and then improve the efficiency of GA. Numerical simulations show the effectiveness and validity of our proposed method. Network topology optimization design considering applications can improve the reliability of applications, and provide guidance for network builders in the early stage of network design, which is of great significance in engineering practices.

TRADING-OFF CONSTRAINTS IN THE PUMP SCHEDULING OPTIMIZATION OF WATER DISTRIBUTION NETWORKS

Directory of Open Access Journals (Sweden)

Gencer Genço\\u011Flu

2016-01-01

Full Text Available Pumps are one of the essential components of water supply systems. Depending of the topography, a water supply system may completely rely on pumping. They may consume non-negligible amount of water authorities' budgets during operation. Besides their energy costs, maintaining the healthiness of pumping systems is another concern for authorities. This study represents a multi-objective optimization method for pump scheduling problem. The optimization objective contains hydraulic and operational constraints. Switching of pumps and usage of electricity tariff are assumed to be key factors for operational reliability and energy consumption and costs of pumping systems. The local optimals for systems operational reliability, energy consumptions and energy costs are investigated resulting from trading-off pump switch and electricity tariff constraints within given set of boundary conditions. In the study, a custom made program is employed that combines genetic algorithm based optimization module with hydraulic network simulation software -EPANET. Developed method is applied on the case study network; N8-3 pressure zone of the Northern Supply of Ankara (Turkey Water Distribution Network. This work offers an efficient method for water authorities aiming to optimize pumping schedules considering expenditures and operational reliability mutually.

Optimal distribution feeder reconfiguration for increasing the penetration of plug-in electric vehicles and minimizing network costs

International Nuclear Information System (INIS)

Kavousi-Fard, Abdollah; Abbasi, Alireza; Rostami, Mohammad-Amin; Khosravi, Abbas

2015-01-01

Appearance of PEVs (Plug-in Electric Vehicles) in future transportation sector brings forward opportunities and challenges from grid perspective. Increased utilization of PEVs will result in problems such as greater total loss, unbalanced load factor, feeder congestion and voltage drop. PEVs are mobile energy storages dispersed all over the network with benefits to both owners and utilities in case of V2G (Vehicle-to-Grid) possibility. The intelligent bidirectional power flow between grid and large number of vehicles adds complexity to the system and requires operative tools to schedule V2G energy and subdue PEV impacts. In this paper, DFR (Distribution Feeder Reconfiguration) is utilized to optimally coordinate PEV operation in a stochastic framework. Uncertainty in PEVs characteristics can be due to several sources from location and time of grid connection to driving pattern and battery SoC (State-of-Charge). The proposed stochastic problem is solved with a self-adaptive evolutionary swarm algorithm based on SSO (Social Spider Optimization) algorithm. Numerical studies verify the efficacy of the proposed DFR to improve the system performance and optimal dispatch of V2G. - Highlights: • Consideration effect of PEVS on the distribution feeder reconfiguration. • Increasing the penetration of PEVS. • Introducing a new artificial optimization algorithm. • Modeling the uncertainty in network. • Investigating the degradation cost of batteries in V2G technology.

Max-Min Optimality of Service Rate Control in Closed Queueing Networks

KAUST Repository

Xia, Li

2013-04-01

In this technical note, we discuss the optimality properties of service rate control in closed Jackson networks. We prove that when the cost function is linear to a particular service rate, the system performance is monotonic w.r.t. (with respect to) that service rate and the optimal value of that service rate can be either maximum or minimum (we call it Max-Min optimality); When the second-order derivative of the cost function w.r.t. a particular service rate is always positive (negative), which makes the cost function strictly convex (concave), the optimal value of such service rate for the performance maximization (minimization) problem can be either maximum or minimum. To the best of our knowledge, this is the most general result for the optimality of service rates in closed Jackson networks and all the previous works only involve the first conclusion. Moreover, our result is also valid for both the state-dependent and load-dependent service rates, under both the time-average and customer-average performance criteria.

Minimum cost connection networks

DEFF Research Database (Denmark)

Hougaard, Jens Leth; Tvede, Mich

2015-01-01

In the present paper we consider the allocation of costs in connection networks. Agents have connection demands in form of pairs of locations they want to have connected. Connections between locations are costly to build. The problem is to allocate costs of networks satisfying all connection...... demands. We use a few axioms to characterize allocation rules that truthfully implement cost minimizing networks satisfying all connection demands in a game where: (1) a central planner announces an allocation rule and a cost estimation rule; (2) every agent reports her own connection demand as well...... as all connection costs; (3) the central planner selects a cost minimizing network satisfying reported connection demands based on the estimated costs; and, (4) the planner allocates the true costs of the selected network. It turns out that an allocation rule satisfies the axioms if and only if relative...

Multiobjective planning of distribution networks incorporating switches and protective devices using a memetic optimization

International Nuclear Information System (INIS)

Pombo, A. Vieira; Murta-Pina, João; Pires, V. Fernão

2015-01-01

A multi-objective planning approach for the reliability of electric distribution networks using a memetic optimization is presented. In this reliability optimization, the type of the equipment (switches or reclosers) and their location are optimized. The multiple objectives considered to find the optimal values for these planning variables are the minimization of the total equipment cost and at the same time the minimization of two distribution network reliability indexes. The reliability indexes are the system average interruption frequency index (SAIFI) and system average interruption duration index (SAIDI). To solve this problem a memetic evolutionary algorithm is proposed, which combines the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) with a local search algorithm. The obtained Pareto-optimal front contains solutions of different trade-offs with respect to the three objectives. A real distribution network is used to test the proposed algorithm. The obtained results show that this approach allows the utility to obtain the optimal type and location of the equipments to achieve the best reliability with the lower cost. - Highlights: • Reliability indexes SAIFI and SAIDI and Equipment Cost are optimized. • Optimization of equipment type, number and location on a MV network. • Memetic evolutionary algorithm with a local search algorithm is proposed. • Pareto optimal front solutions with respect to the three objective functions

Optimal siting of capacitors in radial distribution network using Whale Optimization Algorithm

Directory of Open Access Journals (Sweden)

D.B. Prakash

2017-12-01

Full Text Available In present days, continuous effort is being made in bringing down the line losses of the electrical distribution networks. Therefore proper allocation of capacitors is of utmost importance because, it will help in reducing the line losses and maintaining the bus voltage. This in turn results in improving the stability and reliability of the system. In this paper Whale Optimization Algorithm (WOA is used to find optimal sizing and placement of capacitors for a typical radial distribution system. Multi objectives such as operating cost reduction and power loss minimization with inequality constraints on voltage limits are considered and the proposed algorithm is validated by applying it on standard radial systems: IEEE-34 bus and IEEE-85 bus radial distribution test systems. The results obtained are compared with those of existing algorithms. The results show that the proposed algorithm is more effective in bringing down the operating costs and in maintaining better voltage profile. Keywords: Whale Optimization Algorithm (WOA, Optimal allocation and sizing of capacitors, Power loss reduction and voltage stability improvement, Radial distribution system, Operating cost minimization

Optimal Design of the Feeder-Bus Network Based on the Transfer System

Directory of Open Access Journals (Sweden)

Lianbo Deng

2013-01-01

Full Text Available This paper studied the classic feeder-bus network design problem (FBNDP, which can be described as follows: for the passenger travel demand between rail stations and bus stops on a given urban transit network, it designs the optimal feeder bus routes and frequencies so as to minimize the passengers’ travel expense and the operator’s cost. We extended the demand pattern of M-to-1 in most existing researches to M-to-M. We comprehensively considered the passenger travel cost, which includes the waiting and riding cost on the bus, riding cost on rail, and transfer cost between these two transportation modes, and presented a new genetic algorithm that determines the optimal feeder-bus operating frequencies under strict constraint conditions. The numerical examples under different demand patterns have been experienced and analysed, which showed the robustness and efficiency of the presented algorithm. We also found that the distribution pattern of the travel demand has a significant influence on the feeder-bus network construction.

Optimal Micropatterns in 2D Transport Networks and Their Relation to Image Inpainting

Science.gov (United States)

Brancolini, Alessio; Rossmanith, Carolin; Wirth, Benedikt

2018-04-01

We consider two different variational models of transport networks: the so-called branched transport problem and the urban planning problem. Based on a novel relation to Mumford-Shah image inpainting and techniques developed in that field, we show for a two-dimensional situation that both highly non-convex network optimization tasks can be transformed into a convex variational problem, which may be very useful from analytical and numerical perspectives. As applications of the convex formulation, we use it to perform numerical simulations (to our knowledge this is the first numerical treatment of urban planning), and we prove a lower bound for the network cost that matches a known upper bound (in terms of how the cost scales in the model parameters) which helps better understand optimal networks and their minimal costs.

Network optimization including gas lift and network parameters under subsurface uncertainty

Energy Technology Data Exchange (ETDEWEB)

Schulze-Riegert, R.; Baffoe, J.; Pajonk, O. [SPT Group GmbH, Hamburg (Germany); Badalov, H.; Huseynov, S. [Technische Univ. Clausthal, Clausthal-Zellerfeld (Germany). ITE; Trick, M. [SPT Group, Calgary, AB (Canada)

2013-08-01

Optimization of oil and gas field production systems poses a great challenge to field development due to complex and multiple interactions between various operational design parameters and subsurface uncertainties. Conventional analytical methods are capable of finding local optima based on single deterministic models. They are less applicable for efficiently generating alternative design scenarios in a multi-objective context. Practical implementations of robust optimization workflows integrate the evaluation of alternative design scenarios and multiple realizations of subsurface uncertainty descriptions. Production or economic performance indicators such as NPV (Net Present Value) are linked to a risk-weighted objective function definition to guide the optimization processes. This work focuses on an integrated workflow using a reservoir-network simulator coupled to an optimization framework. The work will investigate the impact of design parameters while considering the physics of the reservoir, wells, and surface facilities. Subsurface uncertainties are described by well parameters such as inflow performance. Experimental design methods are used to investigate parameter sensitivities and interactions. Optimization methods are used to find optimal design parameter combinations which improve key performance indicators of the production network system. The proposed workflow will be applied to a representative oil reservoir coupled to a network which is modelled by an integrated reservoir-network simulator. Gas-lift will be included as an explicit measure to improve production. An objective function will be formulated for the net present value of the integrated system including production revenue and facility costs. Facility and gas lift design parameters are tuned to maximize NPV. Well inflow performance uncertainties are introduced with an impact on gas lift performance. Resulting variances on NPV are identified as a risk measure for the optimized system design. A

A Grooming Nodes Optimal Allocation Method for Multicast in WDM Networks

Directory of Open Access Journals (Sweden)

Chengying Wei

2016-01-01

Full Text Available The grooming node has the capability of grooming multicast traffic with the small granularity into established light at high cost of complexity and node architecture. In the paper, a grooming nodes optimal allocation (GNOA method is proposed to optimize the allocation of the grooming nodes constraint by the blocking probability for multicast traffic in sparse WDM networks. In the proposed GNOA method, the location of each grooming node is determined by the SCLD strategy. The improved smallest cost largest degree (SCLD strategy is designed to select the nongrooming nodes in the proposed GNOA method. The simulation results show that the proposed GNOA method can reduce the required number of grooming nodes and decrease the cost of constructing a network to guarantee a certain request blocking probability when the wavelengths per fiber and transmitter/receiver ports per node are sufficient for the optical multicast in WDM networks.

Optimal control of epidemic information dissemination over networks.

Science.gov (United States)

Chen, Pin-Yu; Cheng, Shin-Ming; Chen, Kwang-Cheng

2014-12-01

Information dissemination control is of crucial importance to facilitate reliable and efficient data delivery, especially in networks consisting of time-varying links or heterogeneous links. Since the abstraction of information dissemination much resembles the spread of epidemics, epidemic models are utilized to characterize the collective dynamics of information dissemination over networks. From a systematic point of view, we aim to explore the optimal control policy for information dissemination given that the control capability is a function of its distribution time, which is a more realistic model in many applications. The main contributions of this paper are to provide an analytically tractable model for information dissemination over networks, to solve the optimal control signal distribution time for minimizing the accumulated network cost via dynamic programming, and to establish a parametric plug-in model for information dissemination control. In particular, we evaluate its performance in mobile and generalized social networks as typical examples.

Phase transitions in Pareto optimal complex networks.

Science.gov (United States)

Seoane, Luís F; Solé, Ricard

2015-09-01

The organization of interactions in complex systems can be described by networks connecting different units. These graphs are useful representations of the local and global complexity of the underlying systems. The origin of their topological structure can be diverse, resulting from different mechanisms including multiplicative processes and optimization. In spatial networks or in graphs where cost constraints are at work, as it occurs in a plethora of situations from power grids to the wiring of neurons in the brain, optimization plays an important part in shaping their organization. In this paper we study network designs resulting from a Pareto optimization process, where different simultaneous constraints are the targets of selection. We analyze three variations on a problem, finding phase transitions of different kinds. Distinct phases are associated with different arrangements of the connections, but the need of drastic topological changes does not determine the presence or the nature of the phase transitions encountered. Instead, the functions under optimization do play a determinant role. This reinforces the view that phase transitions do not arise from intrinsic properties of a system alone, but from the interplay of that system with its external constraints.

Optimal Path Choice in Railway Passenger Travel Network Based on Residual Train Capacity

Directory of Open Access Journals (Sweden)

Fei Dou

2014-01-01

Full Text Available Passenger’s optimal path choice is one of the prominent research topics in the field of railway passenger transport organization. More and more different train types are available, increasing path choices from departure to destination for travelers are unstoppable. However, travelers cannot avoid being confused when they hope to choose a perfect travel plan based on various travel time and cost constraints before departure. In this study, railway passenger travel network is constructed based on train timetable. Both the generalized cost function we developed and the residual train capacity are considered to be the foundation of path searching procedure. The railway passenger travel network topology is analyzed based on residual train capacity. Considering the total travel time, the total travel cost, and the total number of passengers, we propose an optimal path searching algorithm based on residual train capacity in railway passenger travel network. Finally, the rationale of the railway passenger travel network and the optimal path generation algorithm are verified positively by case study.

Cost effective campaigning in social networks

Science.gov (United States)

Kotnis, Bhushan; Kuri, Joy

2016-05-01

Campaigners are increasingly using online social networking platforms for promoting products, ideas and information. A popular method of promoting a product or even an idea is incentivizing individuals to evangelize the idea vigorously by providing them with referral rewards in the form of discounts, cash backs, or social recognition. Due to budget constraints on scarce resources such as money and manpower, it may not be possible to provide incentives for the entire population, and hence incentives need to be allocated judiciously to appropriate individuals for ensuring the highest possible outreach size. We aim to do the same by formulating and solving an optimization problem using percolation theory. In particular, we compute the set of individuals that are provided incentives for minimizing the expected cost while ensuring a given outreach size. We also solve the problem of computing the set of individuals to be incentivized for maximizing the outreach size for given cost budget. The optimization problem turns out to be non trivial; it involves quantities that need to be computed by numerically solving a fixed point equation. Our primary contribution is, that for a fairly general cost structure, we show that the optimization problems can be solved by solving a simple linear program. We believe that our approach of using percolation theory to formulate an optimization problem is the first of its kind.

Optimal Operations and Resilient Investments in Steam Networks

Energy Technology Data Exchange (ETDEWEB)

Bungener, Stéphane L., E-mail: stephane.bungener@a3.epfl.ch [Industrial Process and Energy Systems Engineering, École Polytechnique Fédérale de Lausanne, Lausanne (Switzerland); Van Eetvelde, Greet [Environmental and Spatial Management, Faculty of Engineering and Architecture, Ghent University, Ghent (Belgium); Maréchal, François [Industrial Process and Energy Systems Engineering, École Polytechnique Fédérale de Lausanne, Lausanne (Switzerland)

2016-01-20

Steam is a key energy vector for industrial sites, most commonly used for process heating and cooling, cogeneration of heat and mechanical power as a motive fluid or for stripping. Steam networks are used to carry steam from producers to consumers and between pressure levels through letdowns and steam turbines. The steam producers (boilers, heat and power cogeneration units, heat exchangers, chemical reactors) should be sized to supply the consumers at nominal operating conditions as well as peak demand. First, this paper proposes an Mixed Integer Linear Programing formulation to optimize the operations of steam networks in normal operating conditions and exceptional demand (when operating reserves fall to zero), through the introduction of load shedding. Optimization of investments based on operational and investment costs are included in the formulation. Though rare, boiler failures can have a heavy impact on steam network operations and costs, leading to undercapacity and unit shutdowns. A method is therefore proposed to simulate steam network operations when facing boiler failures. Key performance indicators are introduced to quantify the network’s resilience. The proposed methods are applied and demonstrated in an industrial case study using industrial data. The results indicate the importance of oversizing key steam producing equipments and the value of industrial symbiosis to increase industrial site resilience.

Optimal Operations and Resilient Investments in Steam Networks

International Nuclear Information System (INIS)

Bungener, Stéphane L.; Van Eetvelde, Greet; Maréchal, François

2016-01-01

Steam is a key energy vector for industrial sites, most commonly used for process heating and cooling, cogeneration of heat and mechanical power as a motive fluid or for stripping. Steam networks are used to carry steam from producers to consumers and between pressure levels through letdowns and steam turbines. The steam producers (boilers, heat and power cogeneration units, heat exchangers, chemical reactors) should be sized to supply the consumers at nominal operating conditions as well as peak demand. First, this paper proposes an Mixed Integer Linear Programing formulation to optimize the operations of steam networks in normal operating conditions and exceptional demand (when operating reserves fall to zero), through the introduction of load shedding. Optimization of investments based on operational and investment costs are included in the formulation. Though rare, boiler failures can have a heavy impact on steam network operations and costs, leading to undercapacity and unit shutdowns. A method is therefore proposed to simulate steam network operations when facing boiler failures. Key performance indicators are introduced to quantify the network’s resilience. The proposed methods are applied and demonstrated in an industrial case study using industrial data. The results indicate the importance of oversizing key steam producing equipments and the value of industrial symbiosis to increase industrial site resilience.

On Optimal Policies for Network-Coded Cooperation

DEFF Research Database (Denmark)

Khamfroush, Hana; Roetter, Daniel Enrique Lucani; Pahlevani, Peyman

2015-01-01

Network-coded cooperative communication (NC-CC) has been proposed and evaluated as a powerful technology that can provide a better quality of service in the next-generation wireless systems, e.g., D2D communications. Previous contributions have focused on performance evaluation of NC-CC scenarios...... rather than searching for optimal policies that can minimize the total cost of reliable packet transmission. We break from this trend by initially analyzing the optimal design of NC-CC for a wireless network with one source, two receivers, and half-duplex erasure channels. The problem is modeled...... as a special case of Markov decision process (MDP), which is called stochastic shortest path (SSP), and is solved for any field size, arbitrary number of packets, and arbitrary erasure probabilities of the channels. The proposed MDP solution results in an optimal transmission policy per time slot, and we use...

A Scheme to Optimize Flow Routing and Polling Switch Selection of Software Defined Networks.

Directory of Open Access Journals (Sweden)

Huan Chen

Full Text Available This paper aims at minimizing the communication cost for collecting flow information in Software Defined Networks (SDN. Since flow-based information collecting method requires too much communication cost, and switch-based method proposed recently cannot benefit from controlling flow routing, jointly optimize flow routing and polling switch selection is proposed to reduce the communication cost. To this end, joint optimization problem is formulated as an Integer Linear Programming (ILP model firstly. Since the ILP model is intractable in large size network, we also design an optimal algorithm for the multi-rooted tree topology and an efficient heuristic algorithm for general topology. According to extensive simulations, it is found that our method can save up to 55.76% communication cost compared with the state-of-the-art switch-based scheme.

A Scheme to Optimize Flow Routing and Polling Switch Selection of Software Defined Networks.

Science.gov (United States)

Chen, Huan; Li, Lemin; Ren, Jing; Wang, Yang; Zhao, Yangming; Wang, Xiong; Wang, Sheng; Xu, Shizhong

2015-01-01

This paper aims at minimizing the communication cost for collecting flow information in Software Defined Networks (SDN). Since flow-based information collecting method requires too much communication cost, and switch-based method proposed recently cannot benefit from controlling flow routing, jointly optimize flow routing and polling switch selection is proposed to reduce the communication cost. To this end, joint optimization problem is formulated as an Integer Linear Programming (ILP) model firstly. Since the ILP model is intractable in large size network, we also design an optimal algorithm for the multi-rooted tree topology and an efficient heuristic algorithm for general topology. According to extensive simulations, it is found that our method can save up to 55.76% communication cost compared with the state-of-the-art switch-based scheme.

A probabilistic computational framework for bridge network optimal maintenance scheduling

International Nuclear Information System (INIS)

Bocchini, Paolo; Frangopol, Dan M.

2011-01-01

This paper presents a probabilistic computational framework for the Pareto optimization of the preventive maintenance applications to bridges of a highway transportation network. The bridge characteristics are represented by their uncertain reliability index profiles. The in/out of service states of the bridges are simulated taking into account their correlation structure. Multi-objective Genetic Algorithms have been chosen as numerical tool for the solution of the optimization problem. The design variables of the optimization are the preventive maintenance schedules of all the bridges of the network. The two conflicting objectives are the minimization of the total present maintenance cost and the maximization of the network performance indicator. The final result is the Pareto front of optimal solutions among which the managers should chose, depending on engineering and economical factors. A numerical example illustrates the application of the proposed approach.

Design and optimization of all-optical networks

Science.gov (United States)

Xiao, Gaoxi

1999-10-01

In this thesis, we present our research results on the design and optimization of all-optical networks. We divide our results into the following four parts: 1.In the first part, we consider broadcast-and-select networks. In our research, we propose an alternative and cheaper network configuration to hide the tuning time. In addition, we derive lower bounds on the optimal schedule lengths and prove that they are tighter than the best existing bounds. 2.In the second part, we consider all-optical wide area networks. We propose a set of algorithms for allocating a given number of WCs to the nodes. We adopt a simulation-based optimization approach, in which we collect utilization statistics of WCs from computer simulation and then perform optimization to allocate the WCs. Therefore, our algorithms are widely applicable and they are not restricted to any particular model and assumption. We have conducted extensive computer simulation on regular and irregular networks under both uniform and non-uniform traffic. We see that our method can get nearly the same performance as that of full wavelength conversion by using a much smaller number of WCs. Compared with the best existing method, the results show that our algorithms can significantly reduce (1)the overall blocking probability (i.e., better mean quality of service) and (2)the maximum of the blocking probabilities experienced at all the source nodes (i.e., better fairness). Equivalently, for a given performance requirement on blocking probability, our algorithms can significantly reduce the number of WCs required. 3.In the third part, we design and optimize the physical topology of all-optical wide area networks. We show that the design problem is NP-complete and we propose a heuristic algorithm called two-stage cut saturation algorithm for this problem. Simulation results show that (1)the proposed algorithm can efficiently design networks with low cost and high utilization, and (2)if wavelength converters are

Cost-optimal power system extension under flow-based market coupling

Energy Technology Data Exchange (ETDEWEB)

Hagspiel, Simeon; Jaegemann, Cosima; Lindenberger, Dietmar [Koeln Univ. (Germany). Energiewirtschaftliches Inst.; Brown, Tom; Cherevatskiy, Stanislav; Troester, Eckehard [Energynautics GmbH, Langen (Germany)

2013-05-15

Electricity market models, implemented as dynamic programming problems, have been applied widely to identify possible pathways towards a cost-optimal and low carbon electricity system. However, the joint optimization of generation and transmission remains challenging, mainly due to the fact that different characteristics and rules apply to commercial and physical exchanges of electricity in meshed networks. This paper presents a methodology that allows to optimize power generation and transmission infrastructures jointly through an iterative approach based on power transfer distribution factors (PTDFs). As PTDFs are linear representations of the physical load flow equations, they can be implemented in a linear programming environment suitable for large scale problems. The algorithm iteratively updates PTDFs when grid infrastructures are modified due to cost-optimal extension and thus yields an optimal solution with a consistent representation of physical load flows. The method is first demonstrated on a simplified three-node model where it is found to be robust and convergent. It is then applied to the European power system in order to find its cost-optimal development under the prescription of strongly decreasing CO{sub 2} emissions until 2050.

Sequential Optimization of Paths in Directed Graphs Relative to Different Cost Functions

KAUST Repository

Mahayni, Malek A.

2011-07-01

Finding optimal paths in directed graphs is a wide area of research that has received much of attention in theoretical computer science due to its importance in many applications (e.g., computer networks and road maps). Many algorithms have been developed to solve the optimal paths problem with different kinds of graphs. An algorithm that solves the problem of paths’ optimization in directed graphs relative to different cost functions is described in [1]. It follows an approach extended from the dynamic programming approach as it solves the problem sequentially and works on directed graphs with positive weights and no loop edges. The aim of this thesis is to implement and evaluate that algorithm to find the optimal paths in directed graphs relative to two different cost functions ( , ). A possible interpretation of a directed graph is a network of roads so the weights for the function represent the length of roads, whereas the weights for the function represent a constraint of the width or weight of a vehicle. The optimization aim for those two functions is to minimize the cost relative to the function and maximize the constraint value associated with the function. This thesis also includes finding and proving the relation between the two different cost functions ( , ). When given a value of one function, we can find the best possible value for the other function. This relation is proven theoretically and also implemented and experimented using Matlab®[2].

Video-on-demand network design and maintenance using fuzzy optimization.

Science.gov (United States)

Abadpour, Arash; Alfa, Attahiru Sule; Diamond, Jeff

2008-04-01

Video-on-demand (VoD) is the entertainment source that, in the future, will likely overtake regular television in many aspects. Although many companies have deployed working VoD services, some aspects of the VoD should still undergo further improvement in order for it to reach to the foreseen potentials. An important aspect of a VoD system is the underlying network in which it operates. According to the huge number of customers in this network, it should be carefully designed to fulfill certain performance criteria. This process should be capable of finding optimal locations for the nodes of the network as well as determining the content that should be cached in each one. While this problem is categorized in the general group of network optimization problems, its specific characteristics demand a new solution to be sought for it. In this paper, which is inspired by the successful use of fuzzy optimization in similar problems in other fields, a fuzzy objective function that is heuristically shown to minimize the communication cost in a VoD network is derived while also controlling the storage cost. Then, an iterative algorithm is proposed to find a locally optimal solution to the proposed objective function. Capitalizing on the unrepeatable tendency of the proposed algorithm, a heuristic method for picking a good solution from a bundle of solutions produced by the proposed algorithm is also suggested. This paper includes a formal statement of the problem and its mathematical analysis. In addition, different scenarios in which the proposed algorithm can be utilized are discussed.

A mathematical model for optimization of an integrated network logistic design

Directory of Open Access Journals (Sweden)

Lida Tafaghodi

2011-10-01

Full Text Available In this study, the integrated forward/reverse logistics network is investigated, and a capacitated multi-stage, multi-product logistics network design is proposed by formulating a generalized logistics network problem into a mixed-integer nonlinear programming model (MINLP for minimizing the total cost of the closed-loop supply chain network. Moreover, the proposed model is solved by using optimization solver, which provides the decisions related to the facility location problem, optimum quantity of shipped product, and facility capacity. Numerical results show the power of the proposed MINLP model to avoid th sub-optimality caused by separate design of forward and reverse logistics networks and to handle various transportation modes and periodic demand.

Development of a Deterministic Optimization Model for Design of an Integrated Utility and Hydrogen Supply Network

International Nuclear Information System (INIS)

Hwangbo, Soonho; Lee, In-Beum; Han, Jeehoon

2014-01-01

Lots of networks are constructed in a large scale industrial complex. Each network meet their demands through production or transportation of materials which are needed to companies in a network. Network directly produces materials for satisfying demands in a company or purchase form outside due to demand uncertainty, financial factor, and so on. Especially utility network and hydrogen network are typical and major networks in a large scale industrial complex. Many studies have been done mainly with focusing on minimizing the total cost or optimizing the network structure. But, few research tries to make an integrated network model by connecting utility network and hydrogen network. In this study, deterministic mixed integer linear programming model is developed for integrating utility network and hydrogen network. Steam Methane Reforming process is necessary for combining two networks. After producing hydrogen from Steam-Methane Reforming process whose raw material is steam vents from utility network, produced hydrogen go into hydrogen network and fulfill own needs. Proposed model can suggest optimized case in integrated network model, optimized blueprint, and calculate optimal total cost. The capability of the proposed model is tested by applying it to Yeosu industrial complex in Korea. Yeosu industrial complex has the one of the biggest petrochemical complex and various papers are based in data of Yeosu industrial complex. From a case study, the integrated network model suggests more optimal conclusions compared with previous results obtained by individually researching utility network and hydrogen network

Optimization model for the design of distributed wastewater treatment networks

Directory of Open Access Journals (Sweden)

Ibrić Nidret

2012-01-01

Full Text Available In this paper we address the synthesis problem of distributed wastewater networks using mathematical programming approach based on the superstructure optimization. We present a generalized superstructure and optimization model for the design of the distributed wastewater treatment networks. The superstructure includes splitters, treatment units, mixers, with all feasible interconnections including water recirculation. Based on the superstructure the optimization model is presented. The optimization model is given as a nonlinear programming (NLP problem where the objective function can be defined to minimize the total amount of wastewater treated in treatment operations or to minimize the total treatment costs. The NLP model is extended to a mixed integer nonlinear programming (MINLP problem where binary variables are used for the selection of the wastewater treatment technologies. The bounds for all flowrates and concentrations in the wastewater network are specified as general equations. The proposed models are solved using the global optimization solvers (BARON and LINDOGlobal. The application of the proposed models is illustrated on the two wastewater network problems of different complexity. First one is formulated as the NLP and the second one as the MINLP. For the second one the parametric and structural optimization is performed at the same time where optimal flowrates, concentrations as well as optimal technologies for the wastewater treatment are selected. Using the proposed model both problems are solved to global optimality.

Toward Optimal Transport Networks

Science.gov (United States)

Alexandrov, Natalia; Kincaid, Rex K.; Vargo, Erik P.

2008-01-01

Strictly evolutionary approaches to improving the air transport system a highly complex network of interacting systems no longer suffice in the face of demand that is projected to double or triple in the near future. Thus evolutionary approaches should be augmented with active design methods. The ability to actively design, optimize and control a system presupposes the existence of predictive modeling and reasonably well-defined functional dependences between the controllable variables of the system and objective and constraint functions for optimization. Following recent advances in the studies of the effects of network topology structure on dynamics, we investigate the performance of dynamic processes on transport networks as a function of the first nontrivial eigenvalue of the network's Laplacian, which, in turn, is a function of the network s connectivity and modularity. The last two characteristics can be controlled and tuned via optimization. We consider design optimization problem formulations. We have developed a flexible simulation of network topology coupled with flows on the network for use as a platform for computational experiments.

Towards Optimal Transport Networks

Directory of Open Access Journals (Sweden)

Erik P. Vargo

2010-08-01

Full Text Available Our ultimate goal is to design transportation net- works whose dynamic performance metrics (e.g. pas- senger throughput, passenger delay, and insensitivity to weather disturbances are optimized. Here the fo- cus is on optimizing static features of the network that are known to directly affect the network dynamics. First, we present simulation results which support a connection between maximizing the first non-trivial eigenvalue of a network's Laplacian and superior air- port network performance. Then, we explore the ef- fectiveness of a tabu search heuristic for optimizing this metric by comparing experimental results to the- oretical upper bounds. We also consider generating upper bounds on a network's algebraic connectivity via the solution of semidefinite programming (SDP relaxations. A modification of an existing subgraph extraction algorithm is implemented to explore the underlying regional structures in the U.S. airport net- work, with the hope that the resulting localized struc- tures can be optimized independently and reconnected via a "backbone" network to achieve superior network performance.

Optimization of robustness of interdependent network controllability by redundant design.

Directory of Open Access Journals (Sweden)

Zenghu Zhang

Full Text Available Controllability of complex networks has been a hot topic in recent years. Real networks regarded as interdependent networks are always coupled together by multiple networks. The cascading process of interdependent networks including interdependent failure and overload failure will destroy the robustness of controllability for the whole network. Therefore, the optimization of the robustness of interdependent network controllability is of great importance in the research area of complex networks. In this paper, based on the model of interdependent networks constructed first, we determine the cascading process under different proportions of node attacks. Then, the structural controllability of interdependent networks is measured by the minimum driver nodes. Furthermore, we propose a parameter which can be obtained by the structure and minimum driver set of interdependent networks under different proportions of node attacks and analyze the robustness for interdependent network controllability. Finally, we optimize the robustness of interdependent network controllability by redundant design including node backup and redundancy edge backup and improve the redundant design by proposing different strategies according to their cost. Comparative strategies of redundant design are conducted to find the best strategy. Results shows that node backup and redundancy edge backup can indeed decrease those nodes suffering from failure and improve the robustness of controllability. Considering the cost of redundant design, we should choose BBS (betweenness-based strategy or DBS (degree based strategy for node backup and HDF(high degree first for redundancy edge backup. Above all, our proposed strategies are feasible and effective at improving the robustness of interdependent network controllability.

Deterministic network interdiction optimization via an evolutionary approach

International Nuclear Information System (INIS)

Rocco S, Claudio M.; Ramirez-Marquez, Jose Emmanuel

2009-01-01

This paper introduces an evolutionary optimization approach that can be readily applied to solve deterministic network interdiction problems. The network interdiction problem solved considers the minimization of the maximum flow that can be transmitted between a source node and a sink node for a fixed network design when there is a limited amount of resources available to interdict network links. Furthermore, the model assumes that the nominal capacity of each network link and the cost associated with their interdiction can change from link to link. For this problem, the solution approach developed is based on three steps that use: (1) Monte Carlo simulation, to generate potential network interdiction strategies, (2) Ford-Fulkerson algorithm for maximum s-t flow, to analyze strategies' maximum source-sink flow and, (3) an evolutionary optimization technique to define, in probabilistic terms, how likely a link is to appear in the final interdiction strategy. Examples for different sizes of networks and network behavior are used throughout the paper to illustrate the approach. In terms of computational effort, the results illustrate that solutions are obtained from a significantly restricted solution search space. Finally, the authors discuss the need for a reliability perspective to network interdiction, so that solutions developed address more realistic scenarios of such problem

A Multiobjective Optimization Model in Automotive Supply Chain Networks

Directory of Open Access Journals (Sweden)

Abdolhossein Sadrnia

2013-01-01

Full Text Available In the new decade, green investment decisions are attracting more interest in design supply chains due to the hidden economic benefits and environmental legislative barriers. In this paper, a supply chain network design problem with both economic and environmental concerns is presented. Therefore, a multiobjective optimization model that captures the trade-off between the total logistics cost and CO2 emissions is proposed. With regard to the complexity of logistic networks, a new multiobjective swarm intelligence algorithm known as a multiobjective Gravitational search algorithm (MOGSA has been implemented for solving the proposed mathematical model. To evaluate the effectiveness of the model, a comprehensive set of numerical experiments is explained. The results obtained show that the proposed model can be applied as an effective tool in strategic planning for optimizing cost and CO2 emissions in an environmentally friendly automotive supply chain.

Optimization of a truck-drone in tandem delivery network using k-means and genetic algorithm

Energy Technology Data Exchange (ETDEWEB)

Ferrandez, S. M.; Harbison, T.; Weber, T.; Sturges, R.; Rich, R.

2016-07-01

The purpose of this paper is to investigate the effectiveness of implementing unmanned aerial delivery vehicles in delivery networks. We investigate the notion of the reduced overall delivery time, energy, and costs for a truck-drone network by comparing the in-tandem system with a stand-alone delivery effort. The objectives are (1) to investigate the time, energy, and costs associated to a truck-drone delivery network compared to standalone truck or drone, (2) to propose an optimization algorithm that determines the optimal number of launch sites and locations given delivery requirements, and drones per truck, (3) to develop mathematical formulations for closed form estimations for the optimal number of launch locations, optimal total time, as well as the associated cost for the system. The design of the algorithm herein computes the minimal time of delivery utilizing K-means clustering to find launch locations, as well as a genetic algorithm to solve the truck route as a traveling salesmen problem (TSP). The optimal solution is determined by finding the minimum cost associated to the parabolic convex cost function. The optimal min-cost is determined by finding the most efficient launch locations using K-means algorithms to determine launch locations and a genetic algorithm to determine truck route between those launch locations. Results show improvements with in-tandem delivery efforts as opposed to standalone systems. Further, multiple drones per truck are more optimal and contribute to savings in both energy and time. For this, we sampled various initialization variables to derive closed form mathematical solutions for the problem. Ultimately, this provides the necessary analysis of an integrated truck-drone delivery system which could be implemented by a company in order to maximize deliveries while minimizing time and energy. Closed-form mathematical solutions can be used as close estimators for final costs and time. (Author)

Minimum cost connection networks

DEFF Research Database (Denmark)

Hougaard, Jens Leth; Tvede, Mich

In the present paper we consider the allocation of cost in connection networks. Agents have connection demands in form of pairs of locations they want to be connected. Connections between locations are costly to build. The problem is to allocate costs of networks satisfying all connection demands...

Self-Configuration and Self-Optimization Process in Heterogeneous Wireless Networks

Directory of Open Access Journals (Sweden)

Eduardo Camponogara

2010-12-01

Full Text Available Self-organization in Wireless Mesh Networks (WMN is an emergent research area, which is becoming important due to the increasing number of nodes in a network. Consequently, the manual configuration of nodes is either impossible or highly costly. So it is desirable for the nodes to be able to configure themselves. In this paper, we propose an alternative architecture for self-organization of WMN based on Optimized Link State Routing Protocol (OLSR and the ad hoc on demand distance vector (AODV routing protocols as well as using the technology of software agents. We argue that the proposed self-optimization and self-configuration modules increase the throughput of network, reduces delay transmission and network load, decreases the traffic of HELLO messages according to network’s scalability. By simulation analysis, we conclude that the self-optimization and self-configuration mechanisms can significantly improve the performance of OLSR and AODV protocols in comparison to the baseline protocols analyzed.

Self-Configuration and Self-Optimization Process in Heterogeneous Wireless Networks

Science.gov (United States)

Guardalben, Lucas; Villalba, Luis Javier García; Buiati, Fábio; Sobral, João Bosco Mangueira; Camponogara, Eduardo

2011-01-01

Self-organization in Wireless Mesh Networks (WMN) is an emergent research area, which is becoming important due to the increasing number of nodes in a network. Consequently, the manual configuration of nodes is either impossible or highly costly. So it is desirable for the nodes to be able to configure themselves. In this paper, we propose an alternative architecture for self-organization of WMN based on Optimized Link State Routing Protocol (OLSR) and the ad hoc on demand distance vector (AODV) routing protocols as well as using the technology of software agents. We argue that the proposed self-optimization and self-configuration modules increase the throughput of network, reduces delay transmission and network load, decreases the traffic of HELLO messages according to network’s scalability. By simulation analysis, we conclude that the self-optimization and self-configuration mechanisms can significantly improve the performance of OLSR and AODV protocols in comparison to the baseline protocols analyzed. PMID:22346584

Location based Network Optimizations for Mobile Wireless Networks

DEFF Research Database (Denmark)

Nielsen, Jimmy Jessen

selection in Wi-Fi networks and predictive handover optimization in heterogeneous wireless networks. The investigations in this work have indicated that location based network optimizations are beneficial compared to typical link measurement based approaches. Especially the knowledge of geographical...

AS Migration and Optimization of the Power Integrated Data Network

Science.gov (United States)

Zhou, Junjie; Ke, Yue

2018-03-01

In the transformation process of data integration network, the impact on the business has always been the most important reference factor to measure the quality of network transformation. With the importance of the data network carrying business, we must put forward specific design proposals during the transformation, and conduct a large number of demonstration and practice to ensure that the transformation program meets the requirements of the enterprise data network. This paper mainly demonstrates the scheme of over-migrating point-to-point access equipment in the reconstruction project of power data comprehensive network to migrate the BGP autonomous domain to the specified domain defined in the industrial standard, and to smooth the intranet OSPF protocol Migration into ISIS agreement. Through the optimization design, eventually making electric power data network performance was improved on traffic forwarding, traffic forwarding path optimized, extensibility, get larger, lower risk of potential loop, the network stability was improved, and operational cost savings, etc.

Energy aware swarm optimization with intercluster search for wireless sensor network.

Science.gov (United States)

Thilagavathi, Shanmugasundaram; Geetha, Bhavani Gnanasambandan

2015-01-01

Wireless sensor networks (WSNs) are emerging as a low cost popular solution for many real-world challenges. The low cost ensures deployment of large sensor arrays to perform military and civilian tasks. Generally, WSNs are power constrained due to their unique deployment method which makes replacement of battery source difficult. Challenges in WSN include a well-organized communication platform for the network with negligible power utilization. In this work, an improved binary particle swarm optimization (PSO) algorithm with modified connected dominating set (CDS) based on residual energy is proposed for discovery of optimal number of clusters and cluster head (CH). Simulations show that the proposed BPSO-T and BPSO-EADS perform better than LEACH- and PSO-based system in terms of energy savings and QOS.

A Low-Carbon-Based Bilevel Optimization Model for Public Transit Network

Directory of Open Access Journals (Sweden)

Xu Sun

2013-01-01

Full Text Available To satisfy the demand of low-carbon transportation, this paper studies the optimization of public transit network based on the concept of low carbon. Taking travel time, operation cost, energy consumption, pollutant emission, and traffic efficiency as the optimization objectives, a bilevel model is proposed in order to maximize the benefits of both travelers and operators and minimize the environmental cost. Then the model is solved with the differential evolution (DE algorithm and applied to a real network of Baoji city. The results show that the model can not only ensure the benefits of travelers and operators, but can also reduce pollutant emission and energy consumption caused by the operations of buses, which reflects the concept of low carbon.

Optimal network structure to induce the maximal small-world effect

International Nuclear Information System (INIS)

Zhang Zheng-Zhen; Xu Wen-Jun; Lin Jia-Ru; Zeng Shang-You

2014-01-01

In this paper, the general efficiency, which is the average of the global efficiency and the local efficiency, is defined to measure the communication efficiency of a network. The increasing ratio of the general efficiency of a small-world network relative to that of the corresponding regular network is used to measure the small-world effect quantitatively. The more considerable the small-world effect, the higher the general efficiency of a network with a certain cost is. It is shown that the small-world effect increases monotonically with the increase of the vertex number. The optimal rewiring probability to induce the best small-world effect is approximately 0.02 and the optimal average connection probability decreases monotonically with the increase of the vertex number. Therefore, the optimal network structure to induce the maximal small-world effect is the structure with the large vertex number (> 500), the small rewiring probability (≍ 0.02) and the small average connection probability (< 0.1). Many previous research results support our results. (interdisciplinary physics and related areas of science and technology)

Networks and Transaction Costs

DEFF Research Database (Denmark)

Henning, Christian; Henningsen, Geraldine; Henningsen, Arne

2011-01-01

Based on the well-known fact that social networks can provide effective mechanisms that help to increase the trust level between two trade partners, we apply a simple game-theoretical framework to derive transaction costs as a high risk of opportunistic behavior in a repeated trade relation...... determined by the density and size of trading networks. In the empirical part of the paper we apply a two stage procedure to estimate the impact of social network structures on farm’s transaction costs observed for different input and output markets. At a first stage we estimate a multiple input...... transaction cost functions for all traded farm inputs and outputs. Estimation results based on a sample of 315 Polish farms imply a significant influence of social network structures on farm’s transaction costs. Moreover, estimated transaction costs correspond to a reasonable amount of farm specific shadow...

Networks and Transaction Costs

DEFF Research Database (Denmark)

Henning, Christian; Henningsen, Geraldine; Henningsen, Arne

2011-01-01

determined by the density and size of trading networks. In the empirical part of the paper we apply a two stage procedure to estimate the impact of social network structures on farm’s transaction costs observed for different input and output markets. At a first stage we estimate a multiple input......Based on the well-known fact that social networks can provide effective mechanisms that help to increase the trust level between two trade partners, we apply a simple game-theoretical framework to derive transaction costs as a high risk of opportunistic behavior in a repeated trade relation...... transaction cost functions for all traded farm inputs and outputs. Estimation results based on a sample of 315 Polish farms imply a significant influence of social network structures on farm’s transaction costs. Moreover, estimated transaction costs correspond to a reasonable amount of farm specific shadow...

Cost Minimization Model of Gas Transmission Line for Indonesian SIJ Pipeline Network

Directory of Open Access Journals (Sweden)

Septoratno Siregar

2003-05-01

Full Text Available Optimization of Indonesian SIJ gas pipeline network is being discussed here. Optimum pipe diameters together with the corresponding pressure distribution are obtained from minimization of total cost function consisting of investment and operating costs and subjects to some physical (Panhandle A and Panhandle B equations constraints. Iteration technique based on Generalized Steepest-Descent and fourth order Runge-Kutta method are used here. The resulting diameters from this continuous optimization are then rounded to the closest available discrete sizes. We have also calculated toll fee along each segment and safety factor of the network by determining the pipe wall thickness, using ANSI B31.8 standard. Sensitivity analysis of toll fee for variation of flow rates is shown here. The result will gives the diameter and compressor size and compressor location that feasible to use for the SIJ pipeline project. The Result also indicates that the east route cost relatively less expensive than the west cost.

Cost efficiency and optimal scale of electricity distribution firms in Taiwan: An application of metafrontier analysis

International Nuclear Information System (INIS)

Huang, Y.-J.; Chen, K.-H.; Yang, C.-H.

2010-01-01

This paper analyzes the cost efficiency and optimal scale of Taiwan's electricity distribution industry. Due to the substantial difference in network density, firms may differ widely in production technology. We employ the stochastic metafrontier approach to estimate the cost efficiency of 24 distribution units during the period 1997-2002. Empirical results find that the average cost efficiency is overestimated using the traditional stochastic frontier model, especially for low density regions. The average cost efficiency of the high density group is significantly higher than that of the low density group as it benefits from network economies. This study also calculates both short-term and long-term optimal scales of electricity distribution firms, lending policy implications for the deregulation of the electricity distribution industry.

A Spectrum Handoff Scheme for Optimal Network Selection in NEMO Based Cognitive Radio Vehicular Networks

Directory of Open Access Journals (Sweden)

Krishan Kumar

2017-01-01

Full Text Available When a mobile network changes its point of attachments in Cognitive Radio (CR vehicular networks, the Mobile Router (MR requires spectrum handoff. Network Mobility (NEMO in CR vehicular networks is concerned with the management of this movement. In future NEMO based CR vehicular networks deployment, multiple radio access networks may coexist in the overlapping areas having different characteristics in terms of multiple attributes. The CR vehicular node may have the capability to make call for two or more types of nonsafety services such as voice, video, and best effort simultaneously. Hence, it becomes difficult for MR to select optimal network for the spectrum handoff. This can be done by performing spectrum handoff using Multiple Attributes Decision Making (MADM methods which is the objective of the paper. The MADM methods such as grey relational analysis and cost based methods are used. The application of MADM methods provides wider and optimum choice among the available networks with quality of service. Numerical results reveal that the proposed scheme is effective for spectrum handoff decision for optimal network selection with reduced complexity in NEMO based CR vehicular networks.

Optimizing Cellular Networks Enabled with Renewal Energy via Strategic Learning.

Science.gov (United States)

Sohn, Insoo; Liu, Huaping; Ansari, Nirwan

2015-01-01

An important issue in the cellular industry is the rising energy cost and carbon footprint due to the rapid expansion of the cellular infrastructure. Greening cellular networks has thus attracted attention. Among the promising green cellular network techniques, the renewable energy-powered cellular network has drawn increasing attention as a critical element towards reducing carbon emissions due to massive energy consumption in the base stations deployed in cellular networks. Game theory is a branch of mathematics that is used to evaluate and optimize systems with multiple players with conflicting objectives and has been successfully used to solve various problems in cellular networks. In this paper, we model the green energy utilization and power consumption optimization problem of a green cellular network as a pilot power selection strategic game and propose a novel distributed algorithm based on a strategic learning method. The simulation results indicate that the proposed algorithm achieves correlated equilibrium of the pilot power selection game, resulting in optimum green energy utilization and power consumption reduction.

Effects of network node consolidation in optical access and aggregation networks on costs and power consumption

Science.gov (United States)

Lange, Christoph; Hülsermann, Ralf; Kosiankowski, Dirk; Geilhardt, Frank; Gladisch, Andreas

2010-01-01

The increasing demand for higher bit rates in access networks requires fiber deployment closer to the subscriber resulting in fiber-to-the-home (FTTH) access networks. Besides higher access bit rates optical access network infrastructure and related technologies enable the network operator to establish larger service areas resulting in a simplified network structure with a lower number of network nodes. By changing the network structure network operators want to benefit from a changed network cost structure by decreasing in short and mid term the upfront investments for network equipment due to concentration effects as well as by reducing the energy costs due to a higher energy efficiency of large network sites housing a high amount of network equipment. In long term also savings in operational expenditures (OpEx) due to the closing of central office (CO) sites are expected. In this paper different architectures for optical access networks basing on state-of-the-art technology are analyzed with respect to network installation costs and power consumption in the context of access node consolidation. Network planning and dimensioning results are calculated for a realistic network scenario of Germany. All node consolidation scenarios are compared against a gigabit capable passive optical network (GPON) based FTTH access network operated from the conventional CO sites. The results show that a moderate reduction of the number of access nodes may be beneficial since in that case the capital expenditures (CapEx) do not rise extraordinarily and savings in OpEx related to the access nodes are expected. The total power consumption does not change significantly with decreasing number of access nodes but clustering effects enable a more energyefficient network operation and optimized power purchase order quantities leading to benefits in energy costs.

Energy Aware Swarm Optimization with Intercluster Search for Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Shanmugasundaram Thilagavathi

2015-01-01

Full Text Available Wireless sensor networks (WSNs are emerging as a low cost popular solution for many real-world challenges. The low cost ensures deployment of large sensor arrays to perform military and civilian tasks. Generally, WSNs are power constrained due to their unique deployment method which makes replacement of battery source difficult. Challenges in WSN include a well-organized communication platform for the network with negligible power utilization. In this work, an improved binary particle swarm optimization (PSO algorithm with modified connected dominating set (CDS based on residual energy is proposed for discovery of optimal number of clusters and cluster head (CH. Simulations show that the proposed BPSO-T and BPSO-EADS perform better than LEACH- and PSO-based system in terms of energy savings and QOS.

Model checking optimal finite-horizon control for probabilistic gene regulatory networks.

Science.gov (United States)

Wei, Ou; Guo, Zonghao; Niu, Yun; Liao, Wenyuan

2017-12-14

Probabilistic Boolean networks (PBNs) have been proposed for analyzing external control in gene regulatory networks with incorporation of uncertainty. A context-sensitive PBN with perturbation (CS-PBNp), extending a PBN with context-sensitivity to reflect the inherent biological stability and random perturbations to express the impact of external stimuli, is considered to be more suitable for modeling small biological systems intervened by conditions from the outside. In this paper, we apply probabilistic model checking, a formal verification technique, to optimal control for a CS-PBNp that minimizes the expected cost over a finite control horizon. We first describe a procedure of modeling a CS-PBNp using the language provided by a widely used probabilistic model checker PRISM. We then analyze the reward-based temporal properties and the computation in probabilistic model checking; based on the analysis, we provide a method to formulate the optimal control problem as minimum reachability reward properties. Furthermore, we incorporate control and state cost information into the PRISM code of a CS-PBNp such that automated model checking a minimum reachability reward property on the code gives the solution to the optimal control problem. We conduct experiments on two examples, an apoptosis network and a WNT5A network. Preliminary experiment results show the feasibility and effectiveness of our approach. The approach based on probabilistic model checking for optimal control avoids explicit computation of large-size state transition relations associated with PBNs. It enables a natural depiction of the dynamics of gene regulatory networks, and provides a canonical form to formulate optimal control problems using temporal properties that can be automated solved by leveraging the analysis power of underlying model checking engines. This work will be helpful for further utilization of the advances in formal verification techniques in system biology.

Optimization of power distribution networks; Optimierung von Energieverteilungsnetzen

Energy Technology Data Exchange (ETDEWEB)

Casteren, J. van [Digsilent GmbH (Netherlands); Chalmers Univ. of Technology, Goeteborg (Sweden)

2000-03-01

In a competition-oriented power market the optimization of distribution networks is more and more becoming a search for minimum investment and operating cost where all relevant cost factors should be taken into account. A so far neglected factor is the expectation of reliability-related cost. A new analytical calculation method permits flexible, realistic estimation of interruption costs to be expected. (orig.) [German] In einem wettbewerbsorientierten Strom-Markt wird die Optimierung der Verteilungsnetze mehr und mehr zu einer Suche nach den minimalen Investitions- und Betriebskosten, wobei moeglichst alle relevanten Kostenfaktoren beruecksichtigt werden muessen. Ein bisher vernachlaessigter Faktor ist dabei die Erwartung der zuverlaessigkeitsbedingten Kosten. Ein neues analytisches Berechnungsverfahren erlaubt nun flexibel eine realistische Abschaetzung der zu erwarteten Unterbrechungskosten. (orig.)

Optimizing cost-efficiency in mean exposure assessment--cost functions reconsidered.

Science.gov (United States)

Mathiassen, Svend Erik; Bolin, Kristian

2011-05-21

Reliable exposure data is a vital concern in medical epidemiology and intervention studies. The present study addresses the needs of the medical researcher to spend monetary resources devoted to exposure assessment with an optimal cost-efficiency, i.e. obtain the best possible statistical performance at a specified budget. A few previous studies have suggested mathematical optimization procedures based on very simple cost models; this study extends the methodology to cover even non-linear cost scenarios. Statistical performance, i.e. efficiency, was assessed in terms of the precision of an exposure mean value, as determined in a hierarchical, nested measurement model with three stages. Total costs were assessed using a corresponding three-stage cost model, allowing costs at each stage to vary non-linearly with the number of measurements according to a power function. Using these models, procedures for identifying the optimally cost-efficient allocation of measurements under a constrained budget were developed, and applied on 225 scenarios combining different sizes of unit costs, cost function exponents, and exposure variance components. Explicit mathematical rules for identifying optimal allocation could be developed when cost functions were linear, while non-linear cost functions implied that parts of or the entire optimization procedure had to be carried out using numerical methods.For many of the 225 scenarios, the optimal strategy consisted in measuring on only one occasion from each of as many subjects as allowed by the budget. Significant deviations from this principle occurred if costs for recruiting subjects were large compared to costs for setting up measurement occasions, and, at the same time, the between-subjects to within-subject variance ratio was small. In these cases, non-linearities had a profound influence on the optimal allocation and on the eventual size of the exposure data set. The analysis procedures developed in the present study can be used

Network ownership and optimal tariffs for natural gas transport

International Nuclear Information System (INIS)

Hagen, Kaare P.; Kind, Hans Jarle; Sannarnes, Jan Gaute

2004-11-01

This paper addresses the issue of national optimal tariffs for transportation of natural gas in a setting where national gas production in its entirety is exported to end-user markets abroad. In a situation where the transportation network is owned altogether by a vertically integrated national gas producer, it is shown that the optimal tariff depends on the ownership structure in the integrated transportation company as well as in the non-facility based gas company. There are two reasons why it is possibly optimal with a mark-up on marginal transportation costs. First, there is a premium on public revenue if domestic taxation is distorting. Second, with incomplete national taxation of rents from the gas sector, the transportation tariffs can serve as a second best way of appropriating rents accruing to foreigners. In a situation where the network is run as a separate entity subject to a rate of return regulation, it will be optimal to discriminate the tariffs between shippers for the usual Ramseyean reasons. (Author)

Multiobjective Optimization of Water Distribution Networks Using Fuzzy Theory and Harmony Search

Directory of Open Access Journals (Sweden)

Zong Woo Geem

2015-07-01

Full Text Available Thus far, various phenomenon-mimicking algorithms, such as genetic algorithm, simulated annealing, tabu search, shuffled frog-leaping, ant colony optimization, harmony search, cross entropy, scatter search, and honey-bee mating, have been proposed to optimally design the water distribution networks with respect to design cost. However, flow velocity constraint, which is critical for structural robustness against water hammer or flow circulation against substance sedimentation, was seldom considered in the optimization formulation because of computational complexity. Thus, this study proposes a novel fuzzy-based velocity reliability index, which is to be maximized while the design cost is simultaneously minimized. The velocity reliability index is included in the existing cost optimization formulation and this extended multiobjective formulation is applied to two bench-mark problems. Results show that the model successfully found a Pareto set of multiobjective design solutions in terms of cost minimization and reliability maximization.

Hybrid Swarm Intelligence Optimization Approach for Optimal Data Storage Position Identification in Wireless Sensor Networks

Science.gov (United States)

Mohanasundaram, Ranganathan; Periasamy, Pappampalayam Sanmugam

2015-01-01

The current high profile debate with regard to data storage and its growth have become strategic task in the world of networking. It mainly depends on the sensor nodes called producers, base stations, and also the consumers (users and sensor nodes) to retrieve and use the data. The main concern dealt here is to find an optimal data storage position in wireless sensor networks. The works that have been carried out earlier did not utilize swarm intelligence based optimization approaches to find the optimal data storage positions. To achieve this goal, an efficient swam intelligence approach is used to choose suitable positions for a storage node. Thus, hybrid particle swarm optimization algorithm has been used to find the suitable positions for storage nodes while the total energy cost of data transmission is minimized. Clustering-based distributed data storage is utilized to solve clustering problem using fuzzy-C-means algorithm. This research work also considers the data rates and locations of multiple producers and consumers to find optimal data storage positions. The algorithm is implemented in a network simulator and the experimental results show that the proposed clustering and swarm intelligence based ODS strategy is more effective than the earlier approaches. PMID:25734182

Optimization of a truck-drone in tandem delivery network using k-means and genetic algorithm

Directory of Open Access Journals (Sweden)

Sergio Mourelo Ferrandez

2016-04-01

Full Text Available Purpose: The purpose of this paper is to investigate the effectiveness of implementing unmanned aerial delivery vehicles in delivery networks. We investigate the notion of the reduced overall delivery time, energy, and costs for a truck-drone network by comparing the in-tandem system with a stand-alone delivery effort. The objectives are (1 to investigate the time, energy, and costs associated to a truck-drone delivery network compared to standalone truck or drone, (2 to propose an optimization algorithm that determines the optimal number of launch sites and locations given delivery requirements, and drones per truck, (3 to develop mathematical formulations for closed form estimations for the optimal number of launch locations, optimal total time, as well as the associated cost for the system. Design/methodology/approach: The design of the algorithm herein computes the minimal time of delivery utilizing K-means clustering to find launch locations, as well as a genetic algorithm to solve the truck route as a traveling salesmen problem (TSP. The optimal solution is determined by finding the minimum cost associated to the parabolic convex cost function. The optimal min-cost is determined by finding the most efficient launch locations using K-means algorithms to determine launch locations and a genetic algorithm to determine truck route between those launch locations.  Findings: Results show improvements with in-tandem delivery efforts as opposed to standalone systems. Further, multiple drones per truck are more optimal and contribute to savings in both energy and time. For this, we sampled various initialization variables to derive closed form mathematical solutions for the problem. Originality/value: Ultimately, this provides the necessary analysis of an integrated truck-drone delivery system which could be implemented by a company in order to maximize deliveries while minimizing time and energy. Closed-form mathematical solutions can be used as

Optimized Energy Procurement for Cellular Networks with Uncertain Renewable Energy Generation

KAUST Repository

Rached, Nadhir B.

2017-02-07

Renewable energy (RE) is an emerging solution for reducing carbon dioxide (CO2) emissions from cellular networks. One of the challenges of using RE sources is to handle its inherent uncertainty. In this paper, a RE powered cellular network is investigated. For a one-day operation cycle, the cellular network aims to reduce energy procurement costs from the smart grid by optimizing the amounts of energy procured from their locally deployed RE sources as well as from the smart grid. In addition to that, it aims to determine the extra amount of energy to be sold to the electrical grid at each time period. Chance constrained optimization is first proposed to deal with the randomness in the RE generation. Then, to make the optimization problem tractable, two well- know convex approximation methods, namely; Chernoff and Chebyshev based-approaches, are analyzed in details. Numerical results investigate the optimized energy procurement for various daily scenarios and compare between the performances of the employed convex approximation approaches.

Optimization of the Compensation of a Meshed MV Network by a Modified Genetic Algorithm

DEFF Research Database (Denmark)

Nielsen, Hans; Paar, M.; Toman, P.

2007-01-01

The article discusses the utilization of a modified genetic algorithm (GA) for the optimization of the shunt compensation in meshed and radial MV distribution networks. The algorithm looks for minimum costs of the network power losses and minimum capital and operating costs of applied capacitors......, all of this under limitations specified by a multicriteria penalization function. The parallel evolution branches in the GA are used for the purpose of the optimization accelaration. The application of this GA has been implemented in Matlab. The evaluation part of the GA implementation is based...... on the steady-state analysis using a linear one-line diagram model of a power network. The results of steady-state solutions are compared with the results from the DIgSILENT PowerFactory program. Its practical applicability is demonstrated on examples of 22 kV and meshed overhead distribution networks....

Prediction of Optimal Design and Deflection of Space Structures Using Neural Networks

Directory of Open Access Journals (Sweden)

Reza Kamyab Moghadas

2012-01-01

Full Text Available The main aim of the present work is to determine the optimal design and maximum deflection of double layer grids spending low computational cost using neural networks. The design variables of the optimization problem are cross-sectional area of the elements as well as the length of the span and height of the structures. In this paper, a number of double layer grids with various random values of length and height are selected and optimized by simultaneous perturbation stochastic approximation algorithm. Then, radial basis function (RBF and generalized regression (GR neural networks are trained to predict the optimal design and maximum deflection of the structures. The numerical results demonstrate the efficiency of the proposed methodology.

Towards Optimal Event Detection and Localization in Acyclic Flow Networks

KAUST Repository

Agumbe Suresh, Mahima

2012-01-03

Acyclic flow networks, present in many infrastructures of national importance (e.g., oil & gas and water distribution systems), have been attracting immense research interest. Existing solutions for detecting and locating attacks against these infrastructures, have been proven costly and imprecise, especially when dealing with large scale distribution systems. In this paper, to the best of our knowledge for the first time, we investigate how mobile sensor networks can be used for optimal event detection and localization in acyclic flow networks. Sensor nodes move along the edges of the network and detect events (i.e., attacks) and proximity to beacon nodes with known placement in the network. We formulate the problem of minimizing the cost of monitoring infrastructure (i.e., minimizing the number of sensor and beacon nodes deployed), while ensuring a degree of sensing coverage in a zone of interest and a required accuracy in locating events. We propose algorithms for solving these problems and demonstrate their effectiveness with results obtained from a high fidelity simulator.

Production of Low Cost Carbon-Fiber through Energy Optimization of Stabilization Process

Directory of Open Access Journals (Sweden)

Gelayol Golkarnarenji

2018-03-01

Full Text Available To produce high quality and low cost carbon fiber-based composites, the optimization of the production process of carbon fiber and its properties is one of the main keys. The stabilization process is the most important step in carbon fiber production that consumes a large amount of energy and its optimization can reduce the cost to a large extent. In this study, two intelligent optimization techniques, namely Support Vector Regression (SVR and Artificial Neural Network (ANN, were studied and compared, with a limited dataset obtained to predict physical property (density of oxidative stabilized PAN fiber (OPF in the second zone of a stabilization oven within a carbon fiber production line. The results were then used to optimize the energy consumption in the process. The case study can be beneficial to chemical industries involving carbon fiber manufacturing, for assessing and optimizing different stabilization process conditions at large.

Optimal multicasting in a multi-line-rate ethernet-over-WDM network

Science.gov (United States)

Harve, Shruthi; Batayneh, Marwan; Mukherjee, Biswanath

2009-11-01

Ethernet is the dominant transport technology for Local Area Networks. Efforts are now under way to use carrier-grade Ethernet in backbone networks of different service providers. With the advent of applications such as IPTV and Videoon- Demand, there is need for techniques to route multicast traffic over the Ethernet backbone networks. Here, we address the problem of Routing and Wavelength Assignment (RWA) of a set of multicast requests in a Multi-Line-Rate Ethernet backbone network with the objective of minimizing the cost of setting up the network, in terms of the Service Provider's Capital Expenditure (CAPEX). We present an Auxiliary Graph based heuristic algorithm that routes each multicast request on a light-tree structure, and assigns minimum cost wavelengths along the route. We compare the properties of the algorithm to the optimal solution given by a mathematical model formulated as an Integer Linear Program (ILP), and show that they compare very well. We also find that the algorithm is most cost-effective when the incoming requests are processed in descending order of their bandwidth requirements.

Optimal design of permanent magnet flux switching generator for wind applications via artificial neural network and multi-objective particle swarm optimization hybrid approach

International Nuclear Information System (INIS)

Meo, Santolo; Zohoori, Alireza; Vahedi, Abolfazl

2016-01-01

Highlights: • A new optimal design of flux switching permanent magnet generator is developed. • A prototype is employed to validate numerical data used for optimization. • A novel hybrid multi-objective particle swarm optimization approach is proposed. • Optimization targets are weight, cost, voltage and its total harmonic distortion. • The hybrid approach preference is proved compared with other optimization methods. - Abstract: In this paper a new hybrid approach obtained combining a multi-objective particle swarm optimization and artificial neural network is proposed for the design optimization of a direct-drive permanent magnet flux switching generators for low power wind applications. The targets of the proposed multi-objective optimization are to reduce the costs and weight of the machine while maximizing the amplitude of the induced voltage as well as minimizing its total harmonic distortion. The permanent magnet width, the stator and rotor tooth width, the rotor teeth number and stator pole number of the machine define the search space for the optimization problem. Four supervised artificial neural networks are designed for modeling the complex relationships among the weight, the cost, the amplitude and the total harmonic distortion of the output voltage respect to the quantities of the search space. Finite element analysis is adopted to generate training dataset for the artificial neural networks. Finite element analysis based model is verified by experimental results with a 1.5 kW permanent magnet flux switching generator prototype suitable for renewable energy applications, having 6/19 stator poles/rotor teeth. Finally the effectiveness of the proposed hybrid procedure is compared with the results given by conventional multi-objective optimization algorithms. The obtained results show the soundness of the proposed multi objective optimization technique and its feasibility to be adopted as suitable methodology for optimal design of permanent

A New Wavelength Optimization and Energy-Saving Scheme Based on Network Coding in Software-Defined WDM-PON Networks

Science.gov (United States)

Ren, Danping; Wu, Shanshan; Zhang, Lijing

2016-09-01

In view of the characteristics of the global control and flexible monitor of software-defined networks (SDN), we proposes a new optical access network architecture dedicated to Wavelength Division Multiplexing-Passive Optical Network (WDM-PON) systems based on SDN. The network coding (NC) technology is also applied into this architecture to enhance the utilization of wavelength resource and reduce the costs of light source. Simulation results show that this scheme can optimize the throughput of the WDM-PON network, greatly reduce the system time delay and energy consumption.

A Method of Dynamic Extended Reactive Power Optimization in Distribution Network Containing Photovoltaic-Storage System

Science.gov (United States)

Wang, Wu; Huang, Wei; Zhang, Yongjun

2018-03-01

The grid-integration of Photovoltaic-Storage System brings some undefined factors to the network. In order to make full use of the adjusting ability of Photovoltaic-Storage System (PSS), this paper puts forward a reactive power optimization model, which are used to construct the objective function based on power loss and the device adjusting cost, including energy storage adjusting cost. By using Cataclysmic Genetic Algorithm to solve this optimization problem, and comparing with other optimization method, the result proved that: the method of dynamic extended reactive power optimization this article puts forward, can enhance the effect of reactive power optimization, including reducing power loss and device adjusting cost, meanwhile, it gives consideration to the safety of voltage.

Management and optimization of the CPCU network working

Energy Technology Data Exchange (ETDEWEB)

Silvain, D. (Compagnie Parisienne de Chauffage Urbain, 75 - Paris (FR))

1991-10-01

The CPCU steam distribution network is supplemented by a return network for the condensation water. The data system installed in 1988 provides, for the real time, management of the function of the two networks and a reduction in production costs. For the steam, data required in the network, the boiler houses and from external sources are processed by local network of five microprocessors and permit: - with time delay: technical and economic production optimizing calculations, or forecasts, for the following day, of the total required output and the procedure necessary for supplying this at the lowest cost; - in real time: on the basis of the forecasts for the previous day, creating the production instructions for the boiler houses and the instructions for the network remote control elements; - in case of an unexpected occurrence: immediate creation of new operating forecasts for the boiler houses for the establishing management data in real time. For the water, the system forecasts the volume to be returned to the boiler depending on the quantity of steam to be produced. Subsequently, an analysis is carried out in real time of pressures and outputs measured in the network for deriving valve movements and the pump stop/start procedure for guaranteeing the return of the water. The architecture, basic principles and software developed for this application can be used in other steam or water networks and, in a general manner, are adaptable for the management of any complex multi-supplier or multicustomer systems.

A practical algorithm for optimal operation management of distribution network including fuel cell power plants

Energy Technology Data Exchange (ETDEWEB)

Niknam, Taher; Meymand, Hamed Zeinoddini; Nayeripour, Majid [Electrical and Electronic Engineering Department, Shiraz University of Technology, Shiraz (Iran)

2010-08-15

Fuel cell power plants (FCPPs) have been taken into a great deal of consideration in recent years. The continuing growth of the power demand together with environmental constraints is increasing interest to use FCPPs in power system. Since FCPPs are usually connected to distribution network, the effect of FCPPs on distribution network is more than other sections of power system. One of the most important issues in distribution networks is optimal operation management (OOM) which can be affected by FCPPs. This paper proposes a new approach for optimal operation management of distribution networks including FCCPs. In the article, we consider the total electrical energy losses, the total electrical energy cost and the total emission as the objective functions which should be minimized. Whereas the optimal operation in distribution networks has a nonlinear mixed integer optimization problem, the optimal solution could be obtained through an evolutionary method. We use a new evolutionary algorithm based on Fuzzy Adaptive Particle Swarm Optimization (FAPSO) to solve the optimal operation problem and compare this method with Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Differential Evolution (DE), Ant Colony Optimization (ACO) and Tabu Search (TS) over two distribution test feeders. (author)

A Risk-Based Multi-Objective Optimization Concept for Early-Warning Monitoring Networks

Science.gov (United States)

Bode, F.; Loschko, M.; Nowak, W.

2014-12-01

Groundwater is a resource for drinking water and hence needs to be protected from contaminations. However, many well catchments include an inventory of known and unknown risk sources which cannot be eliminated, especially in urban regions. As matter of risk control, all these risk sources should be monitored. A one-to-one monitoring situation for each risk source would lead to a cost explosion and is even impossible for unknown risk sources. However, smart optimization concepts could help to find promising low-cost monitoring network designs.In this work we develop a concept to plan monitoring networks using multi-objective optimization. Our considered objectives are to maximize the probability of detecting all contaminations and the early warning time and to minimize the installation and operating costs of the monitoring network. A qualitative risk ranking is used to prioritize the known risk sources for monitoring. The unknown risk sources can neither be located nor ranked. Instead, we represent them by a virtual line of risk sources surrounding the production well.We classify risk sources into four different categories: severe, medium and tolerable for known risk sources and an extra category for the unknown ones. With that, early warning time and detection probability become individual objectives for each risk class. Thus, decision makers can identify monitoring networks which are valid for controlling the top risk sources, and evaluate the capabilities (or search for least-cost upgrade) to also cover moderate, tolerable and unknown risk sources. Monitoring networks which are valid for the remaining risk also cover all other risk sources but the early-warning time suffers.The data provided for the optimization algorithm are calculated in a preprocessing step by a flow and transport model. Uncertainties due to hydro(geo)logical phenomena are taken into account by Monte-Carlo simulations. To avoid numerical dispersion during the transport simulations we use the

Optimal topologies for maximizing network transmission capacity

Science.gov (United States)

Chen, Zhenhao; Wu, Jiajing; Rong, Zhihai; Tse, Chi K.

2018-04-01

It has been widely demonstrated that the structure of a network is a major factor that affects its traffic dynamics. In this work, we try to identify the optimal topologies for maximizing the network transmission capacity, as well as to build a clear relationship between structural features of a network and the transmission performance in terms of traffic delivery. We propose an approach for designing optimal network topologies against traffic congestion by link rewiring and apply them on the Barabási-Albert scale-free, static scale-free and Internet Autonomous System-level networks. Furthermore, we analyze the optimized networks using complex network parameters that characterize the structure of networks, and our simulation results suggest that an optimal network for traffic transmission is more likely to have a core-periphery structure. However, assortative mixing and the rich-club phenomenon may have negative impacts on network performance. Based on the observations of the optimized networks, we propose an efficient method to improve the transmission capacity of large-scale networks.

Quantized hopfield networks for reliability optimization

International Nuclear Information System (INIS)

Nourelfath, Mustapha; Nahas, Nabil

2003-01-01

The use of neural networks in the reliability optimization field is rare. This paper presents an application of a recent kind of neural networks in a reliability optimization problem for a series system with multiple-choice constraints incorporated at each subsystem, to maximize the system reliability subject to the system budget. The problem is formulated as a nonlinear binary integer programming problem and characterized as an NP-hard problem. Our design of neural network to solve efficiently this problem is based on a quantized Hopfield network. This network allows us to obtain optimal design solutions very frequently and much more quickly than others Hopfield networks

Optimization of neural network algorithm of the land market description

Directory of Open Access Journals (Sweden)

M. A. Karpovich

2016-01-01

Full Text Available The advantages of neural network technology is shown in comparison of traditional descriptions of dynamically changing systems, which include a modern land market. The basic difficulty arising in the practical implementation of neural network models of the land market and construction products is revealed It is the formation of a representative set of training and test examples. The requirements which are necessary for the correct description of the current economic situation has been determined, it consists in the fact that Train-paid-set in the feature space should not has the ranges with a low density of observations. The methods of optimization of empirical array, which allow to avoid the long-range extrapolation of data from range of concentration of the set of examples are formulated. It is shown that a radical method of optimization a set of training and test examples enclosing to collect supplemantary information, is associated with significant costs time and resources for the economic problems and the ratio of cost / efficiency is less efficient than an algorithm optimization neural network models the earth market fixed set of empirical data. Algorithm of optimization based on the transformation of arrays of information which represents the expansion of the ranges of concentration of the set of examples and compression the ranges of low density of observations is analyzed in details. The significant reduction in the relative error of land price description is demonstrated on the specific example of Voronezh region market of lands which intend for road construction, it makes the using of radical method of empirical optimization of the array costeffective with accounting the significant absolute value of the land. The high economic efficiency of the proposed algorithms is demonstrated.

Optimal design of mixed-media packet-switching networks - Routing and capacity assignment

Science.gov (United States)

Huynh, D.; Kuo, F. F.; Kobayashi, H.

1977-01-01

This paper considers a mixed-media packet-switched computer communication network which consists of a low-delay terrestrial store-and-forward subnet combined with a low-cost high-bandwidth satellite subnet. We show how to route traffic via ground and/or satellite links by means of static, deterministic procedures and assign capacities to channels subject to a given linear cost such that the network average delay is minimized. Two operational schemes for this network model are investigated: one is a scheme in which the satellite channel is used as a slotted ALOHA channel; the other is a new multiaccess scheme we propose in which whenever a channel collision occurs, retransmission of the involved packets will route through ground links to their destinations. The performance of both schemes is evaluated and compared in terms of cost and average packet delay tradeoffs for some examples. The results offer guidelines for the design and optimal utilization of mixed-media networks.

Algorithms for optimization of branching gravity-driven water networks

Directory of Open Access Journals (Sweden)

I. Dardani

2018-05-01

Full Text Available The design of a water network involves the selection of pipe diameters that satisfy pressure and flow requirements while considering cost. A variety of design approaches can be used to optimize for hydraulic performance or reduce costs. To help designers select an appropriate approach in the context of gravity-driven water networks (GDWNs, this work assesses three cost-minimization algorithms on six moderate-scale GDWN test cases. Two algorithms, a backtracking algorithm and a genetic algorithm, use a set of discrete pipe diameters, while a new calculus-based algorithm produces a continuous-diameter solution which is mapped onto a discrete-diameter set. The backtracking algorithm finds the global optimum for all but the largest of cases tested, for which its long runtime makes it an infeasible option. The calculus-based algorithm's discrete-diameter solution produced slightly higher-cost results but was more scalable to larger network cases. Furthermore, the new calculus-based algorithm's continuous-diameter and mapped solutions provided lower and upper bounds, respectively, on the discrete-diameter global optimum cost, where the mapped solutions were typically within one diameter size of the global optimum. The genetic algorithm produced solutions even closer to the global optimum with consistently short run times, although slightly higher solution costs were seen for the larger network cases tested. The results of this study highlight the advantages and weaknesses of each GDWN design method including closeness to the global optimum, the ability to prune the solution space of infeasible and suboptimal candidates without missing the global optimum, and algorithm run time. We also extend an existing closed-form model of Jones (2011 to include minor losses and a more comprehensive two-part cost model, which realistically applies to pipe sizes that span a broad range typical of GDWNs of interest in this work, and for smooth and commercial steel

Algorithms for optimization of branching gravity-driven water networks

Science.gov (United States)

Dardani, Ian; Jones, Gerard F.

2018-05-01

The design of a water network involves the selection of pipe diameters that satisfy pressure and flow requirements while considering cost. A variety of design approaches can be used to optimize for hydraulic performance or reduce costs. To help designers select an appropriate approach in the context of gravity-driven water networks (GDWNs), this work assesses three cost-minimization algorithms on six moderate-scale GDWN test cases. Two algorithms, a backtracking algorithm and a genetic algorithm, use a set of discrete pipe diameters, while a new calculus-based algorithm produces a continuous-diameter solution which is mapped onto a discrete-diameter set. The backtracking algorithm finds the global optimum for all but the largest of cases tested, for which its long runtime makes it an infeasible option. The calculus-based algorithm's discrete-diameter solution produced slightly higher-cost results but was more scalable to larger network cases. Furthermore, the new calculus-based algorithm's continuous-diameter and mapped solutions provided lower and upper bounds, respectively, on the discrete-diameter global optimum cost, where the mapped solutions were typically within one diameter size of the global optimum. The genetic algorithm produced solutions even closer to the global optimum with consistently short run times, although slightly higher solution costs were seen for the larger network cases tested. The results of this study highlight the advantages and weaknesses of each GDWN design method including closeness to the global optimum, the ability to prune the solution space of infeasible and suboptimal candidates without missing the global optimum, and algorithm run time. We also extend an existing closed-form model of Jones (2011) to include minor losses and a more comprehensive two-part cost model, which realistically applies to pipe sizes that span a broad range typical of GDWNs of interest in this work, and for smooth and commercial steel roughness values.

Optimal design of district heating and cooling pipe network of seawater-source heat pump

Energy Technology Data Exchange (ETDEWEB)

Li, Xiang-li; Duanmu, Lin; Shu, Hai-wen [School of Civil and Hydraulic Engineering, Dalian University of Technology, Dalian, Liaoning Province 116024 (China)

2010-01-15

The district heating and cooling (DHC) system of a seawater-source heat pump is large system engineering. The investments and the operational cost of DHC pipe network are higher than a tradition system. Traditional design methods only satisfy the needs of the technology but dissatisfy the needs of the economy, which not only waste a mass of money but also bring problems to the operation, the maintenance and the management. So we build a least-annualized-cost global optimal mathematic model that comprises all constrict conditions. Furthermore, this model considers the variety of heating load and cooling load, the operational adjustment in different periods of the year. Genetic algorithm (GA) is used to obtain the optimal combinations of discrete diameters. Some operators of GA are selected to reduce the calculation time and obtain good calculation accuracy. This optimal method is used to the design of the DHC network of Xinghai Bay commercial district which is a real engineering. The design optimization can avoid the matter of the hydraulic unbalance of the system, enhance the running efficiency and greatly reduce the annualized-cost comparing with the traditional design method. (author)

Dynamic Hierarchical Energy-Efficient Method Based on Combinatorial Optimization for Wireless Sensor Networks.

Science.gov (United States)

Chang, Yuchao; Tang, Hongying; Cheng, Yongbo; Zhao, Qin; Yuan, Baoqing Li andXiaobing

2017-07-19

Routing protocols based on topology control are significantly important for improving network longevity in wireless sensor networks (WSNs). Traditionally, some WSN routing protocols distribute uneven network traffic load to sensor nodes, which is not optimal for improving network longevity. Differently to conventional WSN routing protocols, we propose a dynamic hierarchical protocol based on combinatorial optimization (DHCO) to balance energy consumption of sensor nodes and to improve WSN longevity. For each sensor node, the DHCO algorithm obtains the optimal route by establishing a feasible routing set instead of selecting the cluster head or the next hop node. The process of obtaining the optimal route can be formulated as a combinatorial optimization problem. Specifically, the DHCO algorithm is carried out by the following procedures. It employs a hierarchy-based connection mechanism to construct a hierarchical network structure in which each sensor node is assigned to a special hierarchical subset; it utilizes the combinatorial optimization theory to establish the feasible routing set for each sensor node, and takes advantage of the maximum-minimum criterion to obtain their optimal routes to the base station. Various results of simulation experiments show effectiveness and superiority of the DHCO algorithm in comparison with state-of-the-art WSN routing algorithms, including low-energy adaptive clustering hierarchy (LEACH), hybrid energy-efficient distributed clustering (HEED), genetic protocol-based self-organizing network clustering (GASONeC), and double cost function-based routing (DCFR) algorithms.

Optimization of temporal networks under uncertainty

CERN Document Server

Wiesemann, Wolfram

2012-01-01

Many decision problems in Operations Research are defined on temporal networks, that is, workflows of time-consuming tasks whose processing order is constrained by precedence relations. For example, temporal networks are used to model projects, computer applications, digital circuits and production processes. Optimization problems arise in temporal networks when a decision maker wishes to determine a temporal arrangement of the tasks and/or a resource assignment that optimizes some network characteristic (e.g. the time required to complete all tasks). The parameters of these optimization probl

Integrated Method for Optimizing Connection Layout and Cable Selection for an Internal Network of a Wind Farm

Directory of Open Access Journals (Sweden)

Andrzej Wędzik

2015-09-01

Full Text Available An internal network of a wind farm is similar to a wide network structure. Wind turbines are deployed over a vast area, and cable lines used to interconnect them may have lengths reaching tens of kilometres. The cost of constructing such a network is a major component of the entire investment. Therefore, it is advisable to develop a configuration of such a farm’s internal connections which will minimise the cost, while complying with technical requirements even at the design stage. So far this has usually been done within two independent processes. At first the network structure ensuring the shortest possible connections between the turbines is determined. Then appropriate cables compliant with technical regulations are selected for the specified structure. But does this design approach ensure the optimal (lowest investment cost? This paper gives an answer to this question. A method for accomplishing the task given in the title is presented. Examples of calculations are presented and results are compared for the two methods of optimal wind farm internal connection structure design and cable cross-section dimensioning: two-stage and integrated. The usefulness of employing the Mixed Integer Nonlinear Programming (MNLP method in the process of determining the optimal structure of a wind farm’s cable network is demonstrated.

Least-cost network evaluation of centralized and decentralized contributions to global electrification

International Nuclear Information System (INIS)

Levin, Todd; Thomas, Valerie M.

2012-01-01

The choice between centralized and decentralized electricity generation is examined for 150 countries as a function of population distribution, electricity consumption, transmission cost, and the cost difference between decentralized and centralized electricity generation. A network algorithm is developed to find the shortest centralized transmission network that spans a given fraction of the population in a country. The least-cost combination of centralized and decentralized electricity that serves the country is determined. Case studies of Botswana, Uganda, and Bangladesh illustrate situations that are more and less suited for decentralized electrification. Specific maps for centralized and decentralized generation are presented to show how the least-cost option varies with the relative costs of centralized and decentralized generation and transmission cost. Centralized and decentralized fractions are calculated for 150 countries. For most of the world's population, centralized electricity is the least-cost option. For a number of countries, particularly in Africa, substantial populations and regions may be most cost-effectively served by decentralized electricity. - Highlights: ► Centralized and decentralized electrification are compared for 150 countries. ► A cost-optimized network algorithm finds the least-cost electrification system. ► Least-cost infrastructures combine centralized and decentralized portions. ► For most people, centralized electricity is cheapest option. ► In much of Africa, decentralized electricity may be cheaper than centralized.

Optimizing Bus Frequencies under Uncertain Demand: Case Study of the Transit Network in a Developing City

Directory of Open Access Journals (Sweden)

Zhengfeng Huang

2013-01-01

Full Text Available Various factors can make predicting bus passenger demand uncertain. In this study, a bilevel programming model for optimizing bus frequencies based on uncertain bus passenger demand is formulated. There are two terms constituting the upper-level objective. The first is transit network cost, consisting of the passengers’ expected travel time and operating costs, and the second is transit network robustness performance, indicated by the variance in passenger travel time. The second term reflects the risk aversion of decision maker, and it can make the most uncertain demand be met by the bus operation with the optimal transit frequency. With transit link’s proportional flow eigenvalues (mean and covariance obtained from the lower-level model, the upper-level objective is formulated by the analytical method. In the lower-level model, the above two eigenvalues are calculated by analyzing the propagation of mean transit trips and their variation in the optimal strategy transit assignment process. The genetic algorithm (GA used to solve the model is tested in an example network. Finally, the model is applied to determining optimal bus frequencies in the city of Liupanshui, China. The total cost of the transit system in Liupanshui can be reduced by about 6% via this method.

Aging Cost Optimization for Planning and Management of Energy Storage Systems

Directory of Open Access Journals (Sweden)

Saman Korjani

2017-11-01

Full Text Available In recent years, many studies have proposed the use of energy storage systems (ESSs for the mitigation of renewable energy source (RES intermittent power output. However, the correct estimation of the ESS degradation costs is still an open issue, due to the difficult estimation of their aging in the presence of intermittent power inputs. This is particularly true for battery ESSs (BESSs, which have been proven to exhibit complex aging functions. Unfortunately, this collides with considering aging costs when performing ESS planning and management procedures, which are crucial for the exploitation of this technology. In order to overcome this issue, this paper presents the genetic algorithm-based multi-period optimal power flow (GA-MPOPF procedure, which aims to economically optimize the management of ESSs by taking into account their degradation costs. The proposed methodology has been tested in two different applications: the planning of the correct positioning of a Li-ion BESS in the PG& E 69 bus network in the presence of high RES penetration, and the definition of its management strategy. Simulation results show that GA-MPOPF is able to optimize the ESS usage for time scales of up to one month, even for complex operative costs functions, showing at the same time excellent convergence properties.

Selection of an optimal neural network architecture for computer-aided detection of microcalcifications - Comparison of automated optimization techniques

International Nuclear Information System (INIS)

Gurcan, Metin N.; Sahiner, Berkman; Chan Heangping; Hadjiiski, Lubomir; Petrick, Nicholas

2001-01-01

Many computer-aided diagnosis (CAD) systems use neural networks (NNs) for either detection or classification of abnormalities. Currently, most NNs are 'optimized' by manual search in a very limited parameter space. In this work, we evaluated the use of automated optimization methods for selecting an optimal convolution neural network (CNN) architecture. Three automated methods, the steepest descent (SD), the simulated annealing (SA), and the genetic algorithm (GA), were compared. We used as an example the CNN that classifies true and false microcalcifications detected on digitized mammograms by a prescreening algorithm. Four parameters of the CNN architecture were considered for optimization, the numbers of node groups and the filter kernel sizes in the first and second hidden layers, resulting in a search space of 432 possible architectures. The area A z under the receiver operating characteristic (ROC) curve was used to design a cost function. The SA experiments were conducted with four different annealing schedules. Three different parent selection methods were compared for the GA experiments. An available data set was split into two groups with approximately equal number of samples. By using the two groups alternately for training and testing, two different cost surfaces were evaluated. For the first cost surface, the SD method was trapped in a local minimum 91% (392/432) of the time. The SA using the Boltzman schedule selected the best architecture after evaluating, on average, 167 architectures. The GA achieved its best performance with linearly scaled roulette-wheel parent selection; however, it evaluated 391 different architectures, on average, to find the best one. The second cost surface contained no local minimum. For this surface, a simple SD algorithm could quickly find the global minimum, but the SA with the very fast reannealing schedule was still the most efficient. The same SA scheme, however, was trapped in a local minimum on the first cost

Energy-Aware Multipath Routing Scheme Based on Particle Swarm Optimization in Mobile Ad Hoc Networks.

Science.gov (United States)

Robinson, Y Harold; Rajaram, M

2015-01-01

Mobile ad hoc network (MANET) is a collection of autonomous mobile nodes forming an ad hoc network without fixed infrastructure. Dynamic topology property of MANET may degrade the performance of the network. However, multipath selection is a great challenging task to improve the network lifetime. We proposed an energy-aware multipath routing scheme based on particle swarm optimization (EMPSO) that uses continuous time recurrent neural network (CTRNN) to solve optimization problems. CTRNN finds the optimal loop-free paths to solve link disjoint paths in a MANET. The CTRNN is used as an optimum path selection technique that produces a set of optimal paths between source and destination. In CTRNN, particle swarm optimization (PSO) method is primly used for training the RNN. The proposed scheme uses the reliability measures such as transmission cost, energy factor, and the optimal traffic ratio between source and destination to increase routing performance. In this scheme, optimal loop-free paths can be found using PSO to seek better link quality nodes in route discovery phase. PSO optimizes a problem by iteratively trying to get a better solution with regard to a measure of quality. The proposed scheme discovers multiple loop-free paths by using PSO technique.

WiMAX network performance monitoring & optimization

DEFF Research Database (Denmark)

Zhang, Qi; Dam, H

2008-01-01

frequency reuse, capacity planning, proper network dimensioning, multi-class data services and so on. Furthermore, as a small operator we also want to reduce the demand for sophisticated technicians and man labour hours. To meet these critical demands, we design a generic integrated network performance......In this paper we present our WiMAX (worldwide interoperability for microwave access) network performance monitoring and optimization solution. As a new and small WiMAX network operator, there are many demanding issues that we have to deal with, such as limited available frequency resource, tight...... this integrated network performance monitoring and optimization system in our WiMAX networks. This integrated monitoring and optimization system has such good flexibility and scalability that individual function component can be used by other operators with special needs and more advanced function components can...

Implementing the cost-optimal methodology in EU countries

DEFF Research Database (Denmark)

Atanasiu, Bogdan; Kouloumpi, Ilektra; Thomsen, Kirsten Engelund

This study presents three cost-optimal calculations. The overall aim is to provide a deeper analysis and to provide additional guidance on how to properly implement the cost-optimality methodology in Member States. Without proper guidance and lessons from exemplary case studies using realistic...... input data (reflecting the likely future development), there is a risk that the cost-optimal methodology may be implemented at sub-optimal levels. This could lead to a misalignment between the defined cost-optimal levels and the long-term goals, leaving a significant energy saving potential unexploited....... Therefore, this study provides more evidence on the implementation of the cost-optimal methodology and highlights the implications of choosing different values for key factors (e.g. discount rates, simulation variants/packages, costs, energy prices) at national levels. The study demonstrates how existing...

SOCIAL NETWORK OPTIMIZATION A NEW METHAHEURISTIC FOR GENERAL OPTIMIZATION PROBLEMS

Directory of Open Access Journals (Sweden)

Hassan Sherafat

2017-12-01

Full Text Available In the recent years metaheuristics were studied and developed as powerful technics for hard optimization problems. Some of well-known technics in this field are: Genetic Algorithms, Tabu Search, Simulated Annealing, Ant Colony Optimization, and Swarm Intelligence, which are applied successfully to many complex optimization problems. In this paper, we introduce a new metaheuristic for solving such problems based on social networks concept, named as Social Network Optimization – SNO. We show that a wide range of np-hard optimization problems may be solved by SNO.

Incremental Optimization of Hub and Spoke Network for the Spokes’ Numbers and Flow

Directory of Open Access Journals (Sweden)

Yanfeng Wang

2015-01-01

Full Text Available Hub and spoke network problem is solved as part of a strategic decision making process which may have a profound effect on the future of enterprises. In view of the existing network structure, as time goes on, the number of spokes and the flow change because of different sources of uncertainty. Hence, the incremental optimization of hub and spoke network problem is considered in this paper, and the policy makers should adopt a series of strategies to cope with the change, such as setting up new hubs, adjusting the capacity level of original hubs, or closing some original hubs. The objective is to minimize the total cost, which includes the setup costs for the new hubs, the closure costs, and the adjustment costs for the original hubs as well as the flow routing costs. Two mixed-integer linear programming formulations are proposed and analyzed for this problem. China Deppon Logistics as an example is performed to present computational analysis, and we analyze the changes in the solutions driven by the number of spokes and the flow. The tests also allow an analysis to consider the effect of variation in parameters on network.

A Hierarchical Modeling for Reactive Power Optimization With Joint Transmission and Distribution Networks by Curve Fitting

DEFF Research Database (Denmark)

Ding, Tao; Li, Cheng; Huang, Can

2018-01-01

–slave structure and improves traditional centralized modeling methods by alleviating the big data problem in a control center. Specifically, the transmission-distribution-network coordination issue of the hierarchical modeling method is investigated. First, a curve-fitting approach is developed to provide a cost......In order to solve the reactive power optimization with joint transmission and distribution networks, a hierarchical modeling method is proposed in this paper. It allows the reactive power optimization of transmission and distribution networks to be performed separately, leading to a master...... optimality. Numerical results on two test systems verify the effectiveness of the proposed hierarchical modeling and curve-fitting methods....

Neural-Network-Based Robust Optimal Tracking Control for MIMO Discrete-Time Systems With Unknown Uncertainty Using Adaptive Critic Design.

Science.gov (United States)

Liu, Lei; Wang, Zhanshan; Zhang, Huaguang

2018-04-01

This paper is concerned with the robust optimal tracking control strategy for a class of nonlinear multi-input multi-output discrete-time systems with unknown uncertainty via adaptive critic design (ACD) scheme. The main purpose is to establish an adaptive actor-critic control method, so that the cost function in the procedure of dealing with uncertainty is minimum and the closed-loop system is stable. Based on the neural network approximator, an action network is applied to generate the optimal control signal and a critic network is used to approximate the cost function, respectively. In contrast to the previous methods, the main features of this paper are: 1) the ACD scheme is integrated into the controllers to cope with the uncertainty and 2) a novel cost function, which is not in quadric form, is proposed so that the total cost in the design procedure is reduced. It is proved that the optimal control signals and the tracking errors are uniformly ultimately bounded even when the uncertainty exists. Finally, a numerical simulation is developed to show the effectiveness of the present approach.

Integrated Optimization of Service-Oriented Train Plan and Schedule on Intercity Rail Network with Varying Demand

Directory of Open Access Journals (Sweden)

Wenliang Zhou

2015-01-01

Full Text Available For a better service level of a train operating plan, we propose an integrated optimization method of train planning and train scheduling, which generally are optimized, respectively. Based on the cost analysis of both passengers travelling and enterprises operation, and the constraint analysis of trains operation, we construct a multiobjective function and build an integrated optimization model with the aim of reducing both passenger travel costs and enterprise operating costs. Then, a solving algorithm is established based on the simulated annealing algorithm. Finally, using as an example the Changzhutan intercity rail network, as an example we analyze the optimized results and the influence of the model parameters on the results.

An Improved Method for Reconfiguring and Optimizing Electrical Active Distribution Network Using Evolutionary Particle Swarm Optimization

Directory of Open Access Journals (Sweden)

Nur Faziera Napis

2018-05-01

Full Text Available The presence of optimized distributed generation (DG with suitable distribution network reconfiguration (DNR in the electrical distribution network has an advantage for voltage support, power losses reduction, deferment of new transmission line and distribution structure and system stability improvement. However, installation of a DG unit at non-optimal size with non-optimal DNR may lead to higher power losses, power quality problem, voltage instability and incremental of operational cost. Thus, an appropriate DG and DNR planning are essential and are considered as an objective of this research. An effective heuristic optimization technique named as improved evolutionary particle swarm optimization (IEPSO is proposed in this research. The objective function is formulated to minimize the total power losses (TPL and to improve the voltage stability index (VSI. The voltage stability index is determined for three load demand levels namely light load, nominal load, and heavy load with proper optimal DNR and DG sizing. The performance of the proposed technique is compared with other optimization techniques, namely particle swarm optimization (PSO and iteration particle swarm optimization (IPSO. Four case studies on IEEE 33-bus and IEEE 69-bus distribution systems have been conducted to validate the effectiveness of the proposed IEPSO. The optimization results show that, the best achievement is done by IEPSO technique with power losses reduction up to 79.26%, and 58.41% improvement in the voltage stability index. Moreover, IEPSO has the fastest computational time for all load conditions as compared to other algorithms.

OPTIMIZATION OF DISJOINTS FOR MINIMIZATION OF FAILURE IN WDM OPTICAL NETWORK

Directory of Open Access Journals (Sweden)

A. Renugadevi

2015-06-01

Full Text Available In an optical network, the fiber optic cable is used for communication between the nodes in a network by passing lights. The main problem in optical network is finding the link disjoints as well as optimal solution for the disjoints. To tolerate a single link failure in the network, the enhanced active path first algorithm is used which computes the re-routed back-up path. The multiple link failure in a network called fibre span disjoint path problem is solved using integer linear programming algorithm. The loop back recovery is used to provide pre-planned recovery of link or node failures in a network which allows dynamic choice of routes over pre-planned directions. Considering reliability in a mesh networks, the reliability algorithm helps to achieve the maximum reliability in two-path protection. It addresses the multiple disjoint failures that arise in a network and discusses the best solution between paths shared nodes or links. The unified algorithm is used to generate the optimal results with minimum cost for multiple link failures. The heuristic algorithm namely maximum arbitrary double-link protection algorithm helps to pre-compute the back-up path for double-link failures. In all the above approaches the shortest optimized path must be improved. To find the best shortest path, link-disjoint lightpath algorithm is designed to compute the disjoint occurred in a network and it also satisfies the wavelength continuity constraint in wavelength division multiplexing. A polynomial time algorithm Wavelength Division Multiplexing – Passive Optical Networking is used to compute the disjoint happen in the network. The overall time efficiency is analyzed and performance is evaluated through simulations.

OPTIMIZATION OF THE POSITION OF THE LOCAL DISTRIBUTION CENTRE OF THE REGIONAL POST LOGISTICS NETWORK

Directory of Open Access Journals (Sweden)

Paweł DROŹDZIEL

2017-09-01

Full Text Available The phenomenon of the present postal services is the fact that, customers expect the lowest price while maintaining the availability, security and on time delivery of mail items. We can find that, the costs associated with transport of the postal substrate is one of the most important factors affecting the total cost of the postal services. These transport costs depend on various factors such as the investment in vehicles purchase, operational costs of the postal vehicles (costs of maintenance, repairs, fuel costs of the vehicle, etc. labour costs of the drivers and so on. For this reason, it is important to find such an operational - organizational solutions that can reduce the costs associated with the transportation of postal shipments, resulting in reducing the total cost of postal services. One option to do this is to minimize the length of postal transportation routes. This article presents the approach based on the application of graph theory to optimize existing connections of postal logistics network. Published results is oriented to revaluate existing position of local centre and find a location for the new local distribution centre potentially. New location of local distribution centre can to optimize (minimize the total transport costs of the local postal transportation network in area of the Lublin Province.

Optimization-based topology identification of complex networks

International Nuclear Information System (INIS)

Tang Sheng-Xue; Chen Li; He Yi-Gang

2011-01-01

In many cases, the topological structures of a complex network are unknown or uncertain, and it is of significance to identify the exact topological structure. An optimization-based method of identifying the topological structure of a complex network is proposed in this paper. Identification of the exact network topological structure is converted into a minimal optimization problem by using the estimated network. Then, an improved quantum-behaved particle swarm optimization algorithm is used to solve the optimization problem. Compared with the previous adaptive synchronization-based method, the proposed method is simple and effective and is particularly valid to identify the topological structure of synchronization complex networks. In some cases where the states of a complex network are only partially observable, the exact topological structure of a network can also be identified by using the proposed method. Finally, numerical simulations are provided to show the effectiveness of the proposed method. (general)

Optimizing Cooperative Cognitive Radio Networks with Opportunistic Access

KAUST Repository

Zafar, Ammar; Alouini, Mohamed-Slim; Chen, Yunfei; Radaydeh, Redha M.

2012-01-01

Optimal resource allocation for cooperative cognitive radio networks with opportunistic access to the licensed spectrum is studied. Resource allocation is based on minimizing the symbol error rate at the receiver. Both the cases of all-participate relaying and selective relaying are considered. The objective function is derived and the constraints are detailed for both scenarios. It is then shown that the objective functions and the constraints are nonlinear and nonconvex functions of the parameters of interest, that is, source and relay powers, symbol time, and sensing time. Therefore, it is difficult to obtain closed-form solutions for the optimal resource allocation. The optimization problem is then solved using numerical techniques. Numerical results show that the all-participate system provides better performance than its selection counterpart, at the cost of greater resources. © 2012 Ammar Zafar et al.

Optimizing Cooperative Cognitive Radio Networks with Opportunistic Access

KAUST Repository

Zafar, Ammar

2012-09-16

Optimal resource allocation for cooperative cognitive radio networks with opportunistic access to the licensed spectrum is studied. Resource allocation is based on minimizing the symbol error rate at the receiver. Both the cases of all-participate relaying and selective relaying are considered. The objective function is derived and the constraints are detailed for both scenarios. It is then shown that the objective functions and the constraints are nonlinear and nonconvex functions of the parameters of interest, that is, source and relay powers, symbol time, and sensing time. Therefore, it is difficult to obtain closed-form solutions for the optimal resource allocation. The optimization problem is then solved using numerical techniques. Numerical results show that the all-participate system provides better performance than its selection counterpart, at the cost of greater resources. © 2012 Ammar Zafar et al.

Wireless Sensor Network Optimization: Multi-Objective Paradigm.

Science.gov (United States)

Iqbal, Muhammad; Naeem, Muhammad; Anpalagan, Alagan; Ahmed, Ashfaq; Azam, Muhammad

2015-07-20

Optimization problems relating to wireless sensor network planning, design, deployment and operation often give rise to multi-objective optimization formulations where multiple desirable objectives compete with each other and the decision maker has to select one of the tradeoff solutions. These multiple objectives may or may not conflict with each other. Keeping in view the nature of the application, the sensing scenario and input/output of the problem, the type of optimization problem changes. To address different nature of optimization problems relating to wireless sensor network design, deployment, operation, planing and placement, there exist a plethora of optimization solution types. We review and analyze different desirable objectives to show whether they conflict with each other, support each other or they are design dependent. We also present a generic multi-objective optimization problem relating to wireless sensor network which consists of input variables, required output, objectives and constraints. A list of constraints is also presented to give an overview of different constraints which are considered while formulating the optimization problems in wireless sensor networks. Keeping in view the multi facet coverage of this article relating to multi-objective optimization, this will open up new avenues of research in the area of multi-objective optimization relating to wireless sensor networks.

Wireless Sensor Network Optimization: Multi-Objective Paradigm

Science.gov (United States)

Iqbal, Muhammad; Naeem, Muhammad; Anpalagan, Alagan; Ahmed, Ashfaq; Azam, Muhammad

2015-01-01

Optimization problems relating to wireless sensor network planning, design, deployment and operation often give rise to multi-objective optimization formulations where multiple desirable objectives compete with each other and the decision maker has to select one of the tradeoff solutions. These multiple objectives may or may not conflict with each other. Keeping in view the nature of the application, the sensing scenario and input/output of the problem, the type of optimization problem changes. To address different nature of optimization problems relating to wireless sensor network design, deployment, operation, planing and placement, there exist a plethora of optimization solution types. We review and analyze different desirable objectives to show whether they conflict with each other, support each other or they are design dependent. We also present a generic multi-objective optimization problem relating to wireless sensor network which consists of input variables, required output, objectives and constraints. A list of constraints is also presented to give an overview of different constraints which are considered while formulating the optimization problems in wireless sensor networks. Keeping in view the multi facet coverage of this article relating to multi-objective optimization, this will open up new avenues of research in the area of multi-objective optimization relating to wireless sensor networks. PMID:26205271

Prediction of Aerodynamic Coefficient using Genetic Algorithm Optimized Neural Network for Sparse Data

Science.gov (United States)

Rajkumar, T.; Bardina, Jorge; Clancy, Daniel (Technical Monitor)

2002-01-01

Wind tunnels use scale models to characterize aerodynamic coefficients, Wind tunnel testing can be slow and costly due to high personnel overhead and intensive power utilization. Although manual curve fitting can be done, it is highly efficient to use a neural network to define the complex relationship between variables. Numerical simulation of complex vehicles on the wide range of conditions required for flight simulation requires static and dynamic data. Static data at low Mach numbers and angles of attack may be obtained with simpler Euler codes. Static data of stalled vehicles where zones of flow separation are usually present at higher angles of attack require Navier-Stokes simulations which are costly due to the large processing time required to attain convergence. Preliminary dynamic data may be obtained with simpler methods based on correlations and vortex methods; however, accurate prediction of the dynamic coefficients requires complex and costly numerical simulations. A reliable and fast method of predicting complex aerodynamic coefficients for flight simulation I'S presented using a neural network. The training data for the neural network are derived from numerical simulations and wind-tunnel experiments. The aerodynamic coefficients are modeled as functions of the flow characteristics and the control surfaces of the vehicle. The basic coefficients of lift, drag and pitching moment are expressed as functions of angles of attack and Mach number. The modeled and training aerodynamic coefficients show good agreement. This method shows excellent potential for rapid development of aerodynamic models for flight simulation. Genetic Algorithms (GA) are used to optimize a previously built Artificial Neural Network (ANN) that reliably predicts aerodynamic coefficients. Results indicate that the GA provided an efficient method of optimizing the ANN model to predict aerodynamic coefficients. The reliability of the ANN using the GA includes prediction of aerodynamic

A multiobjective optimization framework for multicontaminant industrial water network design.

Science.gov (United States)

Boix, Marianne; Montastruc, Ludovic; Pibouleau, Luc; Azzaro-Pantel, Catherine; Domenech, Serge

2011-07-01

The optimal design of multicontaminant industrial water networks according to several objectives is carried out in this paper. The general formulation of the water allocation problem (WAP) is given as a set of nonlinear equations with binary variables representing the presence of interconnections in the network. For optimization purposes, three antagonist objectives are considered: F(1), the freshwater flow-rate at the network entrance, F(2), the water flow-rate at inlet of regeneration units, and F(3), the number of interconnections in the network. The multiobjective problem is solved via a lexicographic strategy, where a mixed-integer nonlinear programming (MINLP) procedure is used at each step. The approach is illustrated by a numerical example taken from the literature involving five processes, one regeneration unit and three contaminants. The set of potential network solutions is provided in the form of a Pareto front. Finally, the strategy for choosing the best network solution among those given by Pareto fronts is presented. This Multiple Criteria Decision Making (MCDM) problem is tackled by means of two approaches: a classical TOPSIS analysis is first implemented and then an innovative strategy based on the global equivalent cost (GEC) in freshwater that turns out to be more efficient for choosing a good network according to a practical point of view. Copyright © 2011 Elsevier Ltd. All rights reserved.

Optimal Bidding Strategy for Renewable Microgrid with Active Network Management

Directory of Open Access Journals (Sweden)

Seung Wan Kim

2016-01-01

Full Text Available Active Network Management (ANM enables a microgrid to optimally dispatch the active/reactive power of its Renewable Distributed Generation (RDG and Battery Energy Storage System (BESS units in real time. Thus, a microgrid with high penetration of RDGs can handle their uncertainties and variabilities to achieve the stable operation using ANM. However, the actual power flow in the line connecting the main grid and microgrid may deviate significantly from the day-ahead bids if the bids are determined without consideration of the real-time adjustment through ANM, which will lead to a substantial imbalance cost. Therefore, this study proposes a formulation for obtaining an optimal bidding which reflects the change of power flow in the connecting line by real-time adjustment using ANM. The proposed formulation maximizes the expected profit of the microgrid considering various network and physical constraints. The effectiveness of the proposed bidding strategy is verified through the simulations with a 33-bus test microgrid. The simulation results show that the proposed bidding strategy improves the expected operating profit by reducing the imbalance cost to a greater degree compared to the basic bidding strategy without consideration of ANM.

Optimal Joint Expected Delay Forwarding in Delay Tolerant Networks

OpenAIRE

Jia Xu; Xin Feng; Wen Jun Yang; Ru Chuan Wang; Bing Qing Han

2013-01-01

Multicopy forwarding schemes have been employed in delay tolerant network (DTN) to improve the delivery delay and delivery rate. Much effort has been focused on reducing the routing cost while retaining high performance. This paper aims to provide an optimal joint expected delay forwarding (OJEDF) protocol which minimizes the expected delay while satisfying a certain constant on the number of forwardings per message. We propose a comprehensive forwarding metric called joint expected delay (JE...

Design of an integrated forward and reverse logistics network optimi-zation model for commercial goods management

Directory of Open Access Journals (Sweden)

Eva Ponce-Cueto

2015-01-01

Full Text Available In this study, an optimization model is formulated for designing an integrated forward and reverse logistics network in the consumer goods industry. The resultant model is a mixed-integer linear programming model (MILP. Its purpose is to minimize the total costs of the closed-loop supply chain network. It is important to note that the design of the logistics network may involve a trade-off between the total costs and the optimality in commercial goods management. The model comprises a discrete set as potential locations of unlimited capacity warehouses and fixed locations of customers’ zones. It provides decisions related to the facility location and customers’ requirements satisfaction, all of this related with the inventory and shipment decisions of the supply chain. Finally, an application of this model is illustrated by a real-life case in the food and drinks industry. We can conclude that this model can significantly help companies to make decisions about problems associated with logistics network design.

2016 Network Games, Control, and Optimization Conference

CERN Document Server

Jimenez, Tania; Solan, Eilon

2017-01-01

This contributed volume offers a collection of papers presented at the 2016 Network Games, Control, and Optimization conference (NETGCOOP), held at the University of Avignon in France, November 23-25, 2016. These papers highlight the increasing importance of network control and optimization in many networking application domains, such as mobile and fixed access networks, computer networks, social networks, transportation networks, and, more recently, electricity grids and biological networks. Covering a wide variety of both theoretical and applied topics in the areas listed above, the authors explore several conceptual and algorithmic tools that are needed for efficient and robust control operation, performance optimization, and better understanding the relationships between entities that may be acting cooperatively or selfishly in uncertain and possibly adversarial environments. As such, this volume will be of interest to applied mathematicians, computer scientists, engineers, and researchers in other relate...

Optimal Signal Design for Mixed Equilibrium Networks with Autonomous and Regular Vehicles

Directory of Open Access Journals (Sweden)

Nan Jiang

2017-01-01

Full Text Available A signal design problem is studied for efficiently managing autonomous vehicles (AVs and regular vehicles (RVs simultaneously in transportation networks. AVs and RVs move on separate lanes and two types of vehicles share the green times at the same intersections. The signal design problem is formulated as a bilevel program. The lower-level model describes a mixed equilibrium where autonomous vehicles follow the Cournot-Nash (CN principle and RVs follow the user equilibrium (UE principle. In the upper-level model, signal timings are optimized at signalized intersections to allocate appropriate green times to both autonomous and RVs to minimize system travel cost. The sensitivity analysis based method is used to solve the bilevel optimization model. Various signal control strategies are evaluated through numerical examples and some insightful findings are obtained. It was found that the number of phases at intersections should be reduced for the optimal control of the AVs and RVs in the mixed networks. More importantly, incorporating AVs into the transportation network would improve the system performance due to the value of AV technologies in reducing random delays at intersections. Meanwhile, travelers prefer to choose AVs when the networks turn to be congested.

Airborne Network Optimization with Dynamic Network Update

Science.gov (United States)

2015-03-26

source si and a target ti . For each commodity (si, ki) the commodity specifies a non- negative demand di [5]. The objective of the multi-commodity...queue predictions, and network con- gestion [15]. The implementation of the DRQC uses the Kalman filter to predict the state of the network and optimize

Cost benefit analysis for optimization of radiation protection

International Nuclear Information System (INIS)

Lindell, B.

1984-01-01

ICRP recommends three basic principles for radiation protection. One is the justification of the source. Any use of radiation should be justified with regard to its benefit. The second is the optimization of radiation protection, i.e. all radiation exposure should be kept as low as resonably achievable. And the third principle is that there should be a limit for the radiation dose that any individual receives. Cost benefit assessment or cost benefit analysis is one tool to achieve the optimization, but the optimization is not identical with cost benefit analysis. Basically, in principle, the cost benefit analysis for the optimization of radiation protection is to find the minimum sum of the cost of protection and some cost of detriment. (Mori, K.)

Guaranteed cost control of mobile sensor networks with Markov switching topologies.

Science.gov (United States)

Zhao, Yuan; Guo, Ge; Ding, Lei

2015-09-01

This paper investigates the consensus seeking problem of mobile sensor networks (MSNs) with random switching topologies. The network communication topologies are composed of a set of directed graphs (or digraph) with a spanning tree. The switching of topologies is governed by a Markov chain. The consensus seeking problem is addressed by introducing a global topology-aware linear quadratic (LQ) cost as the performance measure. By state transformation, the consensus problem is transformed to the stabilization of a Markovian jump system with guaranteed cost. A sufficient condition for global mean-square consensus is derived in the context of stochastic stability analysis of Markovian jump systems. A computational algorithm is given to synchronously calculate both the sub-optimal consensus controller gains and the sub-minimum upper bound of the cost. The effectiveness of the proposed design method is illustrated by three numerical examples. Copyright © 2015 ISA. Published by Elsevier Ltd. All rights reserved.

Stochastic multi-objective model for optimal energy exchange optimization of networked microgrids with presence of renewable generation under risk-based strategies.

Science.gov (United States)

Gazijahani, Farhad Samadi; Ravadanegh, Sajad Najafi; Salehi, Javad

2018-02-01

The inherent volatility and unpredictable nature of renewable generations and load demand pose considerable challenges for energy exchange optimization of microgrids (MG). To address these challenges, this paper proposes a new risk-based multi-objective energy exchange optimization for networked MGs from economic and reliability standpoints under load consumption and renewable power generation uncertainties. In so doing, three various risk-based strategies are distinguished by using conditional value at risk (CVaR) approach. The proposed model is specified as a two-distinct objective function. The first function minimizes the operation and maintenance costs, cost of power transaction between upstream network and MGs as well as power loss cost, whereas the second function minimizes the energy not supplied (ENS) value. Furthermore, the stochastic scenario-based approach is incorporated into the approach in order to handle the uncertainty. Also, Kantorovich distance scenario reduction method has been implemented to reduce the computational burden. Finally, non-dominated sorting genetic algorithm (NSGAII) is applied to minimize the objective functions simultaneously and the best solution is extracted by fuzzy satisfying method with respect to risk-based strategies. To indicate the performance of the proposed model, it is performed on the modified IEEE 33-bus distribution system and the obtained results show that the presented approach can be considered as an efficient tool for optimal energy exchange optimization of MGs. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

Optimal Channel Selection Based on Online Decision and Offline Learning in Multichannel Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Mu Qiao

2017-01-01

Full Text Available We propose a channel selection strategy with hybrid architecture, which combines the centralized method and the distributed method to alleviate the overhead of access point and at the same time provide more flexibility in network deployment. By this architecture, we make use of game theory and reinforcement learning to fulfill the optimal channel selection under different communication scenarios. Particularly, when the network can satisfy the requirements of energy and computational costs, the online decision algorithm based on noncooperative game can help each individual sensor node immediately select the optimal channel. Alternatively, when the network cannot satisfy the requirements of energy and computational costs, the offline learning algorithm based on reinforcement learning can help each individual sensor node to learn from its experience and iteratively adjust its behavior toward the expected target. Extensive simulation results validate the effectiveness of our proposal and also prove that higher system throughput can be achieved by our channel selection strategy over the conventional off-policy channel selection approaches.

Implementation of Cooperation for Recycling Vehicle Routing Optimization in Two-Echelon Reverse Logistics Networks

Directory of Open Access Journals (Sweden)

Yong Wang

2018-04-01

Full Text Available The formation of a cooperative alliance is an effective means of approaching the vehicle routing optimization in two-echelon reverse logistics networks. Cooperative mechanisms can contribute to avoiding the inefficient assignment of resources for the recycling logistics operations and reducing long distance transportation. With regard to the relatively low performance of waste collection, this paper proposes a three-phase methodology to properly address the corresponding vehicle routing problem on two echelons. First, a bi-objective programming model is established to minimize the total cost and the number of vehicles considering semitrailers and vehicles sharing. Furthermore, the Clarke–Wright (CW savings method and the Non-dominated Sorting Genetic Algorithm-II (NSGA-II are combined to design a hybrid routing optimization heuristic, which is denoted CW_NSGA-II. Routes on the first and second echelons are obtained on the basis of sub-optimal solutions provided by CW algorithm. Compared to other intelligent algorithms, CW_NSGA-II reduces the complexity of the multi-objective solutions search and mostly converges to optimality. The profit generated by cooperation among retail stores and the recycling hub in the reverse logistics network is fairly and reasonably distributed to the participants by applying the Minimum Costs-Remaining Savings (MCRS method. Finally, an empirical study in Chengdu City, China, reveals the superiority of CW_NSGA over the multi-objective particle swarm optimization and the multi objective genetic algorithms in terms of solutions quality and convergence. Meanwhile, the comparison of MCRS method with the Shapley value model, equal profit method and cost gap allocation proves that MCRS method is more conducive to the stability of the cooperative alliance. In general, the implementation of cooperation in the optimization of the reverse logistics network effectively leads to the sustainable development of urban and sub

Accelerator optimization using a network control and acquisition system

International Nuclear Information System (INIS)

Geddes, Cameron G.R.; Catravas, P.E.; Faure, Jerome; Toth, Csaba; Tilborg, J. van; Leemans, Wim P.

2002-01-01

Accelerator optimization requires detailed study of many parameters, indicating the need for remote control and automated data acquisition systems. A control and data acquisition system based on a network of commodity PCs and applications with standards based inter-application communication is being built for the l'OASIS accelerator facility. This system allows synchronous acquisition of data at high (> 1 Hz) rates and remote control of the accelerator at low cost, allowing detailed study of the acceleration process

A Decision Processing Algorithm for CDC Location Under Minimum Cost SCM Network

Science.gov (United States)

Park, N. K.; Kim, J. Y.; Choi, W. Y.; Tian, Z. M.; Kim, D. J.

Location of CDC in the matter of network on Supply Chain is becoming on the high concern these days. Present status of methods on CDC has been mainly based on the calculation manually by the spread sheet to achieve the goal of minimum logistics cost. This study is focused on the development of new processing algorithm to overcome the limit of present methods, and examination of the propriety of this algorithm by case study. The algorithm suggested by this study is based on the principle of optimization on the directive GRAPH of SCM model and suggest the algorithm utilizing the traditionally introduced MST, shortest paths finding methods, etc. By the aftermath of this study, it helps to assess suitability of the present on-going SCM network and could be the criterion on the decision-making process for the optimal SCM network building-up for the demand prospect in the future.

Optimization of administrative management costs

OpenAIRE

Podolchak, N.; Chepil, B.

2015-01-01

It is important to determine the optimal level of administrative costs in order to achieve main targets of any enterprise, to perform definite tasks, to implement these tasks and not to worsen condition and motivation of the workers. Also it is essential to remember about strategic goals in the area of HR on the long run. The refore, the main idea in using optimization model for assessing the effectiveness of management costs will be to find the minimum level of expenses within the given l...

Design and Profit Allocation in Two-Echelon Heterogeneous Cooperative Logistics Network Optimization

Directory of Open Access Journals (Sweden)

Yong Wang

2018-01-01

Full Text Available In modern supply chain, logistics companies usually operate individually and optimization researches often concentrate on solving problems related to separate networks. Consequences like the complexity of urban transportation networks and long distance deliveries or pickups and pollution are leading problems to more expenses and more complaints from environment protection organizations. A solution approach to these issues is proposed in this article and consists in the adoption of two-echelon heterogeneous cooperative logistics networks (THCLN. The optimization methodology includes the formation of cooperative coalitions, the reallocation of customers to appropriate logistics facilities, and the determination of the best profit allocation scheme. First, a mixed integer linear programing model is introduced to minimize the total operating cost of nonempty coalitions. Thus, the Genetic Algorithm (GA and the Particle Swarm Optimization (PSO algorithm are hybridized to propose GA-PSO heuristics. GA-PSO is employed to provide good solutions to customer clustering units’ reallocation problem. In addition, a negotiation process is established based on logistics centers as coordinators. The case study of Chongqing city is conducted to verify the feasibility of THCLN in practice. The grand coalition and two heterogeneous subcoalitions are designed, and the collective profit is distributed based on cooperative game theory. The Minimum Cost Remaining Savings (MCRS model is used to determine good allocation schemes and strictly monotonic path principles are considered to evaluate and decide the most appropriate coalition sequence. Comparisons proved the combination of GA-PSO and MCRS better as results are found closest to the core center. Therefore, the proposed approach can be implemented in real world environment, increase the reliability of urban logistics network, and allow decision makers to improve service efficiency.

Network synchronization: optimal and pessimal scale-free topologies

International Nuclear Information System (INIS)

Donetti, Luca; Hurtado, Pablo I; Munoz, Miguel A

2008-01-01

By employing a recently introduced optimization algorithm we construct optimally synchronizable (unweighted) networks for any given scale-free degree distribution. We explore how the optimization process affects degree-degree correlations and observe a generic tendency toward disassortativity. Still, we show that there is not a one-to-one correspondence between synchronizability and disassortativity. On the other hand, we study the nature of optimally un-synchronizable networks, that is, networks whose topology minimizes the range of stability of the synchronous state. The resulting 'pessimal networks' turn out to have a highly assortative string-like structure. We also derive a rigorous lower bound for the Laplacian eigenvalue ratio controlling synchronizability, which helps understanding the impact of degree correlations on network synchronizability

An optimization planning technique for Suez Canal Network in Egypt

Energy Technology Data Exchange (ETDEWEB)

Abou El-Ela, A.A.; El-Zeftawy, A.A.; Allam, S.M.; Atta, Gasir M. [Electrical Engineering Dept., Faculty of Eng., Shebin El-Kom (Egypt)

2010-02-15

This paper introduces a proposed optimization technique POT for predicting the peak load demand and planning of transmission line systems. Many of traditional methods have been presented for long-term load forecasting of electrical power systems. But, the results of these methods are approximated. Therefore, the artificial neural network (ANN) technique for long-term peak load forecasting is modified and discussed as a modern technique in long-term load forecasting. The modified technique is applied on the Egyptian electrical network dependent on its historical data to predict the electrical peak load demand forecasting up to year 2017. This technique is compared with extrapolation of trend curves as a traditional method. The POT is applied also to obtain the optimal planning of transmission lines for the 220 kV of Suez Canal Network (SCN) using the ANN technique. The minimization of the transmission network costs are considered as an objective function, while the transmission lines (TL) planning constraints are satisfied. Zafarana site on the Red Sea coast is considered as an optimal site for installing big wind farm (WF) units in Egypt. So, the POT is applied to plan both the peak load and the electrical transmission of SCN with and without considering WF to develop the impact of WF units on the electrical transmission system of Egypt, considering the reliability constraints which were taken as a separate model in the previous techniques. The application on SCN shows the capability and the efficiently of the proposed techniques to obtain the predicting peak load demand and the optimal planning of transmission lines of SCN up to year 2017. (author)

Dry Ports-Seaports Sustainable Logistics Network Optimization: Considering the Environment Constraints and the Concession Cooperation Relationships

Directory of Open Access Journals (Sweden)

Wei Hairui

2017-11-01

Full Text Available In China dry ports enter into a rapid development period now, however for many Chinese dry ports, the operation faces difficulties duo to inefficient logistics networks and cooperation relationship between dry ports and seaports. Focusing on the concession cooperation mechanism of seaports and dry ports, and the environmental constraints (carbon emissions and congestion cost, a bi-objective location-allocation MILP model for the sustainable hinterland-dry ports-seaports logistics network optimization is formulated, aiming at the system logistics costs and carbon emissions to be minimized. Moreover, for the cooperation mechanism of seaports to dry ports, a parameter called cooperation cost concession coefficient is proposed for the optimization model, and a new evaluation method based on the ordered weighted averaging (OWA operator is used to evaluate it. Then a location-allocation decision-making framework for the hinterland-dry port-seaport logistics network is proposed. The innovative aspect of the model is that it can proposes a effective and environment friendly dry ports location strategic and also give insights into the connective cooperation relationships, and cargo flows of the network. A case study involving configuration of dry ports in Henan Province is conducted, and the model is successfully applied.

Bi-objective Optimization of the Water Distribution Networks (Case Study: Sahand City

Directory of Open Access Journals (Sweden)

Ali Nikjoofar

2012-12-01

Full Text Available To design an urban water network in addition to minimizing the cost, improving the water pressure is very important. Then in this paper a bi-objective optimization model for the new city of Sahand in Northwestern Iran is developed.  Due to its non-linearity and the huge number of variables, the genetic algorithm has been utilized to solve it. Several Pareto solutions have been obtained and then based on the game theory approach (the area monotonic solution, the most efficient point was provided. The solution is simulated by the WaterGems software and the elements of the network are designed. This optimum solution shows a decrease of 13% in total cost in addition to the improved water pressure.

Cost-Optimal Analysis for Nearly Zero Energy Buildings Design and Optimization: A Critical Review

Directory of Open Access Journals (Sweden)

Maria Ferrara

2018-06-01

Full Text Available Since the introduction of the recast of the EPBD European Directive 2010/31/EU, many studies on the cost-effective feasibility of nearly zero-energy buildings (NZEBs were carried out either by academic research bodies and by national bodies. In particular, the introduction of the cost-optimal methodology has given a strong impulse to research in this field. This paper presents a comprehensive and significant review on scientific works based on the application of cost-optimal analysis applications in Europe since the EPBD recast entered into force, pointing out the differences in the analyzed studies and comparing their outcomes before the new recast of EPBD enters into force in 2018. The analysis is conducted with special regard to the methods used for the energy performance assessment, the global cost calculation, and for the selection of the energy efficiency measures leading to design optimization. A critical discussion about the assumptions on which the studies are based and the resulting gaps between the resulting cost-optimal performance and the zero energy target is provided together with a summary of the resulting cost-optimal set of technologies to be used for cost-optimal NZEB design in different contexts. It is shown that the cost-optimal approach results as an effective method for delineating the future of NZEB design throughout Europe while emerging criticalities and open research issues are presented.

Bridge Management Strategy Based on Extreme User Costs for Bridge Network Condition

Directory of Open Access Journals (Sweden)

Ladislaus Lwambuka

2014-01-01

Full Text Available This paper presents a practical approach for prioritization of bridge maintenance within a given bridge network. The maintenance prioritization is formulated as a multiobjective optimization problem where the simultaneous satisfaction of several conflicting objectives includes minimization of maintenance costs, maximization of bridge deck condition, and minimization of traffic disruption and associated user costs. The prevalence of user cost during maintenance period is twofold; the first case refers to the period of dry season where normally the traffic flow is diverted to alternative routes usually resurfaced to regain traffic access. The second prevalence refers to the absence of alternative routes which is often the case in the least developed countries; in this case the user cost referred to results from the waiting time while the traffic flow is put on hold awaiting accomplishment of the maintenance activity. This paper deals with the second scenario of traffic closure in the absence of alternative diversion routes which in essence results in extreme user cost. The paper shows that the multiobjective optimization approach remains valid for extreme cases of user costs in the absence of detour roads as often is the scenario in countries with extreme poor road infrastructure.

ENERGY OPTIMIZATION IN CLUSTER BASED WIRELESS SENSOR NETWORKS

Directory of Open Access Journals (Sweden)

T. SHANKAR

2014-04-01

Full Text Available Wireless sensor networks (WSN are made up of sensor nodes which are usually battery-operated devices, and hence energy saving of sensor nodes is a major design issue. To prolong the networks lifetime, minimization of energy consumption should be implemented at all layers of the network protocol stack starting from the physical to the application layer including cross-layer optimization. Optimizing energy consumption is the main concern for designing and planning the operation of the WSN. Clustering technique is one of the methods utilized to extend lifetime of the network by applying data aggregation and balancing energy consumption among sensor nodes of the network. This paper proposed new version of Low Energy Adaptive Clustering Hierarchy (LEACH, protocols called Advanced Optimized Low Energy Adaptive Clustering Hierarchy (AOLEACH, Optimal Deterministic Low Energy Adaptive Clustering Hierarchy (ODLEACH, and Varying Probability Distance Low Energy Adaptive Clustering Hierarchy (VPDL combination with Shuffled Frog Leap Algorithm (SFLA that enables selecting best optimal adaptive cluster heads using improved threshold energy distribution compared to LEACH protocol and rotating cluster head position for uniform energy dissipation based on energy levels. The proposed algorithm optimizing the life time of the network by increasing the first node death (FND time and number of alive nodes, thereby increasing the life time of the network.

Network synchronization: optimal and pessimal scale-free topologies

Energy Technology Data Exchange (ETDEWEB)

Donetti, Luca [Departamento de Electronica y Tecnologia de Computadores and Instituto de Fisica Teorica y Computacional Carlos I, Facultad de Ciencias, Universidad de Granada, 18071 Granada (Spain); Hurtado, Pablo I; Munoz, Miguel A [Departamento de Electromagnetismo y Fisica de la Materia and Instituto Carlos I de Fisica Teorica y Computacional Facultad de Ciencias, Universidad de Granada, 18071 Granada (Spain)], E-mail: mamunoz@onsager.ugr.es

2008-06-06

By employing a recently introduced optimization algorithm we construct optimally synchronizable (unweighted) networks for any given scale-free degree distribution. We explore how the optimization process affects degree-degree correlations and observe a generic tendency toward disassortativity. Still, we show that there is not a one-to-one correspondence between synchronizability and disassortativity. On the other hand, we study the nature of optimally un-synchronizable networks, that is, networks whose topology minimizes the range of stability of the synchronous state. The resulting 'pessimal networks' turn out to have a highly assortative string-like structure. We also derive a rigorous lower bound for the Laplacian eigenvalue ratio controlling synchronizability, which helps understanding the impact of degree correlations on network synchronizability.

Adaptive optimization and control using neural networks

Energy Technology Data Exchange (ETDEWEB)

Mead, W.C.; Brown, S.K.; Jones, R.D.; Bowling, P.S.; Barnes, C.W.

1993-10-22

Recent work has demonstrated the ability of neural-network-based controllers to optimize and control machines with complex, non-linear, relatively unknown control spaces. We present a brief overview of neural networks via a taxonomy illustrating some capabilities of different kinds of neural networks. We present some successful control examples, particularly the optimization and control of a small-angle negative ion source.

An Optimal Path Computation Architecture for the Cloud-Network on Software-Defined Networking

Directory of Open Access Journals (Sweden)

Hyunhun Cho

2015-05-01

Full Text Available Legacy networks do not open the precise information of the network domain because of scalability, management and commercial reasons, and it is very hard to compute an optimal path to the destination. According to today’s ICT environment change, in order to meet the new network requirements, the concept of software-defined networking (SDN has been developed as a technological alternative to overcome the limitations of the legacy network structure and to introduce innovative concepts. The purpose of this paper is to propose the application that calculates the optimal paths for general data transmission and real-time audio/video transmission, which consist of the major services of the National Research & Education Network (NREN in the SDN environment. The proposed SDN routing computation (SRC application is designed and applied in a multi-domain network for the efficient use of resources, selection of the optimal path between the multi-domains and optimal establishment of end-to-end connections.

Optimization-Based Approaches to Control of Probabilistic Boolean Networks

Directory of Open Access Journals (Sweden)

Koichi Kobayashi

2017-02-01

Full Text Available Control of gene regulatory networks is one of the fundamental topics in systems biology. In the last decade, control theory of Boolean networks (BNs, which is well known as a model of gene regulatory networks, has been widely studied. In this review paper, our previously proposed methods on optimal control of probabilistic Boolean networks (PBNs are introduced. First, the outline of PBNs is explained. Next, an optimal control method using polynomial optimization is explained. The finite-time optimal control problem is reduced to a polynomial optimization problem. Furthermore, another finite-time optimal control problem, which can be reduced to an integer programming problem, is also explained.

Modeling and Optimization of M/G/1-Type Queueing Networks: An Efficient Sensitivity Analysis Approach

Directory of Open Access Journals (Sweden)

Liang Tang

2010-01-01

Full Text Available A mathematical model for M/G/1-type queueing networks with multiple user applications and limited resources is established. The goal is to develop a dynamic distributed algorithm for this model, which supports all data traffic as efficiently as possible and makes optimally fair decisions about how to minimize the network performance cost. An online policy gradient optimization algorithm based on a single sample path is provided to avoid suffering from a “curse of dimensionality”. The asymptotic convergence properties of this algorithm are proved. Numerical examples provide valuable insights for bridging mathematical theory with engineering practice.

Self-Optimization of LTE Networks Utilizing Celnet Xplorer

CERN Document Server

Buvaneswari, A; Polakos, Paul; Buvaneswari, Arumugam

2010-01-01

In order to meet demanding performance objectives in Long Term Evolution (LTE) networks, it is mandatory to implement highly efficient, autonomic self-optimization and configuration processes. Self-optimization processes have already been studied in second generation (2G) and third generation (3G) networks, typically with the objective of improving radio coverage and channel capacity. The 3rd Generation Partnership Project (3GPP) standard for LTE self-organization of networks (SON) provides guidelines on self-configuration of physical cell ID and neighbor relation function and self-optimization for mobility robustness, load balancing, and inter-cell interference reduction. While these are very important from an optimization perspective of local phenomenon (i.e., the eNodeB's interaction with its neighbors), it is also essential to architect control algorithms to optimize the network as a whole. In this paper, we propose a Celnet Xplorer-based SON architecture that allows detailed analysis of network performan...

Probabilistic Optimal Power Dispatch in Multi-Carrier Networked Microgrids under Uncertainties

Directory of Open Access Journals (Sweden)

Vahid Amir

2017-11-01

Full Text Available A microgrid (MG is a small-scale version of the power system which makes possible the integration of renewable resources as well as achieving maximum demand side management (DSM utilization. The future power system will be faced with severe uncertainties owing to penetration of renewable resources. Consequently, the uncertainty assessment of system performance is essential. The conventional energy scheduling in an MG may not be suitable for active distribution networks. Hence, this study focuses on the probabilistic analysis of optimal power dispatch considering economic aspects in a multi-carrier networked microgrid. The aim is to study the impact of uncertain behavior of loads, renewable resources, and electricity market on the optimal management of a multi-carrier networked microgrid. Furthermore, a novel time-based demand side management is proposed in order to reshape the load curve, as well as preventing the excessive use of energy in peak hours. The optimization model is formulated as a mixed integer nonlinear program (MINLP and is solved using MATLAB and GAMS software. Results show that the energy sharing capability between MCMGs and MCMGs and the main grids as well as utilization of demand side management can decrease operating costs for smart distribution grids.

Cost optimization on example of hotel-restaurant complex enterprises

Directory of Open Access Journals (Sweden)

Volkovska I.V.

2017-08-01

Full Text Available Optimization of costs is important for increasing competitiveness and profitability of the enterprise, therefore, the purpose of the study is to establish and visualize the basis of cost optimization on the example of hotel-restaurant complex enterprises. The essence of cost optimization is investigated through the analysis of the views of various scholars for this purpose. It is established that cost optimization is the process of planning, accounting, analysis, cost control for searching and selecting of the most effective methods of managing of the conditions of limited resources. The author has developed the sequence of cost optimization on the example of enterprises of the hotel-restaurant complex, which helps to structure the process of cost management. In this sequence, there are areas where costs can be reduced, and the technical and economic conditions under which they can be changed. In addition, it is noted that such implementation is important in the cost management at the enterprise. It is also proposed to optimize costs using the simplex method to carry out a quantitative assessment of the quality of services by the qualimetric method. It is noted that it is necessary to form alternative ways of using resources for rational use of scarce resources. The article proposes cost grouping by the XYZ-analysis with individual approaches to cost management, namely, target costing, the theory of constrains, lean manufacturing. For this purpose, the author develops the table that should be filled in to compare which costs and ways can be reduced or replaced. Besides, the author has added recommendations for filling in the table and commented that with this analysis a transaction and unreasonable costs can be controlled. Thus, with such a sequence of actions, redistribution of funds is possible to optimize costs and save money, which can be directed to enterprise development. The conclusion is made of the need of system analysis to use

Optimal networks of future gravitational-wave telescopes

Science.gov (United States)

Raffai, Péter; Gondán, László; Heng, Ik Siong; Kelecsényi, Nándor; Logue, Josh; Márka, Zsuzsa; Márka, Szabolcs

2013-08-01

We aim to find the optimal site locations for a hypothetical network of 1-3 triangular gravitational-wave telescopes. We define the following N-telescope figures of merit (FoMs) and construct three corresponding metrics: (a) capability of reconstructing the signal polarization; (b) accuracy in source localization; and (c) accuracy in reconstructing the parameters of a standard binary source. We also define a combined metric that takes into account the three FoMs with practically equal weight. After constructing a geomap of possible telescope sites, we give the optimal 2-telescope networks for the four FoMs separately in example cases where the location of the first telescope has been predetermined. We found that based on the combined metric, placing the first telescope to Australia provides the most options for optimal site selection when extending the network with a second instrument. We suggest geographical regions where a potential second and third telescope could be placed to get optimal network performance in terms of our FoMs. Additionally, we use a similar approach to find the optimal location and orientation for the proposed LIGO-India detector within a five-detector network with Advanced LIGO (Hanford), Advanced LIGO (Livingston), Advanced Virgo, and KAGRA. We found that the FoMs do not change greatly in sites within India, though the network can suffer a significant loss in reconstructing signal polarizations if the orientation angle of an L-shaped LIGO-India is not set to the optimal value of ˜58.2°( + k × 90°) (measured counterclockwise from East to the bisector of the arms).

A Network Traffic Control Enhancement Approach over Bluetooth Networks

DEFF Research Database (Denmark)

Son, L.T.; Schiøler, Henrik; Madsen, Ole Brun

2003-01-01

This paper analyzes network traffic control issues in Bluetooth data networks as convex optimization problem. We formulate the problem of maximizing of total network flows and minimizing the costs of flows. An adaptive distributed network traffic control scheme is proposed as an approximated solu...... as capacity limitations and flow requirements in the network. Simulation shows that the performance of Bluetooth networks could be improved by applying the adaptive distributed network traffic control scheme...... solution of the stated optimization problem that satisfies quality of service requirements and topologically induced constraints in Bluetooth networks, such as link capacity and node resource limitations. The proposed scheme is decentralized and complies with frequent changes of topology as well......This paper analyzes network traffic control issues in Bluetooth data networks as convex optimization problem. We formulate the problem of maximizing of total network flows and minimizing the costs of flows. An adaptive distributed network traffic control scheme is proposed as an approximated...

Optimal transport on supply-demand networks.

Science.gov (United States)

Chen, Yu-Han; Wang, Bing-Hong; Zhao, Li-Chao; Zhou, Changsong; Zhou, Tao

2010-06-01

In the literature, transport networks are usually treated as homogeneous networks, that is, every node has the same function, simultaneously providing and requiring resources. However, some real networks, such as power grids and supply chain networks, show a far different scenario in which nodes are classified into two categories: supply nodes provide some kinds of services, while demand nodes require them. In this paper, we propose a general transport model for these supply-demand networks, associated with a criterion to quantify their transport capacities. In a supply-demand network with heterogeneous degree distribution, its transport capacity strongly depends on the locations of supply nodes. We therefore design a simulated annealing algorithm to find the near optimal configuration of supply nodes, which remarkably enhances the transport capacity compared with a random configuration and outperforms the degree target algorithm, the betweenness target algorithm, and the greedy method. This work provides a start point for systematically analyzing and optimizing transport dynamics on supply-demand networks.

Context-Aware Local Optimization of Sensor Network Deployment

Directory of Open Access Journals (Sweden)

Meysam Argany

2015-07-01

Full Text Available Wireless sensor networks are increasingly used for tracking and monitoring dynamic phenomena in urban and natural areas. Spatial coverage is an important issue in sensor networks in order to fulfill the needs of sensing applications. Optimization methods are widely used to efficiently distribute sensor nodes in the network to achieve a desired level of coverage. Most of the existing algorithms do not consider the characteristics of the real environment in the optimization process. In this paper, we propose the integration of contextual information in optimization algorithms to improve sensor network coverage. First, we investigate the implication of contextual information in sensor networks. Then, a conceptual framework for local context-aware sensor network deployment optimization method is introduced and related algorithms are presented in detail. Finally, several experiments are carried out to evaluate the validity of the proposed method. The results obtained from these experiments show the effectiveness of our approach in different contextual situations.

Optimizing the next generation optical access networks

DEFF Research Database (Denmark)

Amaya Fernández, Ferney Orlando; Soto, Ana Cardenas; Tafur Monroy, Idelfonso

2009-01-01

Several issues in the design and optimization of the next generation optical access network (NG-OAN) are presented. The noise, the distortion and the fiber optic nonlinearities are considered to optimize the video distribution link in a passive optical network (PON). A discussion of the effect...

Neural network-based optimal adaptive output feedback control of a helicopter UAV.

Science.gov (United States)

Nodland, David; Zargarzadeh, Hassan; Jagannathan, Sarangapani

2013-07-01

Helicopter unmanned aerial vehicles (UAVs) are widely used for both military and civilian operations. Because the helicopter UAVs are underactuated nonlinear mechanical systems, high-performance controller design for them presents a challenge. This paper introduces an optimal controller design via an output feedback for trajectory tracking of a helicopter UAV, using a neural network (NN). The output-feedback control system utilizes the backstepping methodology, employing kinematic and dynamic controllers and an NN observer. The online approximator-based dynamic controller learns the infinite-horizon Hamilton-Jacobi-Bellman equation in continuous time and calculates the corresponding optimal control input by minimizing a cost function, forward-in-time, without using the value and policy iterations. Optimal tracking is accomplished by using a single NN utilized for the cost function approximation. The overall closed-loop system stability is demonstrated using Lyapunov analysis. Finally, simulation results are provided to demonstrate the effectiveness of the proposed control design for trajectory tracking.

Planning Optimization of the Distributed Antenna System in High-Speed Railway Communication Network Based on Improved Cuckoo Search

Directory of Open Access Journals (Sweden)

Zhaoyu Chen

2018-01-01

Full Text Available The network planning is a key factor that directly affects the performance of the wireless networks. Distributed antenna system (DAS is an effective strategy for the network planning. This paper investigates the antenna deployment in a DAS for the high-speed railway communication networks and formulates an optimization problem which is NP-hard for achieving the optimal deployment of the antennas in the DAS. To solve this problem, a scheme based on an improved cuckoo search based on dimension cells (ICSDC algorithm is proposed. ICSDC introduces the dimension cell mechanism to avoid the internal dimension interferences in order to improve the performance of the algorithm. Simulation results show that the proposed ICSDC-based scheme obtains a lower network cost compared with the uniform network planning method. Moreover, ICSDC algorithm has better performance in terms of the convergence rate and accuracy compared with the conventional cuckoo search algorithm, the particle swarm optimization, and the firefly algorithm.

Transaction costs and social networks in productivity measurement

DEFF Research Database (Denmark)

Henningsen, Geraldine; Henningsen, Arne; Henning, Christian H. C. A.

2015-01-01

. Hence, both the absolute productivity measures and, more importantly, the productivity ranking will be distorted. A major driver of transaction costs is poor access to information and contract enforcement assistance. Social networks often catalyse information exchange as well as generate trust...... and support. Hence, we use measures of a firm’s access to social networks as a proxy for the transaction costs the firm faces. We develop a microeconomic production model that takes into account transaction costs and networks. Using a data set of 384 Polish farms, we empirically estimate this model...... and compare different parametric, semiparametric, and nonparametric model specifications. Our results generally support our hypothesis. Especially, large trading networks and dense household networks have a positive influence on a farm’s productivity. Furthermore, our results indicate that transaction costs...

Optimization of stochastic discrete systems and control on complex networks computational networks

CERN Document Server

Lozovanu, Dmitrii

2014-01-01

This book presents the latest findings on stochastic dynamic programming models and on solving optimal control problems in networks. It includes the authors' new findings on determining the optimal solution of discrete optimal control problems in networks and on solving game variants of Markov decision problems in the context of computational networks. First, the book studies the finite state space of Markov processes and reviews the existing methods and algorithms for determining the main characteristics in Markov chains, before proposing new approaches based on dynamic programming and combinatorial methods. Chapter two is dedicated to infinite horizon stochastic discrete optimal control models and Markov decision problems with average and expected total discounted optimization criteria, while Chapter three develops a special game-theoretical approach to Markov decision processes and stochastic discrete optimal control problems. In closing, the book's final chapter is devoted to finite horizon stochastic con...

Study on Optimization of I and C Architecture for Research Reactors Using Bayesian Networks

Energy Technology Data Exchange (ETDEWEB)

Rahman, Khaili Ur; Shin, Jinsoo; Heo, Gyunyoung [Kyung Hee Univ., Yongin (Korea, Republic of)

2013-07-01

The optimization in terms of redundancy of modules and components in Instrumentation and Control (I and C) architecture is based on cost and availability assuming regulatory requirements are satisfied. The motive of this study is to find an optimized I and C architecture, either in hybrid formation, fully digital or analog, with respect to system availability and relative cost of architecture. The cost of research reactors I and C systems is prone to have effect on marketing competitiveness. As a demonstrative example, the reactor protection system of research reactors is selected. The four cases with different architecture formation were developed with single and double redundancy of bi-stable modules, coincidence processor module, and safety or protection circuit actuation logic. The architecture configurations are transformed to reliability block diagram (RBD) based on logical operation and function of modules. A Bayesian Network (BN) model is constructed from RBD to assess availability. The cost estimation was proposed and reliability cost index RI was suggested.

Study on Optimization of I and C Architecture for Research Reactors Using Bayesian Networks

International Nuclear Information System (INIS)

Rahman, Khaili Ur; Shin, Jinsoo; Heo, Gyunyoung

2013-01-01

The optimization in terms of redundancy of modules and components in Instrumentation and Control (I and C) architecture is based on cost and availability assuming regulatory requirements are satisfied. The motive of this study is to find an optimized I and C architecture, either in hybrid formation, fully digital or analog, with respect to system availability and relative cost of architecture. The cost of research reactors I and C systems is prone to have effect on marketing competitiveness. As a demonstrative example, the reactor protection system of research reactors is selected. The four cases with different architecture formation were developed with single and double redundancy of bi-stable modules, coincidence processor module, and safety or protection circuit actuation logic. The architecture configurations are transformed to reliability block diagram (RBD) based on logical operation and function of modules. A Bayesian Network (BN) model is constructed from RBD to assess availability. The cost estimation was proposed and reliability cost index RI was suggested

Optimal networks of future gravitational-wave telescopes

International Nuclear Information System (INIS)

Raffai, Péter; Márka, Zsuzsa; Márka, Szabolcs; Gondán, László; Kelecsényi, Nándor; Heng, Ik Siong; Logue, Josh

2013-01-01

We aim to find the optimal site locations for a hypothetical network of 1–3 triangular gravitational-wave telescopes. We define the following N-telescope figures of merit (FoMs) and construct three corresponding metrics: (a) capability of reconstructing the signal polarization; (b) accuracy in source localization; and (c) accuracy in reconstructing the parameters of a standard binary source. We also define a combined metric that takes into account the three FoMs with practically equal weight. After constructing a geomap of possible telescope sites, we give the optimal 2-telescope networks for the four FoMs separately in example cases where the location of the first telescope has been predetermined. We found that based on the combined metric, placing the first telescope to Australia provides the most options for optimal site selection when extending the network with a second instrument. We suggest geographical regions where a potential second and third telescope could be placed to get optimal network performance in terms of our FoMs. Additionally, we use a similar approach to find the optimal location and orientation for the proposed LIGO-India detector within a five-detector network with Advanced LIGO (Hanford), Advanced LIGO (Livingston), Advanced Virgo, and KAGRA. We found that the FoMs do not change greatly in sites within India, though the network can suffer a significant loss in reconstructing signal polarizations if the orientation angle of an L-shaped LIGO-India is not set to the optimal value of ∼58.2°( + k × 90°) (measured counterclockwise from East to the bisector of the arms). (paper)

Equation of costs and function objective for the optimization of the design of nets of flow of liquids to pressure

International Nuclear Information System (INIS)

Narvaez R, Paulo Cesar; Galeano P, Haiver

2002-01-01

Optimal design problem of liquid distribution systems has been viewed as the selection of pipe sizes and pumps, which will minimize overall costs, accomplishing the flow and pressure constraints. There is a set of methods for least cost design of liquids distribution networks (6). In the last years, some of them have been studied broadly: linear programming (1, 4, 5, 7], non-linear programming [8, 9], and genetic algorithms (3, 10, 13). This paper describes the development of a cost equation and the objective function for liquid distribution networks that together to the mathematical model and the solution method of the flow problem developed by Narvaez (11), were used by in a computer model that involves the application of an genetic algorithm to the problem of least cost design of liquids distribution networks

Cooperative Convex Optimization in Networked Systems: Augmented Lagrangian Algorithms With Directed Gossip Communication

Science.gov (United States)

Jakovetic, Dusan; Xavier, João; Moura, José M. F.

2011-08-01

We study distributed optimization in networked systems, where nodes cooperate to find the optimal quantity of common interest, x=x^\\star. The objective function of the corresponding optimization problem is the sum of private (known only by a node,) convex, nodes' objectives and each node imposes a private convex constraint on the allowed values of x. We solve this problem for generic connected network topologies with asymmetric random link failures with a novel distributed, decentralized algorithm. We refer to this algorithm as AL-G (augmented Lagrangian gossiping,) and to its variants as AL-MG (augmented Lagrangian multi neighbor gossiping) and AL-BG (augmented Lagrangian broadcast gossiping.) The AL-G algorithm is based on the augmented Lagrangian dual function. Dual variables are updated by the standard method of multipliers, at a slow time scale. To update the primal variables, we propose a novel, Gauss-Seidel type, randomized algorithm, at a fast time scale. AL-G uses unidirectional gossip communication, only between immediate neighbors in the network and is resilient to random link failures. For networks with reliable communication (i.e., no failures,) the simplified, AL-BG (augmented Lagrangian broadcast gossiping) algorithm reduces communication, computation and data storage cost. We prove convergence for all proposed algorithms and demonstrate by simulations the effectiveness on two applications: l_1-regularized logistic regression for classification and cooperative spectrum sensing for cognitive radio networks.

Influence maximization in complex networks through optimal percolation

Science.gov (United States)

Morone, Flaviano; Makse, Hernán A.

2015-08-01

The whole frame of interconnections in complex networks hinges on a specific set of structural nodes, much smaller than the total size, which, if activated, would cause the spread of information to the whole network, or, if immunized, would prevent the diffusion of a large scale epidemic. Localizing this optimal, that is, minimal, set of structural nodes, called influencers, is one of the most important problems in network science. Despite the vast use of heuristic strategies to identify influential spreaders, the problem remains unsolved. Here we map the problem onto optimal percolation in random networks to identify the minimal set of influencers, which arises by minimizing the energy of a many-body system, where the form of the interactions is fixed by the non-backtracking matrix of the network. Big data analyses reveal that the set of optimal influencers is much smaller than the one predicted by previous heuristic centralities. Remarkably, a large number of previously neglected weakly connected nodes emerges among the optimal influencers. These are topologically tagged as low-degree nodes surrounded by hierarchical coronas of hubs, and are uncovered only through the optimal collective interplay of all the influencers in the network. The present theoretical framework may hold a larger degree of universality, being applicable to other hard optimization problems exhibiting a continuous transition from a known phase.

Searching for the most cost-effective strategy for controlling epidemics spreading on regular and small-world networks.

Science.gov (United States)

Kleczkowski, Adam; Oleś, Katarzyna; Gudowska-Nowak, Ewa; Gilligan, Christopher A

2012-01-07

We present a combined epidemiological and economic model for control of diseases spreading on local and small-world networks. The disease is characterized by a pre-symptomatic infectious stage that makes detection and control of cases more difficult. The effectiveness of local (ring-vaccination or culling) and global control strategies is analysed by comparing the net present values of the combined cost of preventive treatment and illness. The optimal strategy is then selected by minimizing the total cost of the epidemic. We show that three main strategies emerge, with treating a large number of individuals (global strategy, GS), treating a small number of individuals in a well-defined neighbourhood of a detected case (local strategy) and allowing the disease to spread unchecked (null strategy, NS). The choice of the optimal strategy is governed mainly by a relative cost of palliative and preventive treatments. If the disease spreads within the well-defined neighbourhood, the local strategy is optimal unless the cost of a single vaccine is much higher than the cost associated with hospitalization. In the latter case, it is most cost-effective to refrain from prevention. Destruction of local correlations, either by long-range (small-world) links or by inclusion of many initial foci, expands the range of costs for which the NS is most cost-effective. The GS emerges for the case when the cost of prevention is much lower than the cost of treatment and there is a substantial non-local component in the disease spread. We also show that local treatment is only desirable if the disease spreads on a small-world network with sufficiently few long-range links; otherwise it is optimal to treat globally. In the mean-field case, there are only two optimal solutions, to treat all if the cost of the vaccine is low and to treat nobody if it is high. The basic reproduction ratio, R(0), does not depend on the rate of responsive treatment in this case and the disease always invades

New optimization strategies of pavement maintenance: A case study for national road network in Indonesia using integrated road management system

Science.gov (United States)

Hamdi, Hadiwardoyo, Sigit P.; Correia, A. Gomes; Pereira, Paulo

2017-06-01

A road network requires timely maintenance to keep the road surface in good condition onward better services to improve accessibility and mobility. Strategies and maintenance techniques must be chosen in order to maximize road service level through cost-effective interventions. This approach requires an updated database, which the road network in Indonesia is supported by a manual and visual survey, also using NAASRA profiler. Furthermore, in this paper, the deterministic model of deterioration was used. This optimization model uses life cycle cost analysis (LCCA), applied in an integrated manner, using IRI indicator, and allows determining the priority of treatment, type of treatment and its relation to the cost. The purpose of this paper was focussed on the aspects of road maintenance management, i.e., maintenance optimization models for different levels of traffic and various initial of road distress conditions on the national road network in Indonesia. The implementation of Integrated Road Management System (IRMS) can provide a solution to the problem of cost constraints in the maintenance of the national road network. The results from this study found that as the lowest as agency cost, it will affect the increasing of user cost. With the achievement of the target plan scenario Pl000 with initial value IRI 2, it was found that the routine management throughout the year and in early reconstruction and periodic maintenance with a 30 mm thick overlay, will simultaneously provide a higher net benefit value and has the lowest total cost of transportation.

Optimizing Groundwater Monitoring Networks Using Integrated Statistical and Geostatistical Approaches

Directory of Open Access Journals (Sweden)

Jay Krishna Thakur

2015-08-01

Full Text Available The aim of this work is to investigate new approaches using methods based on statistics and geo-statistics for spatio-temporal optimization of groundwater monitoring networks. The formulated and integrated methods were tested with the groundwater quality data set of Bitterfeld/Wolfen, Germany. Spatially, the monitoring network was optimized using geo-statistical methods. Temporal optimization of the monitoring network was carried out using Sen’s method (1968. For geostatistical network optimization, a geostatistical spatio-temporal algorithm was used to identify redundant wells in 2- and 2.5-D Quaternary and Tertiary aquifers. Influences of interpolation block width, dimension, contaminant association, groundwater flow direction and aquifer homogeneity on statistical and geostatistical methods for monitoring network optimization were analysed. The integrated approach shows 37% and 28% redundancies in the monitoring network in Quaternary aquifer and Tertiary aquifer respectively. The geostatistical method also recommends 41 and 22 new monitoring wells in the Quaternary and Tertiary aquifers respectively. In temporal optimization, an overall optimized sampling interval was recommended in terms of lower quartile (238 days, median quartile (317 days and upper quartile (401 days in the research area of Bitterfeld/Wolfen. Demonstrated methods for improving groundwater monitoring network can be used in real monitoring network optimization with due consideration given to influencing factors.

Road networks as collections of minimum cost paths

Science.gov (United States)

Wegner, Jan Dirk; Montoya-Zegarra, Javier Alexander; Schindler, Konrad

2015-10-01

We present a probabilistic representation of network structures in images. Our target application is the extraction of urban roads from aerial images. Roads appear as thin, elongated, partially curved structures forming a loopy graph, and this complex layout requires a prior that goes beyond standard smoothness and co-occurrence assumptions. In the proposed model the network is represented as a union of 1D paths connecting distant (super-)pixels. A large set of putative candidate paths is constructed in such a way that they include the true network as much as possible, by searching for minimum cost paths in the foreground (road) likelihood. Selecting the optimal subset of candidate paths is posed as MAP inference in a higher-order conditional random field. Each path forms a higher-order clique with a type of clique potential, which attracts the member nodes of cliques with high cumulative road evidence to the foreground label. That formulation induces a robust PN -Potts model, for which a global MAP solution can be found efficiently with graph cuts. Experiments with two road data sets show that the proposed model significantly improves per-pixel accuracies as well as the overall topological network quality with respect to several baselines.

Influence maximization in complex networks through optimal percolation

Science.gov (United States)

Morone, Flaviano; Makse, Hernan; CUNY Collaboration; CUNY Collaboration

The whole frame of interconnections in complex networks hinges on a specific set of structural nodes, much smaller than the total size, which, if activated, would cause the spread of information to the whole network, or, if immunized, would prevent the diffusion of a large scale epidemic. Localizing this optimal, that is, minimal, set of structural nodes, called influencers, is one of the most important problems in network science. Here we map the problem onto optimal percolation in random networks to identify the minimal set of influencers, which arises by minimizing the energy of a many-body system, where the form of the interactions is fixed by the non-backtracking matrix of the network. Big data analyses reveal that the set of optimal influencers is much smaller than the one predicted by previous heuristic centralities. Remarkably, a large number of previously neglected weakly connected nodes emerges among the optimal influencers. Reference: F. Morone, H. A. Makse, Nature 524,65-68 (2015)

Optimal defense resource allocation in scale-free networks

Science.gov (United States)

Zhang, Xuejun; Xu, Guoqiang; Xia, Yongxiang

2018-02-01

The robustness research of networked systems has drawn widespread attention in the past decade, and one of the central topics is to protect the network from external attacks through allocating appropriate defense resource to different nodes. In this paper, we apply a specific particle swarm optimization (PSO) algorithm to optimize the defense resource allocation in scale-free networks. Results reveal that PSO based resource allocation shows a higher robustness than other resource allocation strategies such as uniform, degree-proportional, and betweenness-proportional allocation strategies. Furthermore, we find that assigning less resource to middle-degree nodes under small-scale attack while more resource to low-degree nodes under large-scale attack is conductive to improving the network robustness. Our work provides an insight into the optimal defense resource allocation pattern in scale-free networks and is helpful for designing a more robust network.

Practical synchronization on complex dynamical networks via optimal pinning control

Science.gov (United States)

Li, Kezan; Sun, Weigang; Small, Michael; Fu, Xinchu

2015-07-01

We consider practical synchronization on complex dynamical networks under linear feedback control designed by optimal control theory. The control goal is to minimize global synchronization error and control strength over a given finite time interval, and synchronization error at terminal time. By utilizing the Pontryagin's minimum principle, and based on a general complex dynamical network, we obtain an optimal system to achieve the control goal. The result is verified by performing some numerical simulations on Star networks, Watts-Strogatz networks, and Barabási-Albert networks. Moreover, by combining optimal control and traditional pinning control, we propose an optimal pinning control strategy which depends on the network's topological structure. Obtained results show that optimal pinning control is very effective for synchronization control in real applications.

Allocation base of general production costs as optimization of prime costs

Directory of Open Access Journals (Sweden)

Levytska I.O.

2017-03-01

Full Text Available Qualified management aimed at optimizing financial results is the key factor in today's society. Effective management decisions depend on the necessary information about the costs of production process in all its aspects – their structure, types, accounting policies of reflecting costs. General production costs, the so-called indirect costs that are not directly related to the production process, but provide its functioning in terms of supporting structural divisions and create the necessary conditions of production, play a significant role in calculating prime costs of goods (works, services. However, the accurate estimate of prime costs of goods (works, services should be determined with the value of indirect costs (in other words, general production costs, and properly determined with the base of their allocation. The choice of allocation base of general production costs is the significant moment, depending on the nature of business, which must guarantee fair distribution regarding to the largest share of direct expenses in the total structure of production costs. The study finds the essence of general production costs based on the analysis of key definitions of leading Ukrainian economists. The optimal allocation approach of general production costs is to calculate these costs as direct production costs within each subsidiary division (department separately without selecting a base as the main one to the their total amount.

Optimal Retrofit Scheme for Highway Network under Seismic Hazards

Directory of Open Access Journals (Sweden)

Yongxi Huang

2014-06-01

Full Text Available Many older highway bridges in the United States (US are inadequate for seismic loads and could be severely damaged or collapsed in a relatively small earthquake. According to the most recent American Society of Civil Engineers’ infrastructure report card, one-third of the bridges in the US are rated as structurally deficient and many of these structurally deficient bridges are located in seismic zones. To improve this situation, at-risk bridges must be identified and evaluated and effective retrofitting programs should be in place to reduce their seismic vulnerabilities. In this study, a new retrofit strategy decision scheme for highway bridges under seismic hazards is developed and seamlessly integrate the scenario-based seismic analysis of bridges and the traffic network into the proposed optimization modeling framework. A full spectrum of bridge retrofit strategies is considered based on explicit structural assessment for each seismic damage state. As an empirical case study, the proposed retrofit strategy decision scheme is utilized to evaluate the bridge network in one of the active seismic zones in the US, Charleston, South Carolina. The developed modeling framework, on average, will help increase network throughput traffic capacity by 45% with a cost increase of only $15million for the Mw 5.5 event and increase the capacity fourfold with a cost of only $32m for the Mw 7.0 event.

LinkMind: Link Optimization in Swarming Mobile Sensor Networks

DEFF Research Database (Denmark)

Ngo, Trung Dung

2012-01-01

of the most advantageous properties of the swarming wireless sensor network is that mobile nodes can work cooperatively to organize an ad-hoc network and optimize the network link capacity to maximize the transmission of gathered data from a source to a target. This paper describes a new method of link...... optimization of swarming mobile sensor networks. The new method is based on combination of the artificial potential force guaranteeing connectivities of the mobile sensor nodes and the max-flow min-cut theorem of graph theory ensuring optimization of the network link capacity. The developed algorithm...

On the cost/delay tradeoff of wireless delay tolerant geographic routing

OpenAIRE

Tasiopoulos, Argyrios; Tsiaras, Christos; Toumpis, Stavros

2012-01-01

In Delay Tolerant Networks (DTNs), there is a fundamental tradeoff between the aggregate transport cost of a packet and the delay in its delivery. We study this tradeoff in the context of geographical routing in wireless DTNs.We ?rst specify the optimal cost/delay tradeoff, i.e., the tradeoff under optimal network operation, using a dynamic network construction termed the Cost/Delay Evolving Graph (C/DEG) and the Optimal Cost/Delay Curve (OC/DC), a function that gives the minimum possible agg...

Cost Optimization of Product Families using Analytic Cost Models

DEFF Research Database (Denmark)

Brunø, Thomas Ditlev; Nielsen, Peter

2012-01-01

This paper presents a new method for analysing the cost structure of a mass customized product family. The method uses linear regression and backwards selection to reduce the complexity of a data set describing a number of historical product configurations and incurred costs. By reducing the data...... set, the configuration variables which best describe the variation in product costs are identified. The method is tested using data from a Danish manufacturing company and the results indicate that the method is able to identify the most critical configuration variables. The method can be applied...... in product family redesign projects focusing on cost reduction to identify which modules contribute the most to cost variation and should thus be optimized....

CONSTRUCTION COST PREDICTION USING NEURAL NETWORKS

Directory of Open Access Journals (Sweden)

Smita K Magdum

2017-10-01

Full Text Available Construction cost prediction is important for construction firms to compete and grow in the industry. Accurate construction cost prediction in the early stage of project is important for project feasibility studies and successful completion. There are many factors that affect the cost prediction. This paper presents construction cost prediction as multiple regression model with cost of six materials as independent variables. The objective of this paper is to develop neural networks and multilayer perceptron based model for construction cost prediction. Different models of NN and MLP are developed with varying hidden layer size and hidden nodes. Four artificial neural network models and twelve multilayer perceptron models are compared. MLP and NN give better results than statistical regression method. As compared to NN, MLP works better on training dataset but fails on testing dataset. Five activation functions are tested to identify suitable function for the problem. ‘elu' transfer function gives better results than other transfer function.

Optimal Information Processing in Biochemical Networks

Science.gov (United States)

Wiggins, Chris

2012-02-01

A variety of experimental results over the past decades provide examples of near-optimal information processing in biological networks, including in biochemical and transcriptional regulatory networks. Computing information-theoretic quantities requires first choosing or computing the joint probability distribution describing multiple nodes in such a network --- for example, representing the probability distribution of finding an integer copy number of each of two interacting reactants or gene products while respecting the `intrinsic' small copy number noise constraining information transmission at the scale of the cell. I'll given an overview of some recent analytic and numerical work facilitating calculation of such joint distributions and the associated information, which in turn makes possible numerical optimization of information flow in models of noisy regulatory and biochemical networks. Illustrating cases include quantification of form-function relations, ideal design of regulatory cascades, and response to oscillatory driving.

GENETIC ALGORITHM BASED CONCEPT DESIGN TO OPTIMIZE NETWORK LOAD BALANCE

Directory of Open Access Journals (Sweden)

Ashish Jain

2012-07-01

Full Text Available Multiconstraints optimal network load balancing is an NP-hard problem and it is an important part of traffic engineering. In this research we balance the network load using classical method (brute force approach and dynamic programming is used but result shows the limitation of this method but at a certain level we recognized that the optimization of balanced network load with increased number of nodes and demands is intractable using the classical method because the solution set increases exponentially. In such case the optimization techniques like evolutionary techniques can employ for optimizing network load balance. In this paper we analyzed proposed classical algorithm and evolutionary based genetic approach is devise as well as proposed in this paper for optimizing the balance network load.

Single- and Multiple-Objective Optimization with Differential Evolution and Neural Networks

Science.gov (United States)

Rai, Man Mohan

2006-01-01

flexible than other methods in dealing with design in the context of both steady and unsteady flows, partial and complete data sets, combined experimental and numerical data, inclusion of various constraints and rules of thumb, and other issues that characterize the aerodynamic design process. Neural networks provide a natural framework within which a succession of numerical solutions of increasing fidelity, incorporating more realistic flow physics, can be represented and utilized for optimization. Neural networks also offer an excellent framework for multiple-objective and multi-disciplinary design optimization. Simulation tools from various disciplines can be integrated within this framework and rapid trade-off studies involving one or many disciplines can be performed. The prospect of combining neural network based optimization methods and evolutionary algorithms to obtain a hybrid method with the best properties of both methods will be included in this presentation. Achieving solution diversity and accurate convergence to the exact Pareto front in multiple objective optimization usually requires a significant computational effort with evolutionary algorithms. In this lecture we will also explore the possibility of using neural networks to obtain estimates of the Pareto optimal front using non-dominated solutions generated by DE as training data. Neural network estimators have the potential advantage of reducing the number of function evaluations required to obtain solution accuracy and diversity, thus reducing cost to design.

Optimal pinnate leaf-like network/matrix structure for enhanced conductive cooling

International Nuclear Information System (INIS)

Hu, Liguo; Zhou, Han; Zhu, Hanxing; Fan, Tongxiang; Zhang, Di

2015-01-01

Highlights: • We present a pinnate leaf-like network/matrix structure for conductive cooling. • We study the effect of matrix thickness on network conductive cooling performance. • Matrix thickness determines optimal distance between collection channels in network. • We determine the optimal network architecture from a global perspective. • Optimal network greatly reduces the maximum temperature difference in the network. - Abstract: Heat generated in electronic devices has to be effectively removed because excessive temperature strongly impairs their performance and reliability. Embedding a high thermal conductivity network into an electronic device is an effective method to conduct the generated heat to the outside. In this study, inspired by the pinnate leaf, we present a pinnate leaf-like network embedded in the matrix (i.e., electronic device) to cool the matrix by conduction and develop a method to construct the optimal network. In this method, we first investigate the effect of the matrix thickness on the conductive cooling performance of the network, and then optimize the network architecture from a global perspective so that to minimize the maximum temperature difference between the heat sink and the matrix. The results indicate that the matrix thickness determines the optimal distance of the neighboring collection channels in the network, which minimizes the maximum temperature difference between the matrix and the network, and that the optimal network greatly reduces the maximum temperature difference in the network. The results can serve as a design guide for efficient conductive cooling of electronic devices

An Optimization Model for Expired Drug Recycling Logistics Networks and Government Subsidy Policy Design Based on Tri-level Programming.

Science.gov (United States)

Huang, Hui; Li, Yuyu; Huang, Bo; Pi, Xing

2015-07-09

In order to recycle and dispose of all people's expired drugs, the government should design a subsidy policy to stimulate users to return their expired drugs, and drug-stores should take the responsibility of recycling expired drugs, in other words, to be recycling stations. For this purpose it is necessary for the government to select the right recycling stations and treatment stations to optimize the expired drug recycling logistics network and minimize the total costs of recycling and disposal. This paper establishes a tri-level programming model to study how the government can optimize an expired drug recycling logistics network and the appropriate subsidy policies. Furthermore, a Hybrid Genetic Simulated Annealing Algorithm (HGSAA) is proposed to search for the optimal solution of the model. An experiment is discussed to illustrate the good quality of the recycling logistics network and government subsides obtained by the HGSAA. The HGSAA is proven to have the ability to converge on the global optimal solution, and to act as an effective algorithm for solving the optimization problem of expired drug recycling logistics network and government subsidies.

Optimizing Transmission Network Expansion Planning With The Mean Of Chaotic Differential Evolution Algorithm

Directory of Open Access Journals (Sweden)

Ahmed R. Abdelaziz

2015-08-01

Full Text Available This paper presents an application of Chaotic differential evolution optimization approach meta-heuristics in solving transmission network expansion planning TNEP using an AC model associated with reactive power planning RPP. The reliabilityredundancy of network analysis optimization problems implicate selection of components with multiple choices and redundancy levels that produce maximum benefits can be subject to the cost weight and volume constraints is presented in this paper. Classical mathematical methods have failed in handling non-convexities and non-smoothness in optimization problems. As an alternative to the classical optimization approaches the meta-heuristics have attracted lot of attention due to their ability to find an almost global optimal solution in reliabilityredundancy optimization problems. Evolutionary algorithms EAs paradigms of evolutionary computation field are stochastic and robust meta-heuristics useful to solve reliabilityredundancy optimization problems. EAs such as genetic algorithm evolutionary programming evolution strategies and differential evolution are being used to find global or near global optimal solution. The Differential Evolution Algorithm DEA population-based algorithm is an optimal algorithm with powerful global searching capability but it is usually in low convergence speed and presents bad searching capability in the later evolution stage. A new Chaotic Differential Evolution algorithm CDE based on the cat map is recommended which combines DE and chaotic searching algorithm. Simulation results and comparisons show that the chaotic differential evolution algorithm using Cat map is competitive and stable in performance with other optimization approaches and other maps.

A two-phase copula entropy-based multiobjective optimization approach to hydrometeorological gauge network design

Science.gov (United States)

Xu, Pengcheng; Wang, Dong; Singh, Vijay P.; Wang, Yuankun; Wu, Jichun; Wang, Lachun; Zou, Xinqing; Chen, Yuanfang; Chen, Xi; Liu, Jiufu; Zou, Ying; He, Ruimin

2017-12-01

Hydrometeorological data are needed for obtaining point and areal mean, quantifying the spatial variability of hydrometeorological variables, and calibration and verification of hydrometeorological models. Hydrometeorological networks are utilized to collect such data. Since data collection is expensive, it is essential to design an optimal network based on the minimal number of hydrometeorological stations in order to reduce costs. This study proposes a two-phase copula entropy- based multiobjective optimization approach that includes: (1) copula entropy-based directional information transfer (CDIT) for clustering the potential hydrometeorological gauges into several groups, and (2) multiobjective method for selecting the optimal combination of gauges for regionalized groups. Although entropy theory has been employed for network design before, the joint histogram method used for mutual information estimation has several limitations. The copula entropy-based mutual information (MI) estimation method is shown to be more effective for quantifying the uncertainty of redundant information than the joint histogram (JH) method. The effectiveness of this approach is verified by applying to one type of hydrometeorological gauge network, with the use of three model evaluation measures, including Nash-Sutcliffe Coefficient (NSC), arithmetic mean of the negative copula entropy (MNCE), and MNCE/NSC. Results indicate that the two-phase copula entropy-based multiobjective technique is capable of evaluating the performance of regional hydrometeorological networks and can enable decision makers to develop strategies for water resources management.

Site specific optimization of wind turbines energy cost: Iterative approach

International Nuclear Information System (INIS)

Rezaei Mirghaed, Mohammad; Roshandel, Ramin

2013-01-01

Highlights: • Optimization model of wind turbine parameters plus rectangular farm layout is developed. • Results show that levelized cost for single turbine fluctuates between 46.6 and 54.5 $/MW h. • Modeling results for two specific farms reported optimal sizing and farm layout. • Results show that levelized cost of the wind farms fluctuates between 45.8 and 67.2 $/MW h. - Abstract: The present study was aimed at developing a model to optimize the sizing parameters and farm layout of wind turbines according to the wind resource and economic aspects. The proposed model, including aerodynamic, economic and optimization sub-models, is used to achieve minimum levelized cost of electricity. The blade element momentum theory is utilized for aerodynamic modeling of pitch-regulated horizontal axis wind turbines. Also, a comprehensive cost model including capital costs of all turbine components is considered. An iterative approach is used to develop the optimization model. The modeling results are presented for three potential regions in Iran: Khaf, Ahar and Manjil. The optimum configurations and sizing for a single turbine with minimum levelized cost of electricity are presented. The optimal cost of energy for one turbine is calculated about 46.7, 54.5 and 46.6 dollars per MW h in the studied sites, respectively. In addition, optimal size of turbines, annual electricity production, capital cost, and wind farm layout for two different rectangular and square shaped farms in the proposed areas have been recognized. According to the results, optimal system configuration corresponds to minimum levelized cost of electricity about 45.8 to 67.2 dollars per MW h in the studied wind farms

Decreasing-Rate Pruning Optimizes the Construction of Efficient and Robust Distributed Networks.

Directory of Open Access Journals (Sweden)

Saket Navlakha

2015-07-01

Full Text Available Robust, efficient, and low-cost networks are advantageous in both biological and engineered systems. During neural network development in the brain, synapses are massively over-produced and then pruned-back over time. This strategy is not commonly used when designing engineered networks, since adding connections that will soon be removed is considered wasteful. Here, we show that for large distributed routing networks, network function is markedly enhanced by hyper-connectivity followed by aggressive pruning and that the global rate of pruning, a developmental parameter not previously studied by experimentalists, plays a critical role in optimizing network structure. We first used high-throughput image analysis techniques to quantify the rate of pruning in the mammalian neocortex across a broad developmental time window and found that the rate is decreasing over time. Based on these results, we analyzed a model of computational routing networks and show using both theoretical analysis and simulations that decreasing rates lead to more robust and efficient networks compared to other rates. We also present an application of this strategy to improve the distributed design of airline networks. Thus, inspiration from neural network formation suggests effective ways to design distributed networks across several domains.

A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization.

Science.gov (United States)

Liu, Qingshan; Guo, Zhishan; Wang, Jun

2012-02-01

In this paper, a one-layer recurrent neural network is proposed for solving pseudoconvex optimization problems subject to linear equality and bound constraints. Compared with the existing neural networks for optimization (e.g., the projection neural networks), the proposed neural network is capable of solving more general pseudoconvex optimization problems with equality and bound constraints. Moreover, it is capable of solving constrained fractional programming problems as a special case. The convergence of the state variables of the proposed neural network to achieve solution optimality is guaranteed as long as the designed parameters in the model are larger than the derived lower bounds. Numerical examples with simulation results illustrate the effectiveness and characteristics of the proposed neural network. In addition, an application for dynamic portfolio optimization is discussed. Copyright © 2011 Elsevier Ltd. All rights reserved.

Transaction costs and social networks in productivity measurement

DEFF Research Database (Denmark)

Henningsen, Geraldine; Henningsen, Arne; Henning, Christian H. C. A.

2015-01-01

and support. Hence, we use measures of a firm’s access to social networks as a proxy for the transaction costs the firm faces. We develop a microeconomic production model that takes into account transaction costs and networks. Using a data set of 384 Polish farms, we empirically estimate this model......We argue that in the presence of transaction costs, observed productivity measures may in many cases understate the true productivity, as production data seldom distinguish between resources entering the production process and resources of a similar type that are sacrificed for transaction costs....... Hence, both the absolute productivity measures and, more importantly, the productivity ranking will be distorted. A major driver of transaction costs is poor access to information and contract enforcement assistance. Social networks often catalyse information exchange as well as generate trust...

Optimal knockout strategies in genome-scale metabolic networks using particle swarm optimization.

Science.gov (United States)

Nair, Govind; Jungreuthmayer, Christian; Zanghellini, Jürgen

2017-02-01

Knockout strategies, particularly the concept of constrained minimal cut sets (cMCSs), are an important part of the arsenal of tools used in manipulating metabolic networks. Given a specific design, cMCSs can be calculated even in genome-scale networks. We would however like to find not only the optimal intervention strategy for a given design but the best possible design too. Our solution (PSOMCS) is to use particle swarm optimization (PSO) along with the direct calculation of cMCSs from the stoichiometric matrix to obtain optimal designs satisfying multiple objectives. To illustrate the working of PSOMCS, we apply it to a toy network. Next we show its superiority by comparing its performance against other comparable methods on a medium sized E. coli core metabolic network. PSOMCS not only finds solutions comparable to previously published results but also it is orders of magnitude faster. Finally, we use PSOMCS to predict knockouts satisfying multiple objectives in a genome-scale metabolic model of E. coli and compare it with OptKnock and RobustKnock. PSOMCS finds competitive knockout strategies and designs compared to other current methods and is in some cases significantly faster. It can be used in identifying knockouts which will force optimal desired behaviors in large and genome scale metabolic networks. It will be even more useful as larger metabolic models of industrially relevant organisms become available.

Modeling and optimization of cloud-ready and content-oriented networks

CERN Document Server

Walkowiak, Krzysztof

2016-01-01

This book focuses on modeling and optimization of cloud-ready and content-oriented networks in the context of different layers and accounts for specific constraints following from protocols and technologies used in a particular layer. It addresses a wide range of additional constraints important in contemporary networks, including various types of network flows, survivability issues, multi-layer networking, and resource location. The book presents recent existing and new results in a comprehensive and cohesive way. The contents of the book are organized in five chapters, which are mostly self-contained. Chapter 1 briefly presents information on cloud computing and content-oriented services, and introduces basic notions and concepts of network modeling and optimization. Chapter 2 covers various optimization problems that arise in the context of connection-oriented networks. Chapter 3 focuses on modeling and optimization of Elastic Optical Networks. Chapter 4 is devoted to overlay networks. The book concludes w...

Combinatorial optimization networks and matroids

CERN Document Server

Lawler, Eugene

2011-01-01

Perceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. A suitable text or reference for courses in combinatorial computing and concrete computational complexity in departments of computer science and mathematics.

Cost Overrun Optimism: Fact or Fiction

Science.gov (United States)

2016-02-29

Base, OH. Homgren, C. T. (1990). In G. Foster (Ed.), Cost accounting : A managerial emphasis (7th ed.). Englewood Cliffs, NJ: Prentice Hall. Morrison... Accounting Office. Gansler, J. S. (1989). Affording defense. Cambridge, MA: The MIT Press. Heise, S. R. (1991). A review of cost performance index...Image designed by Diane Fleischer Cost Overrun Optimism: FACT or FICTION? Maj David D. Christensen, USAF Program managers are advocates by

Estimation of optimal educational cost per medical student.

Science.gov (United States)

Yang, Eunbae B; Lee, Seunghee

2009-09-01

This study aims to estimate the optimal educational cost per medical student. A private medical college in Seoul was targeted by the study, and its 2006 learning environment and data from the 2003~2006 budget and settlement were carefully analyzed. Through interviews with 3 medical professors and 2 experts in the economics of education, the study attempted to establish the educational cost estimation model, which yields an empirically computed estimate of the optimal cost per student in medical college. The estimation model was based primarily upon the educational cost which consisted of direct educational costs (47.25%), support costs (36.44%), fixed asset purchases (11.18%) and costs for student affairs (5.14%). These results indicate that the optimal cost per student is approximately 20,367,000 won each semester; thus, training a doctor costs 162,936,000 won over 4 years. Consequently, we inferred that the tuition levels of a local medical college or professional medical graduate school cover one quarter or one-half of the per- student cost. The findings of this study do not necessarily imply an increase in medical college tuition; the estimation of the per-student cost for training to be a doctor is one matter, and the issue of who should bear this burden is another. For further study, we should consider the college type and its location for general application of the estimation method, in addition to living expenses and opportunity costs.

Network models for solving the problem of multicriterial adaptive optimization of investment projects control with several acceptable technologies

Science.gov (United States)

Shorikov, A. F.; Butsenko, E. V.

2017-10-01

This paper discusses the problem of multicriterial adaptive optimization the control of investment projects in the presence of several technologies. On the basis of network modeling proposed a new economic and mathematical model and a method for solving the problem of multicriterial adaptive optimization the control of investment projects in the presence of several technologies. Network economic and mathematical modeling allows you to determine the optimal time and calendar schedule for the implementation of the investment project and serves as an instrument to increase the economic potential and competitiveness of the enterprise. On a meaningful practical example, the processes of forming network models are shown, including the definition of the sequence of actions of a particular investment projecting process, the network-based work schedules are constructed. The calculation of the parameters of network models is carried out. Optimal (critical) paths have been formed and the optimal time for implementing the chosen technologies of the investment project has been calculated. It also shows the selection of the optimal technology from a set of possible technologies for project implementation, taking into account the time and cost of the work. The proposed model and method for solving the problem of managing investment projects can serve as a basis for the development, creation and application of appropriate computer information systems to support the adoption of managerial decisions by business people.

Neural Network for Optimization of Existing Control Systems

DEFF Research Database (Denmark)

Madsen, Per Printz

1995-01-01

The purpose of this paper is to develop methods to use Neural Network based Controllers (NNC) as an optimization tool for existing control systems.......The purpose of this paper is to develop methods to use Neural Network based Controllers (NNC) as an optimization tool for existing control systems....

Optimization of China Crude Oil Transportation Network with Genetic Ant Colony Algorithm

Directory of Open Access Journals (Sweden)

Yao Wang

2015-08-01

Full Text Available Taking into consideration both shipping and pipeline transport, this paper first analysed the risk factors for different modes of crude oil import transportation. Then, based on the minimum of both transportation cost and overall risk, a multi-objective programming model was established to optimize the transportation network of crude oil import, and the genetic algorithm and ant colony algorithm were employed to solve the problem. The optimized result shows that VLCC (Very Large Crude Carrier is superior in long distance sea transportation, whereas pipeline transport is more secure than sea transport. Finally, this paper provides related safeguard suggestions on crude oil import transportation.

Cascade-robustness optimization of coupling preference in interconnected networks

International Nuclear Information System (INIS)

Zhang, Xue-Jun; Xu, Guo-Qiang; Zhu, Yan-Bo; Xia, Yong-Xiang

2016-01-01

Highlights: • A specific memetic algorithm was proposed to optimize coupling links. • A small toy model was investigated to examine the underlying mechanism. • The MA optimized strategy exhibits a moderate assortative pattern. • A novel coupling coefficient index was proposed to quantify coupling preference. - Abstract: Recently, the robustness of interconnected networks has attracted extensive attentions, one of which is to investigate the influence of coupling preference. In this paper, the memetic algorithm (MA) is employed to optimize the coupling links of interconnected networks. Afterwards, a comparison is made between MA optimized coupling strategy and traditional assortative, disassortative and random coupling preferences. It is found that the MA optimized coupling strategy with a moderate assortative value shows an outstanding performance against cascading failures on both synthetic scale-free interconnected networks and real-world networks. We then provide an explanation for this phenomenon from a micro-scope point of view and propose a coupling coefficient index to quantify the coupling preference. Our work is helpful for the design of robust interconnected networks.

Efficient Solutions and Cost-Optimal Analysis for Existing School Buildings

Directory of Open Access Journals (Sweden)

Paolo Maria Congedo

2016-10-01

Full Text Available The recast of the energy performance of buildings directive (EPBD describes a comparative methodological framework to promote energy efficiency and establish minimum energy performance requirements in buildings at the lowest costs. The aim of the cost-optimal methodology is to foster the achievement of nearly zero energy buildings (nZEBs, the new target for all new buildings by 2020, characterized by a high performance with a low energy requirement almost covered by renewable sources. The paper presents the results of the application of the cost-optimal methodology in two existing buildings located in the Mediterranean area. These buildings are a kindergarten and a nursery school that differ in construction period, materials and systems. Several combinations of measures have been applied to derive cost-effective efficient solutions for retrofitting. The cost-optimal level has been identified for each building and the best performing solutions have been selected considering both a financial and a macroeconomic analysis. The results illustrate the suitability of the methodology to assess cost-optimality and energy efficiency in school building refurbishment. The research shows the variants providing the most cost-effective balance between costs and energy saving. The cost-optimal solution reduces primary energy consumption by 85% and gas emissions by 82%–83% in each reference building.

Optimal neural networks for protein-structure prediction

International Nuclear Information System (INIS)

Head-Gordon, T.; Stillinger, F.H.

1993-01-01

The successful application of neural-network algorithms for prediction of protein structure is stymied by three problem areas: the sparsity of the database of known protein structures, poorly devised network architectures which make the input-output mapping opaque, and a global optimization problem in the multiple-minima space of the network variables. We present a simplified polypeptide model residing in two dimensions with only two amino-acid types, A and B, which allows the determination of the global energy structure for all possible sequences of pentamer, hexamer, and heptamer lengths. This model simplicity allows us to compile a complete structural database and to devise neural networks that reproduce the tertiary structure of all sequences with absolute accuracy and with the smallest number of network variables. These optimal networks reveal that the three problem areas are convoluted, but that thoughtful network designs can actually deconvolute these detrimental traits to provide network algorithms that genuinely impact on the ability of the network to generalize or learn the desired mappings. Furthermore, the two-dimensional polypeptide model shows sufficient chemical complexity so that transfer of neural-network technology to more realistic three-dimensional proteins is evident

Optimization of water network in petroleum refinery; Otimizacao de redes de agua em refinarias de petroleo

Energy Technology Data Exchange (ETDEWEB)

Faria, Debora C.; Souza, Selene M.A. Guelli Ulson de; Souza, Antonio A. Ulson de [Universidade Federal de Santa Catarina (UFSC), Florianopolis, SC (Brazil)

2004-07-01

The petroleum refineries have shown high water's consuming that creates high costs and damages the hydric resources. However, the industrial sector, especially the petroleum industry, has been looking for alternatives that minimizing the impact caused by to use these natural resources. Currently, methodologies of controlling the pollution on the source have been appearing how a strong tendency and the reuse and/or recycle of wastewater can be emphasized. The optimization by mathematical programming, together with engineering know-how, is one of the great tendency in process integration technology developed. The present work presents one optimization mathematical model that objectifies to reduce the water's consuming and/or operational costs. The model is based in chemical species and mass conservation equation. This work presents the solution of one case found in literature that broach one petroleum refinery's network of water. This network is composed of six operations and three regenerative processes, and there are four keys contaminants. The water's consuming was minimized first and next the minimum cost in the minimum consume was broached. The results found were enough satisfactory and presented reductions up to 76% in the water consume and approximately 65% in the operational costs. (author)

Optimizing Biomass Feedstock Logistics for Forest Residue Processing and Transportation on a Tree-Shaped Road Network

Directory of Open Access Journals (Sweden)

Hee Han

2018-03-01

Full Text Available An important task in forest residue recovery operations is to select the most cost-efficient feedstock logistics system for a given distribution of residue piles, road access, and available machinery. Notable considerations include inaccessibility of treatment units to large chip vans and frequent, long-distance mobilization of forestry equipment required to process dispersed residues. In this study, we present optimized biomass feedstock logistics on a tree-shaped road network that take into account the following options: (1 grinding residues at the site of treatment and forwarding ground residues either directly to bioenergy facility or to a concentration yard where they are transshipped to large chip vans, (2 forwarding residues to a concentration yard where they are stored and ground directly into chip vans, and (3 forwarding residues to a nearby grinder location and forwarding the ground materials. A mixed-integer programming model coupled with a network algorithm was developed to solve the problem. The model was applied to recovery operations on a study site in Colorado, USA, and the optimal solution reduced the cost of logistics up to 11% compared to the conventional system. This is an important result because this cost reduction propagates downstream through the biomass supply chain, reducing production costs for bioenergy and bioproducts.

Cost- and reliability-oriented aggregation point association in long-term evolution and passive optical network hybrid access infrastructure for smart grid neighborhood area network

Science.gov (United States)

Cheng, Xiao; Feng, Lei; Zhou, Fanqin; Wei, Lei; Yu, Peng; Li, Wenjing

2018-02-01

With the rapid development of the smart grid, the data aggregation point (AP) in the neighborhood area network (NAN) is becoming increasingly important for forwarding the information between the home area network and wide area network. Due to limited budget, it is unable to use one-single access technology to meet the ongoing requirements on AP coverage. This paper first introduces the wired and wireless hybrid access network with the integration of long-term evolution (LTE) and passive optical network (PON) system for NAN, which allows a good trade-off among cost, flexibility, and reliability. Then, based on the already existing wireless LTE network, an AP association optimization model is proposed to make the PON serve as many APs as possible, considering both the economic efficiency and network reliability. Moreover, since the features of the constraints and variables of this NP-hard problem, a hybrid intelligent optimization algorithm is proposed, which is achieved by the mixture of the genetic, ant colony and dynamic greedy algorithm. By comparing with other published methods, simulation results verify the performance of the proposed method in improving the AP coverage and the performance of the proposed algorithm in terms of convergence.

Cost-optimal power system extension under flow-based market coupling and high shares of photovoltaics

Energy Technology Data Exchange (ETDEWEB)

Hagspiel, Simeon; Jaegemann, Cosima; Lindenberger, Dietmar [Koeln Univ. (Germany). Inst. of Energy Economics; Cherevatskiy, Stanislav; Troester, Eckehard; Brown, Tom [Energynautics GmbH, Langen (Germany)

2012-07-01

Electricity market models, implemented as dynamic programming problems, have been applied widely to identify possible pathways towards a cost-optimal and low carbon electricity system. However, the joint optimization of generation and transmission remains challenging, mainly due to the fact that different characteristics and rules apply to commercial and physical exchanges of electricity in meshed networks. This paper presents a methodology that allows to optimize power generation and transmission infrastructures jointly through an iterative approach based on power transfer distribution factors (PTDFs). As PTDFs are linear representations of the physical load flow equations, they can be implemented in a linear programming environment suitable for large scale problems such as the European power system. The algorithm iteratively updates PTDFs when grid infrastructures are modified due to cost-optimal extension and thus yields an optimal solution with a consistent representation of physical load flows. The method is demonstrated on a simplified three-node model where it is found to be stable and convergent. It is then scaled to the European level in order to find the optimal power system infrastructure development under the prescription of strongly decreasing CO{sub 2} emissions in Europe until 2050 with a specific focus on photovoltaic (PV) power. (orig.)

Projected reduction in healthcare costs in Belgium after optimization of iodine intake: impact on costs related to thyroid nodular disease.

Science.gov (United States)

Vandevijvere, Stefanie; Annemans, Lieven; Van Oyen, Herman; Tafforeau, Jean; Moreno-Reyes, Rodrigo

2010-11-01

Several surveys in the last 50 years have repeatedly indicated that Belgium is affected by mild iodine deficiency. Within the framework of the national food and health plan in Belgium, a selective, progressive, and monitored strategy was proposed in 2009 to optimize iodine intake. The objective of the present study was to perform a health economic evaluation of the consequences of inadequate iodine intake in Belgium, focusing on undisputed and measurable health outcomes such as thyroid nodular disease and its associated morbidity (hyperthyroidism). For the estimation of direct, indirect, medical, and nonmedical costs related to thyroid nodular diseases in Belgium, data from the Federal Public Service of Public Health, Food Chain Safety and Environment, the National Institute for Disease and Disability Insurance (RIZIV/INAMI), the Information Network about the prescription of reimbursable medicines (FARMANET), Intercontinental Marketing Services, and expert opinions were used. These costs translate into savings after implementation of the iodization program and are defined as costs due to thyroid nodular disease throughout the article. Costs related to the iodization program are referred to as program costs. Only figures dating from before the start of the intervention were exploited. Only adult and elderly people (≥18 years) were taken into account in this study because thyroid nodular diseases predominantly affect this age group. The yearly costs due to thyroid nodular diseases caused by mild iodine deficiency in the Belgian adult population are ∼€38 million. It is expected that the iodization program will result in additional costs of ∼€54,000 per year and decrease the prevalence of thyroid nodular diseases by 38% after a 4-5-year period. The net savings after establishment of the program are therefore estimated to be at least €14 million a year. Optimization of iodine intake in Belgium should be quite cost effective, if only considering its impact on

LinkMind: link optimization in swarming mobile sensor networks.

Science.gov (United States)

Ngo, Trung Dung

2011-01-01

A swarming mobile sensor network is comprised of a swarm of wirelessly connected mobile robots equipped with various sensors. Such a network can be applied in an uncertain environment for services such as cooperative navigation and exploration, object identification and information gathering. One of the most advantageous properties of the swarming wireless sensor network is that mobile nodes can work cooperatively to organize an ad-hoc network and optimize the network link capacity to maximize the transmission of gathered data from a source to a target. This paper describes a new method of link optimization of swarming mobile sensor networks. The new method is based on combination of the artificial potential force guaranteeing connectivities of the mobile sensor nodes and the max-flow min-cut theorem of graph theory ensuring optimization of the network link capacity. The developed algorithm is demonstrated and evaluated in simulation.

LinkMind: Link Optimization in Swarming Mobile Sensor Networks

Directory of Open Access Journals (Sweden)

Trung Dung Ngo

2011-08-01

Full Text Available A swarming mobile sensor network is comprised of a swarm of wirelessly connected mobile robots equipped with various sensors. Such a network can be applied in an uncertain environment for services such as cooperative navigation and exploration, object identification and information gathering. One of the most advantageous properties of the swarming wireless sensor network is that mobile nodes can work cooperatively to organize an ad-hoc network and optimize the network link capacity to maximize the transmission of gathered data from a source to a target. This paper describes a new method of link optimization of swarming mobile sensor networks. The new method is based on combination of the artificial potential force guaranteeing connectivities of the mobile sensor nodes and the max-flow min-cut theorem of graph theory ensuring optimization of the network link capacity. The developed algorithm is demonstrated and evaluated in simulation.

Social Network Community Detection for DMA Creation: Criteria Analysis through Multilevel Optimization

Directory of Open Access Journals (Sweden)

Bruno M. Brentan

2017-01-01

Full Text Available Management of large water distribution systems can be improved by dividing their networks into so-called district metered areas (DMAs. However, such divisions must be based on appropriated technical criteria. Considering the importance of deeply understanding the relationship between DMA creation and these criteria, this work proposes a performance analysis of DMA generation that takes into account such indicators as resilience index, demand similarity, pressure uniformity, water age (and thus water quality, solution implantation costs, and electrical consumption. To cope with the complexity of the problem, suitable mathematical techniques are proposed in this paper. We use a social community detection technique to define the sectors, and then a multilevel particle swarm optimization approach is applied to find the optimal placement and operating point of the necessary devices. The results obtained by implementing the methodology in a real water supply network show its validity and the meaningful influence on the final result of, especially, elevation and pipe length.

Prediction of energy demands using neural network with model identification by global optimization

Energy Technology Data Exchange (ETDEWEB)

Yokoyama, Ryohei; Wakui, Tetsuya; Satake, Ryoichi [Department of Mechanical Engineering, Osaka Prefecture University, 1-1 Gakuen-cho, Naka-ku, Sakai, Osaka 599-8531 (Japan)

2009-02-15

To operate energy supply plants properly from the viewpoints of stable energy supply, and energy and cost savings, it is important to predict energy demands accurately as basic conditions. Several methods of predicting energy demands have been proposed, and one of them is to use neural networks. Although local optimization methods such as gradient ones have conventionally been adopted in the back propagation procedure to identify the values of model parameters, they have the significant drawback that they can derive only local optimal solutions. In this paper, a global optimization method called ''Modal Trimming Method'' proposed for non-linear programming problems is adopted to identify the values of model parameters. In addition, the trend and periodic change are first removed from time series data on energy demand, and the converted data is used as the main input to a neural network. Furthermore, predicted values of air temperature and relative humidity are considered as additional inputs to the neural network, and their effect on the prediction of energy demand is investigated. This approach is applied to the prediction of the cooling demand in a building used for a bench mark test of a variety of prediction methods, and its validity and effectiveness are clarified. (author)

Minimizing communication cost among distributed controllers in software defined networks

Science.gov (United States)

Arlimatti, Shivaleela; Elbreiki, Walid; Hassan, Suhaidi; Habbal, Adib; Elshaikh, Mohamed

2016-08-01

Software Defined Networking (SDN) is a new paradigm to increase the flexibility of today's network by promising for a programmable network. The fundamental idea behind this new architecture is to simplify network complexity by decoupling control plane and data plane of the network devices, and by making the control plane centralized. Recently controllers have distributed to solve the problem of single point of failure, and to increase scalability and flexibility during workload distribution. Even though, controllers are flexible and scalable to accommodate more number of network switches, yet the problem of intercommunication cost between distributed controllers is still challenging issue in the Software Defined Network environment. This paper, aims to fill the gap by proposing a new mechanism, which minimizes intercommunication cost with graph partitioning algorithm, an NP hard problem. The methodology proposed in this paper is, swapping of network elements between controller domains to minimize communication cost by calculating communication gain. The swapping of elements minimizes inter and intra communication cost among network domains. We validate our work with the OMNeT++ simulation environment tool. Simulation results show that the proposed mechanism minimizes the inter domain communication cost among controllers compared to traditional distributed controllers.

The ASAC Flight Segment and Network Cost Models

Science.gov (United States)

Kaplan, Bruce J.; Lee, David A.; Retina, Nusrat; Wingrove, Earl R., III; Malone, Brett; Hall, Stephen G.; Houser, Scott A.

1997-01-01

To assist NASA in identifying research art, with the greatest potential for improving the air transportation system, two models were developed as part of its Aviation System Analysis Capability (ASAC). The ASAC Flight Segment Cost Model (FSCM) is used to predict aircraft trajectories, resource consumption, and variable operating costs for one or more flight segments. The Network Cost Model can either summarize the costs for a network of flight segments processed by the FSCM or can be used to independently estimate the variable operating costs of flying a fleet of equipment given the number of departures and average flight stage lengths.

A one-layer recurrent neural network for constrained nonsmooth optimization.

Science.gov (United States)

Liu, Qingshan; Wang, Jun

2011-10-01

This paper presents a novel one-layer recurrent neural network modeled by means of a differential inclusion for solving nonsmooth optimization problems, in which the number of neurons in the proposed neural network is the same as the number of decision variables of optimization problems. Compared with existing neural networks for nonsmooth optimization problems, the global convexity condition on the objective functions and constraints is relaxed, which allows the objective functions and constraints to be nonconvex. It is proven that the state variables of the proposed neural network are convergent to optimal solutions if a single design parameter in the model is larger than a derived lower bound. Numerical examples with simulation results substantiate the effectiveness and illustrate the characteristics of the proposed neural network.

Brain network analysis: separating cost from topology using cost-integration.

Directory of Open Access Journals (Sweden)

Cedric E Ginestet

Full Text Available A statistically principled way of conducting brain network analysis is still lacking. Comparison of different populations of brain networks is hard because topology is inherently dependent on wiring cost, where cost is defined as the number of edges in an unweighted graph. In this paper, we evaluate the benefits and limitations associated with using cost-integrated topological metrics. Our focus is on comparing populations of weighted undirected graphs that differ in mean association weight, using global efficiency. Our key result shows that integrating over cost is equivalent to controlling for any monotonic transformation of the weight set of a weighted graph. That is, when integrating over cost, we eliminate the differences in topology that may be due to a monotonic transformation of the weight set. Our result holds for any unweighted topological measure, and for any choice of distribution over cost levels. Cost-integration is therefore helpful in disentangling differences in cost from differences in topology. By contrast, we show that the use of the weighted version of a topological metric is generally not a valid approach to this problem. Indeed, we prove that, under weak conditions, the use of the weighted version of global efficiency is equivalent to simply comparing weighted costs. Thus, we recommend the reporting of (i differences in weighted costs and (ii differences in cost-integrated topological measures with respect to different distributions over the cost domain. We demonstrate the application of these techniques in a re-analysis of an fMRI working memory task. We also provide a Monte Carlo method for approximating cost-integrated topological measures. Finally, we discuss the limitations of integrating topology over cost, which may pose problems when some weights are zero, when multiplicities exist in the ranks of the weights, and when one expects subtle cost-dependent topological differences, which could be masked by cost-integration.

Brain Network Analysis: Separating Cost from Topology Using Cost-Integration

Science.gov (United States)

Ginestet, Cedric E.; Nichols, Thomas E.; Bullmore, Ed T.; Simmons, Andrew

2011-01-01

A statistically principled way of conducting brain network analysis is still lacking. Comparison of different populations of brain networks is hard because topology is inherently dependent on wiring cost, where cost is defined as the number of edges in an unweighted graph. In this paper, we evaluate the benefits and limitations associated with using cost-integrated topological metrics. Our focus is on comparing populations of weighted undirected graphs that differ in mean association weight, using global efficiency. Our key result shows that integrating over cost is equivalent to controlling for any monotonic transformation of the weight set of a weighted graph. That is, when integrating over cost, we eliminate the differences in topology that may be due to a monotonic transformation of the weight set. Our result holds for any unweighted topological measure, and for any choice of distribution over cost levels. Cost-integration is therefore helpful in disentangling differences in cost from differences in topology. By contrast, we show that the use of the weighted version of a topological metric is generally not a valid approach to this problem. Indeed, we prove that, under weak conditions, the use of the weighted version of global efficiency is equivalent to simply comparing weighted costs. Thus, we recommend the reporting of (i) differences in weighted costs and (ii) differences in cost-integrated topological measures with respect to different distributions over the cost domain. We demonstrate the application of these techniques in a re-analysis of an fMRI working memory task. We also provide a Monte Carlo method for approximating cost-integrated topological measures. Finally, we discuss the limitations of integrating topology over cost, which may pose problems when some weights are zero, when multiplicities exist in the ranks of the weights, and when one expects subtle cost-dependent topological differences, which could be masked by cost-integration. PMID:21829437

Optimizing Teleportation Cost in Distributed Quantum Circuits

Science.gov (United States)

Zomorodi-Moghadam, Mariam; Houshmand, Mahboobeh; Houshmand, Monireh

2018-03-01

The presented work provides a procedure for optimizing the communication cost of a distributed quantum circuit (DQC) in terms of the number of qubit teleportations. Because of technology limitations which do not allow large quantum computers to work as a single processing element, distributed quantum computation is an appropriate solution to overcome this difficulty. Previous studies have applied ad-hoc solutions to distribute a quantum system for special cases and applications. In this study, a general approach is proposed to optimize the number of teleportations for a DQC consisting of two spatially separated and long-distance quantum subsystems. To this end, different configurations of locations for executing gates whose qubits are in distinct subsystems are considered and for each of these configurations, the proposed algorithm is run to find the minimum number of required teleportations. Finally, the configuration which leads to the minimum number of teleportations is reported. The proposed method can be used as an automated procedure to find the configuration with the optimal communication cost for the DQC. This cost can be used as a basic measure of the communication cost for future works in the distributed quantum circuits.

Parallel multi-join query optimization algorithm for distributed sensor network in the internet of things

Science.gov (United States)

Zheng, Yan

2015-03-01

Internet of things (IoT), focusing on providing users with information exchange and intelligent control, attracts a lot of attention of researchers from all over the world since the beginning of this century. IoT is consisted of large scale of sensor nodes and data processing units, and the most important features of IoT can be illustrated as energy confinement, efficient communication and high redundancy. With the sensor nodes increment, the communication efficiency and the available communication band width become bottle necks. Many research work is based on the instance which the number of joins is less. However, it is not proper to the increasing multi-join query in whole internet of things. To improve the communication efficiency between parallel units in the distributed sensor network, this paper proposed parallel query optimization algorithm based on distribution attributes cost graph. The storage information relations and the network communication cost are considered in this algorithm, and an optimized information changing rule is established. The experimental result shows that the algorithm has good performance, and it would effectively use the resource of each node in the distributed sensor network. Therefore, executive efficiency of multi-join query between different nodes could be improved.

Bio-Mimic Optimization Strategies in Wireless Sensor Networks: A Survey

Science.gov (United States)

Adnan, Md. Akhtaruzzaman; Razzaque, Mohammd Abdur; Ahmed, Ishtiaque; Isnin, Ismail Fauzi

2014-01-01

For the past 20 years, many authors have focused their investigations on wireless sensor networks. Various issues related to wireless sensor networks such as energy minimization (optimization), compression schemes, self-organizing network algorithms, routing protocols, quality of service management, security, energy harvesting, etc., have been extensively explored. The three most important issues among these are energy efficiency, quality of service and security management. To get the best possible results in one or more of these issues in wireless sensor networks optimization is necessary. Furthermore, in number of applications (e.g., body area sensor networks, vehicular ad hoc networks) these issues might conflict and require a trade-off amongst them. Due to the high energy consumption and data processing requirements, the use of classical algorithms has historically been disregarded. In this context contemporary researchers started using bio-mimetic strategy-based optimization techniques in the field of wireless sensor networks. These techniques are diverse and involve many different optimization algorithms. As far as we know, most existing works tend to focus only on optimization of one specific issue of the three mentioned above. It is high time that these individual efforts are put into perspective and a more holistic view is taken. In this paper we take a step in that direction by presenting a survey of the literature in the area of wireless sensor network optimization concentrating especially on the three most widely used bio-mimetic algorithms, namely, particle swarm optimization, ant colony optimization and genetic algorithm. In addition, to stimulate new research and development interests in this field, open research issues, challenges and future research directions are highlighted. PMID:24368702

Bio-mimic optimization strategies in wireless sensor networks: a survey.

Science.gov (United States)

Adnan, Md Akhtaruzzaman; Abdur Razzaque, Mohammd; Ahmed, Ishtiaque; Isnin, Ismail Fauzi

2013-12-24

For the past 20 years, many authors have focused their investigations on wireless sensor networks. Various issues related to wireless sensor networks such as energy minimization (optimization), compression schemes, self-organizing network algorithms, routing protocols, quality of service management, security, energy harvesting, etc., have been extensively explored. The three most important issues among these are energy efficiency, quality of service and security management. To get the best possible results in one or more of these issues in wireless sensor networks optimization is necessary. Furthermore, in number of applications (e.g., body area sensor networks, vehicular ad hoc networks) these issues might conflict and require a trade-off amongst them. Due to the high energy consumption and data processing requirements, the use of classical algorithms has historically been disregarded. In this context contemporary researchers started using bio-mimetic strategy-based optimization techniques in the field of wireless sensor networks. These techniques are diverse and involve many different optimization algorithms. As far as we know, most existing works tend to focus only on optimization of one specific issue of the three mentioned above. It is high time that these individual efforts are put into perspective and a more holistic view is taken. In this paper we take a step in that direction by presenting a survey of the literature in the area of wireless sensor network optimization concentrating especially on the three most widely used bio-mimetic algorithms, namely, particle swarm optimization, ant colony optimization and genetic algorithm. In addition, to stimulate new research and development interests in this field, open research issues, challenges and future research directions are highlighted.

Optimization of business processes of a distribution network operator. Evaluation and control; Optimierung der Geschaeftsprozesse von Verteilungsnetzbetreibern. Bewerten und steuern

Energy Technology Data Exchange (ETDEWEB)

Schmidt, Philipp; Katzfey, Joerg [E-Bridge Consulting GmbH, Bonn (Germany)

2012-09-10

The assessment of business processes of a distribution network operator is often more cost-oriented. In order to optimize the own processes reasonably a holistic process management has to be used in order to measure the costs incurred, the quality of implementation and the quality of the fulfillment of the planning.

A new multi objective optimization model for designing a green supply chain network under uncertainty

Directory of Open Access Journals (Sweden)

Mohammad Mahdi Saffar

2015-01-01

Full Text Available Recently, researchers have focused on how to minimize the negative effects of industrial activities on environment. Consequently, they work on mathematical models, which minimize the environmental issues as well as optimizing the costs. In the field of supply chain network design, most managers consider economic and environmental issues, simultaneously. This paper introduces a bi-objective supply chain network design, which uses fuzzy programming to obtain the capability of resisting uncertain conditions. The design considers production, recovery, and distribution centers. The advantage of using this model includes the optimal facilities, locating them and assigning the optimal facilities to them. It also chooses the type and the number of technologies, which must be bought. The fuzzy programming converts the multi objective model to an auxiliary crisp model by Jimenez approach and solves it with ε-constraint. For solving large size problems, the Multi Objective Differential Evolutionary algorithm (MODE is applied.

Optimization behavior of brainstem respiratory neurons. A cerebral neural network model.

Science.gov (United States)

Poon, C S

1991-01-01

A recent model of respiratory control suggested that the steady-state respiratory responses to CO2 and exercise may be governed by an optimal control law in the brainstem respiratory neurons. It was not certain, however, whether such complex optimization behavior could be accomplished by a realistic biological neural network. To test this hypothesis, we developed a hybrid computer-neural model in which the dynamics of the lung, brain and other tissue compartments were simulated on a digital computer. Mimicking the "controller" was a human subject who pedalled on a bicycle with varying speed (analog of ventilatory output) with a view to minimize an analog signal of the total cost of breathing (chemical and mechanical) which was computed interactively and displayed on an oscilloscope. In this manner, the visuomotor cortex served as a proxy (homolog) of the brainstem respiratory neurons in the model. Results in 4 subjects showed a linear steady-state ventilatory CO2 response to arterial PCO2 during simulated CO2 inhalation and a nearly isocapnic steady-state response during simulated exercise. Thus, neural optimization is a plausible mechanism for respiratory control during exercise and can be achieved by a neural network with cognitive computational ability without the need for an exercise stimulus.

Optimal information dissemination strategy to promote preventive behaviors in multilayer epidemic networks.

Science.gov (United States)

Shakeri, Heman; Sahneh, Faryad Darabi; Scoglio, Caterina; Poggi-Corradini, Pietro; Preciado, Victor M

2015-06-01

Launching a prevention campaign to contain the spread of infection requires substantial financial investments; therefore, a trade-off exists between suppressing the epidemic and containing costs. Information exchange among individuals can occur as physical contacts (e.g., word of mouth, gatherings), which provide inherent possibilities of disease transmission, and non-physical contacts (e.g., email, social networks), through which information can be transmitted but the infection cannot be transmitted. Contact network (CN) incorporates physical contacts, and the information dissemination network (IDN) represents non-physical contacts, thereby generating a multilayer network structure. Inherent differences between these two layers cause alerting through CN to be more effective but more expensive than IDN. The constraint for an epidemic to die out derived from a nonlinear Perron-Frobenius problem that was transformed into a semi-definite matrix inequality and served as a constraint for a convex optimization problem. This method guarantees a dying-out epidemic by choosing the best nodes for adopting preventive behaviors with minimum monetary resources. Various numerical simulations with network models and a real-world social network validate our method.

Optimal sensor placement for leakage detection and isolation in water distribution networks

OpenAIRE

Rosich Oliva, Albert; Sarrate Estruch, Ramon; Nejjari Akhi-Elarab, Fatiha

2012-01-01

In this paper, the problem of leakage detection and isolation in water distribution networks is addressed applying an optimal sensor placement methodology. The chosen technique is based on structural models and thus it is suitable to handle non-linear and large scale systems. A drawback of this technique arises when costs are assigned uniformly. A main contribution of this paper is the proposal of an iterative methodology that focuses on identifying essential sensors which ultimately leads to...

Discounted cost model for condition-based maintenance optimization

International Nuclear Information System (INIS)

Weide, J.A.M. van der; Pandey, M.D.; Noortwijk, J.M. van

2010-01-01

This paper presents methods to evaluate the reliability and optimize the maintenance of engineering systems that are damaged by shocks or transients arriving randomly in time and overall degradation is modeled as a cumulative stochastic point process. The paper presents a conceptually clear and comprehensive derivation of formulas for computing the discounted cost associated with a maintenance policy combining both condition-based and age-based criteria for preventive maintenance. The proposed discounted cost model provides a more realistic basis for optimizing the maintenance policies than those based on the asymptotic, non-discounted cost rate criterion.

Small cell networks deployment, management, and optimization

CERN Document Server

Claussen, Holger; Ho, Lester; Razavi, Rouzbeh; Kucera, Stepan

2018-01-01

Small Cell Networks: Deployment, Management, and Optimization addresses key problems of the cellular network evolution towards HetNets. It focuses on the latest developments in heterogeneous and small cell networks, as well as their deployment, operation, and maintenance. It also covers the full spectrum of the topic, from academic, research, and business to the practice of HetNets in a coherent manner. Additionally, it provides complete and practical guidelines to vendors and operators interested in deploying small cells. The first comprehensive book written by well-known researchers and engineers from Nokia Bell Labs, Small Cell Networks begins with an introduction to the subject--offering chapters on capacity scaling and key requirements of future networks. It then moves on to sections on coverage and capacity optimization, and interference management. From there, the book covers mobility management, energy efficiency, and small cell deployment, ending with a section devoted to future trends and applicat...

Optimization of costs versus radiation exposures in decommissioning

International Nuclear Information System (INIS)

Konzek, G.J.

1979-01-01

The estimated worth of decommissioning optimization planning during each phase of the reactor's life cycle is dependent on many variables. The major variables are tabulated and relatively ranked. For each phase, optimization qualitative values (i.e., cost, safety, maintainability, ALARA, and decommissioning considerations) are estimated and ranked according to their short-term and long-term potential benefits. These estimates depend on the quality of the input data, interpretation of that data, and engineering judgment. Once identified and ranked, these considerations form an integral part of the information data base from which estimates, decisions, and alternatives are derived. The optimization of costs and the amount of occupational radiation exposure reductions are strongly interrelated during decommissioning. Realizing that building the necessary infrastructure for decommissioning will take time is an important first step in any decommissioning plan. In addition, the following conclusions are established to achieve optimization of costs and reduced occupational radiation exposures: the assignment of cost versus man-rem is item-specific and sensitive to the expertise of many interrelated disciplines; a commitment to long-term decommissioning planning by management will provide the conditions needed to achieve optimization; and, to be most effective, costs and exposure reduction are sensitive to the nearness of the decommissioning operation. For a new plant, it is best to start at the beginning of the cycle, update continually, consider innovations, and realize full potential and benefits of this concept. For an older plant, the life cycle methodology permits a comprehensive review of the plant history and the formulation of an orderly decommissioning program based on planning, organization, and effort

An Optimization Model for Expired Drug Recycling Logistics Networks and Government Subsidy Policy Design Based on Tri-level Programming

Directory of Open Access Journals (Sweden)

Hui Huang

2015-07-01

Full Text Available In order to recycle and dispose of all people’s expired drugs, the government should design a subsidy policy to stimulate users to return their expired drugs, and drug-stores should take the responsibility of recycling expired drugs, in other words, to be recycling stations. For this purpose it is necessary for the government to select the right recycling stations and treatment stations to optimize the expired drug recycling logistics network and minimize the total costs of recycling and disposal. This paper establishes a tri-level programming model to study how the government can optimize an expired drug recycling logistics network and the appropriate subsidy policies. Furthermore, a Hybrid Genetic Simulated Annealing Algorithm (HGSAA is proposed to search for the optimal solution of the model. An experiment is discussed to illustrate the good quality of the recycling logistics network and government subsides obtained by the HGSAA. The HGSAA is proven to have the ability to converge on the global optimal solution, and to act as an effective algorithm for solving the optimization problem of expired drug recycling logistics network and government subsidies.

Finding the optimal Bayesian network given a constraint graph

Directory of Open Access Journals (Sweden)

Jacob M. Schreiber

2017-07-01

Full Text Available Despite recent algorithmic improvements, learning the optimal structure of a Bayesian network from data is typically infeasible past a few dozen variables. Fortunately, domain knowledge can frequently be exploited to achieve dramatic computational savings, and in many cases domain knowledge can even make structure learning tractable. Several methods have previously been described for representing this type of structural prior knowledge, including global orderings, super-structures, and constraint rules. While super-structures and constraint rules are flexible in terms of what prior knowledge they can encode, they achieve savings in memory and computational time simply by avoiding considering invalid graphs. We introduce the concept of a “constraint graph” as an intuitive method for incorporating rich prior knowledge into the structure learning task. We describe how this graph can be used to reduce the memory cost and computational time required to find the optimal graph subject to the encoded constraints, beyond merely eliminating invalid graphs. In particular, we show that a constraint graph can break the structure learning task into independent subproblems even in the presence of cyclic prior knowledge. These subproblems are well suited to being solved in parallel on a single machine or distributed across many machines without excessive communication cost.

Appling a Novel Cost Function to Hopfield Neural Network for Defects Boundaries Detection of Wood Image

Directory of Open Access Journals (Sweden)

Qi Dawei

2010-01-01

Full Text Available A modified Hopfield neural network with a novel cost function was presented for detecting wood defects boundary in the image. Different from traditional methods, the boundary detection problem in this paper was formulated as an optimization process that sought the boundary points to minimize a cost function. An initial boundary was estimated by Canny algorithm first. The pixel gray value was described as a neuron state of Hopfield neural network. The state updated till the cost function touches the minimum value. The designed cost function ensured that few neurons were activated except the neurons corresponding to actual boundary points and ensured that the activated neurons are positioned in the points which had greatest change in gray value. The tools of Matlab were used to implement the experiment. The results show that the noises of the image are effectively removed, and our method obtains more noiseless and vivid boundary than those of the traditional methods.

Optimizing the spatial pattern of networks for monitoring radioactive releases

NARCIS (Netherlands)

Melles, S.J.; Heuvelink, G.B.M.; Twenhofel, C.J.W.; Dijk, van A.; Hiemstra, P.H.; Baume, O.P.; Stohlker, U.

2011-01-01

This study presents a method to optimize the sampling design of environmental monitoring networks in a multi-objective setting. We optimize the permanent network of radiation monitoring stations in the Netherlands and parts of Germany as an example. The optimization method proposed combines

Optimizing the Heat Exchanger Network of a Steam Reforming System

DEFF Research Database (Denmark)

Nielsen, Mads Pagh; Korsgaard, Anders Risum; Kær, Søren Knudsen

2004-01-01

Proton Exchange Membrane (PEM) based combined heat and power production systems are highly integrated energy systems. They may include a hydrogen production system and fuel cell stacks along with post combustion units optionally coupled with gas turbines. The considered system is based on a natural...... stationary numerical system model was used and process integration techniques for optimizing the heat exchanger network for the reforming unit are proposed. Objective is to minimize the system cost. Keywords: Fuel cells; Steam Reforming; Heat Exchanger Network (HEN) Synthesis; MINLP....... gas steam reformer along with gas purification reactors to generate clean hydrogen suited for a PEM stack. The temperatures in the various reactors in the fuel processing system vary from around 1000°C to the stack temperature at 80°C. Furthermore, external heating must be supplied to the endothermic...

A Study of Joint Cost Inclusion in Linear Programming Optimization

Directory of Open Access Journals (Sweden)

P. Armaos

2013-08-01

Full Text Available The concept of Structural Optimization has been a topic or research over the past century. Linear Programming Optimization has proved being the most reliable method of structural optimization. Global advances in linear programming optimization have been recently powered by University of Sheffield researchers, to include joint cost, self-weight and buckling considerations. A joint cost inclusion scopes to reduce the number of joints existing in an optimized structural solution, transforming it to a practically viable solution. The topic of the current paper is to investigate the effects of joint cost inclusion, as this is currently implemented in the optimization code. An extended literature review on this subject was conducted prior to familiarization with small scale optimization software. Using IntelliFORM software, a structured series of problems were set and analyzed. The joint cost tests examined benchmark problems and their consequent changes in the member topology, as the design domain was expanding. The findings of the analyses were remarkable and are being commented further on. The distinct topologies of solutions created by optimization processes are also recognized. Finally an alternative strategy of penalizing joints is presented.

An optimal power-dispatching system using neural networks for the electrochemical process of zinc depending on varying prices of electricity.

Science.gov (United States)

Yang, Chunhua; Deconinck, G; Gui, Weihua; Li, Yonggang

2002-01-01

Depending on varying prices of electricity, an optimal power-dispatching system (OPDS) is developed to minimize the cost of power consumption in the electrochemical process of zinc (EPZ). Due to the complexity of the EPZ, the main factors influencing the power consumption are determined by qualitative analysis, and a series of conditional experiments is conducted to acquire sufficient data, then two backpropagation neural networks are used to describe these relationships quantitatively. An equivalent Hopfield neural network is constructed to solve the optimization problem where a penalty function is introduced into the network energy function so as to meet the equality constraints, and inequality constraints are removed by alteration of the Sigmoid function. This OPDS was put into service in a smeltery in 1998. The cost of power consumption has decreased significantly, the total electrical energy consumption is reduced, and it is also beneficial to balancing the load of the power grid. The actual results show the effectiveness of the OPDS. This paper introduces a successful industrial application and mainly presents how to utilize neural networks to solve particular problems for the real world.

Topologically determined optimal stochastic resonance responses of spatially embedded networks

International Nuclear Information System (INIS)

Gosak, Marko; Marhl, Marko; Korosak, Dean

2011-01-01

We have analyzed the stochastic resonance phenomenon on spatial networks of bistable and excitable oscillators, which are connected according to their location and the amplitude of external forcing. By smoothly altering the network topology from a scale-free (SF) network with dominating long-range connections to a network where principally only adjacent oscillators are connected, we reveal that besides an optimal noise intensity, there is also a most favorable interaction topology at which the best correlation between the response of the network and the imposed weak external forcing is achieved. For various distributions of the amplitudes of external forcing, the optimal topology is always found in the intermediate regime between the highly heterogeneous SF network and the strong geometric regime. Our findings thus indicate that a suitable number of hubs and with that an optimal ratio between short- and long-range connections is necessary in order to obtain the best global response of a spatial network. Furthermore, we link the existence of the optimal interaction topology to a critical point indicating the transition from a long-range interactions-dominated network to a more lattice-like network structure.

Cost-optimal levels for energy performance requirements

DEFF Research Database (Denmark)

Thomsen, Kirsten Engelund; Aggerholm, Søren; Kluttig-Erhorn, Heike

2011-01-01

The CA conducted a study on experiences and challenges for setting cost optimal levels for energy performance requirements. The results were used as input by the EU Commission in their work of establishing the Regulation on a comparative methodology framework for calculating cost optimal levels...... of minimum energy performance requirements. In addition to the summary report released in August 2011, the full detailed report on this study is now also made available, just as the EC is about to publish its proposed Regulation for MS to apply in their process to update national building requirements....

[Physician's anxiety and physician's elegance. Problems in dealing with cost reduction, education of general practitioners and optimal size of practice networks in a cross-national comparison].

Science.gov (United States)

Behrens, J

2000-03-01

The key reason for physicians networking in managed care is to get a better coping with uncertainty on action (treatment) decisions. The second reason for networking in managed care are financial benefits grounds. But this reason is very ambivalent. Three different action problems (role conflicts) in managed care network are to solved, which was also in single practices. In the lecture the decision strategies and decision resources has been compared. Observations are done using expert interviews, patient interviews and analysis of documents in USA, Germany and Switzerland. The first problem is the choosing of a cost reduction strategy which is not reducing the effectiveness. Such "ugly" solution strategies like exclusion of "expensive" patients and a rationing of necessary medical services in a kind of McDonalds network of physicians will fail the target. The optimost way is a saving of all unnecessary medical even injourious performances. The chosen cost reduction strategy is not real visible from outside but in fact limited cognizable and controllable. Evidence based health care can be a resource of treatment decisions and could train such decisions but it will not substitute these decisions. The second problem is the making of real family practitioners as gatekeepers. Knowledge about the care system is still not making a real family practitioner, even if this is the minimum condition of their work. Also contractual relationships between insurance and doctor as a gatekeeper or financial incentives for patients are still making not a real family practitioner as a gatekpeeper. Only throughout the trust of patients supported by second opinions is making the real family practitioner as a gatekeeper. "Doctor hopping" could be the reaction by scarcity of trustworthy family practitioners as gatekeepers. The third problem is the choosing of the optimal scale of a network due to the very different optimal size of networks regarding the requirement of risk spreeds, of the

Multi-objective synthesis of work and heat exchange networks: Optimal balance between economic and environmental performance

International Nuclear Information System (INIS)

Onishi, Viviani C.; Ravagnani, Mauro A.S.S.; Jiménez, Laureano; Caballero, José A.

2017-01-01

Highlights: • New multi-objective optimization model for the simultaneous WHEN synthesis. • A multistage superstructure allows power and thermal integration of process streams. • Simultaneous minimization of environmental impacts and total annualized cost. • Alternative set of Pareto solutions is presented to support decision-makers. - Abstract: Sustainable and efficient energy use is crucial for lessening carbon dioxide emissions in industrial plants. This paper introduces a new multi-objective optimization model for the synthesis of work and heat exchange networks (WHENs), aiming to obtain the optimal balance between economic and environmental performance. The proposed multistage superstructure allows power and thermal integration of process gaseous streams, through the simultaneous minimization of total annualized cost (TAC) and environmental impacts (EI). The latter objective is determined by environmental indicators that follow the life cycle assessment (LCA) principles. The WHEN superstructure is optimized as a multi-objective mixed-integer nonlinear programming (moMINLP) model and solved with the GAMS software. Results show a decrease of ∼79% in the heat transfer area and ∼32% in the capital cost between the solutions found for single problem optimizations. These results represent a diminution of ∼23.5% in the TAC, while EI is increased in ∼99.2%. As these solutions can be impractical for economic or environmental reasons, we present a set of alternative Pareto-optimal solutions to support decision-makers towards the implementation of more environment-friendly and cost-effective WHENs.

Optimization of Actuating Origami Networks

Science.gov (United States)

Buskohl, Philip; Fuchi, Kazuko; Bazzan, Giorgio; Joo, James; Gregory, Reich; Vaia, Richard

2015-03-01

Origami structures morph between 2D and 3D conformations along predetermined fold lines that efficiently program the form, function and mobility of the structure. By leveraging design concepts from action origami, a subset of origami art focused on kinematic mechanisms, reversible folding patterns for applications such as solar array packaging, tunable antennae, and deployable sensing platforms may be designed. However, the enormity of the design space and the need to identify the requisite actuation forces within the structure places a severe limitation on design strategies based on intuition and geometry alone. The present work proposes a topology optimization method, using truss and frame element analysis, to distribute foldline mechanical properties within a reference crease pattern. Known actuating patterns are placed within a reference grid and the optimizer adjusts the fold stiffness of the network to optimally connect them. Design objectives may include a target motion, stress level, or mechanical energy distribution. Results include the validation of known action origami structures and their optimal connectivity within a larger network. This design suite offers an important step toward systematic incorporation of origami design concepts into new, novel and reconfigurable engineering devices. This research is supported under the Air Force Office of Scientific Research (AFOSR) funding, LRIR 13RQ02COR.

Enhanced Multi-Objective Optimization of Groundwater Monitoring Networks

DEFF Research Database (Denmark)

Bode, Felix; Binning, Philip John; Nowak, Wolfgang

Drinking-water well catchments include many sources for potential contaminations like gas stations or agriculture. Finding optimal positions of monitoring wells for such purposes is challenging because there are various parameters (and their uncertainties) that influence the reliability...... and optimality of any suggested monitoring location or monitoring network. The goal of this project is to develop and establish a concept to assess, design, and optimize early-warning systems within well catchments. Such optimal monitoring networks need to optimize three competing objectives: (1) a high...... be reduced to a minimum. The method is based on numerical simulation of flow and transport in heterogeneous porous media coupled with geostatistics and Monte-Carlo, wrapped up within the framework of formal multi-objective optimization. In order to gain insight into the flow and transport physics...

Simultaneous optimization of water and heat exchange networks

Energy Technology Data Exchange (ETDEWEB)

Chen, Zhiyou; Hou, Yanlong; Li, Xiaoduan; Wang, Jingtao [Tianjin University, Tianjin (China)

2014-04-15

This paper focuses on the simultaneous optimization of the heat-integrated water allocation networks. A mathematic model is established to illustrate the modified state-space representation of this problem. An easy logical method is employed to help identify the streams of hot or cold ones. In this model, the water exchange networks (WEN), heat exchange networks (HEN), and the interactions between the WEN and HEN combine together as one unity. Thus, the whole network can be solved at one time, which enhances the possibility to get a global optimal result. Examples from the literature and a PVC plant are analyzed to illustrate the accuracy and applicability of this method.

METHODS FOR DETERMINATION AND OPTIMIZATION OF LOGISTICS COSTS

OpenAIRE

Mihaela STET

2016-01-01

The paper is dealing with the problems of logistics costs, highlighting some methods for estimation and determination of specific costs for different transport modes in freight distribution. There are highlighted, besides costs of transports, the other costs in supply chain, as well as costing methods used in logistics activities. In this context, there are also revealed some optimization means of transport costs in logistics chain.

Design and optimizing factors of PACS network architecture

International Nuclear Information System (INIS)

Tao Yonghao; Miao Jingtao

2001-01-01

Objective: Exploring the design and optimizing factors of picture archiving and communication system (PACS) network architecture. Methods: Based on the PACS of shanghai first hospital to performed the measurements and tests on the requirements of network bandwidth and transmitting rate for different PACS functions and procedures respectively in static and dynamic network traffic situation, utilizing the network monitoring tools which built-in workstations and provided by Windows NT. Results: No obvious difference between switch equipment and HUB when measurements and tests implemented in static situation except route which slow down the rate markedly. In dynamic environment Switch is able to provide higher bandwidth utilizing than HUB and local system scope communication achieved faster transmitting rate than global system. Conclusion: The primary optimizing factors of PACS network architecture design include concise network topology and disassemble tremendous global traffic to multiple distributed local scope network communication to reduce the traffic of network backbone. The most important issue is guarantee essential bandwidth for diagnosis procedure of medical imaging

Investigation of Cost and Energy Optimization of Drinking Water Distribution Systems.

Science.gov (United States)

Cherchi, Carla; Badruzzaman, Mohammad; Gordon, Matthew; Bunn, Simon; Jacangelo, Joseph G

2015-11-17

Holistic management of water and energy resources through energy and water quality management systems (EWQMSs) have traditionally aimed at energy cost reduction with limited or no emphasis on energy efficiency or greenhouse gas minimization. This study expanded the existing EWQMS framework and determined the impact of different management strategies for energy cost and energy consumption (e.g., carbon footprint) reduction on system performance at two drinking water utilities in California (United States). The results showed that optimizing for cost led to cost reductions of 4% (Utility B, summer) to 48% (Utility A, winter). The energy optimization strategy was successfully able to find the lowest energy use operation and achieved energy usage reductions of 3% (Utility B, summer) to 10% (Utility A, winter). The findings of this study revealed that there may be a trade-off between cost optimization (dollars) and energy use (kilowatt-hours), particularly in the summer, when optimizing the system for the reduction of energy use to a minimum incurred cost increases of 64% and 184% compared with the cost optimization scenario. Water age simulations through hydraulic modeling did not reveal any adverse effects on the water quality in the distribution system or in tanks from pump schedule optimization targeting either cost or energy minimization.

Multiobjective genetic algorithm conjunctive use optimization for production, cost, and energy with dynamic return flow

Science.gov (United States)

Peralta, Richard C.; Forghani, Ali; Fayad, Hala

2014-04-01

Many real water resources optimization problems involve conflicting objectives for which the main goal is to find a set of optimal solutions on, or near to the Pareto front. E-constraint and weighting multiobjective optimization techniques have shortcomings, especially as the number of objectives increases. Multiobjective Genetic Algorithms (MGA) have been previously proposed to overcome these difficulties. Here, an MGA derives a set of optimal solutions for multiobjective multiuser conjunctive use of reservoir, stream, and (un)confined groundwater resources. The proposed methodology is applied to a hydraulically and economically nonlinear system in which all significant flows, including stream-aquifer-reservoir-diversion-return flow interactions, are simulated and optimized simultaneously for multiple periods. Neural networks represent constrained state variables. The addressed objectives that can be optimized simultaneously in the coupled simulation-optimization model are: (1) maximizing water provided from sources, (2) maximizing hydropower production, and (3) minimizing operation costs of transporting water from sources to destinations. Results show the efficiency of multiobjective genetic algorithms for generating Pareto optimal sets for complex nonlinear multiobjective optimization problems.

Optimization of recurrent neural networks for time series modeling

DEFF Research Database (Denmark)

Pedersen, Morten With

1997-01-01

The present thesis is about optimization of recurrent neural networks applied to time series modeling. In particular is considered fully recurrent networks working from only a single external input, one layer of nonlinear hidden units and a li near output unit applied to prediction of discrete time...... series. The overall objective s are to improve training by application of second-order methods and to improve generalization ability by architecture optimization accomplished by pruning. The major topics covered in the thesis are: 1. The problem of training recurrent networks is analyzed from a numerical...... of solution obtained as well as computation time required. 3. A theoretical definition of the generalization error for recurrent networks is provided. This definition justifies a commonly adopted approach for estimating generalization ability. 4. The viability of pruning recurrent networks by the Optimal...

Compensatory Analysis and Optimization for MADM for Heterogeneous Wireless Network Selection

Directory of Open Access Journals (Sweden)

Jian Zhou

2016-01-01

Full Text Available In the next-generation heterogeneous wireless networks, a mobile terminal with a multi-interface may have network access from different service providers using various technologies. In spite of this heterogeneity, seamless intersystem mobility is a mandatory requirement. One of the major challenges for seamless mobility is the creation of a network selection scheme, which is for users that select an optimal network with best comprehensive performance between different types of networks. However, the optimal network may be not the most reasonable one due to compensation of MADM (Multiple Attribute Decision Making, and the network is called pseudo-optimal network. This paper conducts a performance evaluation of a number of widely used MADM-based methods for network selection that aim to keep the mobile users always best connected anywhere and anytime, where subjective weight and objective weight are all considered. The performance analysis shows that the selection scheme based on MEW (weighted multiplicative method and combination weight can better avoid accessing pseudo-optimal network for balancing network load and reducing ping-pong effect in comparison with three other MADM solutions.

Network inference via adaptive optimal design

Directory of Open Access Journals (Sweden)

Stigter Johannes D

2012-09-01

Full Text Available Abstract Background Current research in network reverse engineering for genetic or metabolic networks very often does not include a proper experimental and/or input design. In this paper we address this issue in more detail and suggest a method that includes an iterative design of experiments based, on the most recent data that become available. The presented approach allows a reliable reconstruction of the network and addresses an important issue, i.e., the analysis and the propagation of uncertainties as they exist in both the data and in our own knowledge. These two types of uncertainties have their immediate ramifications for the uncertainties in the parameter estimates and, hence, are taken into account from the very beginning of our experimental design. Findings The method is demonstrated for two small networks that include a genetic network for mRNA synthesis and degradation and an oscillatory network describing a molecular network underlying adenosine 3’-5’ cyclic monophosphate (cAMP as observed in populations of Dyctyostelium cells. In both cases a substantial reduction in parameter uncertainty was observed. Extension to larger scale networks is possible but needs a more rigorous parameter estimation algorithm that includes sparsity as a constraint in the optimization procedure. Conclusion We conclude that a careful experiment design very often (but not always pays off in terms of reliability in the inferred network topology. For large scale networks a better parameter estimation algorithm is required that includes sparsity as an additional constraint. These algorithms are available in the literature and can also be used in an adaptive optimal design setting as demonstrated in this paper.

Optimizing Seismic Monitoring Networks for EGS and Conventional Geothermal Projects

Science.gov (United States)

Kraft, Toni; Herrmann, Marcus; Bethmann, Falko; Stefan, Wiemer

2013-04-01

location problem. Optimization for additional criteria (e.g., focal mechanism determination or installation costs) can be included. We consider a 3D seismic velocity model, an European ambient seismic noise model derived from high-resolution land-use data, and existing seismic stations in the vicinity of the geotechnical site. Additionally, we account for the attenuation of the seismic signal with travel time and ambient seismic noise with depth to be able to correctly deal with borehole station networks. Using this algorithm we are able to find the optimal geometry and size of the seismic monitoring network that meets the predefined application-oriented performance criteria. This talk will focus on optimal network geometries for deep geothermal projects of the EGS and hydrothermal type, and discuss the requirements for basic seismic surveillance and high-resolution reservoir monitoring and characterization.

A Game Theoretic Optimization Method for Energy Efficient Global Connectivity in Hybrid Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

JongHyup Lee

2016-08-01

Full Text Available For practical deployment of wireless sensor networks (WSN, WSNs construct clusters, where a sensor node communicates with other nodes in its cluster, and a cluster head support connectivity between the sensor nodes and a sink node. In hybrid WSNs, cluster heads have cellular network interfaces for global connectivity. However, when WSNs are active and the load of cellular networks is high, the optimal assignment of cluster heads to base stations becomes critical. Therefore, in this paper, we propose a game theoretic model to find the optimal assignment of base stations for hybrid WSNs. Since the communication and energy cost is different according to cellular systems, we devise two game models for TDMA/FDMA and CDMA systems employing power prices to adapt to the varying efficiency of recent wireless technologies. The proposed model is defined on the assumptions of the ideal sensing field, but our evaluation shows that the proposed model is more adaptive and energy efficient than local selections.

A Game Theoretic Optimization Method for Energy Efficient Global Connectivity in Hybrid Wireless Sensor Networks

Science.gov (United States)

Lee, JongHyup; Pak, Dohyun

2016-01-01

For practical deployment of wireless sensor networks (WSN), WSNs construct clusters, where a sensor node communicates with other nodes in its cluster, and a cluster head support connectivity between the sensor nodes and a sink node. In hybrid WSNs, cluster heads have cellular network interfaces for global connectivity. However, when WSNs are active and the load of cellular networks is high, the optimal assignment of cluster heads to base stations becomes critical. Therefore, in this paper, we propose a game theoretic model to find the optimal assignment of base stations for hybrid WSNs. Since the communication and energy cost is different according to cellular systems, we devise two game models for TDMA/FDMA and CDMA systems employing power prices to adapt to the varying efficiency of recent wireless technologies. The proposed model is defined on the assumptions of the ideal sensing field, but our evaluation shows that the proposed model is more adaptive and energy efficient than local selections. PMID:27589743

Optimization in a Networked Economy

Directory of Open Access Journals (Sweden)

Ahmet Sekreter

2017-10-01

Full Text Available An age of network has been living for the last decades. The information technologies have been used by hundreds of millions of users. These technologies are enabling to connect businesses and economic activities. One of the characteristics of the networked economy is the amount of data that produced due to the interlinking of firms, individuals, processes by businesses, and economic activities. Another issue with the networked economy is the complexity of the data. Extraction of the knowledge from the networked economy has challenges by the traditional approach since data is large scale, second decentralized, and third they connect many heterogeneous agents. The challenges can be overcome by the new optimization methods including human element or the social interactions with technological infrastructure.

Optimal satisfaction degree in energy harvesting cognitive radio networks

International Nuclear Information System (INIS)

Li Zan; Liu Bo-Yang; Si Jiang-Bo; Zhou Fu-Hui

2015-01-01

A cognitive radio (CR) network with energy harvesting (EH) is considered to improve both spectrum efficiency and energy efficiency. A hidden Markov model (HMM) is used to characterize the imperfect spectrum sensing process. In order to maximize the whole satisfaction degree (WSD) of the cognitive radio network, a tradeoff between the average throughput of the secondary user (SU) and the interference to the primary user (PU) is analyzed. We formulate the satisfaction degree optimization problem as a mixed integer nonlinear programming (MINLP) problem. The satisfaction degree optimization problem is solved by using differential evolution (DE) algorithm. The proposed optimization problem allows the network to adaptively achieve the optimal solution based on its required quality of service (Qos). Numerical results are given to verify our analysis. (paper)

Synchronization-optimized networks for coupled nearly identical ...

Indian Academy of Sciences (India)

From the stability criteria of the MSF, we construct optimal networks ... of intense research in physical, biological, chemical, technological and social sci- ..... In figure 3a, a sample of initial network of 32 coupled nearly identical Rössler oscilla-.

METHODS FOR DETERMINATION AND OPTIMIZATION OF LOGISTICS COSTS

Directory of Open Access Journals (Sweden)

Mihaela STET

2016-12-01

Full Text Available The paper is dealing with the problems of logistics costs, highlighting some methods for estimation and determination of specific costs for different transport modes in freight distribution. There are highlighted, besides costs of transports, the other costs in supply chain, as well as costing methods used in logistics activities. In this context, there are also revealed some optimization means of transport costs in logistics chain.

An Integrated Modeling Approach to Evaluate and Optimize Data Center Sustainability, Dependability and Cost

Directory of Open Access Journals (Sweden)

Gustavo Callou

2014-01-01

Full Text Available Data centers have evolved dramatically in recent years, due to the advent of social networking services, e-commerce and cloud computing. The conflicting requirements are the high availability levels demanded against the low sustainability impact and cost values. The approaches that evaluate and optimize these requirements are essential to support designers of data center architectures. Our work aims to propose an integrated approach to estimate and optimize these issues with the support of the developed environment, Mercury. Mercury is a tool for dependability, performance and energy flow evaluation. The tool supports reliability block diagrams (RBD, stochastic Petri nets (SPNs, continuous-time Markov chains (CTMC and energy flow (EFM models. The EFM verifies the energy flow on data center architectures, taking into account the energy efficiency and power capacity that each device can provide (assuming power systems or extract (considering cooling components. The EFM also estimates the sustainability impact and cost issues of data center architectures. Additionally, a methodology is also considered to support the modeling, evaluation and optimization processes. Two case studies are presented to illustrate the adopted methodology on data center power systems.

Statistical-QoS Guaranteed Energy Efficiency Optimization for Energy Harvesting Wireless Sensor Networks.

Science.gov (United States)

Gao, Ya; Cheng, Wenchi; Zhang, Hailin

2017-08-23

Energy harvesting, which offers a never-ending energy supply, has emerged as a prominent technology to prolong the lifetime and reduce costs for the battery-powered wireless sensor networks. However, how to improve the energy efficiency while guaranteeing the quality of service (QoS) for energy harvesting based wireless sensor networks is still an open problem. In this paper, we develop statistical delay-bounded QoS-driven power control policies to maximize the effective energy efficiency (EEE), which is defined as the spectrum efficiency under given specified QoS constraints per unit harvested energy, for energy harvesting based wireless sensor networks. For the battery-infinite wireless sensor networks, our developed QoS-driven power control policy converges to the Energy harvesting Water Filling (E-WF) scheme and the Energy harvesting Channel Inversion (E-CI) scheme under the very loose and stringent QoS constraints, respectively. For the battery-finite wireless sensor networks, our developed QoS-driven power control policy becomes the Truncated energy harvesting Water Filling (T-WF) scheme and the Truncated energy harvesting Channel Inversion (T-CI) scheme under the very loose and stringent QoS constraints, respectively. Furthermore, we evaluate the outage probabilities to theoretically analyze the performance of our developed QoS-driven power control policies. The obtained numerical results validate our analysis and show that our developed optimal power control policies can optimize the EEE over energy harvesting based wireless sensor networks.

Robust Optimization for Time-Cost Tradeoff Problem in Construction Projects

OpenAIRE

Li, Ming; Wu, Guangdong

2014-01-01

Construction projects are generally subject to uncertainty, which influences the realization of time-cost tradeoff in project management. This paper addresses a time-cost tradeoff problem under uncertainty, in which activities in projects can be executed in different construction modes corresponding to specified time and cost with interval uncertainty. Based on multiobjective robust optimization method, a robust optimization model for time-cost tradeoff problem is developed. In order to illus...

Empirical study of long-range connections in a road network offers new ingredient for navigation optimization models

Science.gov (United States)

Wang, Pu; Liu, Like; Li, Xiamiao; Li, Guanliang; González, Marta C.

2014-01-01

Navigation problem in lattices with long-range connections has been widely studied to understand the design principles for optimal transport networks; however, the travel cost of long-range connections was not considered in previous models. We define long-range connection in a road network as the shortest path between a pair of nodes through highways and empirically analyze the travel cost properties of long-range connections. Based on the maximum speed allowed in each road segment, we observe that the time needed to travel through a long-range connection has a characteristic time Th ˜ 29 min, while the time required when using the alternative arterial road path has two different characteristic times Ta ˜ 13 and 41 min and follows a power law for times larger than 50 min. Using daily commuting origin-destination matrix data, we additionally find that the use of long-range connections helps people to save about half of the travel time in their daily commute. Based on the empirical results, we assign a more realistic travel cost to long-range connections in two-dimensional square lattices, observing dramatically different minimum average shortest path but similar optimal navigation conditions.

Neural network for nonsmooth pseudoconvex optimization with general convex constraints.

Science.gov (United States)

Bian, Wei; Ma, Litao; Qin, Sitian; Xue, Xiaoping

2018-05-01

In this paper, a one-layer recurrent neural network is proposed for solving a class of nonsmooth, pseudoconvex optimization problems with general convex constraints. Based on the smoothing method, we construct a new regularization function, which does not depend on any information of the feasible region. Thanks to the special structure of the regularization function, we prove the global existence, uniqueness and "slow solution" character of the state of the proposed neural network. Moreover, the state solution of the proposed network is proved to be convergent to the feasible region in finite time and to the optimal solution set of the related optimization problem subsequently. In particular, the convergence of the state to an exact optimal solution is also considered in this paper. Numerical examples with simulation results are given to show the efficiency and good characteristics of the proposed network. In addition, some preliminary theoretical analysis and application of the proposed network for a wider class of dynamic portfolio optimization are included. Copyright © 2018 Elsevier Ltd. All rights reserved.

Information spread in networks: Games, optimal control, and stabilization

Science.gov (United States)

Khanafer, Ali

, that can be checked in a distributed fashion. Moreover, we investigate the problem of stabilizing the network when the curing rates of a limited number of nodes can be controlled. In particular, we characterize the number of controllers required for a class of undirected graphs. We also design optimal controllers capable of minimizing the total infection in the network at minimum cost. Finally, we outline a set of open problems in the area of information spread control.

Bi and tri-objective optimization in the deterministic network interdiction problem

International Nuclear Information System (INIS)

Rocco S, Claudio M.; Emmanuel Ramirez-Marquez, Jose; Salazar A, Daniel E.

2010-01-01

Solution approaches to the deterministic network interdiction problem have previously been developed for optimizing a single figure-of-merit of the network configuration (i.e. flow that can be transmitted between a source node and a sink node for a fixed network design) under constraints related to limited amount of resources available to interdict network links. These approaches work under the assumption that: (1) nominal capacity of each link is completely reduced when interdicted and (2) there is a single criterion to optimize. This paper presents a newly developed evolutionary algorithm that for the first time allows solving multi-objective optimization models for the design of network interdiction strategies that take into account a variety of figures-of-merit. The algorithm provides an approximation to the optimal Pareto frontier using: (a) techniques in Monte Carlo simulation to generate potential network interdiction strategies, (b) graph theory to analyze strategies' maximum source-sink flow and (c) an evolutionary search that is driven by the probability that a link will belong to the optimal Pareto set. Examples for different sizes of networks and network behavior are used throughout the paper to illustrate and validate the approach.

Optimal Quantum Spatial Search on Random Temporal Networks

Science.gov (United States)

Chakraborty, Shantanav; Novo, Leonardo; Di Giorgio, Serena; Omar, Yasser

2017-12-01

To investigate the performance of quantum information tasks on networks whose topology changes in time, we study the spatial search algorithm by continuous time quantum walk to find a marked node on a random temporal network. We consider a network of n nodes constituted by a time-ordered sequence of Erdös-Rényi random graphs G (n ,p ), where p is the probability that any two given nodes are connected: After every time interval τ , a new graph G (n ,p ) replaces the previous one. We prove analytically that, for any given p , there is always a range of values of τ for which the running time of the algorithm is optimal, i.e., O (√{n }), even when search on the individual static graphs constituting the temporal network is suboptimal. On the other hand, there are regimes of τ where the algorithm is suboptimal even when each of the underlying static graphs are sufficiently connected to perform optimal search on them. From this first study of quantum spatial search on a time-dependent network, it emerges that the nontrivial interplay between temporality and connectivity is key to the algorithmic performance. Moreover, our work can be extended to establish high-fidelity qubit transfer between any two nodes of the network. Overall, our findings show that one can exploit temporality to achieve optimal quantum information tasks on dynamical random networks.

Optimal Quantum Spatial Search on Random Temporal Networks.

Science.gov (United States)

Chakraborty, Shantanav; Novo, Leonardo; Di Giorgio, Serena; Omar, Yasser

2017-12-01

To investigate the performance of quantum information tasks on networks whose topology changes in time, we study the spatial search algorithm by continuous time quantum walk to find a marked node on a random temporal network. We consider a network of n nodes constituted by a time-ordered sequence of Erdös-Rényi random graphs G(n,p), where p is the probability that any two given nodes are connected: After every time interval τ, a new graph G(n,p) replaces the previous one. We prove analytically that, for any given p, there is always a range of values of τ for which the running time of the algorithm is optimal, i.e., O(sqrt[n]), even when search on the individual static graphs constituting the temporal network is suboptimal. On the other hand, there are regimes of τ where the algorithm is suboptimal even when each of the underlying static graphs are sufficiently connected to perform optimal search on them. From this first study of quantum spatial search on a time-dependent network, it emerges that the nontrivial interplay between temporality and connectivity is key to the algorithmic performance. Moreover, our work can be extended to establish high-fidelity qubit transfer between any two nodes of the network. Overall, our findings show that one can exploit temporality to achieve optimal quantum information tasks on dynamical random networks.

The simulation and optimization research on manufacturing enterprise’s supply chain process from the perspective of social network

OpenAIRE

Fu, Chun; Shuai, Zhenzhen

2015-01-01

Purpose: By studying the case of a Changsha engineering machinery manufacturing firm, this paper aims to find out the optimization tactics to reduce enterprise’s logistics operational cost. Design/methodology/approach: This paper builds the structure model of manufacturing enterprise’s logistics operational costs from the perspective of social firm network and simulates the model based on system dynamics. Findings: It concludes that applying system dynamics in the research o...

Optimized Charging Scheduling with Single Mobile Charger for Wireless Rechargeable Sensor Networks

Directory of Open Access Journals (Sweden)

Qihua Wang

2017-11-01

Full Text Available Due to the rapid development of wireless charging technology, the recharging issue in wireless rechargeable sensor network (WRSN has been a popular research problem in the past few years. The weakness of previous work is that charging route planning is not reasonable. In this work, a dynamic optimal scheduling scheme aiming to maximize the vacation time ratio of a single mobile changer for WRSN is proposed. In the proposed scheme, the wireless sensor network is divided into several sub-networks according to the initial topology of deployed sensor networks. After comprehensive analysis of energy states, working state and constraints for different sensor nodes in WRSN, we transform the optimized charging path problem of the whole network into the local optimization problem of the sub networks. The optimized charging path with respect to dynamic network topology in each sub-network is obtained by solving an optimization problem, and the lifetime of the deployed wireless sensor network can be prolonged. Simulation results show that the proposed scheme has good and reliable performance for a small wireless rechargeable sensor network.

[Application of simulated annealing method and neural network on optimizing soil sampling schemes based on road distribution].

Science.gov (United States)

Han, Zong-wei; Huang, Wei; Luo, Yun; Zhang, Chun-di; Qi, Da-cheng

2015-03-01

Taking the soil organic matter in eastern Zhongxiang County, Hubei Province, as a research object, thirteen sample sets from different regions were arranged surrounding the road network, the spatial configuration of which was optimized by the simulated annealing approach. The topographic factors of these thirteen sample sets, including slope, plane curvature, profile curvature, topographic wetness index, stream power index and sediment transport index, were extracted by the terrain analysis. Based on the results of optimization, a multiple linear regression model with topographic factors as independent variables was built. At the same time, a multilayer perception model on the basis of neural network approach was implemented. The comparison between these two models was carried out then. The results revealed that the proposed approach was practicable in optimizing soil sampling scheme. The optimal configuration was capable of gaining soil-landscape knowledge exactly, and the accuracy of optimal configuration was better than that of original samples. This study designed a sampling configuration to study the soil attribute distribution by referring to the spatial layout of road network, historical samples, and digital elevation data, which provided an effective means as well as a theoretical basis for determining the sampling configuration and displaying spatial distribution of soil organic matter with low cost and high efficiency.

Design Optimization of Microalloyed Steels Using Thermodynamics Principles and Neural-Network-Based Modeling

Science.gov (United States)

Mohanty, Itishree; Chintha, Appa Rao; Kundu, Saurabh

2018-06-01

The optimization of process parameters and composition is essential to achieve the desired properties with minimal additions of alloying elements in microalloyed steels. In some cases, it may be possible to substitute such steels for those which are more richly alloyed. However, process control involves a larger number of parameters, making the relationship between structure and properties difficult to assess. In this work, neural network models have been developed to estimate the mechanical properties of steels containing Nb + V or Nb + Ti. The outcomes have been validated by thermodynamic calculations and plant data. It has been shown that subtle thermodynamic trends can be captured by the neural network model. Some experimental rolling data have also been used to support the model, which in addition has been applied to calculate the costs of optimizing microalloyed steel. The generated pareto fronts identify many combinations of strength and elongation, making it possible to select composition and process parameters for a range of applications. The ANN model and the optimization model are being used for prediction of properties in a running plant and for development of new alloys, respectively.

Energy-Efficient Optimal Power Allocation in Integrated Wireless Sensor and Cognitive Satellite Terrestrial Networks.

Science.gov (United States)

Shi, Shengchao; Li, Guangxia; An, Kang; Gao, Bin; Zheng, Gan

2017-09-04

This paper proposes novel satellite-based wireless sensor networks (WSNs), which integrate the WSN with the cognitive satellite terrestrial network. Having the ability to provide seamless network access and alleviate the spectrum scarcity, cognitive satellite terrestrial networks are considered as a promising candidate for future wireless networks with emerging requirements of ubiquitous broadband applications and increasing demand for spectral resources. With the emerging environmental and energy cost concerns in communication systems, explicit concerns on energy efficient resource allocation in satellite networks have also recently received considerable attention. In this regard, this paper proposes energy-efficient optimal power allocation schemes in the cognitive satellite terrestrial networks for non-real-time and real-time applications, respectively, which maximize the energy efficiency (EE) of the cognitive satellite user while guaranteeing the interference at the primary terrestrial user below an acceptable level. Specifically, average interference power (AIP) constraint is employed to protect the communication quality of the primary terrestrial user while average transmit power (ATP) or peak transmit power (PTP) constraint is adopted to regulate the transmit power of the satellite user. Since the energy-efficient power allocation optimization problem belongs to the nonlinear concave fractional programming problem, we solve it by combining Dinkelbach's method with Lagrange duality method. Simulation results demonstrate that the fading severity of the terrestrial interference link is favorable to the satellite user who can achieve EE gain under the ATP constraint comparing to the PTP constraint.

Power consumption optimization strategy for wireless networks

DEFF Research Database (Denmark)

Cornean, Horia; Kumar, Sanjay; Marchetti, Nicola

2011-01-01

in order to reduce the total power consumption in a multi cellular network. We present an algorithm for power optimization under no interference and in presence of interference conditions, targeting to maximize the network capacity. The convergence of the algorithm is guaranteed if the interference...

Optimal routing of hazardous substances in time-varying, stochastic transportation networks

International Nuclear Information System (INIS)

Woods, A.L.; Miller-Hooks, E.; Mahmassani, H.S.

1998-07-01

This report is concerned with the selection of routes in a network along which to transport hazardous substances, taking into consideration several key factors pertaining to the cost of transport and the risk of population exposure in the event of an accident. Furthermore, the fact that travel time and the risk measures are not constant over time is explicitly recognized in the routing decisions. Existing approaches typically assume static conditions, possibly resulting in inefficient route selection and unnecessary risk exposure. The report described the application of recent advances in network analysis methodologies to the problem of routing hazardous substances. Several specific problem formulations are presented, reflecting different degrees of risk aversion on the part of the decision-maker, as well as different possible operational scenarios. All procedures explicitly consider travel times and travel costs (including risk measures) to be stochastic time-varying quantities. The procedures include both exact algorithms, which may require extensive computational effort in some situations, as well as more efficient heuristics that may not guarantee a Pareto-optimal solution. All procedures are systematically illustrated for an example application using the Texas highway network, for both normal and incident condition scenarios. The application illustrates the trade-offs between the information obtained in the solution and computational efficiency, and highlights the benefits of incorporating these procedures in a decision-support system for hazardous substance shipment routing decisions

Energy Management Optimization for Cellular Networks under Renewable Energy Generation Uncertainty

KAUST Repository

Rached, Nadhir B.

2017-03-28

The integration of renewable energy (RE) as an alternative power source for cellular networks has been deeply investigated in literature. However, RE generation is often assumed to be deterministic; an impractical assumption for realistic scenarios. In this paper, an efficient energy procurement strategy for cellular networks powered simultaneously by the smart grid (SG) and locally deployed RE sources characterized by uncertain processes is proposed. For a one-day operation cycle, the mobile operator aims to reduce its total energy cost by optimizing the amounts of energy to be procured from the local RE sources and SG at each time period. Additionally, it aims to determine the amount of extra generated RE to be sold back to SG. A chance constrained optimization is first proposed to deal with the RE generation uncertainty. Then, two convex approximation approaches: Chernoff and Chebyshev methods, characterized by different levels of knowledge about the RE generation, are developed to determine the energy procurement strategy for different risk levels. In addition, their performances are analyzed for various daily scenarios through selected simulation results. It is shown that the higher complex Chernoff method outperforms the Chebyshev one for different risk levels set by the operator.

Energy Management Optimization for Cellular Networks under Renewable Energy Generation Uncertainty

KAUST Repository

Rached, Nadhir B.; Ghazzai, Hakim; Kadri, Abdullah; Alouini, Mohamed-Slim

2017-01-01

The integration of renewable energy (RE) as an alternative power source for cellular networks has been deeply investigated in literature. However, RE generation is often assumed to be deterministic; an impractical assumption for realistic scenarios. In this paper, an efficient energy procurement strategy for cellular networks powered simultaneously by the smart grid (SG) and locally deployed RE sources characterized by uncertain processes is proposed. For a one-day operation cycle, the mobile operator aims to reduce its total energy cost by optimizing the amounts of energy to be procured from the local RE sources and SG at each time period. Additionally, it aims to determine the amount of extra generated RE to be sold back to SG. A chance constrained optimization is first proposed to deal with the RE generation uncertainty. Then, two convex approximation approaches: Chernoff and Chebyshev methods, characterized by different levels of knowledge about the RE generation, are developed to determine the energy procurement strategy for different risk levels. In addition, their performances are analyzed for various daily scenarios through selected simulation results. It is shown that the higher complex Chernoff method outperforms the Chebyshev one for different risk levels set by the operator.

Recurrent neural network for non-smooth convex optimization problems with application to the identification of genetic regulatory networks.

Science.gov (United States)

Cheng, Long; Hou, Zeng-Guang; Lin, Yingzi; Tan, Min; Zhang, Wenjun Chris; Wu, Fang-Xiang

2011-05-01

A recurrent neural network is proposed for solving the non-smooth convex optimization problem with the convex inequality and linear equality constraints. Since the objective function and inequality constraints may not be smooth, the Clarke's generalized gradients of the objective function and inequality constraints are employed to describe the dynamics of the proposed neural network. It is proved that the equilibrium point set of the proposed neural network is equivalent to the optimal solution of the original optimization problem by using the Lagrangian saddle-point theorem. Under weak conditions, the proposed neural network is proved to be stable, and the state of the neural network is convergent to one of its equilibrium points. Compared with the existing neural network models for non-smooth optimization problems, the proposed neural network can deal with a larger class of constraints and is not based on the penalty method. Finally, the proposed neural network is used to solve the identification problem of genetic regulatory networks, which can be transformed into a non-smooth convex optimization problem. The simulation results show the satisfactory identification accuracy, which demonstrates the effectiveness and efficiency of the proposed approach.

Evaluation and design of a rain gauge network using a statistical optimization method in a severe hydro-geological hazard prone area

Science.gov (United States)

Fattoruso, Grazia; Longobardi, Antonia; Pizzuti, Alfredo; Molinara, Mario; Marocco, Claudio; De Vito, Saverio; Tortorella, Francesco; Di Francia, Girolamo

2017-06-01

Rainfall data collection gathered in continuous by a distributed rain gauge network is instrumental to more effective hydro-geological risk forecasting and management services though the input estimated rainfall fields suffer from prediction uncertainty. Optimal rain gauge networks can generate accurate estimated rainfall fields. In this research work, a methodology has been investigated for evaluating an optimal rain gauges network aimed at robust hydrogeological hazard investigations. The rain gauges of the Sarno River basin (Southern Italy) has been evaluated by optimizing a two-objective function that maximizes the estimated accuracy and minimizes the total metering cost through the variance reduction algorithm along with the climatological variogram (time-invariant). This problem has been solved by using an enumerative search algorithm, evaluating the exact Pareto-front by an efficient computational time.

WiMax network planning and optimization

CERN Document Server

Zhang, Yan

2009-01-01

This book offers a comprehensive explanation on how to dimension, plan, and optimize WiMAX networks. The first part of the text introduces WiMAX networks architecture, physical layer, standard, protocols, security mechanisms, and highly related radio access technologies. It covers system framework, topology, capacity, mobility management, handoff management, congestion control, medium access control (MAC), scheduling, Quality of Service (QoS), and WiMAX mesh networks and security. Enabling easy understanding of key concepts and technologies, the second part presents practical examples and illu

PARTICLE SWARM OPTIMIZATION (PSO FOR TRAINING OPTIMIZATION ON CONVOLUTIONAL NEURAL NETWORK (CNN

Directory of Open Access Journals (Sweden)

Arie Rachmad Syulistyo

2016-02-01

Full Text Available Neural network attracts plenty of researchers lately. Substantial number of renowned universities have developed neural network for various both academically and industrially applications. Neural network shows considerable performance on various purposes. Nevertheless, for complex applications, neural network’s accuracy significantly deteriorates. To tackle the aforementioned drawback, lot of researches had been undertaken on the improvement of the standard neural network. One of the most promising modifications on standard neural network for complex applications is deep learning method. In this paper, we proposed the utilization of Particle Swarm Optimization (PSO in Convolutional Neural Networks (CNNs, which is one of the basic methods in deep learning. The use of PSO on the training process aims to optimize the results of the solution vectors on CNN in order to improve the recognition accuracy. The data used in this research is handwritten digit from MNIST. The experiments exhibited that the accuracy can be attained in 4 epoch is 95.08%. This result was better than the conventional CNN and DBN.  The execution time was also almost similar to the conventional CNN. Therefore, the proposed method was a promising method.

Data on cost-optimal Nearly Zero Energy Buildings (NZEBs across Europe

Directory of Open Access Journals (Sweden)

Delia D'Agostino

2018-04-01

Full Text Available This data article refers to the research paper A model for the cost-optimal design of Nearly Zero Energy Buildings (NZEBs in representative climates across Europe [1]. The reported data deal with the design optimization of a residential building prototype located in representative European locations. The study focus on the research of cost-optimal choices and efficiency measures in new buildings depending on the climate. The data linked within this article relate to the modelled building energy consumption, renewable production, potential energy savings, and costs. Data allow to visualize energy consumption before and after the optimization, selected efficiency measures, costs and renewable production. The reduction of electricity and natural gas consumption towards the NZEB target can be visualized together with incremental and cumulative costs in each location. Further data is available about building geometry, costs, CO2 emissions, envelope, materials, lighting, appliances and systems.

Data on cost-optimal Nearly Zero Energy Buildings (NZEBs) across Europe.

Science.gov (United States)

D'Agostino, Delia; Parker, Danny

2018-04-01

This data article refers to the research paper A model for the cost-optimal design of Nearly Zero Energy Buildings (NZEBs) in representative climates across Europe [1]. The reported data deal with the design optimization of a residential building prototype located in representative European locations. The study focus on the research of cost-optimal choices and efficiency measures in new buildings depending on the climate. The data linked within this article relate to the modelled building energy consumption, renewable production, potential energy savings, and costs. Data allow to visualize energy consumption before and after the optimization, selected efficiency measures, costs and renewable production. The reduction of electricity and natural gas consumption towards the NZEB target can be visualized together with incremental and cumulative costs in each location. Further data is available about building geometry, costs, CO 2 emissions, envelope, materials, lighting, appliances and systems.

The optimal number, type and location of devices in automation of electrical distribution networks

Directory of Open Access Journals (Sweden)

Popović Željko N.

2015-01-01

Full Text Available This paper presents the mixed integer linear programming based model for determining optimal number, type and location of remotely controlled and supervised devices in distribution networks in the presence of distributed generators. The proposed model takes into consideration a number of different devices simultaneously (remotely controlled circuit breakers/reclosers, sectionalizing switches, remotely supervised and local fault passage indicators along with the following: expected outage cost to consumers and producers due to momentary and long-term interruptions, automated device expenses (capital investment, installation, and annual operation and maintenance costs, number and expenses of crews involved in the isolation and restoration process. Furthermore, the other possible benefits of each of automated device are also taken into account (e.g., benefits due to decreasing the cost of switching operations in normal conditions. The obtained numerical results emphasize the importance of consideration of different types of automation devices simultaneously. They also show that the proposed approach have a potential to improve the process of determining of the best automation strategy in real life distribution networks.

A multiyear DG-incorporated framework for expansion planning of distribution networks using binary chaotic shark smell optimization algorithm

International Nuclear Information System (INIS)

Ahmadigorji, Masoud; Amjady, Nima

2016-01-01

In this paper, a new model for MEPDN (multiyear expansion planning of distribution networks) is proposed. By solving this model, the optimal expansion scheme of primary (i.e. medium voltage) distribution network including the reinforcement pattern of primary feeders as well as location and size of DG (distributed generators) during an ascertained planning period is determined. Furthermore, the time-based feature of proposed model allows it to specify the investments/reinforcements time (i.e. year). Moreover, a minimum load shedding-based analytical approach for optimizing the network's reliability is introduced. The associated objective function of proposed model is minimizing the total investment and operation costs. To solve the formulated MEPDN model as a complex multi-dimensional optimization problem, a new evolutionary algorithm-based solution method called BCSSO (Binary Chaotic Shark Smell Optimization) is presented. The effectiveness of the proposed MEPDN model and solution approach is illustrated by applying them on two widely-used test cases including 12-bus and 33-bus distribution network and comparing the acquired results with the results of other solution methods. - Highlights: • A multiyear expansion planning model for distribution network is presented. • A new evolutionary algorithm-based solution approach is proposed. • A minimum load shedding-based analytical method for EENS minimization is suggested. • The efficacy of the proposed solution approach is broadly investigated.

Optimization of rainfall networks using information entropy and temporal variability analysis

Science.gov (United States)

Wang, Wenqi; Wang, Dong; Singh, Vijay P.; Wang, Yuankun; Wu, Jichun; Wang, Lachun; Zou, Xinqing; Liu, Jiufu; Zou, Ying; He, Ruimin

2018-04-01

Rainfall networks are the most direct sources of precipitation data and their optimization and evaluation are essential and important. Information entropy can not only represent the uncertainty of rainfall distribution but can also reflect the correlation and information transmission between rainfall stations. Using entropy this study performs optimization of rainfall networks that are of similar size located in two big cities in China, Shanghai (in Yangtze River basin) and Xi'an (in Yellow River basin), with respect to temporal variability analysis. Through an easy-to-implement greedy ranking algorithm based on the criterion called, Maximum Information Minimum Redundancy (MIMR), stations of the networks in the two areas (each area is further divided into two subareas) are ranked during sliding inter-annual series and under different meteorological conditions. It is found that observation series with different starting days affect the ranking, alluding to the temporal variability during network evaluation. We propose a dynamic network evaluation framework for considering temporal variability, which ranks stations under different starting days with a fixed time window (1-year, 2-year, and 5-year). Therefore, we can identify rainfall stations which are temporarily of importance or redundancy and provide some useful suggestions for decision makers. The proposed framework can serve as a supplement for the primary MIMR optimization approach. In addition, during different periods (wet season or dry season) the optimal network from MIMR exhibits differences in entropy values and the optimal network from wet season tended to produce higher entropy values. Differences in spatial distribution of the optimal networks suggest that optimizing the rainfall network for changing meteorological conditions may be more recommended.

A One-Layer Recurrent Neural Network for Constrained Complex-Variable Convex Optimization.

Science.gov (United States)

Qin, Sitian; Feng, Jiqiang; Song, Jiahui; Wen, Xingnan; Xu, Chen

2018-03-01

In this paper, based on calculus and penalty method, a one-layer recurrent neural network is proposed for solving constrained complex-variable convex optimization. It is proved that for any initial point from a given domain, the state of the proposed neural network reaches the feasible region in finite time and converges to an optimal solution of the constrained complex-variable convex optimization finally. In contrast to existing neural networks for complex-variable convex optimization, the proposed neural network has a lower model complexity and better convergence. Some numerical examples and application are presented to substantiate the effectiveness of the proposed neural network.

Remote Autonomous Sensor Networks: A Study in Redundancy and Life Cycle Costs

Science.gov (United States)

Ahlrichs, M.; Dotson, A.; Cenek, M.

2017-12-01

The remote nature of the United States and Canada border and their extreme seasonal shifts has made monitoring much of the area impossible using conventional monitoring techniques. Currently, the United States has large gaps in its ability to detect movement on an as-needed-basis in remote areas. The proposed autonomous sensor network aims to meet that need by developing a product that is low cost, robust, and can be deployed on an as-needed-basis for short term monitoring events. This is accomplished by identifying radio frequency disturbance and acoustic disturbance. This project aims to validate the proposed design and offer optimization strategies by conducting a redundancy model as well as performing a Life Cycle Assessment (LCA). The model will incorporate topological, meteorological, and land cover datasets to estimate sensor loss over a three-month period, ensuring that the remaining network does not have significant gaps in coverage which preclude being able to receive and transmit data. The LCA will investigate the materials used to create the sensor to generate an estimate of the total environmental energy that is utilized to create the network and offer alternative materials and distribution methods that can lower this cost. This platform can function as a stand-alone monitoring network or provide additional spatial and temporal resolution to existing monitoring networks. This study aims to create the framework to determine if a sensor's design and distribution is appropriate for the target environment. The incorporation of a LCA will seek to answer if the data a proposed sensor network will collect outweighs the environmental damage that will result from its deployment. Furthermore, as the arctic continues to thaw and economic development grows, the methodology described in paper will function as a guidance document to ensure that future sensor networks have a minimal impact on these pristine areas.

Algorithms for finding optimal paths in network games with p players

Directory of Open Access Journals (Sweden)

R. Boliac

1997-08-01

Full Text Available We study the problem of finding optimal paths in network games with p players. Some polynomial-time algorithms for finding optimal paths and optimal by Nash strategies of the players in network games with p players are proposed.

Optimal Power Allocation Algorithm for Radar Network Systems Based on Low Probability of Intercept Optimization(in English

Directory of Open Access Journals (Sweden)

Shi Chen-guang

2014-08-01

Full Text Available A novel optimal power allocation algorithm for radar network systems is proposed for Low Probability of Intercept (LPI technology in modern electronic warfare. The algorithm is based on the LPI optimization. First, the Schleher intercept factor for a radar network is derived, and then the Schleher intercept factor is minimized by optimizing the transmission power allocation among netted radars in the network to guarantee target-tracking performance. Furthermore, the Nonlinear Programming Genetic Algorithm (NPGA is used to solve the resulting nonconvex, nonlinear, and constrained optimization problem. Numerical simulation results show the effectiveness of the proposed algorithm.

Extending Resolution of Fault Slip With Geodetic Networks Through Optimal Network Design

Science.gov (United States)

Sathiakumar, Sharadha; Barbot, Sylvain Denis; Agram, Piyush

2017-12-01

Geodetic networks consisting of high precision and high rate Global Navigation Satellite Systems (GNSS) stations continuously monitor seismically active regions of the world. These networks measure surface displacements and the amount of geodetic strain accumulated in the region and give insight into the seismic potential. SuGar (Sumatra GPS Array) in Sumatra, GEONET (GNSS Earth Observation Network System) in Japan, and PBO (Plate Boundary Observatory) in California are some examples of established networks around the world that are constantly expanding with the addition of new stations to improve the quality of measurements. However, installing new stations to existing networks is tedious and expensive. Therefore, it is important to choose suitable locations for new stations to increase the precision obtained in measuring the geophysical parameters of interest. Here we describe a methodology to design optimal geodetic networks that augment the existing system and use it to investigate seismo-tectonics at convergent and transform boundaries considering land-based and seafloor geodesy. The proposed network design optimization would be pivotal to better understand seismic and tsunami hazards around the world. Land-based and seafloor networks can monitor fault slip around subduction zones with significant resolution, but transform faults are more challenging to monitor due to their near-vertical geometry.

Optimal design of an IP/MPLS over DWDM network

Directory of Open Access Journals (Sweden)

Eduardo Canale

2014-04-01

Full Text Available Different approaches for deploying resilient optical networks of low cost constitute a traditional group of NP-Hard problems that have been widely studied. Most of them are based on the construction of low cost networks that fulfill connectivity constraints. However, recent trends to virtualize optical networks over the legacy fiber infrastructure, modified the nature of network design problems and turned inappropriate many of these models and algorithms. In this paper we study a design problem arising from the deployment of an IP/MPLS network over an existing DWDM infrastructure. Besides cost and resiliency, this problem integrates traffic and capacity constraints. We present: an integer programming formulation for the problem, theoretical results, and describe how several metaheuristics were applied in order to find good quality solutions, for a real application case of a telecommunications company.

The optimal vertical structure in the electricity industry when the incumbent has a cost advantage

International Nuclear Information System (INIS)

Kurakawa, Yukihide

2013-01-01

This paper studies how the vertical structure of the electricity industry affects the social welfare when the incumbent has a cost advantage in generation relative to the entrants. The model consists of a generation sector and a transmission sector. In the generation sector the incumbent and entrants compete in a Cournot fashion taking as given the access charge to the transmission network set in advance by the regulator to maximize the social welfare. Two vertical structures, integration and separation, are considered. Under vertical separation the transmission network is established as an organization independent of every generator, whereas under vertical integration it is a part of the incumbent's organization. The optimal vertical structure is shown to depend on the number of entrants. If the number of entrants is smaller than a certain threshold, vertical separation is superior in welfare to vertical integration, and vice versa. This is because the choice of vertical structure produces a trade-off in the effects on competition promotion and production efficiency. If a break-even constraint is imposed in the transmission sector, however, vertical integration is shown to be always superior in welfare. - Highlights: • We examine the optimal vertical structure in the electricity industry. • We model a generation sector in which the incumbent has a cost advantage. • A trade-off between production efficiency and competition promotion occurs. • The optimal vertical structure depends on the number of entrants. • Vertical integration is always superior if a break-even constraint is imposed

Brocade: Optimal flow placement in SDN networks

CERN Multimedia

CERN. Geneva

2015-01-01

Today' network poses several challanges to network providers. These challanges fall in to a variety of areas ranging from determining efficient utilization of network bandwidth to finding out which user applications consume majority of network resources. Also, how to protect a given network from volumetric and botnet attacks. Optimal placement of flows deal with identifying network issues and addressing them in a real-time. The overall solution helps in building new services where a network is more secure and more efficient. Benefits derived as a result are increased network efficiency due to better capacity and resource planning, better security with real-time threat mitigation, and improved user experience as a result of increased service velocity.

Optimized Neural Network for Fault Diagnosis and Classification

International Nuclear Information System (INIS)

Elaraby, S.M.

2005-01-01

This paper presents a developed and implemented toolbox for optimizing neural network structure of fault diagnosis and classification. Evolutionary algorithm based on hierarchical genetic algorithm structure is used for optimization. The simplest feed-forward neural network architecture is selected. Developed toolbox has friendly user interface. Multiple solutions are generated. The performance and applicability of the proposed toolbox is verified with benchmark data patterns and accident diagnosis of Egyptian Second research reactor (ETRR-2)

Multiobjective optimal placement of switches and protective devices in electric power distribution systems using ant colony optimization

Energy Technology Data Exchange (ETDEWEB)

Tippachon, Wiwat; Rerkpreedapong, Dulpichet [Department of Electrical Engineering, Kasetsart University, 50 Phaholyothin Rd., Ladyao, Jatujak, Bangkok 10900 (Thailand)

2009-07-15

This paper presents a multiobjective optimization methodology to optimally place switches and protective devices in electric power distribution networks. Identifying the type and location of them is a combinatorial optimization problem described by a nonlinear and nondifferential function. The multiobjective ant colony optimization (MACO) has been applied to this problem to minimize the total cost while simultaneously minimize two distribution network reliability indices including system average interruption frequency index (SAIFI) and system interruption duration index (SAIDI). Actual distribution feeders are used in the tests, and test results have shown that the algorithm can determine the set of optimal nondominated solutions. It allows the utility to obtain the optimal type and location of devices to achieve the best system reliability with the lowest cost. (author)

A one-layer recurrent neural network for constrained nonconvex optimization.

Science.gov (United States)

Li, Guocheng; Yan, Zheng; Wang, Jun

2015-01-01

In this paper, a one-layer recurrent neural network is proposed for solving nonconvex optimization problems subject to general inequality constraints, designed based on an exact penalty function method. It is proved herein that any neuron state of the proposed neural network is convergent to the feasible region in finite time and stays there thereafter, provided that the penalty parameter is sufficiently large. The lower bounds of the penalty parameter and convergence time are also estimated. In addition, any neural state of the proposed neural network is convergent to its equilibrium point set which satisfies the Karush-Kuhn-Tucker conditions of the optimization problem. Moreover, the equilibrium point set is equivalent to the optimal solution to the nonconvex optimization problem if the objective function and constraints satisfy given conditions. Four numerical examples are provided to illustrate the performances of the proposed neural network.

DRO: domain-based route optimization scheme for nested mobile networks

Directory of Open Access Journals (Sweden)

Chuang Ming-Chin

2011-01-01

Full Text Available Abstract The network mobility (NEMO basic support protocol is designed to support NEMO management, and to ensure communication continuity between nodes in mobile networks. However, in nested mobile networks, NEMO suffers from the pinball routing problem, which results in long packet transmission delays. To solve the problem, we propose a domain-based route optimization (DRO scheme that incorporates a domain-based network architecture and ad hoc routing protocols for route optimization. DRO also improves the intra-domain handoff performance, reduces the convergence time during route optimization, and avoids the out-of-sequence packet problem. A detailed performance analysis and simulations were conducted to evaluate the scheme. The results demonstrate that DRO outperforms existing mechanisms in terms of packet transmission delay (i.e., better route-optimization, intra-domain handoff latency, convergence time, and packet tunneling overhead.

System Approach of Logistic Costs Optimization Solution in Supply Chain

OpenAIRE

Majerčák, Peter; Masárová, Gabriela; Buc, Daniel; Majerčáková, Eva

2013-01-01

This paper is focused on the possibility of using the costs simulation in supply chain, which are on relative high level. Our goal is to determine the costs using logistic costs optimization which must necessarily be used in business activities in the supply chain management. The paper emphasizes the need to perform not isolated optimization in the whole supply chain. Our goal is to compare classic approach, when every part tracks its costs isolated, a try to minimize them, with the system (l...

Modification Propagation in Complex Networks

Science.gov (United States)

Mouronte, Mary Luz; Vargas, María Luisa; Moyano, Luis Gregorio; Algarra, Francisco Javier García; Del Pozo, Luis Salvador

To keep up with rapidly changing conditions, business systems and their associated networks are growing increasingly intricate as never before. By doing this, network management and operation costs not only rise, but are difficult even to measure. This fact must be regarded as a major constraint to system optimization initiatives, as well as a setback to derived economic benefits. In this work we introduce a simple model in order to estimate the relative cost associated to modification propagation in complex architectures. Our model can be used to anticipate costs caused by network evolution, as well as for planning and evaluating future architecture development while providing benefit optimization.

Modeling and optimization of an electric power distribution network ...

African Journals Online (AJOL)

Modeling and optimization of an electric power distribution network planning system using ... of the network was modelled with non-linear mathematical expressions. ... given feasible locations, re-conductoring of existing feeders in the network, ...

Construction of road network vulnerability evaluation index based on general travel cost

Science.gov (United States)

Leng, Jun-qiang; Zhai, Jing; Li, Qian-wen; Zhao, Lin

2018-03-01

With the development of China's economy and the continuous improvement of her urban road network, the vulnerability of the urban road network has attracted increasing attention. Based on general travel cost, this work constructs the vulnerability evaluation index for the urban road network, and evaluates the vulnerability of the urban road network from the perspective of user generalised travel cost. Firstly, the generalised travel cost model is constructed based on vehicle cost, travel time, and traveller comfort. Then, the network efficiency index is selected as an evaluation index of vulnerability: the network efficiency index is composed of the traffic volume and the generalised travel cost, which are obtained from the equilibrium state of the network. In addition, the research analyses the influence of traffic capacity decrease, road section attribute value, and location of road section, on vulnerability. Finally, the vulnerability index is used to analyse the local area network of Harbin and verify its applicability.

Cost-effectiveness analysis of optimal strategy for tumor treatment

International Nuclear Information System (INIS)

Pang, Liuyong; Zhao, Zhong; Song, Xinyu

2016-01-01

We propose and analyze an antitumor model with combined immunotherapy and chemotherapy. Firstly, we explore the treatment effects of single immunotherapy and single chemotherapy, respectively. Results indicate that neither immunotherapy nor chemotherapy alone are adequate to cure a tumor. Hence, we apply optimal theory to investigate how the combination of immunotherapy and chemotherapy should be implemented, for a certain time period, in order to reduce the number of tumor cells, while minimizing the implementation cost of the treatment strategy. Secondly, we establish the existence of the optimality system and use Pontryagin’s Maximum Principle to characterize the optimal levels of the two treatment measures. Furthermore, we calculate the incremental cost-effectiveness ratios to analyze the cost-effectiveness of all possible combinations of the two treatment measures. Finally, numerical results show that the combination of immunotherapy and chemotherapy is the most cost-effective strategy for tumor treatment, and able to eliminate the entire tumor with size 4.470 × 10"8 in a year.

Designing Green Networks and Network Operations Saving Run-the-Engine Costs

CERN Document Server

Minoli, Daniel

2011-01-01

In recent years the confluence of socio-political trends toward environmental responsibility and the pressing need to reduce Run-the-Engine (RTE) costs has given birth to a nascent discipline of Green IT. A clear and concise introduction to green networks and green network operations, this book examines analytical measures and discusses virtualization, network computing, and web services as approaches for green data centers and networks. It identifies some strategies for green appliance and end devices and examines the methodical steps that can be taken over time to achieve a seamless migratio

Chaotic Hopfield Neural Network Swarm Optimization and Its Application

Directory of Open Access Journals (Sweden)

Yanxia Sun

2013-01-01

Full Text Available A new neural network based optimization algorithm is proposed. The presented model is a discrete-time, continuous-state Hopfield neural network and the states of the model are updated synchronously. The proposed algorithm combines the advantages of traditional PSO, chaos and Hopfield neural networks: particles learn from their own experience and the experiences of surrounding particles, their search behavior is ergodic, and convergence of the swarm is guaranteed. The effectiveness of the proposed approach is demonstrated using simulations and typical optimization problems.

Minimisation of a heat exchanger networks' cost over its lifetime

International Nuclear Information System (INIS)

Nemet, Andreja; Klemeš, Jiří Jaromír; Kravanja, Zdravko

2012-01-01

The optimal design of heat exchanger networks (HENs) has a great influence on the profitability of a plant. The optimisation is based on trade-offs between investment and operational cost. The full lifetime of the HEN and future utility prices have to be considered rather than optimising HEN on a yearly basis using current utility prices. Single-period optimisation and synthesis models for HENs reflect current utility prices only. These prices can fluctuate rather quickly and the optimal solution may be very different from a year to year. Deterministic and stochastic multi-period mixed-integer nonlinear programming (MINLP) models for HEN synthesis have been developed to account for future price projections, where the utility cost coefficients are forecasted for the lifetime of the process. An optimal design is then determined for each projection and these designs are compared against a design with fixed current prices by applying the Incremental Net Present Value and other economic measures. In case studies the difference between utility consumption, using previous optimisation methods and new, were significant; e.g. in Case Study 2 the utility savings were 18.4% for hot and 32.6% for cold utility yielding an increase of the Net Present Value (NPV) by 7.8%. Highlights: ► Optimisation using forecasted utility prices can lead to higher energy recovery. ► Incremental Net Present Value when using future versus current prices is positive. ► The reduction of utilities increases with the process lifetime. ► Developed multi-period MINLP models for HEN account for future utility prices.

Optimal placement of distributed generation in distribution networks ...

African Journals Online (AJOL)

This paper proposes the application of Particle Swarm Optimization (PSO) technique to find the optimal size and optimum location for the placement of DG in the radial distribution networks for active power compensation by reduction in real power losses and enhancement in voltage profile. In the first segment, the optimal ...

Stochastic network optimization with application to communication and queueing systems

CERN Document Server

Neely, Michael

2010-01-01

This text presents a modern theory of analysis, control, and optimization for dynamic networks. Mathematical techniques of Lyapunov drift and Lyapunov optimization are developed and shown to enable constrained optimization of time averages in general stochastic systems. The focus is on communication and queueing systems, including wireless networks with time-varying channels, mobility, and randomly arriving traffic. A simple drift-plus-penalty framework is used to optimize time averages such as throughput, throughput-utility, power, and distortion. Explicit performance-delay tradeoffs are prov

Model Based Optimal Sensor Network Design for Condition Monitoring in an IGCC Plant

Energy Technology Data Exchange (ETDEWEB)

Kumar, Rajeeva; Kumar, Aditya; Dai, Dan; Seenumani, Gayathri; Down, John; Lopez, Rodrigo

2012-12-31

This report summarizes the achievements and final results of this program. The objective of this program is to develop a general model-based sensor network design methodology and tools to address key issues in the design of an optimal sensor network configuration: the type, location and number of sensors used in a network, for online condition monitoring. In particular, the focus in this work is to develop software tools for optimal sensor placement (OSP) and use these tools to design optimal sensor network configuration for online condition monitoring of gasifier refractory wear and radiant syngas cooler (RSC) fouling. The methodology developed will be applicable to sensing system design for online condition monitoring for broad range of applications. The overall approach consists of (i) defining condition monitoring requirement in terms of OSP and mapping these requirements in mathematical terms for OSP algorithm, (ii) analyzing trade-off of alternate OSP algorithms, down selecting the most relevant ones and developing them for IGCC applications (iii) enhancing the gasifier and RSC models as required by OSP algorithms, (iv) applying the developed OSP algorithm to design the optimal sensor network required for the condition monitoring of an IGCC gasifier refractory and RSC fouling. Two key requirements for OSP for condition monitoring are desired precision for the monitoring variables (e.g. refractory wear) and reliability of the proposed sensor network in the presence of expected sensor failures. The OSP problem is naturally posed within a Kalman filtering approach as an integer programming problem where the key requirements of precision and reliability are imposed as constraints. The optimization is performed over the overall network cost. Based on extensive literature survey two formulations were identified as being relevant to OSP for condition monitoring; one based on LMI formulation and the other being standard INLP formulation. Various algorithms to solve

A fuzzy multi-objective optimization model for sustainable reverse logistics network design

DEFF Research Database (Denmark)

Govindan, Kannan; Paam, Parichehr; Abtahi, Amir Reza

2016-01-01

Decreasing the environmental impact, increasing the degree of social responsibility, and considering the economic motivations of organizations are three significant features in designing a reverse logistics network under sustainability respects. Developing a model, which can simultaneously consider...... a multi-echelon multi-period multi-objective model for a sustainable reverse logistics network. To reflect all aspects of sustainability, we try to minimize the present value of costs, as well as environmental impacts, and optimize the social responsibility as objective functions of the model. In order...... these environmental, social, and economic aspects and their indicators, is an important problem for both researchers and practitioners. In this paper, we try to address this comprehensive approach by using indicators for measurement of aforementioned aspects and by applying fuzzy mathematical programming to design...

A Network Reconfiguration Method Considering Data Uncertainties in Smart Distribution Networks

Directory of Open Access Journals (Sweden)

Ke-yan Liu

2017-05-01

Full Text Available This work presents a method for distribution network reconfiguration with the simultaneous consideration of distributed generation (DG allocation. The uncertainties of load fluctuation before the network reconfiguration are also considered. Three optimal objectives, including minimal line loss cost, minimum Expected Energy Not Supplied, and minimum switch operation cost, are investigated. The multi-objective optimization problem is further transformed into a single-objective optimization problem by utilizing weighting factors. The proposed network reconfiguration method includes two periods. The first period is to create a feasible topology network by using binary particle swarm optimization (BPSO. Then the DG allocation problem is solved by utilizing sensitivity analysis and a Harmony Search algorithm (HSA. In the meanwhile, interval analysis is applied to deal with the uncertainties of load and devices parameters. Test cases are studied using the standard IEEE 33-bus and PG&E 69-bus systems. Different scenarios and comparisons are analyzed in the experiments. The results show the applicability of the proposed method. The performance analysis of the proposed method is also investigated. The computational results indicate that the proposed network reconfiguration algorithm is feasible.

Solving Minimum Cost Multi-Commodity Network Flow Problem ...

African Journals Online (AJOL)

ADOWIE PERE

2018-03-23

Mar 23, 2018 ... network-based modeling framework for integrated fixed and mobile ... Minimum Cost Network Flow Problem (MCNFP) and some ..... Unmanned Aerial Vehicle Routing in Traffic. Incident ... Ph.D. Thesis, Dept. of Surveying &.

Empirical study of long-range connections in a road network offers new ingredient for navigation optimization models

International Nuclear Information System (INIS)

Wang, Pu; Liu, Like; Li, Xiamiao; Li, Guanliang; González, Marta C

2014-01-01

Navigation problem in lattices with long-range connections has been widely studied to understand the design principles for optimal transport networks; however, the travel cost of long-range connections was not considered in previous models. We define long-range connection in a road network as the shortest path between a pair of nodes through highways and empirically analyze the travel cost properties of long-range connections. Based on the maximum speed allowed in each road segment, we observe that the time needed to travel through a long-range connection has a characteristic time T h  ∼ 29 min, while the time required when using the alternative arterial road path has two different characteristic times T a  ∼ 13 and 41 min and follows a power law for times larger than 50 min. Using daily commuting origin–destination matrix data, we additionally find that the use of long-range connections helps people to save about half of the travel time in their daily commute. Based on the empirical results, we assign a more realistic travel cost to long-range connections in two-dimensional square lattices, observing dramatically different minimum average shortest path 〈l〉 but similar optimal navigation conditions. (paper)

Cost optimization for buildings with hybrid ventilation systems

Science.gov (United States)

Ji, Kun; Lu, Yan

2018-02-13

A method including: computing a total cost for a first zone in a building, wherein the total cost is equal to an actual energy cost of the first zone plus a thermal discomfort cost of the first zone; and heuristically optimizing the total cost to identify temperature setpoints for a mechanical heating/cooling system and a start time and an end time of the mechanical heating/cooling system, based on external weather data and occupancy data of the first zone.

Optimal operation management of fuel cell/wind/photovoltaic power sources connected to distribution networks

Science.gov (United States)

Niknam, Taher; Kavousifard, Abdollah; Tabatabaei, Sajad; Aghaei, Jamshid

2011-10-01

In this paper a new multiobjective modified honey bee mating optimization (MHBMO) algorithm is presented to investigate the distribution feeder reconfiguration (DFR) problem considering renewable energy sources (RESs) (photovoltaics, fuel cell and wind energy) connected to the distribution network. The objective functions of the problem to be minimized are the electrical active power losses, the voltage deviations, the total electrical energy costs and the total emissions of RESs and substations. During the optimization process, the proposed algorithm finds a set of non-dominated (Pareto) optimal solutions which are stored in an external memory called repository. Since the objective functions investigated are not the same, a fuzzy clustering algorithm is utilized to handle the size of the repository in the specified limits. Moreover, a fuzzy-based decision maker is adopted to select the 'best' compromised solution among the non-dominated optimal solutions of multiobjective optimization problem. In order to see the feasibility and effectiveness of the proposed algorithm, two standard distribution test systems are used as case studies.

Design of shared unit-dose drug distribution network using multi-level particle swarm optimization.

Science.gov (United States)

Chen, Linjie; Monteiro, Thibaud; Wang, Tao; Marcon, Eric

2018-03-01

Unit-dose drug distribution systems provide optimal choices in terms of medication security and efficiency for organizing the drug-use process in large hospitals. As small hospitals have to share such automatic systems for economic reasons, the structure of their logistic organization becomes a very sensitive issue. In the research reported here, we develop a generalized multi-level optimization method - multi-level particle swarm optimization (MLPSO) - to design a shared unit-dose drug distribution network. Structurally, the problem studied can be considered as a type of capacitated location-routing problem (CLRP) with new constraints related to specific production planning. This kind of problem implies that a multi-level optimization should be performed in order to minimize logistic operating costs. Our results show that with the proposed algorithm, a more suitable modeling framework, as well as computational time savings and better optimization performance are obtained than that reported in the literature on this subject.

Equity in multiproduct supply chain network

Directory of Open Access Journals (Sweden)

Mina SAEE BOSTANABAD

2013-01-01

Full Text Available In this paper, multiproduct supply chain network is investigated with equity consideration,namely, obtaining the optimal flow pattern, in such a way that no user in the network can increasehis(her benefit with change in product’s sending path. However, each kind of products, has anindividual cost function and, at the same time, contributes to its own and other product’s cost functionin an individual way. An algorithm is developed to find optimal flow pattern for such multiproductsupply chain network.

Optimal Joint Liability Lending and with Costly Peer Monitoring

NARCIS (Netherlands)

Carli, Francesco; Uras, R.B.

2014-01-01

This paper characterizes an optimal group loan contract with costly peer monitoring. Using a fairly standard moral hazard framework, we show that the optimal group lending contract could exhibit a joint-liability scheme. However, optimality of joint-liability requires the involvement of a group

Synchrony-optimized networks of non-identical Kuramoto oscillators

International Nuclear Information System (INIS)

Brede, Markus

2008-01-01

In this Letter we discuss a method for generating synchrony-optimized coupling architectures of Kuramoto oscillators with a heterogeneous distribution of native frequencies. The method allows us to relate the properties of the coupling network to its synchronizability. These relations were previously only established from a linear stability analysis of the identical oscillator case. We further demonstrate that the heterogeneity in the oscillator population produces heterogeneity in the optimal coupling network as well. Two rules for enhancing the synchronizability of a given network by a suitable placement of oscillators are given: (i) native frequencies of adjacent oscillators must be anti-correlated and (ii) frequency magnitudes should positively correlate with the degree of the node they are placed at

Optimization and Control of Communication Networks

OpenAIRE

Chiang, Mung; Low, Steven

2005-01-01

Recently, there has been a surge in research activities that utilize the power of recent developments in nonlinear optimization to tackle a wide scope of work in the analysis and design of communication systems, touching every layer of the layered network architecture, and resulting in both intellectual and practical impacts significantly beyond the earlier frameworks. These research activities are driven by both new demands in the areas of communications and networking, and n...

Optimal traffic control in highway transportation networks using linear programming

KAUST Repository

Li, Yanning

2014-06-01

This article presents a framework for the optimal control of boundary flows on transportation networks. The state of the system is modeled by a first order scalar conservation law (Lighthill-Whitham-Richards PDE). Based on an equivalent formulation of the Hamilton-Jacobi PDE, the problem of controlling the state of the system on a network link in a finite horizon can be posed as a Linear Program. Assuming all intersections in the network are controllable, we show that the optimization approach can be extended to an arbitrary transportation network, preserving linear constraints. Unlike previously investigated transportation network control schemes, this framework leverages the intrinsic properties of the Halmilton-Jacobi equation, and does not require any discretization or boolean variables on the link. Hence this framework is very computational efficient and provides the globally optimal solution. The feasibility of this framework is illustrated by an on-ramp metering control example.

Optimal satisfaction degree in energy harvesting cognitive radio networks

Science.gov (United States)

Li, Zan; Liu, Bo-Yang; Si, Jiang-Bo; Zhou, Fu-Hui

2015-12-01

A cognitive radio (CR) network with energy harvesting (EH) is considered to improve both spectrum efficiency and energy efficiency. A hidden Markov model (HMM) is used to characterize the imperfect spectrum sensing process. In order to maximize the whole satisfaction degree (WSD) of the cognitive radio network, a tradeoff between the average throughput of the secondary user (SU) and the interference to the primary user (PU) is analyzed. We formulate the satisfaction degree optimization problem as a mixed integer nonlinear programming (MINLP) problem. The satisfaction degree optimization problem is solved by using differential evolution (DE) algorithm. The proposed optimization problem allows the network to adaptively achieve the optimal solution based on its required quality of service (Qos). Numerical results are given to verify our analysis. Project supported by the National Natural Science Foundation of China (Grant No. 61301179), the Doctorial Programs Foundation of the Ministry of Education of China (Grant No. 20110203110011), and the 111 Project (Grant No. B08038).

PSO-Optimized Hopfield Neural Network-Based Multipath Routing for Mobile Ad-hoc Networks

Directory of Open Access Journals (Sweden)

Mansour Sheikhan

2012-06-01

Full Text Available Mobile ad-hoc network (MANET is a dynamic collection of mobile computers without the need for any existing infrastructure. Nodes in a MANET act as hosts and routers. Designing of robust routing algorithms for MANETs is a challenging task. Disjoint multipath routing protocols address this problem and increase the reliability, security and lifetime of network. However, selecting an optimal multipath is an NP-complete problem. In this paper, Hopfield neural network (HNN which its parameters are optimized by particle swarm optimization (PSO algorithm is proposed as multipath routing algorithm. Link expiration time (LET between each two nodes is used as the link reliability estimation metric. This approach can find either node-disjoint or link-disjoint paths in singlephase route discovery. Simulation results confirm that PSO-HNN routing algorithm has better performance as compared to backup path set selection algorithm (BPSA in terms of the path set reliability and number of paths in the set.

[Construction and optimization of ecological network for nature reserves in Fujian Province, China].

Science.gov (United States)

Gu, Fan; Huang, Yi Xiong; Chen, Chuan Ming; Cheng, Dong Liang; Guo, Jia Lei

2017-03-18

The nature reserve is very important to biodiversity maintenance. However, due to the urbanization, the nature reserve has been fragmented with reduction in area, leading to the loss of species diversity. Establishing ecological network can effectively connect the fragmented habitats and plays an important role in species conversation. In this paper, based on deciding habitat patches and the landscape cost surface in ArcGIS, a minimum cumulative resistance model was used to simulate the potential ecological network of Fujian provincial nature reserves. The connectivity and importance of network were analyzed and evaluated based on comparison of connectivity indices (including the integral index of connectivity and probability of connectivity) and gravity model both before and after the potential ecological network construction. The optimum ecological network optimization measures were proposed. The result demonstrated that woodlands, grasslands and wetlands together made up the important part of the nature reserve ecological network. The habitats with large area had a higher degree of importance in the network. After constructing the network, the connectivity level was significantly improved. Although interaction strength between different patches va-ried greatly, the corridors between patches with large interaction were very important. The research could provide scientific reference and basis for nature protection and planning in Fujian Province.

Starship Sails Propelled by Cost-Optimized Directed Energy

Science.gov (United States)

Benford, J.

Microwave and laser-propelled sails are a new class of spacecraft using photon acceleration. It is the only method of interstellar flight that has no physics issues. Laboratory demonstrations of basic features of beam-driven propulsion, flight, stability (`beam-riding'), and induced spin, have been completed in the last decade, primarily in the microwave. It offers much lower cost probes after a substantial investment in the launcher. Engineering issues are being addressed by other applications: fusion (microwave, millimeter and laser sources) and astronomy (large aperture antennas). There are many candidate sail materials: carbon nanotubes and microtrusses, beryllium, graphene, etc. For acceleration of a sail, what is the cost-optimum high power system? Here the cost is used to constrain design parameters to estimate system power, aperture and elements of capital and operating cost. From general relations for cost-optimal transmitter aperture and power, system cost scales with kinetic energy and inversely with sail diameter and frequency. So optimal sails will be larger, lower in mass and driven by higher frequency beams. Estimated costs include economies of scale. We present several starship point concepts. Systems based on microwave, millimeter wave and laser technologies are of equal cost at today's costs. The frequency advantage of lasers is cancelled by the high cost of both the laser and the radiating optic. Cost of interstellar sailships is very high, driven by current costs for radiation source, antennas and especially electrical power. The high speeds necessary for fast interstellar missions make the operating cost exceed the capital cost. Such sailcraft will not be flown until the cost of electrical power in space is reduced orders of magnitude below current levels.