检索结果-内蒙古大学图书馆

Potential and economic viability of green hydrogen production from seawater electrolysis using renewable energy in remote Japanese islands

引用

RENEWABLE ENERGY 2023年 202卷 1436-1447页

作者： He, Hongjing Huang, Yongyi Nakadomari, Akito Masrur, Hasan Krishnan, Narayanan Hemeida, Ashraf M. Mikhaylov, Alexey Senjyu, Tomonobu Univ Ryukyus Fac Engn 1 Senbaru Okinawa 9030213 Japan King Fahd Univ Petr & Minerals Interdisciplinary Res Ctr Smart Mobil & Logist Dhahran Saudi Arabia SASTRA Deemed Univ Dept Elect & Elect Engn Thanjavur 613401 India Aswan Univ Fac Energy Engn Aswan 81528 Egypt Financial Univ Govt Russian Federat Financial markets & Financial Engn Dept Moscow Russia

Remote island power systems face high equipment costs when introducing renewable energy technologies. Lowering input costs is essential for any setup, but it is especially important for these integrated systems. Electrolysis of seawater is a good option for islands with abundant seawater resources since the green hydrogen produced may be used to create power and excess green hydrogen and Sodium hypochlorite as a by-product can be sold to reduce costs. This study compares three cases. Case 1 mixes solar, wind, and batteries to satisfy load needs. Cases 2 and 3 are based on Case 1 and apply to a seawater electrolysis plant. Case 2 does not account chemical product earnings, whereas Case 3 does. Total cost of the power system and CO2 total emissions were employed as optimization metrics, using k-means to simplify annual data and MILP to model optimal operation and capacity. Case 3 cuts costs by 16.6% and CO2 by 13.2% compared to Case 1. The initiative proposes producing and selling green hydrogen and sodium hypochlorite on remote islands by electrolyzing seawater to reduce carbon emissions and costs.

关键词： Seawater electrolysis Renewable energy systems k-means mixed integer linear programming Green hydrogen Chemical product earnings

来源：评论

学校读者我要写书评

暂无评论

Optimal capacitor placement in northern region of Bangladesh transmission network for voltage profile improvement

引用

ENERGY REPORTS 2023年 9卷 1896-1909页

作者： Masood, Nahid-Al Jawad, Atik Ahmed, Kazi Toukir Islam, Sk. Razibul Islam, M. Asiful Bangladesh Univ Engn & Technol Dept Elect & Elect Engn Dhaka 1205 Bangladesh Univ Liberal Arts Bangladesh Dept Elect & Elect Engn Dhaka 1207 Bangladesh Power Grid Co Bangladesh Ltd Dhaka 1212 Bangladesh

This paper solves the problem of optimal placement of shunt capacitors in the northern region of Bangladesh transmission network. During network augmentation event like very high inductive reactive load condition, the weakened voltage profile of the buses can be compensated by optimum allocation of the capacitor banks. In this regard, the aim of this problem is to minimise the costs associated with capacitor banks, transmission system losses and voltage profile improvement whilst satisfying various constraints. mixed integer linear programming method is introduced for the discrete optimisation problem of placing capacitors in transmission system for cost minimisation and voltage profile improvement. In this proposed formulation, sensitivity dependent voltage magnitude is taken into account for the selection of candidate buses. It is also shown that voltage profile is linearly dependent on reactive load. Therefore, load modelling is done carefully to get a more realistic image of the overall outcomes. The proposed methodology yields integer number of capacitors of particular sizes to be placed on best suited buses. In addition, the proposed approach is applied to IEEE 39 bus system and 33 bus real transmission system of northern region of Bangladesh power system Furthermore, a thorough performance comparison with an existing state-of-the-art capacitor placement method is also performed for validation. The simulation results demonstrate that the proposed methodology is capable of producing optimised solution while successfully mitigating the low voltage issue. Moreover, the proposed approach shows enhanced voltage profile of the buses at a reduced reactive support size than the existing approach.(c) 2023 The Author(s). Published by Elsevier Ltd. This is an open access article under the CC BY license (http://***/licenses/by/4.0/).

关键词： Capacitor placement Transmission system planning mixed integer linear programming Sensitivity analysis Bangladesh power system

来源：评论

学校读者我要写书评

暂无评论

Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2023年第3期306卷 1219-1235页

作者： Ji, Bin Zhang, Zheng Yu, Samson S. Zhou, Saiqi Wu, Guohua Cent South Univ Sch Traff & Transportat Engn Changsha 410075 Peoples R China Deakin Univ Sch Engn Waurn Ponds Vic 3216 Australia

In light of the existing practical applications of the two-dimensional loading on vehicle scheduling and many-to-many supply-demand relationships between suppliers and customers, we address a many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading con-straints (or the heterogeneous 2L-MVRPCD). The newly proposed problem can be regarded as a general-ized problem of the many-to-many vehicle routing with cross-docking (MVRPCD) and capacitated vehicle routing problem with two-dimensional loading constraints (2L-CVRP). To solve small-scale 2L-MVRPCDs, a mixed integer linear programming (MILP) model is developed, whereas two hybrid optimization heuristic algorithms are proposed to solve large-scale 2L-MVRPCDs. The first heuristic incorporates a basic adaptive large neighborhood search (ALNS) algorithm and a new best-fit-skyline (BFS) packing heuristic, while the second heuristic, a Tabu-based ALNS (ALNS/TS), extends the first one by embedding an insert-tabu strat-egy to enhance the intensity and diversity of search. Wide-ranging instances with various many-to-many supply-demand scenarios and different loading configurations are employed to verify the efficacy of the proposed MILP model and two heuristics. Numerical results show that small-scale heterogeneous 2L-MVRPCD instances with and without the rotation constraints can be solved to optimality by commercial solvers, and the proposed heuristics can achieve high-quality solutions within a reasonable computational time for large-scale instances. Meanwhile, the comparison between the proposed heuristics and existing methods verifies the effectiveness and applicability of the proposed heuristics for solving MVRPCD and 2L-CVRP.(c) 2022 Elsevier B.V. All rights reserved.

关键词： Routing Cross-docking Loading constraints Tabu-based adaptive large neighborhood search mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A low-carbon, fixed-tour scheduling problem with time windows in a time-dependent traffic environment

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2023年第18期61卷 6177-6196页

作者： Zhang, Siyue Zhou, Shenghan Luo, Rui Zhao, Runze Xiao, Yiyong Xu, Yuchun Beihang Univ Sch Reliabil & Syst Engn Beijing 100191 Peoples R China Aston Univ Sch Engn & Appl Sci Birmingham England

Traffic congestion is a major concern in urban transportation in supply chain management. Road-based logistic companies can mitigate their Carbon dioxide (CO2) emissions effectively by optimising their operation. In this study, we observed a low-carbon, fixed-tour scheduling problem with time windows (LC-FTSP-TW) that is designed to consider the factors that can minimise the greenhouse-gas emissions of logistics systems. Through better planning of the delivery times, we delineated a system to control the schedules of two vehicle types: fossil-fuel-powered and electric-powered vehicles. We formulated the LC-FTSP-TW as a mixed-integer linear programming model that can take into consideration time-varying traffic conditions, customer time windows, and vehicle energy-consumption functions. The proposed model was observed to be convenient for practical use, as it could be solved directly using commercial optimisation toolboxes, such as CPLEX and Gurobi, with continuous optimal results. In addition, we developed an efficient dynamic programming algorithm for solving large-sized problems with discrete optimal results. Computational experiments were conducted on a group of test instances to verify the proposed model and algorithm, which demonstrated considerable reductions in CO2 emissions compared to non-optimised solutions for both the tested fossil-fuel-powered and electric-powered vehicles.

关键词： Dynamic programming green supply chain mixed integer linear programming carbon dioxide emissions optimisation

来源：评论

学校读者我要写书评

暂无评论

Computationally Efficient Collision-Free Trajectory Planning of Satellite Swarms Under Unmodeled Orbital Perturbations

引用

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 2023年第8期46卷 1548-1563页

作者： Basu, Himadri Pedari, Yasaman Almassalkhi, Mads Ossareh, Hamid R. Univ Grenoble Alpes Grenoble Images Parole Signal Automat Lab CNRS F-38000 Grenoble France Univ Vermont Dept Elect & Biomed Engn Burlington VT 05405 USA

This paper studies the problem of collision-free trajectory planning for a satellite swarm reconfiguration under perturbations and modeling uncertainties in a low Earth orbit (LEO). Determining exact trajectory planning solutions is computationally heavy as they require solving a mixed-integer nonlinear program owing to i) nonlinear relative dynamic models of satellites, ii) fuel-optimal assignment of satellites on the final formation, and iii) nonconvex collision avoidance constraints. To address these, first, a suitable linear model for trajectory planning is identified by quantifying modeling accuracy associated with various models capturing LEO perturbations. The effects of any residual modeling errors in the path prediction are mitigated by shrinking-horizon model-predictive feedback control, which updates the control command based on the latest satellite measurements. Secondly, an optimal swarm configuration is efficiently computed by decoupling the target-assignment algorithm from the trajectory optimization problem. Based on the estimated fuel expenditure for each satellite-target pairing, the target-assignment algorithm selects a configuration with minimal fuel consumption. Lastly, to determine collision-free, fuel-optimal maneuvers, two novel trajectory planning approaches, namely, distributed and decentralized trajectory optimization, are presented. While the former iteratively searches for collision-free feasible paths to optimal terminal configuration, the latter computes a near-optimal configuration with collision-free paths.

关键词： Satellite Formation Flying Pontryagin's Maximum Principle mixed integer linear programming Energy Economics Feedback Control Adaptive Control Algorithm Aircraft Operations Planets Sun Synchronous Orbit Computational Fluid Dynamics

来源：评论

学校读者我要写书评

暂无评论

Optimal operation of building microgrids - comparison with mixed-integer linear and continuous non-linear programming approaches

引用

COMPEL-THE INTERNATIONAL JOURNAL FOR COMPUTATION AND MATHEMATICS IN ELECTRICAL AND ELECTRONIC ENGINEERING 2018年第2期37卷 603-616页

作者： Reinbold, Vincent Dinh, Van-Binh Tenfen, Daniel Delinchant, Benoit Saelens, Dirk Katholieke Univ Leuven Leuven Belgium Grenoble Univ Grenoble France Inst Fed Educ Ciencia & Tecnol Santa Catarina Florianopolis SC Brazil Grenoble Univ Grenoble Elect Engn Lab G2Elab Grenoble France

PurposeThis paper aims to present two mathematical models to solve the Energy Management problem of a building microgrid (MG). In particular, it proposes a deterministic mixed integer linear programming (MILP) and non-linear programming (NLP) formulations. This paper focuses on the modelling process and the optimization performances for both approaches regarding optimal operation of near-zero energy buildings connected to an electric MG with a 24-h time horizon. Design/methodology/approachA general architecture of a MG is detailed, involving energy storage systems, distributed generation and a thermal reduced model of the grid-connected building. A continuous non-linear model is detailed along with linearizations for the mixed-integer liner formulation. Multi-physic, non-linear and non-convex phenomena are detailed, such as ventilation and air quality models. FindingsResults show that both approaches are relevant for solving the energy management problem of the building MG. Originality/valueIntroduction and modelling of the thermal loads within the MG. The resulting linear program handles the mutli-objective trade-off between discomfort and the cost of use taking into account air quality criterion. linearization and modelling of the ventilation system behaviour, which is generally non-linear and non-convex equality constraints, involving air quality model, heat transfer and ventilation power. Comparison of both MILP and NLP methods on a general use case provides a solution that can be interpreted for implementation.

关键词： Microgrid mixed integer linear programming Optimal operation Sequential quadratic programming

来源：评论

学校读者我要写书评

暂无评论

Nonlinear autoregressive prediction model for VAWT power supply network energy management

引用

ENERGY REPORTS 2025年 13卷 5446-5462页

作者： Alqahtani, Mohammed King Khalid Univ Dept Ind Engn Abha 62529 Saudi Arabia

Due to technological breakthroughs and improvements in the wind energy industry over the past few decades, wind energy is seen as one of the viable alternatives to non-renewable energy resources (such as fossil fuels). Researchers have recently focused on traffic-generated wind since it can be captured by vertical axis wind turbines (VAWT) and transformed into useful energy with sustainability. This paper presents a nonlinear autoregressive (NAR) approach to offer an energy management prediction model to forecast energy management choices for VAWTs with batteries and energy purchased from the power grid. Compared to earlier heuristic and computational methods, the developed approach is more novel and robust as it integrates MILP with ANNs, which further enables finer convergence for complex optimization functions. To identify the elements that have a major influence on the prediction's accuracy, the prediction's accuracy is evaluated in a variety of circumstances. Wind speeds, turbine swept area, battery size, and seasonality of energy demand are some of these variables. The findings indicate that seasonal variations and energy demand significantly affect the accuracy of the forecast by 69.23%, while the swept area of the turbine has the least effect, affecting the accuracy of the prediction by 15.38%. Furthermore, according to the forecast results, using VAWT under steady state conditions as a supplementary energy supply can reduce carbon emissions by up to 231 tons yearly and save up to $52,831 in energy expenses annually.

关键词： Vertical axis wind turbine Nonlinear autoregressive Renewable energy mixed integer linear programming Energy management

来源：评论

学校读者我要写书评

暂无评论

A Kernel search algorithm for virtual machine consolidation problem in cloud computing

引用

JOURNAL OF SUPERCOMPUTING 2023年第17期79卷 19277-19296页

作者： Luo, Jiang-Yao Yuan, Jian-Hua Beijing Univ Posts & Telecommun Sch Sci Beijing 100876 Peoples R China Beijing Univ Posts & Telecommun Key Lab Math & Informat Networks Minist Educ Beijing Peoples R China

Virtual machine consolidation refers to the process of reallocating virtual machines across a set of target servers. It can be formulated as a mixed integer linear programming problem, which is known to be NP-hard. In this paper, we propose a kernel search (KS) heuristic algorithm based on hard variable fixing to quickly obtain high-quality solutions for large-scale virtual machine consolidation problems (VMCPs). Since existing variable fixing strategies in KS algorithms may result in some VMCP instances being infeasible, our proposed KS algorithm employs a more efficient strategy to choose a set of fixed variables based on their corresponding reduced costs. Our numerical results on VMCP instances demonstrate that our proposed KS algorithm significantly outperforms mixed integer linear programming solvers in terms of CPU time. Moreover, our proposed strategy of variable fixing improves the efficiency of the KS algorithm significantly, with negligible degradation in solution quality.

关键词： Kernel search Heuristic algorithm mixed integer linear programming Virtual machine consolidation Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Feasibility Jump: an LP-free Lagrangian MIP heuristic

引用

MATHEMATICAL programming COMPUTATION 2023年第2期15卷 365-388页

作者： Luteberget, Bjornar Sartor, Giorgio SINTEF Forskningsveien 1 N-0373 Oslo Norway

We present Feasibility Jump (FJ), a primal heuristic for mixed-integer linear programs (MIP) using stochastic guided local search over a Lagrangian relaxation. The method is incomplete: it does not necessarily produce solutions to all feasible problems, the solutions it produces are not in general optimal, and it cannot detect infeasibility. It does, however, very quickly produce feasible solutions to many hard MIP problem instances. Starting from any variable assignment, Feasibility Jump repeatedly selects a variable and sets its value to minimize a weighted sum of constraint violations. These weights (which correspond to the Lagrangian multipliers) are adjusted for constraints that remain violated in local minima. Contrary to many other primal heuristics, Feasibility Jump does not require a solution of the continuous relaxation, which can be time-consuming for some problems. We compare FJ against FICO Xpress Solver 8.14 and we show that this heuristic is effective on a range of problems from the MIPLIB 2017 benchmark set, significantly improving the average time to find a first feasible solution. We also show that providing these quick solutions to Xpress produces a modest reduction in the average time to optimality in the same benchmark set. Our entry based on FJ to the MIP 2022 Computational Competition (which challenged participants to write LP-free MIP heuristics) won 1st place. Moreover, an implementation of Feasibility Jump now runs by default on FICO Xpress Solver 9.0, where similar results to the ones presented here could be observed.

关键词： mixed integer linear programming Metaheuristics Lagrangian relaxation Guided local search Primal heuristics

来源：评论

学校读者我要写书评

暂无评论

On the minimum number of resources for a perfect schedule

引用

CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH 2023年第1期31卷 191-204页

作者： Benmansour, Rachid Braun, Oliver Inst Natl Stat & Econ Appl SI2M Lab Rabat Morocco Trier Univ Appl Sci Environm Campus Birkenfeld D-55768 Birkenfeld Germany

In the single-processor scheduling problem with time restrictions there is one main processor and B resources that are used to execute the jobs. A perfect schedule has no idle times or gaps on the main processor and the makespan is therefore equal to the sum of the processing times. In general, more resources result in smaller makespans, and as it is in practical applications often more economic not to mobilize resources that will be unnecessary and expensive, we investigate in this paper the problem to find the smallest number B of resources that make a perfect schedule possible. We show that the decision version of this problem is NP-complete, derive new structural properties of perfect schedules, and we describe a mixed integer linear programming (MIP) formulation to solve the problem. A large number of computational tests show that (for our randomly chosen problem instances) only B = 3 or B = 4 resources are sufficient for a perfect schedule.

关键词： Minimizing the number of resources Perfect schedule Single-processor scheduling mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：