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

The Effectiveness of Energy Cooperatives Operating on the Capacity Market

ENERGIES 2021年第11期14卷 3226页

作者： Jasinski, Jakub Kozakiewicz, Mariusz Soltysik, Maciej Polish Acad Sci Inst Rural & Agr Dev 72 Nowy Swiat St PL-00330 Warsaw Poland Warsaw Sch Econ Coll Econ Anal Madalinskiego 6-8 St PL-02513 Warsaw Poland Czestochowa Tech Univ Fac Elect Engn Armii Krajowej St 17 PL-42200 Czestochowa Poland

The European Green Deal aims to make Europe the world's first climate-neutral continent by 2050 by shifting to a clean circular economy, combating biodiversity loss and reducing pollution levels. In Poland, whose economy invariably remains one of the most dependent on coal consumption in Europe, institutional responses to the above EU objectives have taken the shape of energy cooperatives aimed at filling the gaps in the development of the civic dimension of energy on a local scale and the use of potential renewable energy sources in rural areas, including in relation to the agricultural sector. This article is a continuation of the authors' previous research work, which has so far focused on the analysis of the development of profitability of Polish institutions that fit into the European idea of a "local energy community", which includes energy cooperatives. In this research paper, they present the results of subsequent research work and analyses performed on the basis of it which, on the one hand, complement the previously developed optimization model with variables concerning actual energy storage and, on the other hand, analyze the profitability of the operation of energy cooperatives in the conditions of the "capacity market". The latter was actually introduced in Poland at the beginning of 2021. The research took account of the characteristics of energy producers and consumers in rural areas of Poland, the legally defined rules for the operation of the capacity market and the institutional conditions for the operation of energy cooperatives that can use the potential of energy storage. A dedicated mathematical model in mixed integer programming technology was used, enriched with respect to previous research, making it possible to optimize the operation of energy cooperative with the use of actual energy storage (batteries). Conclusions from the research and simulation show that the installation of energy storage only partially minimizes the volume of energy d

关键词： energy cooperatives capacity market energy storage rural areas mixed integer programming

来源：评论

学校读者我要写书评

暂无评论

Optimal design and cost of ship-based CO2 transport under uncertainties and fluctuations

引用

INTERNATIONAL JOURNAL OF GREENHOUSE GAS CONTROL 2020年 103卷 103190-103190页

作者： Bjerketvedt, Vegard Skonseng Tomasgard, Asgeir Roussanaly, Simon Norwegian Univ Sci & Technol NTNU Dept Ind Econ & Technol Management N-7491 Trondheim Norway SINTEF Energy Res Sem Saelandsvei 11 NO-7465 Trondheim Norway

This study investigates the impact of operational fluctuations and uncertainties on the design and expected cost of ship-based CO2 transport. The model analysis is based on a two-stage stochastic investment model for a single source single-sink CCS value chain with a ship-based transport system. The sailing time of the ship is uncertain due to changing weather conditions. The optimal investment decisions are driven by the expected cost of operating the value chain in the stochastic operational scenarios. This approach is demonstrated on a case study in which 0.4 MtCO(2)/y is transported over 715 km, from a cement plant located in Brevik to a harbor in Kollsnes in Norway. The results show that a transport rate of 99 % of the available CO2 leads to the lowest average cost of transport at 33.8 Euro/ton. Once the delays caused by the weather are considered, the buffer storage capacity that is 18 % above the ships transport capacity, seems to be the most efficient solution for recovering normal operation after weather delays. The expected transport cost increases with 1.9 Euro/ton (i.e. 5%) when the uncertainty in weather conditions is neglected in the value chain design decisions. Furthermore, seasonal variations in emissions lead to the need of a larger ship rather than maintaining the same ship size and increasing the power when required. The seasonal storage of CO2 never appears to be a cost-efficient strategy, compared to increasing ship capacity. Finally, the risks of higher future fuel prices and ship breakdowns will cause the value of buffer storage capacity to increase, and thus resulting to select a buffer capacity up to 73 % larger than the ship size.

关键词： CCS Value Chain Stochastic programming mixed integer programming Capacity investments

来源：评论

学校读者我要写书评

暂无评论

Scheduling a single batch processing machine with non-identical two-dimensional job sizes

引用

EXPERT SYSTEMS WITH APPLICATIONS 2022年第0期201卷 1页

作者： Zhou, Shengchao Jin, Mingzhou Liu, Chuang Zheng, Xu Chen, Huaping Cent South Univ Sch Automat Changsha 410083 Hunan Peoples R China Univ Tennessee Dept Ind & Syst Engn Knoxville TN 37996 USA Univ Sci & Technol China Sch Management Hefei 230026 Anhui Peoples R China

This paper considers a single batch processing machine scheduling problem with non-identical two-dimensional job sizes. Jobs may be rotated but must be placed orthogonally without overlapping in the machine. The machine can simultaneously process a batch of jobs as long as its two-dimensional capacity is not exceeded. The processing time of a batch is defined by the longest processing time of all jobs in the batch. The objective is to assign jobs to batches considering the machine capacity constraint such that the makespan is minimized. An improved mixed integer programming formulation is proposed to reduce the solution space. 16 heuristics, combining four job sequencing, two batch selection, and two job placement alternatives, are investigated. The effectiveness of the model and heuristics is analyzed through a comprehensive experimental study. The results show that the LPTBFSA heuristic outperforms the others, in which jobs are sorted in decreasing processing time, a batch is selected for each job based on the best-fit algorithm, and a job is placed in the selected batch following the "as compact as possible" packing principle. The LPTFFSA heuristic also works well, in which the first-fit algorithm is used to select a batch for each job.

关键词： Scheduling Batch processing machines Heuristics Two-dimensional job sizes mixed integer programming

来源：评论

学校读者我要写书评

暂无评论

Exploring the tradeoff between energy dissipation, delay, and the number of backbones for broadcasting in wireless sensor networks through goal programming

引用

AD HOC NETWORKS 2023年 149卷

作者： Gultekin, Busra Nurcan-Atceken, Derya Altin-Kayhan, Aysegul Yildiz, Huseyin Ugur Tavli, Bulent TOBB Univ Econ & Technol Dept Ind Engn TR-06560 Ankara Turkiye TED Univ Dept Ind Engn TR-06420 Ankara Turkiye Ankara Sci Univ Dept Ind Engn TR-06570 Ankara Turkiye TED Univ Dept Elect & Elect Engn TR-06420 Ankara Turkiye TOBB Univ Econ & Technol Dept Elect & Elect Engn TR-06560 Ankara Turkiye

Broadcasting, which is an essential mode of operation in wireless sensor networks (WSNs), dissipates a non -negligible portion of the energy budget of a sensor node. Broadcasting is achieved by the dissemination of broadcast packets (originated at the BS) by a set of relay nodes, which constitute a backbone so that all sensor nodes receive broadcast packets. Utilization of multiple backbones is necessary to achieve balanced energy dissipation of sensor nodes in broadcasting. In this study, we propose two mixed integer programming (MIP) models (i.e., the flow-based model and the node-based model), which minimize the energy dissipation of the highest energy-consuming node for broadcasting by utilizing multiple backbones. Balanced energy minimization and delay minimization objectives are integrated through a goal programming (GP) framework built upon the foundation provided by the scalable node-based model. Performance evaluations based on the optimal solutions of our models reveal that maximum energy dissipation and delay in WSN broadcasting can be significantly reduced, simultaneously, by utilizing multiple backbones (e.g., with two backbones maximum energy dissipation and delay can be, concurrently, reduced by more than 2% and 22%, respectively, in comparison to the single backbone case, likewise, it is also possible to simultaneously reduce maximum energy dissipation and delay more than 8% and 13%, respectively, depending on the priorities assigned to the objectives). Nevertheless, employing more than two backbones does not provide any significant performance improvements.

关键词： Wireless sensor networks Broadcasting mixed integer programming Goal programming Network lifetime Delay

来源：评论

学校读者我要写书评

暂无评论

Formulation and exact algorithms for electric vehicle production routing problem

引用

EXPERT SYSTEMS WITH APPLICATIONS 2022年 204卷

作者： Attar, S. Fateme Mohammadi, Mohammad Pasandideh, Seyed Hamid Reza Naderi, Bahman Kharazmi Univ Fac Engn Dept Ind Engn Tehran Iran Univ Windsor Fac Engn Dept Mech Automot & Mat Windsor ON Canada

Advanced decision-making models have been recently developed to integrate various aspects of a supply chain, i.e., production, distribution, shipping, and routing. These have resulted in higher productivity and significant cost saving. On the other side, regulations, and incentives to operate Electric Vehicles (EVs) are growing to address the environmental impacts of a supply chain. In this study, we present an Electric Vehicle Production Routing Problem (EVPRP) to achieve optimal decisions. In the proposed problem the limitation of battery capacity and charging facilities is incorporated. In addition, to address the issue of long charging, the option of partial charging is considered using both Heterogeneous (HT) and Homogeneous (HM) fleets. We propose a mixed-integer linear programming model for the EVPRP, which is mathematically validated by solving (via CPLEX) the new instances generated compatible with the EVPRP. Due to the NP-hardness of the EVPRP model, which cannot solve large-scale instances by a commercial solver, we develop two types of exact algorithms named, Logic-Based Benders Decomposition (LBBD) algorithms. The first one is based on each vehicle in each period (LBBDvt), and the second algorithm is applied for each period (LBBDt). The performance of the proposed model and LBBD algorithms is validated through the computational experiments on the HM and HT EVPRP data sets. The computational results show that the proposed exact algorithms clearly outperform the MIP formulation solved by Cplex as well as demonstrate the efficiency of both algorithms in finding high-quality solutions.

关键词： Electric vehicle production routing problem Heterogonous and homogeneous fleets mixed integer programming Partial recharge Logic Based Benders Decomposition

来源：评论

学校读者我要写书评

暂无评论

Joint outlier detection and variable selection using discrete optimization

引用

SORT-STATISTICS AND OPERATIONS RESEARCH TRANSACTIONS 2021年第1期45卷 47-66页

作者： Jammal, Mahdi Canu, Stephane Abdallah, Maher Inst Natl Sci Appl INSA Rouen 685 Ave Univ F-76800 St Etienne Du Rouvray France Lebanese Univ Beirut Lebanon Lebanese Univ Fac Publ Hlth Beirut Lebanon

In regression, the quality of estimators is known to be very sensitive to the presence of spurious variables and outliers. Unfortunately, this is a frequent situation when dealing with real data. To handle outlier proneness and achieve variable selection, we propose a robust method performing the outright rejection of discordant observations together with the selection of relevant variables. A natural way to define the corresponding optimization problem is to use the l(0) norm and recast it as a mixed integer optimization problem. To retrieve this global solution more efficiently, we suggest the use of additional constraints as well as a clever initialization. To this end, an efficient and scalable non-convex proximal alternate algorithm is introduced. An empirical comparison between the l(0) norm approach and its l(1) relaxation is presented as well. Results on both synthetic and real data sets provided that the mixed integer programming approach and its discrete first order warm start provide high quality solutions.

关键词： Robust optimization statistical learning linear regression variable selection outlier detection mixed integer programming

来源：评论

学校读者我要写书评

暂无评论

A comparative study of formulations for a cross-dock door assignment problem

引用

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE 2020年 91卷 102015-000页

作者： Gelareh, Shahin Glover, Fred Guemri, Oualid Hanafi, Said Nduwayo, Placide Todosijevic, Raca Univ Artois Dept Reseaux & Telecommun IUT Bethune F-62400 Bethune France OptTek Syst Boulder CO USA Univ Polytech Hauts De France LAMM UMR CNRS 8201 F-59313 Valenciennes 9 France

A cross docking facility is a type of warehouse in supply chain management that allows orders to be prepared with or without going through the phase of storing products in the warehouse and subsequently selecting them for delivery. The goods are unloaded from incoming trucks called origins on inbound doors of a cross-docking facility platform and, using a handling device inside the platform such as a forklift, immediately transferred to outbound doors to be loaded into outgoing trucks named destinations or delivery trucks for distribution to customers. Contrary to a traditional warehouse, goods are unloaded and loaded without placing them in temporary storage inside the cross-docking facility. The goal of the cross-docking assignment problem (CDAP) is to assign origins to inbound doors and destinations to outbound doors so that the total cost inside the cross-dock platform is minimized. To the best of our knowledge, there are only three mixed integer programming (MIP) formulations of the CDAP in the literature. We propose eight new MIP models and demonstrate the mathematical equivalence of all 11 models, together with rigorously proving some of their properties. In order to detect which of these 11 models is best, we conduct an extensive comparative analysis on benchmark instances from the literature, which discloses that the best model is one proposed in this paper for the first time. (C) 2018 Elsevier Ltd. All rights reserved.

关键词： Cross-docking Dock-door assignment mixed integer programming

来源：评论

学校读者我要写书评

暂无评论

On maximum degree-based -quasi-clique problem: Complexity and exact approaches

引用

NETWORKS 2018年第2期71卷 136-152页

作者： Pastukhov, Grigory Veremyev, Alexander Boginski, Vladimir Prokopyev, Oleg A. CSX Transportat Operat Res Jacksonville FL 32202 USA Univ Cent Florida Ind Engn & Management Syst Orlando FL 32816 USA Univ Florida Ind & Syst Engn Gainesville FL 32611 USA Univ Pittsburgh Ind Engn Pittsburgh PA 15261 USA

We consider the problem of finding a degree-based -quasi-clique of maximum cardinality in a given graph for some fixed (0,1]. A degree-based -quasi-clique (often referred to as simply a quasi-clique) is a subgraph, where the degree of each vertex is at least times the maximum possible degree of a vertex in the subgraph. A degree-based -quasi-clique is a relative clique relaxation model, where the case of =1 corresponds to the well-known concept of a clique. In this article, we first prove that the problem is NP-hard for any fixed (0,1], which addresses one of the open questions in the literature. More importantly, we also develop new exact solution methods for solving the problem and demonstrate their advantages and limitations in extensive computational experiments with both random and real-world networks. Finally, we outline promising directions of future research including possible functional generalizations of the considered clique relaxation model. (c) 2017 Wiley Periodicals, Inc. NETWORKS, Vol. 71(2), 136-152 2018

关键词： degree-based quasi-clique quasi-clique k-core clique clique relaxation branch-and-bound mixed integer programming

来源：评论

学校读者我要写书评

暂无评论

Structured pruning of neural networks for constraints learning

引用

OPERATIONS RESEARCH LETTERS 2024年 57卷

作者： Cacciola, Matteo Frangioni, Antonio Lodi, Andrea Polytech Montreal CERC Montreal PQ Canada Univ Pisa Pisa Italy Cornell Tech New York NY 10044 USA Technion IIT New York NY 10011 USA

In recent years, the integration of Machine Learning (ML) models with Operation Research (OR) tools has gained popularity in applications such as cancer treatment, algorithmic configuration, and chemical process optimization. This integration often uses mixed integer programming (MIP) formulations to represent the chosen ML model, that is often an Artificial Neural Networks (ANNs) due to their widespread use. However, ANNs frequently contain a large number of parameters, resulting in MIP formulations impractical to solve. In this paper we showcase the effectiveness of a ANN pruning, when applied to models prior to their integration into MIPs. We discuss why pruning is more suitable in this context than other ML compression techniques, and we highlight the potential of appropriate pruning strategies via experiments on MIPs used to construct adversarial examples to ANNs. Our results demonstrate that pruning offers remarkable reductions in solution times without hindering the quality of the final decision, enabling the resolution of previously unsolvable instances.

关键词： Artificial neural networks mixed integer programming Model compression Pruning

来源：评论

学校读者我要写书评

暂无评论

A new model for automated pushback selection

引用

COMPUTERS & OPERATIONS RESEARCH 2020年 115卷 104456-000页

作者： Jelvez, Enrique Morales, Nelson Askari-Nasab, Hooman Univ Chile Adv Min Technol Ctr Av Tupper 2007 Santiago 8370451 Chile Univ Chile Dept Min Engn Delphos Mine Planning Lab Santiago Chile Univ Alberta Sch Min & Petr Engn Dept Civil & Environm Engn Min Optimizat Lab Edmonton AB Canada

The design of pushbacks is essential to long-term open pit mine scheduling because it partitions the pit space into individual units, controlling ore and waste production. In this paper, a new model is proposed for the pushback selection procedure, which consists of characterizing the potential pushbacks based on the comprehensive family of nested pits and selecting those ones that meet a set of criteria, for instance, bounded ore and waste. An advantage of this method is the possibility to automate the pushback selection methodology, applying well-defined criteria for the selection and reducing the time employed in the planning task. (C) 2018 Elsevier Ltd. All rights reserved.

关键词： Long-term open-pit mine planning Nested pits Pushback selection mixed integer programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：