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

Short-term optimal scheduling of cascade hydropower plants shaving peak load for multiple power grids

RENEWABLE ENERGY 2022年第0期184卷 68-79页

作者： Wang, Peilin Yuan, Wenlin Su, Chengguo Wu, Yang Lu, Lu Yan, Denghua Wu, Zening Zhengzhou Univ Sch Hydraul Sci & Engn Zhengzhou 450001 Peoples R China Yunnan Power Grid Co Ltd Power Dispatching & Control Ctr Kunming 650011 Yunnan Peoples R China China Inst Water Resources & Hydropower Res Water Resources Dept Beijing 100038 Peoples R China

Cascade hydropower plants which have good regulation performance and are managed by the dis-patching center of regional power grids are usually required to simultaneously shave the peak load for multiple provincial power grids, which is an important way of relieving the growing peak shaving pressure on power grids in central and eastern China. This paper establishes an optimization model for the short-term generation scheduling of cascade hydropower plants in regional power grids. In this model, minimizing the peak-valley load difference of multiple power grids is adopted as the objective function. In addition to conventional hydraulic constraints, the operation constraints of individual hy-dropower units, electrical constraints and head effect on the power generation are all considered to obtain precise scheduling. The original nonlinear and non-convex model is converted into a standard mixed-integer linear programming (MILP) formulation through several linearization strategies. The re-sults for the real-world case study indicate that: 1) the proposed model is computationally efficient with a calculation time of 326 s;2) the peak-valley differences of the Shanghai Power Grid and Zhejiang Power Grid decreased by 9.71% and 2.29%, respectively;3) compared with actual operation, the proposed model shows better performance in peak shaving for multiple provincial power grids. (c) 2021 Elsevier Ltd. All rights reserved.

关键词： Cascade hydropower plants Peak shaving Regional power grid mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A novel location-inventory-routing problem in a two-stage red meat supply chain with logistic decisions: evidence from an emerging economy

引用

KYBERNETES 2022年第4期51卷 1498-1531页

作者： Rahbari, Misagh Razavi Hajiagha, Seyed Hossein Amoozad Mahdiraji, Hannan Riahi Dorcheh, Farshid Garza-Reyes, Jose Arturo Kharazmi Univ Dept Ind Engn Tehran Iran Khatam Univ Fac Management & Finance Dept Management Tehran Iran De Montfort Univ Leicester Castle Business Sch Leicester Leics England Univ Tehran Fac Management Tehran Iran Univ Tehran Fac Agr Econ & Dev Dept Agr Econ Karaj Iran Univ Derby Ctr Supply Chain Improvement Derby England

Purpose This study focuses on a specific method of meat production that involves carcass purchase and meat production by packing facilities with a novel two-stage model that simultaneously considers location-routing and inventory-production operating decisions. The considered problem aims to reduce variable and fixed transportation and production costs, inventory holding cost and the cost of opening cold storage facilities. Design/methodology/approach The proposed model encompasses a two-stage model consisting of a single-echelon and a three-echelon many-to-many network with deterministic demand. The proposed model is a mixed-integer linear programming (MILP) model which was tested with the general algebraic modelling system (GAMS) software for a real-world case study in Iran. A sensitivity analysis was performed to examine the effect of retailers' holding capacity and supply capacity at carcass suppliers. Findings In this research, the number of products transferred at each level, the number of products held, the quantity of red meat produced, the required cold storage facilities and the required vehicles were optimally specified. The outcomes indicated a two percent (2%) decrease in cost per kg of red meat. Eventually, the outcomes of the first and second sensitivity analysis indicated that reduced retailers' holding capacity and supply capacity at carcass suppliers leads to higher total costs. Originality/value This research proposes a novel multi-period location-inventory-routing problem for the red meat supply chain in an emerging economy with a heterogeneous vehicle fleet and logistics decisions. The proposed model is presented in two stages and four-echelon including carcass suppliers, packing facilities, cold storage facilities and retailers.

关键词： Two-stage supply chain Location-inventory-routing problem Transportation and logistic decisions mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Critical Propagation Path Identification for Cascading Overload Failures With Multi-Stage MILP

引用

IEEE ACCESS 2022年 10卷 117561-117571页

作者： Wang, Leibao Zeng, Siming Liang, Jifeng Fan, Hui Li, Tiecheng Luo, Peng Rong, Shiyang Hu, Bo State Grid Hebei Elect Power Res Inst Shijiazhuang 050021 Peoples R China State Grid Hebei Elect Power Supply Co Ltd Shijiazhuang 050022 Peoples R China Chongqing Univ State Key Lab Power Transmiss Equipment & Syst Sec Chongqing 400044 Peoples R China

Cascading overload failures of transmission lines are one of the dominant factors that induce catastrophic blackouts. The reliability risk of cascading overload failures is significantly underestimated in traditional adequacy assessment studies. This paper proposes an evaluation model for the assessment of N-k contingencies as cascading overloading failures. The interactions between outaged lines in the propagation path are revealed with a multi-stage optimization problem. The objective function is to maximize the probability of the propagation path of cascading overload failures. Several linearization techniques are proposed to convert the nonlinear evaluation model to mixed-integer linear programming. A rolling search algorithm is adopted to improve the capability of the proposed model to evaluate high-order contingencies. The case studies on the IEEE 118-bus systems show that the proposed model enables the identification of critical propagation paths with probabilities that are a few orders of magnitude larger than those with the traditional method.

关键词： Cascading overload failures mixed-integer linear programming propagation path N-k contingencies reliability risk

来源：评论

学校读者我要写书评

暂无评论

A stochastic programming model for the aircraft sequencing and scheduling problem considering flight duration uncertainties

引用

AERONAUTICAL JOURNAL 2022年第1304期126卷 1736-1751页

作者： Cecen, R. K. Eskisehir Osmangazi Univ Eskisehir Turkey

This study presents a stochastic mixed-integer linear programming model for the aircraft sequencing and scheduling problem. The proposed model aims to minimise the average fuel consumption per aircraft in the Terminal Manoeuvring Area while considering uncertain flight durations for each flight. The tabu search algorithm was selected to solve the problem. The stochastic solution and deterministic solution results were compared to show the benefits of the stochastic solution. The average sample approximation technique was applied to this problem, and enhancement rates of the average fuel consumption per aircraft were 8.78% and 9.11% comparing the deterministic approach

关键词： Aircraft sequencing and scheduling problem Stochastic programming mixed-integer linear programming Fuel consumption Tabu search algorithm

来源：评论

学校读者我要写书评

暂无评论

Intelligent computational design of scalene-faceted flat-foldable tessellations

引用

JOURNAL OF COMPUTATIONAL DESIGN AND ENGINEERING 2022年第5期9卷 1765-1774页

作者： Chen, Yao Lu, Chenhao Yan, Jiayi Feng, Jian Sareh, Pooya Southeast Univ Key Lab Concrete & Prestressed Concrete Struct Minist Educ Nanjing 211189 Peoples R China Southeast Univ Natl Prestress Engn Res Ctr Nanjing 211189 Peoples R China Air Force Engn Univ Shaanxi Key Lab Artificially Struct Funct Mat & Xian 710051 Peoples R China Univ Liverpool Sch Engn Dept Mech Mat & Aerosp Engn Creat Design Engn Lab Cdel Brownlow Hill Liverpool L69 3GH Merseyside England

Origami tessellations can be folded from a given planar pattern into a three-dimensional object with specific geometric properties, inspiring developments in various fields of science and engineering such as deployable structures, energy absorption devices, reconfigurable robots, and metamaterials. However, the range of existing origami patterns with functional properties such as flat-foldability is rather scant, as analytical solutions to constraint equations arising in the design process are generally highly complicated. In this paper, we tackle the challenging problem of automated design of scalene-faceted flat-foldable origami tessellations using an efficient metaheuristic algorithm. To this end, this study establishes constraint curves based on compatibility conditions for all six-fold (i.e., degree-6) vertices. Subsequently, a graphical method and a particle swarm optimization (PSO) method are adopted to produce optimal origami patterns. Moreover, mountain-valley assignments for the obtained geometric designs are determined using a computational approach based on mixed-integer linear programming. It turns out that the flat-foldable internal vertices of each C-2-symmetric unit fragment (UF) exist as C-2-symmetric pairs about the centroid of the UF. Furthermore, numerical experiments are carried out to examine the feasibility and compare the accuracy, computational efficiency, and global convergence of the proposed methods. The results of numerical experiments demonstrated that, in comparison with the graphical method, the proposed PSO method has not only a higher accuracy but also a significantly lower computational cost, enabling us to develop an intelligent computational platform to efficiently design scalene-faceted flat-foldable origami tessellations.

关键词： computational design origami tessellation metaheuristic optimization particle swarm optimization mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Multistage Planning Model for Active Distribution Systems and Electric Vehicle Charging Stations Considering Voltage-Dependent Load Behavior

引用

IEEE TRANSACTIONS ON SMART GRID 2022年第2期13卷 1383-1397页

作者： Mejia, Mario A. Macedo, Leonardo H. Munoz-Delgado, Gregorio Contreras, Javier Padilha-Feltrin, Antonio Sao Paulo State Univ Dept Elect Engn BR-15385000 Ilha Solteira Brazil Univ Castilla La Mancha Escuela Tecn Super Ingn Ind Ciudad Real 13071 Spain

This work proposes a novel mixed-integer linear programming model for the medium-term multistage planning of active distribution systems and electric vehicle charging stations (EVCSs). Investment alternatives include the installation of conductors, capacitor banks, voltage regulators, dispatchable and nondispatchable distributed generation, energy storage units, and EVCSs. Hence, the model identifies the best size, location, and installation time for the candidate assets under the uncertainty associated with electricity demand, energy prices, renewable energy sources, and EVCSs' load profiles. Unlike classical planning approaches, conventional load is modeled as voltage-dependent. Besides, EVCSs are planned by zones to optimize the coverage of the service provided to users of electric vehicles and to reduce the discrepancy between the geographical requirements and the optimal locations for the installation of EVCSs in the system. EVCSs' load profiles are calculated using a travel simulation algorithm based on real travel patterns that consider fast, slow, and residential chargers. Moreover, as another salient feature, constraints for CO2 emissions are incorporated into the model. The resulting model is formulated as a stochastic scenario-based program, which is driven by the minimization of the total expected cost. Tests are conducted using a 69-node system to demonstrate the effectiveness of the proposed model.

关键词： Conductors Load modeling Investment Costs Planning Renewable energy sources Uncertainty Active distribution systems electric vehicle charging stations mixed-integer linear programming multistage planning voltage-dependent load model

来源：评论

学校读者我要写书评

暂无评论

A matheuristic for AGV scheduling with battery constraints

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2022年第3期298卷 855-873页

作者： Singh, Nitish Dang, Quang-Vinh Akcay, Alp Adan, Ivo Martagan, Tugce Eindhoven Univ Technol Dept Ind Engn & Innovat Sci POB 513 NL-5600 MB Eindhoven Netherlands

This paper considers the problem of scheduling automated guided vehicles (AGVs) with battery constraints. Each transport request involves a soft time window, and the AGV fleet used to service those requests is heterogeneous with a diverse set of capabilities and travel costs. In contrast to the existing literature, each transport request may require different AGV material handling capabilities (such as lift loads, tow loads, or handle loads with a mounted robot arm), and the AGV batteries can be recharged partially under consideration of a critical battery threshold. The problem is to assign the transport and charging requests to AGVs, sequence the requests, and determine their starting times and the recharging durations of the AGVs with the objective of minimizing a weighted sum of the tardiness costs of transport requests and travel costs of AGVs. A mixed-integer linear programming model is formulated. We also propose a new matheuristic that makes use of an adaptive large neighborhood search algorithm and a linear program to solve industry-size instances. We illustrate the efficacy of our approach with an industry case study using real-world data. (c) 2021 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY license ( http://***/licenses/by/4.0/ )

关键词： Scheduling Automated guided vehicles Adaptive large neighborhood search mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A Recycling Routing Problem of Broken Bikes With Incentives in Bike Sharing Systems

引用

IEEE ACCESS 2022年 10卷 106191-106201页

作者： Xu, Guoxun Zou, An Hainan Univ Sch Tourism Haikou 570228 Hainan Peoples R China

In recent years, the truck-based broken bike recycling mode (i.e., dedicated trucks deal with all transportation activities of broken bikes) in bike sharing systems (BSSs) has led to some problems in China, such as BSS operators have no willingness to collect broken bikes from a bike station in time. As a result, many BSSs are in bad condition due to an increase in the number of broken bikes. To solve this problem, many cities in China have started to introduce a new broken bike recycling mode, where some citizens (i.e., sanitation workers, freelancers, volunteers, etc.) are incentivized to participate in recycling activities. To deal with this new recycling mode, a recycling routing problem of broken bikes with incentives in BSSs is proposed, where the recycling operation is performed by citizen participants and a fleet of homogeneous trucks. Participants are incentivized to relocate broken bikes scattered in a BSS to transshipment stations in exchange for monetary rewards, and then these broken bikes are transported from transshipment stations to the depot by trucks. The problem is formulated as a mixed-integer linear programming model to minimize the total operation cost, and an efficient modified tabu search is developed to solve the proposed problem. Experimental results reveal the proposed broken bike recycling mode is beneficial for BSS operators to reduce the operation cost. Experimental results also show the proposed modified tabu search can generate high-quality solutions in short computing times.

关键词： Bicycles Costs Urban areas Search problems Vehicle routing Transportation Routing mixed integer linear programming Bike sharing vehicle routing problem broken bike mixed-integer linear programming tabu search

来源：评论

学校读者我要写书评

暂无评论

Inventory Positioning in Supply Chain Network: A Service-Oriented Approach

引用

IEEE ACCESS 2022年 10卷 92986-93002页

作者： Nguyen Trong Tri Duc Pham Duc Tai Buddhakulsomsiri, Jirachai Thammasat Univ Sch Mfg Syst & Mech Engn Sirindhorn Int Inst Technol Khlong Luang 12120 Pathum Thani Thailand

This study develops a mixed-integer linear programming model based on a guaranteed service approach for an inventory positioning problem in a supply chain under the base stock inventory policy. Our proposed model aims to determine appropriate inventory positions and amounts and the optimal service level for the supply chain to minimize the total cost of safety inventory holding and shortage. Two demand scenarios, based on normal and empirical distributions, are investigated. An extensive numerical experiment is conducted to illustrate the applicability and effectiveness of our model, especially under empirical distribution. The experiment features a practical network structure and demand data from an industrial user. Moreover, to further validate the experimental results from the mathematical model, they are compared with the result from a simulation model, which is constructed to imitate the operations of the supply chain. The comparison result indicates that the model solution under the empirical demand distribution is close to the simulation regarding the difference in the total cost (less than 1%). This solution significantly outperforms the model solution under the normal demand, which results in a significant difference in total cost (more than 25%) compared to the simulation.

关键词： Supply chains Safety Mathematical models Costs Uncertainty Stochastic processes inventory control linear programming Base stock policy empirical demand guaranteed service approach inventory positioning mixed-integer linear programming multi-echelon inventory system multiple cycle service levels safety stock placement

来源：评论

学校读者我要写书评

暂无评论

MIP Outer Belief Approximations of Lower Conditional Joint CDFs in Statistical Matching Problems 16th

MIP Outer Belief Approximations of Lower Conditional Joint ...

引用

16th International Conference on Scalable Uncertainty Management, SUM 2024

作者： Baioletti, Marco Capotorti, Andrea Petturiti, Davide Vantaggi, Barbara University of Perugia Perugia Italy Sapienza University of Rome Rome Italy

ISBN: (纸本)9783031762345

We propose a mixed integer programming (MIP) procedure to find an outer belief approximation of a lower conditional joint cumulative distribution function (lower conditional joint CDF) obtained by the statistical matching of several sources of information, given a common variable. We assume that the variables have finite supports and we provide a procedure based on the MIP technique that produces a sparse solution with at most a given finite number of focal elements, permitting to obtain an outer approximation with a conditional belief function. In turn, the family of sparse solutions given the common variable, allows us to efficiently perform coherent inferences on new items, relying on the generalized Bayesian conditioning rule. We finally show the effectiveness of the proposed approach in the domain of company fraud detection. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：