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

Impact of the splitting of the German-Austrian electricity bidding zone on investment in a grid-scale battery energy storage system deployed for price arbitrage with gray and green power in Austrian and German day-ahead power markets

引用

ENERGY REPORTS 2022年 8卷 12045-12062页

作者： Hurta, Adam Zilka, Miroslav Freiberg, Frantisek Czech Tech Univ Fac Mech Engn Dept Enterprise Management & Econ Karlovo Namesti 13 Prague 2 Czech Republic

The splitting of the German-Austrian electricity bidding zone in October 2018 established limits for cross-border exchanges of power between Germany and Austria, which led to the decoupling of German and Austrian wholesale power prices. We analyze the impact of the split on the investment in lithium-ion grid-scale battery energy storage systems (BESS) used for intertemporal arbitrage in German and Austrian day-ahead power markets with hourly contracts operated by the Energy Exchange of Austria. The paper was written in response to the increasing share of green power in the national energy mix of the two countries, followed by a similar development in the volume of green power traded. Arbitrage with green power was analyzed and compared to arbitrage with power from conventional sources using a robust mixed-integer linear programming (MILP) model extended with a battery degradation process. The model was solved for different levels of depth of discharge (DOD) to identify the optimum between cycle life and calendar aging with respect to prevailing market conditions. Using predicted costs of battery, a break-even point was reached with 60% DOD identified as the optimal pattern for the dispatch of the BESS. A separate scenario was considered for the analysis of the impact of moving from the perfect knowledge of future prices to a situation where day-ahead prices are forecasted using the seasonal autoregressive integrated moving average (SARIMA) model.(c) 2022 The Author(s). Published by Elsevier Ltd. This is an open access article under the CC BY license (http://***/licenses/by/4.0/).

关键词： German-Austrian electricity bidding zone Battery storage Green power mixed -integer linear programming Electricity forecasting

来源：评论

学校读者我要写书评

暂无评论

Electric Bus Charging Scheduling for a Single Public Transport Route Considering Nonlinear Charging Profile and Battery Degradation Effect

引用

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL 2022年 159卷 49-75页

作者： Zhou, Yu Meng, Qiang Ong, Ghim Ping Natl Univ Singapore Dept Civil & Environm Engn Singapore 117576 Singapore

This study deals with a fundamental electric bus charging scheduling (EBCS) problem for a single public transport route by considering the nonlinear electric bus (EB) charging profile and battery degradation effect under the partial charging policy, which allows EBs to be charged any length of time and make good use of dwell times between consecutive trips. Given a group of trip tasks for an EB fleet and charger type, the problem is to minimize the total cost for a public transport operator of providing peak-hour bus services for a focal single public transport route by simul-taneously determining the EB-to-trip assignment and EB charging schedule with charger type choice subject to the necessary EB operational constraints. We first build a mixed-integer nonlinear and nonconvex programming (MINL&NCP) model for the EBCS problem. To effec-tively solve the MINL&NCP model to global optimality, we subsequently develop two mixed -integer linear programming (MILP) models by means of linearization and approximation tech-niques. To accelerate the solution efficiency, we further create three families of valid inequalities depending on the unique features of the problem. A real case study based on the No.171 bus route in Singapore is conducted to demonstrate the performance of the developed models. Extensive numerical experiments are carried out to seek valuable managerial insights for public transport operators.

关键词： Electric bus bus -to -trip assignment charging scheduling battery degradation mixed -integer linear programming valid inequalities

来源：评论

学校读者我要写书评

暂无评论

Mathematical models for a ship routing problem with a small number of ports on a route

引用

APPLIED MATHEMATICAL MODELLING 2022年 111卷 126-138页

作者： Lee, Jonghwa Kim, Byung-In Pohang Univ Sci & Technol POSTECH Dept Ind & Management Engn Pohang South Korea

This paper presents an industrial ship routing problem with split loads faced by a steel company that exports its steel products to neighboring countries. The problem considers two types of ships: ships with contracts of affreightment and spot ships. It also consid-ers other practical constraints, such as cargo-cargo and cargo-ship compatibility and the minimum loading amount for using a ship. Due to high surcharges for multiple port vis-its, each ship is allowed to visit at most two loading and two unloading ports. Herein, arc flow-based and path flow-based mathematical models are proposed to solve the problem. Computational experiments show that the path flow model is more efficient than the arc flow model. The path flow model can reduce the computational time by 67% on average and find optimal solutions to real-world ship routing problems in acceptable computa-tional time in most cases.(c) 2022 Elsevier Inc. All rights reserved.

关键词： Ship routing problem Split load mixed -integer linear programming Optimal solution

来源：评论

学校读者我要写书评

暂无评论

Timetable synchronization optimization in a subway-bus network

引用

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS 2022年 608卷

作者： Huang, Kang Wu, Jianjun Sun, Huijun Yang, Xin Gao, Ziyou Feng, Xujie Beijing Jiaotong Univ State Key Lab Rail Traff Control & Safety Beijing 100044 Peoples R China Eindhoven Univ Technol Urban Planning & Transportat Grp Eindhoven Netherlands Beijing Jiaotong Univ Minist Transport Key Lab Transport Ind Big Data Applicat Technol Co Beijing 100044 Peoples R China China Acad Transportat Sci Key Lab Adv Publ Transportat Sci Beijing 100029 Peoples R China

The subway and bus together contribute to the structure of public transport network in a metropolis. However, integrated service of public transport is not satisfied due to the lower timetable synchronization between these two modes at transfer stations. In this paper, a double-layer public transport network composed of subway/bus lines and stations is first created. Then, two stages are included in the timetable optimization process. In the first stage, a user equilibrium assignment model and a capacity restriction iterative algorithm are employed to obtain the passenger distribution in the subway- bus public transport transfer network. Based on this distribution, with the consideration of the synchronization and section service level, a mixed-integer linear programming (MILP) model is applied to optimize the timetables of the subway and bus networks in the second stage. Computational results using real Automatic Fare Collection System (AFC) data from the public transport system in Beijing are reported, and these results show that the suggested model is efficient in improving passenger service levels. (c) 2022 Published by Elsevier B.V.

关键词： Timetable synchronization Subway-bus networks mixed -integer linear programming AFC data

来源：评论

学校读者我要写书评

暂无评论

An MILP based optimization model for reservoir flood control operation considering spillway gate scheduling

引用

JOURNAL OF HYDROLOGY 2022年 613卷

作者： Su, Chengguo Wang, Peilin Yuan, Wenlin Cheng, Chuntian Zhang, Taiheng Yan, Denghua Wu, Zening Zhengzhou Univ Sch Hydraul Sci & Engn Zhengzhou 450001 Peoples R China Dalian Univ Technol Inst Hydropower & Hydroinformat Dalian 116024 Peoples R China Huadian Elect Power Res Inst Co LTD Hangzhou 310030 Peoples R China China Inst Water Resources & Hydropower Res Water Resources Dept Beijing 100038 Peoples R China

Reservoir flood control operation is an important and effective measure for avoiding or reducing flood disasters. Considering that reservoir operation is a control process that essentially manages the spillway gates to increase or decrease the amount of released water, this paper focuses on studying the reservoir flood control operation which considers spillway gate scheduling. Minimizing the peak outflow from the reservoir is adopted as the optimization objective to protect downstream areas from flood disasters. In addition to the conventional reservoir constraints, the operation constraints of individual spillway gates and the influence of the reservoir forebay water level and opening degree on the gates' discharge capacity are also well considered to obtain precise scheduling. The nonlinear factors, especially the objective function in the form of maximin, the three-dimensional water discharge curves, and the rules for the opening and closing sequence of the spillway gates, are linearized through several strategies. The original nonlinear and non-convex model is then converted into a standard mixed-integer linear programming (MILP) formulation. The results for the real-world case study indicate that: 1) the proposed model is believed to be computationally efficient with a calculation time of about 30 min;2) for the flood events with return periods of 10 years and 100 years, the flood peaks are reduced from 4160 m3/s to 3681 m3/s and from 11007 m3/s to 9293 m3/s, representing decreases of 11.5 % and 15.6 %, respectively. The outflow curves become more stable, demonstrating that the flood control pressure on the downstream had been relieved after optimization;3) the proposed model can produce more realistic and executable flood control operation scheduling compared with the conventional optimization model without considering spillway gate scheduling. These research findings can provide an effective reference for both the operators of reservoirs and researchers in t

关键词： Flood control operation Spillway gate scheduling Gate operation rules Water discharge curves mixed -integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Two-sided disassembly line balancing problem with sequence-dependent setup time: A constraint programming model and artificial bee colony algorithm

引用

EXPERT SYSTEMS WITH APPLICATIONS 2022年 203卷

作者： Cil, Zeynel Abidin Kizilay, Damla Li, Zixiang Oztop, Hande Izmir Democracy Univ Dept Ind Engn Izmir Turkey Wuhan Univ Sci & Technol Key Lab Met Equipment & Control Technol Wuhan Hubei Peoples R China Wuhan Univ Sci & Technol Hubei Key Lab Mech Transmiss & Mfg Engn Wuhan Hubei Peoples R China Izmir Democracy Univ Dept Ind Engn Gursel Aksel Bulvari 14 TR-35140 Izmir Turkey

The large-size products can allow workers to perform tasks on both sides of the line. Hence, a two-sided disassembly line is preferred to ensure several advantages, such as a shorter line. The two-sided disassembly line balancing problem (TDLBP) is relatively new in the literature. This study considers the two-sided disas-sembly line balancing problem with sequence-dependent setup time (TDLBP-SDST) to reflect the real practice better, as sequence-dependent setup times may exist between tasks in many real-life applications. To the authors' best knowledge, sequence-dependent setup time has not been considered for the TDLBP in the current literature. The proposed problem creates a more complicated problem. Therefore, proposing effective solution techniques is more critical for obtaining better results. This study proposes two new mixed-integer linear programming models and a novel constraint programming (CP) model to define and solve the TDLBP-SDST. A genetic algorithm, an artificial bee colony algorithm, and the improved versions of these two algorithms are also developed to solve the large-size problems due to the NP-hardness of the TDLBP-SDST. Furthermore, a novel CP model is proposed for the standard TDLBP without considering sequence-dependent setup times. Initially, we compare the performance of the proposed CP model to those of the previous state-of-the-art methods in the literature for the TDLBP without sequence-dependent setup time. The computational results show that the proposed CP model out-performs all the other solution methods and reports the best-known results for all existing benchmark instances for the TDLBP. Then, we present the computational results of the proposed models and algorithms for the TDLBP-SDST. Computational study on a comprehensive set of generated instances indicates that the proposed solution methods effectively solve the TDLBP-SDST.

关键词： Two-sided disassembly line Line balancing Sequence -dependent setup time Constraint programming Metaheuristic algorithms mixed -integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A sustainable-circular citrus closed-loop supply chain configuration: Pareto-based algorithms

引用

JOURNAL OF ENVIRONMENTAL MANAGEMENT 2023年 328卷 116892页

作者： Goodarzian, Fariba Ghasemi, Peiman Gonzalez, Ernesto DR. Santibanez Tirkolaee, Erfan Babaee Univ Seville Sch Engn Org Engn Grp Camino Descubrimientos S-N Seville 41092 Spain Univ Vienna Dept Business Decis & Analyt Kolingasse 14-16 A-1090 Vienna Austria Univ Talca Fac Ingn Talca1 Poniente1141 Talca Chile Istinye Univ Dept Ind Engn TR-34396 Istanbul Turkiye

Configuration of sustainable supply chains for agricultural products has been a well-known research field recently which is continuing to evolve and grow. It is a complex network design problem, and despite the abundant literature in the field, there are still few models offered to integrate social impacts and environmental effects to support network design decision-making to support the configuration of the citrus supply chain. In this work, the citrus supply chain design problem is investigated by integrating the production, distribution, in-ventory control, recycling and locational decisions in which the triple bottom lines of sustainability, as well as circularity strategy, are addressed. Accordingly, a novel multi-objective mixed-integer linear programming (MILP) model is proposed to formulate a multi-period multi-echelon problem to design the sustainable citrus Closed-Loop Supply Chain (CLSC) network. To solve the developed model, the epsilon-constraint approach is employed in small-sized problems. Furthermore, Strength Pareto Evolutionary Algorithm II (SPEA-II) and Pareto Envelope -based Selection Algorithm II (PESA-II) algorithms are used in medium-and large-sized problems. Taguchi design technique is then utilized to adjust the parameters of the algorithms efficiently. Three well-known assessment metrics and convergence analysis are regarded to test the efficiency of the suggested algorithms. The numerical results demonstrate that the SPEA-II algorithm has a superior efficiency over PESA-II. Moreover, to validate the applicability of the developed methodology, a real case study in Mazandaran/Iran is investigated with the help of a set of sensitivity analyses.

关键词： Citrus supply chain Closed -loop supply chain network Sustainability Circularity mixed -integer linear programming Meta -heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Accelerated dual dynamic integer programming applied to short-term power generation scheduling

引用

INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS 2023年 145卷

作者： dos Santos, Kenny Vinente Colonetti, Bruno Finardi, Erlon Cristian Zavala, Victor M. Univ Fed Amazonas Dept Oil & Gas 6200 Gen RodrigoOctavio AvCoroado 1 BR-69080900 Manaus Amazonas Brazil Univ Fed Santa Catarina Dept Elect & Elect Engn BR-88040900 Florianopolis SC Brazil INESC P&D Brasil BR-11055300 Santos SP Brazil Univ Wisconsin Dept Chem & Biol Engn 1415 Engn Dr Madison WI 53706 USA

The short-term generation scheduling (STGS) problem defines which units must operate and how much power they must deliver to satisfy the system demand over a planning horizon of up to two weeks. The problem is typically formulated as a large-scale mixed-integer linear programming problem, where off-the-shelf commercial solvers generally struggle to efficiently solve realistic instances of the STGS, mainly due to the large-scale of these models. Thus, decomposition approaches that break the model into smaller instances that are more easily handled are attractive alternatives to directly employing these solvers. This paper proposes a dual dynamic integer programming (DDiP) framework for solving the STGS problem efficiently. As in the standard DDiP approach, we use a nested Benders decomposition over the time horizon but introduce multiperiod stages and overlap strategies to accelerate the method. Simulations performed on the IEEE-118 system show that the pro-posed approach is significantly faster than standard DDiP and can deliver near-optimal solutions.

关键词： Dual dynamic integer programming Short-term generation scheduling mixed -integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Scheduling quay cranes and shuttle vehicles simultaneously with limited apron buffer capacity

引用

COMPUTERS & OPERATIONS RESEARCH 2023年 151卷

作者： Yin, Yu-Qi Zhong, Meisu Wen, Xin Ge, Ying-En Shanghai Maritime Univ Sch Econ & Management Shanghai Peoples R China Changan Univ Sch Econ & Management Xian Shaanxi Peoples R China Jiangsu Univ Sci & Technol Sch Econ & Management Zhenjiang Jiangsu Peoples R China Changan Univ Coll Transportat Engn Xian Shaanxi Peoples R China

How to schedule quay cranes (QCs) and shuttle vehicles (SVs) simultaneously or model them in an integrated scheduling problem is one of the most important problems in operations and management of a container terminal. This paper investigates an integrated QC and SV scheduling problem constrained by apron buffer capacity. In this problem, the decisions to make include the bay-to-QC assignment, the QC-bay sequence, the QC-job sequence, the job-to-SV assignment and the SV-job sequence. First, a mixed-integer linear programming model is formulated for this problem to minimize the makespan. Second, the relationships and interactive variables among the four segments of constraints of the proposed model (i.e., scheduling QCs for vessel bays, sequencing jobs handled by a QC in each bay, scheduling SVs for jobs, apron buffer capacity constraints for each vessel bay) are analyzed to present three rules: vessel block rule, near-to-far rule and full-buffer rule. Finally, a sequential insertion algorithm, a greedy insertion algorithm and an improved genetic algorithm are proposed to solve midand large-sized cases for the problem. Numerical experiments show that the algorithms perform well, compared to the off-the-shelf solver. Based on these experiments, managerial implications are discussed for container terminal operations and management.

关键词： Container terminal Quay crane Shuttle vehicle Integrated scheduling problem mixed -integer linear programming Block buffer zone Automated stacking

来源：评论

学校读者我要写书评

暂无评论

Model-based energy management systems: Weighting of multiobjective functions using the Volatile Energy Prices Scalarization (VEPS)

引用

COMPUTERS & CHEMICAL ENGINEERING 2023年 169卷

作者： Fuhrmann, Florian Schirrer, Alexander Kozek, Martin Tech Univ Wien Inst Mech & Mechatron Getreidemarkt 9-BA A-1060 Vienna Austria

Predictive energy management systems (EMSs) enable industrial plants to operate the energy supply systems at optimal efficiency, taking account of multiple objectives, including energy cost reduction. The performance of model-based EMSs depends on the appropriate design and correct scalarization of the resulting multiobjective function. This paper introduces the Volatile Energy Prices Scalarization (VEPS) method, which effectively de-signs, standardizes, and weighs the multiobjective function of model-based EMSs without the need for prior simulations or test runs. We present a case study, in which we compare the VEPS method to other state-of-the-art methods, utilizing a validated simulation model from an industrial food plant. The results show that the VEPS method outperforms other weighting methods with comparable tuning effort in this case-study. Moreover, the performance of the VEPS method is close to the Pareto-optimal performance. Economic weighting methods such as VEPS enable a fast and cost-effective implementation of EMS in the manufacturing industry.

关键词： Energy management system Model predictive control Multiobjective optimization mixed -integer linear programming Thermal batch processes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：