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

Optimal and efficient planning of charging stations for electric vehicles in urban areas: formulation, complexity and solutions

引用

EXPERT SYSTEMS WITH APPLICATIONS 2023年第1期230卷

作者： Zhang, Ying Hua, Yunpeng Kang, Ao He, Jiyuan Jia, Meng Chiang, Yao-Yi North China Elect Power Univ Sch Control & Comp Engn 2 Beinong Rd Beijing 102206 Peoples R China Univ Minnesota Dept Comp Sci & Engn 200 Union St SE Minneapolis MN 55455 USA

The deployment of charging infrastructure for electric vehicles is crucial in extending their range. Many studies on the charging infrastructure deployment adopt the mixed integer linear programming (MILP) method to optimize various objectives. However, as the number of integer variables and constraints increases, the computational time and memory requirements of MILP models increase exponentially. This makes it impractical to use MILP models to solve large-scale optimization problems. In this paper, we formulate and prove that the Planning of Electric Vehicle Charging Stations (PEVCS) is an NP-complete combinatorial optimization problem. We also prove that PEVCS has a significant effect, that is, submodularity. Additionally, we propose two efficient methods that use submodularity to improve the conventional methodology for PEVCS. Furthermore, we provide a provable guarantee for the performance of our proposed methods. Our experimental results demonstrate the efficiency and effectiveness of these methods on small-scale and large-scale datasets, especially in realistic large-scale situations.

关键词： Charging station planning Electric vehicle Combinatorial optimization mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A branch-and-bound algorithm for the Precedence-Constrained Minimum-Cost Arborescence problem

引用

COMPUTERS & OPERATIONS RESEARCH 2023年第1期156卷

作者： Dell'Amico, Mauro Jamal, Jafar Montemanni, Roberto Univ Modena & Reggio Emilia Reggio Emilia Italy

The Precedence-Constrained Minimum-Cost Arborescence problem, in which precedence constraints are enforced on pairs of vertices, has been recently proposed. The purpose of the constraints is to prevent the formation of directed paths along the tree that violate a precedence relationship. The problem has been shown to be NP-hard, and formulations for the problem have been proposed in the literature. This work introduces a branch-and-bound algorithm based on a Lagrangian relaxation for solving the problem. The results show that the newly proposed method is 74.6% faster, on average, compared to the state-of-the-art methods recently available in the literature.

关键词： Precedence constrained arborescences mixed integer linear programming Branch and bound Lagrangian relaxation Network optimization

来源：评论

学校读者我要写书评

暂无评论

Techno-economic evaluation of combined cycle gas turbine and a diabatic compressed air energy storage integration concept

引用

ENERGY 2023年第1期266卷

作者： Kruk-Gotzman, Sylwia Ziolkowski, Pawel Iliev, Iliya Negreanu, Gabriel-Paul Badur, Janusz Polish Acad Sci Inst Fluid Flow Machinery Dept Energy Convers Fiszera 14 PL-80231 Gdansk Poland Agencja Rynku Energii SA Browiecka 3 PL-00728 Warsaw Poland Gdansk Univ Technol Fac Mech Engn & Ship Technol Narutowicza 11-12 PL-80233 Gdansk Poland D Angel Kanchev Univ Ruse Dept Heat Hydraul & Environm Engn 8 Studentska Str Ruse 7017 Bulgaria Univ Politehn Bucuresti Fac Mech Engn & Mechatron Bucharest Romania

More and more operational flexibility is required from conventional power plants due to the increasing share of weather-dependent renewable energy sources (RES) generation in the power system. One way to increase power plant's flexibility is integrating it with energy storage. The energy storage facility can be used to minimize ramping or shutdowns and therefore should lower overall generating costs and CO2 *** this article, we examined the effects of a combined cycle gas turbine (CCGT) power plan and a compressed air energy storage (CAES) system integration. The main feature of the CCGT-CAES integration concept is using the CCGT installation as a heat recipient and provider for the CAES installation. This approach was applied to a real-life case study of the PGE Gorz acute accent ow CCGT power plant. First, technical feasibility of itegrating a CCGT plant with a CAES system was verified and the restrictions on the operating conditions were identified. Next, the improvement in flexibility was quantified by the additional profits gained from the integration. Polish day-ahead electricity prices were used as a measure for remunerating flexibility. Two models were developed in the Python computer programming language: a thermodynamic one and an economic one. The former was buit without the use of flowsheeting software or purpose-built industry specific tool. The latter was implemented within the frame of the PuLP library and solved using its default solver (CBC). By means of mixed integer linear programming (MILP) optimal generation schedules and maximum profits were found for three cases: an independent operation of the CCGT, an integrated CCGT-CAES plant and an integrated CCGT-ES plant with 81% storage *** results of the computational simulations contradict the supposition that the integration is economically viable, even if mechanical energy storage efficiency of 81% is assumed. Regarding the impact of the integration on the optimal schedule, alth

关键词： Combined cycle gas turbine power plant Compressed air energy storage system Flexible operation Thermo-economic optimization mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Two-stage meta-heuristic for part-packing and build-scheduling problem in parallel additive manufacturing

引用

APPLIED SOFT COMPUTING 2023年 136卷

作者： Lee, Seung Jae Kim, Byung Soo Incheon Natl Univ Dept Ind & Management Engn 119 Acad Ro Incheon 22012 South Korea

This paper studies the part-packing and build-scheduling problem in parallel additive manufacturing. The multi-part grouping, 2D placement, and 3D rotation should be determined in the part-packing problem. The build allocation and sequencing should be determined in the build-scheduling problem. The objective function is to minimize the makespan. A mixed integer linear programming (MILP) model is developed to find the optimal solution. Then, we propose a two-stage meta-heuristic that can decompose the proposed problem into the part-packing and the build-scheduling stages. In this paper, the two-stage meta-heuristic is applied to using a genetic algorithm (GA) and particle swarm optimization (PSO). To verify the performance of the two-stage meta-heuristic, two types of computational experiments are conducted. In the small-sized instance experiments, the two-stage meta-heuristic compares with the MILP model, and it shows a good performance. In the large-sized instance experiments, we compare two single-stage meta-heuristics applied to using the genetic algorithm and particle swarm optimization. The two-stage meta-heuristic shows the best performance among the proposed meta-heuristics. To analyze the experimental results and extract insights from the two-stage meta-heuristic, we conduct the robustness, impact of part rotation, and sensitivity analyses.

关键词： Scheduling Additive manufacturing mixed integer linear programming Genetic algorithm Particle swarm optimization

来源：评论

学校读者我要写书评

暂无评论

Designing modular capacitated emergency medical service using information on ambulance trip

引用

OPERATIONAL RESEARCH 2021年第3期21卷 1723-1742页

作者： Hammami, Sondes Jebali, Aida Univ Tunis El Manar Lab Anal Concept & Commande Syst LR 11 ES20 Ecole Natl Ingenieurs Tunis Tunis Tunisia Univ Carthage Ecole Natl Ingenieurs Carthage ENICarthage Tunis Tunisia Univ Paris Est Dept Ingn Syst ESIEE Paris BP 99 93162 Noisy Le Grand France

In this paper, we investigate the design of a two-tiered emergency medical service (EMS) system. The objective remains in determining the location and the capacity of modular ambulance stations that minimize the EMS system's cost while respecting a pre-specified response time. A novel approach considering advanced information on ambulance trip and accounting for ambulance busy fractions is proposed. This approach is compared to its counterpart traditional approach that does not consider ambulance trip. Two mixed integer linear programs are developed. Experimentation of the two models was conducted on a real life case study. The obtained results pointed out the usefulness and superiority of the proposed approach. A cost saving of 3% is achieved in addition to the reduction in ambulance round-trip time.

关键词： Two-tiered EMS Location allocation problem Ambulance trip information Modular capacity Busy fraction mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Metaheuristic approaches to a vehicle scheduling problem in sugar beet transportation

引用

OPERATIONAL RESEARCH 2021年第3期21卷 2021-2053页

作者： Anokic, Ana Stanimirovic, Zorica Stakic, Dorde Davidovic, Tatjana Univ Belgrade Fac Math Studentski Trg 16-4 Belgrade 11000 Serbia Univ Belgrade Fac Econ Kamenicka 6 Belgrade 11000 Serbia Serbian Acad Arts & Sci Math Inst Kneza Mihaila 36 Belgrade 11000 Serbia

A variant of vehicle scheduling problem (VSP) arising from the sugar beet transportation in a sugar factory in Serbia is introduced. The objective of the considered VSP is to minimize the required transportation time under problem-specific constraints. The problem is formulated as a mixed integer linear program (MILP). Within the framework of commercial CPLEX solver the proposed MILP model was able to produce optimal solutions for small size problem instances. Therefore, two metaheuristic methods, variable neighborhood search (VNS) and greedy randomized adaptive search procedure (GRASP), are designed to solve problem instances of larger dimensions. The proposed GRASP and VNS are evaluated and compared against CPLEX and each other on the set of real-life and generated problem instances. Computational results show that VNS is superior method with respect to the solution quality, while GRASP is able to find high quality solutions within very short running times.

关键词： Optimization in transport Vehicle scheduling problem mixed integer linear programming Variable neighborhood search Greedy Randomized Adaptive Search Procedure

来源：评论

学校读者我要写书评

暂无评论

Hybrid Continuous-Time MILP Model for Crude Oil Scheduling under the Influence of High Tides

引用

China Petroleum Processing & Petrochemical Technology 2021年第3期23卷 76-89页

作者： Zhou Zhiju Zhou Xiang Zhou Han SINOPEC Research Institute of Petroleum Processing Beijing 100083

Vessels,especially very large or ultra large crude carriers(VLCCs or ULCCs),often can only dock and leave the berth during high tide periods to prevent being ***,the current crude scheduling models do not take into account tidal conditions,which will seriously affect the feasibility of crude *** we first focus on the docking and leaving operations under the tidal actions,and establish a new hybrid continuous-time mixed integer linear programming(MILP)model which incorporates global event based formulation and unit-specific event based *** considering that the multiple blending of crude oil can easily cause the production fluctuating,there are some reasonable assumptions that storage tanks can only store pure crude,and charging tanks just can be refilled after being emptied,which helps us obtain a simple MILP model without composition discrepancy caused by crude *** cases are used to demonstrate the efficacy of proposed scheduling *** results show that the optimization schedule can minimize the demurrage of the vessels and the number of feeding changeovers of crude oil distillation units(CDUs).

关键词： crude scheduling tide continuous-time representation mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Dynamic unsplittable flows with path-change penalties: New formulations and solution schemes for large instances

引用

COMPUTERS & OPERATIONS RESEARCH 2023年第1期152卷

作者： Lamothe, Francois Rachelson, Emmanuel Hait, Alain Baudoin, Cedric Dupe, Jean-Baptiste Univ Toulouse ISAE SUPAERO Toulouse France Thales Alenia Space Toulouse France Ctr Natl Etud spatiales CNES Toulouse France

In this work, we consider the dynamic unsplittable flow problem. This variation of the unsplittable flow problem has received little attention so far. The unsplittable flow problem is an NP-hard extension of the multi-commodity flow problem where each commodity sends its flow on only one path. In its dynamic version, this problem features several time steps and a penalty is paid when a commodity changes its path from one time step to the next. We present several mixed-integer linear programming formulations for this problem and compare the strength of their linear relaxation. These formulations are embedded in several solvers which are extensively compared on small to large instances. One of these formulations must be solved through a column generation process whose pricing problem is more difficult than those used in classical flow problems. We present limitations of the pricing schemes proposed in earlier works and describe two new schemes with a better worst-case complexity. Overall, this work lays a strong algorithmic baseline for the resolution of the dynamic unsplittable flow problem, proposes original formulations, and discusses the compared advantages of each, thus hopefully contributing a step towards a better understanding of this problem for both OR researchers and practical applications.

关键词： Routing Unsplittable flows mixed integer linear programming Column generation Heuristics

来源：评论

学校读者我要写书评

暂无评论

Dispatch optimization of electric thermal energy storage within System Advisor Model

引用

JOURNAL OF ENERGY STORAGE 2023年 61卷

作者： Hamilton, William T. Neises, Ty W. Natl Renewable Energy Lab Thermal Syst R&D Grp 15013 Denver West Pkwy Golden CO 80401 USA

A stand-alone electric thermal energy storage (ETES) system converts low-value electricity into heat using resistance heating elements. During periods of high-value electricity, an ETES system uses a thermodynamic power cycle to convert stored thermal energy back to electricity. These dispatchable systems derive value from their ability to store energy when prices are low and generate electricity when prices are favorable, i.e., energy arbitrage. Consequently, dispatch optimization of system operations, through maximizing revenue subject to system constraints, is essential to evaluate the economic value of a particular system design. While stand-alone ETES systems offer potential advantages as dispatchable grid storage technologies, there is a lack of a neutral third-party, publicly available, open-source model to evaluate the performance, dispatch, and financial viability of these systems. To address this problem, we have developed a techno-economic model for stand-alone ETES systems, within National Renewable Energy Laboratory's (NREL's) System Advisor Model (SAM). We implement a mixed-integer linear program to determine an ETES optimal operating schedule that maximizes electricity sales less maintenance costs caused by operation and cycling given temporal-varying grid electricity prices. Our contributions include a mixed-integer linear program for energy arbitrage of an ETES system, an ETES performance model through a publicly-available software (i.e., SAM), and an exercise of our model through case studies that compare ETES operational strategies and annual financial metrics. With our dispatch optimization model, we were able to improve revenue by 20% compared to a myopic heuristic while reducing the operational cost of the ETES system through decreases in cycle starts, cycles per day, and heater starts.

关键词： Dispatch optimization Thermal energy storage mixed integer linear programming System advisor model Techno-economic analysis Energy arbitrage

来源：评论

学校读者我要写书评

暂无评论

Coordinating the day-ahead operation scheduling for demand response and water desalination plants in smart grid

引用

APPLIED ENERGY 2023年第1期335卷

作者： Elsir, Mohamed Al-Sumaiti, Ameena Saad Moursi, Mohamed Shawky El Al-Awami, Ali Taleb Khalifa Univ Adv Power & Energy Ctr Dept Elect Engn & Comp Sci POB 127788 Abu Dhabi U Arab Emirates King Fahd Univ Petr & Minerals Elect Engn Dhahran Saudi Arabia Interdisciplinary Res Ctr Smart Mobil & Logist Dhahran Saudi Arabia

Integrating renewable energy resources (RES) is a challenge for power system operators due to their fluctuations and unpredictability. At the same time, the water shortage problem and the needs to desalinate more freshwater increase the prominence of sufficient energy resources for sustainable operation. Therefore, this paper presents a market-clearing mechanism in a co-optimization model that coordinates the operation of grid-connected reverse osmosis water desalination plants (RO-WDPs) and the operation of renewable-rich power systems. It is assumed that electric demands can participate in the provision of demand response (DR) to the market via multiple DR options. The DR options related to the general loads are demand shifting, load curtailment, distributed generation, and hybrid energy storage systems (HESS). These HESS includes battery storage and hydrogen storage systems. Pertaining to their special characteristics, a new DR option is proposed as a customized option for RO-WDPs. The market clearing mechanism is assumed to be based on the security-constrained unit commitment (SCUC) and formulated as a stochastic mixed-integer linear programming problem (MILP) to optimally schedule the day-ahead operation of the power system. The presented model is applied on 6-bus and IEEE 24-bus reliability test system (RTS) test power systems with significant penetration of RES to demonstrate its merits. The simulation results show that the system efficiency is enhanced by adding the energy flexibility of RO-WDP without endangering the water demand-supply when using the proposed coordinated model. Hence, the total operation cost is minimized, the RES integration is facilitated, and the hourly electricity prices are smoothened.

关键词： Day-ahead schedule Demand response Load aggregation mixed integer linear programming Security-constrained unit commitment Reverse osmosis Membrane water desalination plant Energy-water nexus

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：