Total Site Hydrogen Integration with fresh hydrogen of multiple quality and waste hydrogen recovery in refineries

This paper proposes a novel method combining Pinch Methodology and waste hydrogen recovery, aiming to minimise fresh hydrogen consumption and waste hydrogen discharge. The method of multiple-level resource Pinch Analysis is extended to the level of Total Site Hydrogen Integration by considering fresh hydrogen sources with various quality. Waste hydrogen after Total Site Integration is further regenerated. The technical feasibility and economy of the various purification approaches are considered, demonstrated with a case study of a refinery hydrogen network in a petrochemical industrial park. The results showed that fresh hydrogen usage and waste hydrogen discharge could be reduced by 21.3% and 67.6%. The hydrogen recovery ratio is 95.2%. It has significant economic benefits and a short payback period for Total Site Hydrogen Integration with waste hydrogen purification. The proposed method facilitates the reuse of waste hydrogen before the purification process that incurs an additional environmental footprint. In line with the Circular Economy principles, hydrogen resource is retained in the system as long as possible before discharge.     

Structural analysis and optimization of a tethered swept wing for airborne wind energy generation

In this paper, we present an aero‐structural model of a tethered swept wing for airborne wind energy generation. The carbon composite wing has neither fuselage nor actuated aerodynamic control surfaces and is controlled entirely from the ground using three separate tethers. The computational model is efficient enough to be used for weight optimisation at the initial design stage. The main load‐bearing wing component is a nontypical “D”‐shaped wing‐box, which is represented as a slender carbon composite shell and further idealised as a stack of two‐dimensional cross section models arranged along an anisotropic one‐dimensional beam model. This reduced 2+1D finite element model is then combined with a nonlinear vortex step method that determines the aerodynamic load. A bridle model is utilised to calculate the individual forces as a function of the aerodynamic load in the bridle lines that connect the main tether to the wing. The entire computational model is used to explore the influence of the bride on the D‐box structure. Considering a reference D‐box design along with a reference aerodynamic load case, the structural response is analysed for typical bridle configurations. Subsequently, an optimisation of the internal geometry and laminate fibre orientations is carried out using the structural computation models, for a fixed aerodynamic and bridle configuration. Aiming at a minimal weight of the wing structure, we find that for the typical load case of the system, an overall weight savings of approximately 20% can be achieved compared with the initial reference design.     

Robust optimisation of sustainable food grain transportation with uncertain supply and intentional disruptions

The proliferating need for sustainability intervention in food grain transportation planning is anchoring the attention of researchers in the interests of stakeholders and environment at large. Uncertainty associated with food grain supply further intensifies the problem steering the need for designing robust, cost-efficient and sustainable models. In line with this, this paper aims to develop a robust and sustainable intermodal transportation model to facilitate single type of food grain commodity shipments while considering procurement uncertainty, greenhouse gas emissions, and intentional hub disruption. The problem is designed as a mixed integer non-linear robust optimisation model on a hub and spoke network for evaluating near optimal shipment quantity, route selection and hub location decisions. The robust optimisation approach considers minimisation of total relative regret associated with total cost subject to several real-time constraints. A version of Particle Swarm Optimisation with Differential Evolution is proposed to tackle the resulting NP-hard problem. The model is tested with two other state-of the art meta-heuristics for small, medium, and large datasets subject to different procurement scenarios inspired from real time food grain operations in Indian context. Finally, the solution is evaluated with respect to total cost, model and solution robustness for all instances.     

基于学科竞赛的中医药类院校程序设计课程教学模式的探索

高素质人才培养是我国可持续发展战略、科教兴国战略以及人才强国战略等多项发展战略的一项基础性工程。本文针对中医药类院校程序设计类课程实践教学模式单一等教学实际，以“学科竞赛”为平台，“赛教结合”为理念，以《C语言程序设计》为例，从现存问题、赛教结合模式的引入、建立实施及其评价机制4个方面展开阐述，旨在提高学生学习积极性和能力。     

Theoretical framework for formulating MIP scheduling models with multiple and non-uniform discrete-time grids

We present a framework for the formulation of MIP scheduling models based on multiple and nonuniform discrete time grids. In a previous work we showed that it is possible to use different (possibly non-uniform) time grids for each task, unit, and material. Here, we generalize these ideas to account for general resources, and a range of processing characteristics such as limited intermediate storage and changeovers. Each resource has its own grid based on resource consumption and availability allowing resource constraints to be modeled more accurately without increasing the number of binary variables. We develop algorithms to define the unit-, task-, material-, and resource-specific grids directly from problem data. Importantly, we prove that the multi-grid formulation is able to find a schedule with the same optimal objective as the discrete-time single-grid model with an arbitrarily fine grid. The proposed framework leads to the formulation of models with reduced number of binary variables and constraints, which are able to find good solutions faster than existing models.     

基于Stateflow电力机车变流器控制设计与实现

某出口型号交流电力机车牵引控制系统要求变流器控制逻辑具备接触器控制、牵引系统数据交互、变流器故障保护、变流器启动自检等功能。针对以上功能,基于MATLAB中的Simulink/Stateflow可视化编程工具进行牵引控制模型的搭建,遵循模块化编程理念,采用较少的程序代码编写实现复杂的逻辑控制模型,生成逻辑清晰的控制功能流程图,进行半实物仿真测试,增强控制模型的可靠性。通过该变流器产品型式试验检验,验证变流器控制逻辑的功能可以满足控制系统的需求。     

Multi-objective particle swarm optimisation based integrated production inventory routing planning for efficient perishable food logistics operations

Sustainable and efficient food supply chain has become an essential component of one’s life. The model proposed in this paper is deeply linked to people's quality of life as a result of which there is a large incentive to fulfil customer demands through it. This proposed model can enhance food quality by making the best possible food quality accessible to customers, construct a sustainable logistics system considering its environmental impact and ensure the customer demand to be fulfilled as fast as possible. In this paper, an extended model is examined that builds a unified planning problem for efficient food logistics operations where four important objectives are viewed: minimising the total expense of the system, maximising the average food quality along with the minimisation of the amount of CO₂ emissions in transportation along with production and total weighted delivery lead time minimisation. A four objective mixed integer linear programming model for intelligent food logistics system is developed in the paper. The optimisation of the formulated mathematical model is proposed using a modified multi-objective particle swarm optimisation algorithm with multiple social structures: MO-GLNPSO (Multi-Objective Global Local Near-Neighbour Particle Swarm Optimisation). Computational results of a case study on a given dataset as well as on multiple small, medium and large-scale datasets followed by sensitivity analysis show the potency and effectiveness of the introduced method. Lastly, there has been a scope for future study displayed which would lead to the further progress of these types of models.     

Exactly satisfying initial conditions neural network models for numerical treatment of first Painlevé equation

In this paper, novel computing approach using three different models of feed-forward artificial neural networks (ANNs) are presented for the solution of initial value problem (IVP) based on first Painlevé equation. These mathematical models of ANNs are developed in an unsupervised manner with capability to satisfy the initial conditions exactly using log-sigmoid, radial basis and tan-sigmoid transfer functions in hidden layers to approximate the solution of the problem. The training of design parameters in each model is performed with sequential quadratic programming technique. The accuracy, convergence and effectiveness of the proposed schemes are evaluated on the basis of the results of statistical analyses through sufficient large number of independent runs with different number of neurons in each model as well. The comparisons of these results of proposed schemes with standard numerical and analytical solutions validate the correctness of the design models.     

Reliability of complex chemical engineering processes

This paper presents a stochastic performance modelling approach that can be used to optimise design and operational reliability of complex chemical engineering processes. The framework can be applied to processes comprising multiple units, including the cases where closed form process performance functions are unavailable or difficult to derive from first principles, which is often the case in practice. An interface that facilitates automated two-way communication between Matlab^® and process simulation environment is used to generate large process responses. The resulting constrained optimisation problem is solved using both Monte Carlo Simulation (MCS) and First Order Reliability Method (FORM); providing a wide range of stochastic process performance measures. Adding such capabilities to traditional deterministic process simulators provides a more informed basis for selecting optimum design factors; giving a simple way of enhancing overall process reliability and cost-efficiency. Two case study systems are considered to highlight the applicability and benefits of the approach.     

Mathematical representation of radiality constraint in distribution system reconfiguration problem

Distribution systems are most commonly operated in a radial configuration for a number of reasons. In order to impose radiality constraint in the optimal network reconfiguration problem, an efficient algorithm is introduced in this paper based on graph theory. The paper shows that the normally followed methods of imposing radiality constraint within a mixed-integer programming formulation of the reconfiguration problem may not be sufficient. The minimum-loss network reconfiguration problem is formulated using different ways to impose radiality constraint. It is shown, through simulations, that the formulated problem using the proposed method for representing radiality constraint can be solved more efficiently, as opposed to the previously proposed formulations. This results in up to 30% reduction in CPU time for the test systems used in this study.