In this study, we introduce the Covering Tour Problem with Arc Upgrade (CTPAU), an extension of the Covering Tour Problem (CTP) that exploits the possibility of enhancing the network by upgrading arcs. The CTP is defi...
详细信息
ISBN:
(纸本)9783031782404;9783031782411
In this study, we introduce the Covering Tour Problem with Arc Upgrade (CTPAU), an extension of the Covering Tour Problem (CTP) that exploits the possibility of enhancing the network by upgrading arcs. The CTP is defined on a graph consisting of three sets of nodes: those requiring coverage, those eligible to provide coverage, and a subset of the latter which must be visited. The objective is to determine the minimum cost tour that complies with both visiting and covering requirements. We introduce a further aspect on the problem given by the possibility of arc upgrades. Such upgrades decrease the length of an arc, usually within specific limits, incurring a cost directly proportional to the degree of reduction. Thus, the CTPAU aims to determine the minimum cost tour that meets the CTP requirements and incorporates the possibility of upgrading arcs, satisfying a budget constraint. To address this problem, we developed a mixedintegerlinearprogramming formulation and conducted experiments on benchmark instances from TSPLIB to assess our approach.
The state-of-the-art approach for computing alignments is to apply an exhaustive state-space search with a well-tailored A*-heuristic function. If the heuristic fails to provide good estimates, the alignment computati...
详细信息
The benefits of thermal storage in hybrid energy systems (HESs) are multiple, being among others the enhancement of flexibility of the network and of the efficiency in the energy resources use, by also reducing the ov...
详细信息
The benefits of thermal storage in hybrid energy systems (HESs) are multiple, being among others the enhancement of flexibility of the network and of the efficiency in the energy resources use, by also reducing the overall cost of the energy system. Choosing the capacity of TSS to minimize the operational cost of the HES is not a trivial task, depending on several variables existing at both supply and demand sides. The contribution of this paper is to present the experimental validation of an innovative optimization model aiming to identify the optimal capacity of TSS in HESs that maximizes the economic performances. The optimization model is based on a mixed-integer linear programming approach and allows determining the optimal hourly operating strategies of the system components as well as the optimal capacity of the TSS, while minimizing the total daily energy costs. The optimized hourly operation schedule of the HES was simulated experimentally by using one of the systems from the TSS laboratory of ENEA Portici Research Center. The experimental results demonstrated the practical applicability of the proposed optimization model. In fact, a good overlap was found between the results obtained from the implementation of the optimization model with those obtained from the experimental simulation, both considering energy and economic data.
In this paper, we propose a novel mixed-integer Non-linear Optimization formulation to construct a risk score, where we optimize the logistic loss with sparsity constraints. Previous approaches are typically designed ...
详细信息
The transition to sustainable energy systems has highlighted the critical need for efficient sizing of renewable energy resources in microgrids. In particular, designing photovoltaic (PV) and battery systems to meet r...
详细信息
Security-constrained unit commitment (SCUC) model is used for power system day-ahead scheduling. However, current SCUC model uses a static network to deliver power and meet demand optimally. A dynamic network can prov...
详细信息
Security-constrained unit commitment (SCUC) model is used for power system day-ahead scheduling. However, current SCUC model uses a static network to deliver power and meet demand optimally. A dynamic network can provide a lower optimal cost and alleviate network congestion. However, due to the computational complexity and the lack of effective algorithms, network reconfiguration has not been included in the SCUC model yet. This paper presents a novel approach to handle the computational complexity in security-constrained unit commitment (SCUC) with corrective network reconfiguration (CNR) while considering the scalability through accelerated-decomposition approach with fast screening non-critical sub-problems of SCUC-CNR. The proposed approach provides substantial computational benefits and is also applicable to SCUC. Simulation results on the IEEE 24-bus system show that the proposed methods are substantially faster without the loss in solution quality while the scalability benefits are demonstrated using larger cases: the IEEE 73-bus system, IEEE 118-bus system and Polish system.
This study quantified the impact of future battery electric vehicle (EV) charging on the least-cost electricity generation portfolio in South Africa (RSA). This was done by performing a capacity expansion optimization...
详细信息
This study quantified the impact of future battery electric vehicle (EV) charging on the least-cost electricity generation portfolio in South Africa (RSA). This was done by performing a capacity expansion optimization of the generation fleet for the year 2040. It was assumed that there would be 2.8 million EVs by 2040, informed by global estimates. Two EV charging scenarios were tested, one using an aggregated fixed charging profile based on existing literature and another where the charging demand was optimized by the power system based on least cost. The results showed that additional capacity was required to meet the demand. For both scenarios, the least-cost capacity investment technologies chosen were the same, although the quantities differed. This indicates that the least-cost technology choice was robust against the charging profiles. The optimized charging profile led to lower system costs and a slightly higher energy share from solar relative to the fixed charging case.
In this paper, we study the joint optimization problem of computation path selection and workload allocation for in-network computing at the edge. The existing works, which only consider the end-to-end latency, ignore...
详细信息
The integration of renewable energy sources has significantly advanced sustainability efforts, yet their intermittent nature poses challenges to grid stability. Electricity-Hydrogen (EH) storage systems have emerged a...
详细信息
Quantum optimization shows significant potential in tackling complex combinatorial challenges, prompting our research exploration into the domain of quantum computing to address the Bin Packing Problem (BPP) through Q...
详细信息
ISBN:
(纸本)9798350373981;9798350373974
Quantum optimization shows significant potential in tackling complex combinatorial challenges, prompting our research exploration into the domain of quantum computing to address the Bin Packing Problem (BPP) through Quadratic Unconstrained Binary Optimization (QUBO) formulations. This work-in-progress paper outlines our proposal for a thorough study that encompasses classical bin packing formulations, initiating with the mixedintegerlinear Program, followed by a comparative analysis of the corresponding QUBO representations, and adopting a structured approach of Quantum Annealing on the D-Wave machine. While our work is still in progress, continuous comparative analyses are being conducted to evaluate various QUBO formulations, derived from diverse classical bin packing models, aiming to identify the most efficient QUBO for addressing the BPP. On another front, efforts are dedicated to refining the solution process further, with a focus on enhancing the precision of the selected QUBO formulation.
暂无评论