Optimal design of long-span steel portal frames using fabricated beams

This paper considers the optimal design of fabricated steel beams for long-span portal frames. The design optimisation takes into account ultimate as well as serviceability limit states, adopting deflection limits recommended by the Steel Construction Institute (SCI). Results for three benchmark frames demonstrate the efficiency of the optimisation methodology. A genetic algorithm (GA) was used to optimise the dimensions of the plates used for the columns, rafters and haunches. Discrete decision variables were adopted for the thickness of the steel plates and continuous variables for the breadth and depth of the plates. Strategies were developed to enhance the performance of the GA including solution space reduction and a hybrid initial population half of which is derived using Latin hypercube sampling. The results show that the proposed GA-based optimisation model generates optimal and near-optimal solutions consistently. A parametric study is then conducted on frames of different spans. A significant variation in weight between fabricated and conventional hot-rolled steel portal frames is shown; for a 50 m span frame, a 14–19% saving in weight was achieved. Furthermore, since Universal Beam sections in the UK come from a discrete section library, the results could also provide overall dimensions of other beams that could be more efficient for portal frames. Eurocode 3 was used for illustrative purposes; any alternative code of practice may be used.

Multi-Party Negotiation When Agents Have Subjective Estimates of Bargaining Powers

This paper presents a method for generating Pareto-optimal solutions in multi-party negotiations. In this iterative method, decision makers (DMs) formulate proposals that yield a minimum payoff to their opponents. Each proposal belongs to the efficient frontier, DMs try to adjust to a common one. In this setting, each DM is supposed to have a given bargaining power. More precisely each DM is supposed to have a subjective estimate of the power of the different parties. We study the convergence of the method, and provide examples where there is no possible agreement resulting from it.

Multiobjective design optimization of IGBT power modules considering power cycling and thermal cycling

Insulated-gate bipolar transistor (IGBT) power modules find widespread use in numerous power conversion applications where their reliability is of significant concern. Standard IGBT modules are fabricated for general-purpose applications while little has been designed for bespoke applications. However, conventional design of IGBTs can be improved by the multiobjective optimization technique. This paper proposes a novel design method to consider die-attachment solder failures induced by short power cycling and baseplate solder fatigue induced by the thermal cycling which are among major failure mechanisms of IGBTs. Thermal resistance is calculated analytically and the plastic work design is obtained with a high-fidelity finite-element model, which has been validated experimentally. The objective of minimizing the plastic work and constrain functions is formulated by the surrogate model. The nondominated sorting genetic algorithm-II is used to search for the Pareto-optimal solutions and the best design. The result of this combination generates an effective approach to optimize the physical structure of power electronic modules, taking account of historical environmental and operational conditions in the field.

An efficient genetic algorithm for the design optimization of cold-formed steel portal frame buildings

The design optimization of a cold-formed steel portal frame building is considered in this paper. The proposed genetic algorithm (GA) optimizer considers both topology (i.e., frame spacing and pitch) and cross-sectional sizes of the main structural members as the decision variables. Previous GAs in the literature were characterized by poor convergence, including slow progress, that usually results in excessive computation times and/or frequent failure to achieve an optimal or near-optimal solution. This is the main issue addressed in this paper. In an effort to improve the performance of the conventional GA, a niching strategy is presented that is shown to be an effective means of enhancing the dissimilarity of the solutions in each generation of the GA. Thus, population diversity is maintained and premature convergence is reduced significantly. Through benchmark examples, it is shown that the efficient GA proposed generates optimal solutions more consistently. A parametric study was carried out, and the results included. They show significant variation in the optimal topology in terms of pitch and frame spacing for a range of typical column heights. They also show that the optimized design achieved large savings based on the cost of the main structural elements; the inclusion of knee braces at the eaves yield further savings in cost, that are significant.

Wireless Networks with Energy Harvesting and Power Transfer: Joint Power and Time Allocation

In this letter, we consider wireless powered communication networks which could operate perpetually, as the base station (BS) broadcasts energy to the multiple energy harvesting (EH) information transmitters. These employ “harvest then transmit” mechanism, as they spend all of their energy harvested during the previous BS energy broadcast to transmit the information towards the BS. Assuming time division multiple access (TDMA), we propose a novel transmission scheme for jointly optimal allocation of the BS broadcasting power and time sharing among the wireless nodes, which maximizes the overall network throughput, under the constraint of average transmit power and maximum transmit power at the BS. The proposed scheme significantly outperforms “state of the art” schemes that employ only the optimal time allocation. If a single EH transmitter is considered, we generalize the optimal solutions for the case of fixed circuit power consumption, which refers to a much more practical scenario.

Day-Ahead Optimal Charging/Discharging Scheduling for Electric Vehicles in Micro-Grids

A micro-grid is an autonomous system which can be operated and connected to an external system or isolated with the help of energy storage systems (ESSs). While the daily output of distributed generators (DGs) strongly depends on the temporal distribution of natural resources such as wind and solar, unregulated electric vehicle (EV) charging demand will deteriorate the imbalance between the daily load and generation curves. In this paper, a statistical model is presented to describe daily EV charging/discharging behaviour. An optimisation problem is proposed to obtain economic operation for the micro-grid based on this model. In day-ahead scheduling, with estimated information of power generation and load demand, optimal charging/discharging of EVs during 24 hours is obtained. A series of numerical optimization solutions in different scenarios is achieved by serial quadratic programming. The results show that optimal charging/discharging of EVs, a daily load curve can better track the generation curve and the network loss and required ESS capacity are both decreased. The paper also demonstrates cost benefits for EVs and operators.

Experimental design and batch experiments for optimization of Cr(VI) removal from aqueous solutions by hydrous cerium oxide nanoparticles

Hydrous cerium oxide (HCO) was synthesized by intercalation of solutions of cerium(III) nitrate and sodium hydroxide and evaluated as an adsorbent for the removal of hexavalent chromium from aqueous solutions. Simple batch experiments and a 2⁵ factorial experimental design were employed to screen the variables affecting Cr(VI) removal efficiency. The effects of the process variables; solution pH, initial Cr(VI) concentration, temperature, adsorbent dose and ionic strength were examined. Using the experimental results, a linear mathematical model representing the influence of the different variables and their interactions was obtained. Analysis of variance (ANOVA) demonstrated that Cr(VI) adsorption significantly increases with decreased solution pH, initial concentration and amount of adsorbent used (dose), but slightly decreased with an increase in temperature and ionic strength. The optimization study indicates 99% as the maximum removal at pH 2, 20 °C, 1.923 mM of metal concentration and a sorbent dose of 4 g/dm³. At these optimal conditions, Langmuir, Freundlich and Redlich–Peterson isotherm models were obtained. The maximum adsorption capacity of Cr(VI) adsorbed by HCO was 0.828 mmol/g, calculated by the Langmuir isotherm model. Desorption of chromium indicated that the HCO adsorbent can be regenerated using NaOH solution 0.1 M (up to 85%). The adsorption interactions between the surface sites of HCO and the Cr(VI) ions were found to be a combined effect of both anion exchange and surface complexation with the formation of an inner-sphere complex.

Decentralized Computation of Pareto Optimal Pure Nash Equilibria of Boolean Games with Privacy Concerns

In Boolean games, agents try to reach a goal formulated as a Boolean formula. These games are attractive because of their compact representations. However, few methods are available to compute the solutions and they are either limited or do not take privacy or communication concerns into account. In this paper we propose the use of an algorithm related to reinforcement learning to address this problem. Our method is decentralized in the sense that agents try to achieve their goals without knowledge of the other agents’ goals. We prove that this is a sound method to compute a Pareto optimal pure Nash equilibrium for an interesting class of Boolean games. Experimental results are used to investigate the performance of the algorithm.