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

A mixed integer linear programming model for the energy management problem of microgrids

ELECTRIC POWER SYSTEMS RESEARCH 2015年 122卷 19-28页

作者： Tenfen, Daniel Finardi, Erlon Cristian Univ Fed Santa Catarina Elect Syst Planning Res Lab LabPlan UFSC BR-88040900 Florianopolis SC Brazil

This paper presents a mathematical model for the energy management (EM) problem of a microgrid (MG) by means of a mixed integer linear programming approach. In the EM problem, the objective is to determine a generation and a controllable load demand policy that minimises, over a planning horizon, the operation cost subject to economical and technical constraints. We propose a detail modelling for microturbines (MTs) and fuel cells (FCs), where the constraints associated with such factors as the ramps, minimum up and downtime, and generation limits, represent various peculiarities that have not been adequately considered in literature. The proposed model also considers a detailed representation of critical, reschedulable and curtailable loads, which are important aspects in the MG concept. To analyse the proposed modelling, a MG is used along with a MT, a FC, a battery bank, wind and photovoltaic generators connected to the main grid. The results indicate that the model is adequate for the MG EM. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Energy management Microgrids Microturbines Fuel cells Controllable load demand mixed linear integer programming

来源：评论

学校读者我要写书评

暂无评论

A mixed integer linear programming Formulation to Artificial Neural Networks 19

A Mixed Integer Linear Programming Formulation to Artificial...

引用

2nd International Conference on Information Science and System (ICISS)

作者： Akutsu, Tatsuya Nagamochi, Hiroshi Kyoto Univ Inst Chem Res Bioinformat Ctr Kyoto 6110011 Japan Kyoto Univ Dept Appl Math & Phys Kyoto 6068501 Japan

ISBN: (纸本)9781450361033

This paper studies the problem of computing an input vector for a given pair of Artificial Neural Network (ANN) and output vector, which is a kind of inverse problem. This problem has potential applications in design of new objects, especially in design of new chemical compounds. This paper focuses on ANNs in which activation functions are represented as continuous piece-wise linear functions, which can exactly represent ReLU functions and well approximate sigmoid functions. It is shown that this inverse problem can be formulated as a mixed integer linear programming Problem (MILP) with O(vertical bar V vertical bar + n(b) variables and constraints, where V is a set of neurons in a given ANN and nb denotes the total number of break points over all activation functions f(nu), nu is an element of V .

关键词： Artificial neural networks inverse problem mixed linear integer programming

来源：评论

学校读者我要写书评

暂无评论

A mixed integer linear programming Formulation to Artificial Neural Networks

A Mixed Integer Linear Programming Formulation to Artificial...

引用

2019第二届信息科学与系统国际会议

作者： Tatsuya Akutsu Hiroshi Nagamochi Bioinformatics Center Institute for Chemical Research Kyoto University Department of Applied Mathematics and Physics Kyoto University

This paper studies the problem of computing an input vector for a given pair of Artificial Neural Network（ANN） and output vector,which is a kind of inverse *** problem has potential applications in design of new objects,especially in design of new chemical *** paper focuses on ANNs in which activation functions are represented as continuous piece-wise linear functions,which can exactly represent ReLU functions and well approximate sigmoid *** is shown that this inverse problem can be formulated as a mixed integer linear programming Problem（MILP） with O（|V|+n） variables and constraints,where V is a set of neurons in a given ANN and n denotes the total number of break points over all activation functions f,v∈V.

关键词： Artificial neural networks inverse problem mixed linear integer programming

来源：评论

学校读者我要写书评

暂无评论

100% renewable fueled mine

引用

ENERGY 2020年 205卷 117964-117964页

作者： Romero, Alberto Millar, Dean Carvalho, Monica Abrando, Raphael Laurentian Univ Grad Program Nat Resources Engn Sudbury ON Canada Laurentian Univ Dept Min Engn Sudbury ON Canada Univ Fed Paraiba Dept Renewable Energy Engn Joao Pessoa Paraiba Brazil Kreisel Elect Kreiselstr 1 A-4261 Rainbach Im Muhlkreis Austria

This study investigates the potential of hydrogen as an energy carrier to store seasonal energy from wind power in a remote off-grid underground mine located in the Northwest Territories, Canada. The energy demands to be satisfied by the Energy Supply System (ESS) were electricity, heating, and cooling. Diesel imports and local wind were the energy utilities available. An optimization model of the mine's ESS was formulated using mixed integer linear programming to search for cost-effective and sustainable energy supply solutions. The objective function to be minimized was the total cost of the ESS (investment plus operation costs). Several optimization scenarios were investigated in a sensitivity analysis, varying the time discretization (12 typical days v. 365 days), and the amount of conventional energy sources (i.e., diesel) available. The analysis could be extended to include other demands, such as mobile work demand and related conversion technologies, i.e.,hydrogen-fueled mobile equipment. For the case study considered, results demonstrated that it is technically feasible to meet the demands of a remote mine using a local renewable energy resource exclusively. However, the cost, size, and complexity of the ESS make such an option, in general, unattractive in comparison with a fossil fuel-based system. (C) 2020 Elsevier Ltd. All rights reserved.

关键词： Renewable energy Hydrogen Wind Mine site Optimization mixed linear integer programming

来源：评论

学校读者我要写书评

暂无评论

Security-Aware Max-Min Resource Allocation in Multiuser OFDMA Downlink

引用

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY 2015年第3期10卷 529-542页

作者： Karachontzitis, Sotiris Timotheou, Stelios Krikidis, Ioannis Berberidis, Kostas Univ Patras Dept Comp Engn & Informat Patras 26504 Greece Univ Cyprus KIOS Res Ctr Intelligent Syst & Networks CY-1678 Nicosia Cyprus Univ Cyprus Dept Elect & Comp Engn CY-1678 Nicosia Cyprus

In this paper, we study the problem of resource allocation for a multiuser orthogonal frequency-division multiple access (OFDMA) downlink with eavesdropping. The considered setup consists of a base station, several users, and a single eavesdropper that intends to wiretap the transmitted message within each OFDMA subchannel. By taking into consideration the existence of the eavesdropper, the base station aims to assign subchannels and allocate the available power in order to optimize the max-min fairness criterion over the users' secrecy rate. The considered problem is a mixed integer nonlinear program. For a fixed subchannel assignment, the optimal power allocation is obtained by developing an algorithm of polynomial computational complexity. In the general case, the problem is investigated from two different perspectives due to its combinatorial nature. In the first, the number of users is equal or higher than the number of subchannels, whereas in the second, the number of users is less than the number of subchannels. In the first case, we provide the optimal solution in polynomial time by transforming the original problem into an assignment one for which there are polynomial time algorithms. In the second case, the secrecy rate formula is linearly approximated and the problem is transformed to a mixed integer linear program, which is solved by a branch-and-bound algorithm. Moreover, optimality is discussed for two particular cases where the available power tends to infinity and zero, respectively. Based on the resulting insights, three heuristic schemes of polynomial complexity are proposed, offering a better balance between performance and complexity. Simulation results demonstrate that each one of these schemes achieves its highest performance at a different power regime of the system.

关键词： Resource allocation physical layer security linear sum assignment problem linear approximation mixed linear integer programming

来源：评论

学校读者我要写书评

暂无评论

Batch loading and scheduling problem with processing time deterioration and rate-modifying activities

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2022年第5期60卷 1600-1620页

作者： Kim, Yong Jae Jang, Jae Won Kim, David S. Kim, Byung Soo Incheon Natl Univ Dept Ind & Management Engn 119 Acad Ro Incheon 22012 South Korea Oregon State Univ Sch Mech Ind & Mfg Engn Corvallis OR 97331 USA

This research addresses a single machine batch loading and scheduling problem. Jobs in the same family are processed as a batch in the machine with a known family-specific processing time. Each job in a batch requires a known volume or space, and the total batch volume cannot exceed the available volume/capacity of the machine. Batch processing times increase proportionately with the time since the most recent rate-modifying activity and the starting time of a batch. A rate-modifying activity can be executed which restores original batch processing times. In this research, a solution procedure is proposed that simultaneously determines the appropriate batching of jobs and the number of rate-modifying activities. Job batches and the rate-modifying activities are then sequenced to minimise the makespan. To develop a solution procedure, a mixed integer linear programming model is formulated and a tight lower bound is proposed. Three genetic algorithms (GAs), including batch loading and sequencing heuristics, are proposed. The performance of the three GAs is compared, and the best GA is compared to other meta-heuristic algorithms.

关键词： Scheduling genetic algorithm mixed linear integer programming deteriorations rate-modifying activity

来源：评论

学校读者我要写书评

暂无评论

Multi-Period Profit-Oriented Location Routing Problem in Multi-User Warehouses with Backordering and Order Acceptance: A Relax-Fix-Optimize Heuristic

引用

ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH 2024年第0期

作者： Ech-Charrat, Mohammed Rida Zhani, Najlae Chargui, Kaoutar Zouadi, Tarik Univ Abdelmalek Essaadi ENSATE Tetouan Morocco Int Univ Rabat Rabat Business Sch BEAR Lab Sala Al Jadida 11100 Morocco

This paper addresses profit maximization in location routing problem (LRP) where backordering is allowed and serving all customers is not mandatory. The problem is motivated by the practical case of distribution companies using temporary multi-user warehouses to serve their customers. We propose a multi-period novel mixed integer linear programming (MILP) model for the problem where demand is price sensitive. The model seeks to find optimal locations of warehouses over the planning horizon, set of orders to serve, to backorder or to reject, and routing decisions giving optimal profit. The commercial solver (CPLEX) is used to solve the model on small instances. For medium and large instances, we propose a solution approach that incorporates the Relax and Fix (R&F), Fix and Optimize (F&O) procedures combined with local search heuristics. Computational experiments and economic analysis show the relevance of the proposed approach and the impact of parameters on generated profit.

关键词： Location routing problem backordering profit maximization price-sensitive demand mixed linear integer programming relax and fix fix-and-optimize local search

来源：评论

学校读者我要写书评

暂无评论

A linear characterization of the switching dynamic behavior of timed continuous Petri nets with structural conflicts

引用

NONlinear ANALYSIS-HYBRID SYSTEMS 2016年 19卷 38-59页

作者： Gudino-Mendoza, Berenice Lopez-Mellado, Ernesto Alla, Hassane CINVESTAV Unidad Guadalajara Av Bosque 1145 Zapopan 45015 Mexico Univ Grenoble GIPSA Lab 11 Rue MathBP46 Grenoble France

The behavior of timed continuous Petri nets (TCPN) can be ruled by linear equations during certain time elapses (IB-states), but changes in the marking and conflict solving policies make nonlinear the complete computation of the behavior. In this paper a global characterization of the switching behavior of TCPN through mixed linear integer programming (MLIP) is presented. The contribution is an analytical technique to compute the evolution graph of a TCPN, which allows deriving MLIP problems from TCPN models including cycles and structural conflicts;conflict resolution policies by priorities and sharing are considered. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： Timed continuous Petri nets mixed linear integer programming IB-states Conflict resolution policies

来源：评论

学校读者我要写书评

暂无评论

New smart home energy management systems based on inclining block-rate pricing scheme

引用

Clean Energy 2022年第3期6卷 503-511页

作者： Rasha Elazab Omar Saif Amr M.A.Amin Metwally Mohamed Daowd Electrical Power and Machines Department Faculty of Engineering at Helwan UniversityCairoEgypt

There are wide applications of block-rate pricing schemes in many ***,there are no significant studies that apply this common tariff for smart home energy management *** this paper,a three-time-frame energy management scheme has been proposed for photovoltaic(PV)-powered grid-connected smart homes based on the well-known mixed-integer linear programming optimization *** paper provides three original and novel smart home energy management algorithms that depend on the most common residential tariff specifically in developing *** different management concepts have been studied for a typical Egyptian *** concepts of shifting load,vehicle-to-home and reducing air conditioning have been tested according to a commonly applied slab *** proposed scheme considers the home battery extending lifetime *** also preserves comfortable lifestyle limits for home users according to Arab housing climatic conditions and ***,the economic feasibility of integrated PV modules for the studied home has been verified according to the Egyptian *** proposed energy management scheme of PV-powered home reduces the electrical power bill significantly in a wide range from 61%to only 19%of the default case bill according to the applied management technique.

关键词： smart homes energy management system inclining block-rate tariff mixed linear integer programming

来源：评论

学校读者我要写书评

暂无评论

Two-Phase Decision Support Methodology for Design and Planning an Outcome-Driven Supply Chain

引用

JOURNAL OF APPLIED RESEARCH AND TECHNOLOGY 2014年第4期12卷 704-715页

作者： Alvarez-Socarras, A. Baez-Olvera, A. Lopez-Irarragorri, F. Univ Autonoma Nuevo Leon Grad Program Syst Engn San Nicolas De Los Garza Nuevo Leon Mexico

Nowadays, Supply Chain success and competitiveness heavily depend on the integration of its components and adaptability to deal with a changing environment. This article suggests the integration of design and management of a Supply Chain from an outcome-driven perspective. We propose a two-phase decision-making support methodology: first suppliers are pre-screened by solving a multi criteria sorting problem, and then a design and management plan is generated by solving a mixed integer linear programming Model. Experimentally we showed that the proposed methodology can efficiently solve to optimality the most popular benchmark instances published in previous paper moreover our model also includes problem characteristics that have not been addressed together in previous published papers.

关键词： Supply chain design supply chain planning mixed linear integer programming multi-criteria sorting problem outcome-driven

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：