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.     

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.     

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.     

基于组合双向拍卖的云资源调度方法

针对跨数据中心的资源调度问题，提出了一种基于组合双向拍卖（PCDA）的资源调度方案。首先，将云资源拍卖分为三个部分：云用户代理报价、云资源提供商要价、拍卖代理组织拍卖；其次，在定义用户的优先级及任务紧迫度的基础上，在拍卖过程中估算每一个工作发生的服务等级协议（SLA）违规并以此计算云提供商的收益，同时每轮竞拍允许成交多项交易；最终达到根据用户等级合理分配云资源调度的效果。仿真实验结果表明该算法保证了竞拍成功率，与传统一次拍卖成交一项的组合双向拍卖方案相比，PCDA在竞拍时间段产生的能耗降低了35.00%，拍卖云提供商的利润提高了约38.84%。     

The PAR(p) Interconfigurations model used by the Brazilian Electric Sector

This study discusses the characteristics of the Periodic Autoregressive model, PAR(p), which is used to generate synthetic series of inflow energies that serve as entries for computer platforms that implement the planning and expansion of the operations of the BES – the Brazilian Electric Sector (SEB – Sistema Elétrico Brasileiro). The methodology for the design of a generating plant is presented in addition to the fundamentals of the “PAR(p) Interconfigurations” Model, which is referred to as the Inflow Energy Generation Model (IEGM) in this study. The major contribution of this study is to provide the first scientific discussion of the representation of multiple configurations using the PAR(p) model. For this purpose, several topics related to the time series are discussed, such as the definition of the model order, the matter of stationarity and the need to address possible outliers. Finally, a case study is presented, wherein the results of the estimation and generation of the described model’s scenarios are demonstrated.     

Mining fleet management systems: a review of models and algorithms

The objective of this paper is to review and document the mine fleet management systems’ models and algorithms. The purpose is to understand the algorithms behind the fleet management systems and the proposed academic solutions in this area to identify any gaps in the current literature and to open up opportunities to establish research questions that need to be addressed in an integrated simulation and optimisation operational planning research framework. In this paper, we review industrial fleet management systems and the main academic algorithms behind such systems. The fleet management systems are divided into three subsequently related problems to review: shortest path, production optimisation and real-time dispatching. Finally, the limitations of current algorithms for fleet management systems are documented in terms of mining practice feasibility and optimality of the solution on large-scale problems. The results of this literature review enable us to evaluate the logical links between major components of an integrated simulation and optimisation operational planning framework with current theory of fleet management systems.     

一种非对称互联型粒子群算法

提出了一种非对称互联型粒子群算法(AFIPSO),它是对互联型粒子群算法的改进。此算法重新构造了加权函数,体现了粒子之间的非对称影响。随后对六种加权函数及其4种交叉组合进行了测试。试验结果表明:组合加权函数对算法的收敛速度和稳定性均有非常好的改善,在收敛率上几近完美。     

Infinite-horizon Scheduling Algorithms for Optimal Search for Hidden Objects

This paper considers discrete search problems in which a decision-maker has to find objects lost or hidden in a given set of locations so as to minimize the expected losses incurred. Given a chance to look for a hidden object in the same location infinitely many times, this type of problem, in contrast to standard scheduling problems, has an infinite sequence as its solution. Thus we are concerned to find an algorithm that yields an optimal solution, rather than the optimal sequence itself. Using combinatorial techniques, fast optimal algorithms for solving the problems are obtained, and optimality conditions are presented for search criteria, under which the local-search algorithms yield the global optimum.