A near-optimal solution method for coordinated operation planning problem of power- and heat-interchange networks using column generation-based decomposition

Energy ◽  
2020 ◽  
Vol 197 ◽  
pp. 117118
Author(s):  
Tetsuya Wakui ◽  
Moe Hashiguchi ◽  
Ryohei Yokoyama
2021 ◽  
Vol 13 (12) ◽  
pp. 6708
Author(s):  
Hamza Mubarak ◽  
Nurulafiqah Nadzirah Mansor ◽  
Hazlie Mokhlis ◽  
Mahazani Mohamad ◽  
Hasmaini Mohamad ◽  
...  

Demand for continuous and reliable power supply has significantly increased, especially in this Industrial Revolution 4.0 era. In this regard, adequate planning of electrical power systems considering persistent load growth, increased integration of distributed generators (DGs), optimal system operation during N-1 contingencies, and compliance to the existing system constraints are paramount. However, these issues need to be parallelly addressed for optimum distribution system planning. Consequently, the planning optimization problem would become more complex due to the various technical and operational constraints as well as the enormous search space. To address these considerations, this paper proposes a strategy to obtain one optimal solution for the distribution system expansion planning by considering N-1 system contingencies for all branches and DG optimal sizing and placement as well as fluctuations in the load profiles. In this work, a hybrid firefly algorithm and particle swarm optimization (FA-PSO) was proposed to determine the optimal solution for the expansion planning problem. The validity of the proposed method was tested on IEEE 33- and 69-bus systems. The results show that incorporating DGs with optimal sizing and location minimizes the investment and power loss cost for the 33-bus system by 42.18% and 14.63%, respectively, and for the 69-system by 31.53% and 12%, respectively. In addition, comparative studies were done with a different model from the literature to verify the robustness of the proposed method.


2020 ◽  
Vol 12 (13) ◽  
pp. 2123 ◽  
Author(s):  
Leran Han ◽  
Chunmei Wang ◽  
Tao Yu ◽  
Xingfa Gu ◽  
Qiyue Liu

This paper proposes a combined approach comprising a set of methods for the high-precision mapping of soil moisture in a study area located in Jiangsu Province of China, based on the Chinese C-band synthetic aperture radar data of GF-3 and high spatial-resolution optical data of GF-1, in situ experimental datasets and background knowledge. The study was conducted in three stages: First, in the process of eliminating the effect of vegetation canopy, an empirical vegetation water content model and a water cloud model with localized parameters were developed to obtain the bare soil backscattering coefficient. Second, four commonly used models (advanced integral equation model (AIEM), look-up table (LUT) method, Oh model, and the Dubois model) were coupled to acquire nine soil moisture retrieval maps and algorithms. Finally, a simple and effective optimal solution method was proposed to select and combine the nine algorithms based on classification strategies devised using three types of background knowledge. A comprehensive evaluation was carried out on each soil moisture map in terms of the root-mean-square-error (RMSE), Pearson correlation coefficient (PCC), mean absolute error (MAE), and mean bias (bias). The results show that for the nine individual algorithms, the estimated model constructed using the AIEM (mv1) was significantly more accurate than those constructed using the other models (RMSE = 0.0321 cm³/cm³, MAE = 0.0260 cm³/cm³, and PCC = 0.9115), followed by the Oh model (m_v5) and LUT inversion method under HH polarization (mv2). Compared with the independent algorithms, the optimal solution methods have significant advantages; the soil moisture map obtained using the classification strategy based on the percentage content of clay was the most satisfactory (RMSE = 0.0271 cm³/cm³, MAE = 0.0225 cm³/cm³, and PCC = 0.9364). This combined method could not only effectively integrate the optical and radar satellite data but also couple a variety of commonly used inversion models, and at the same time, background knowledge was introduced into the optimal solution method. Thus, we provide a new method for the high-precision mapping of soil moisture in areas with a complex underlying surface.


Omega ◽  
2021 ◽  
pp. 102581
Author(s):  
Zhe Zhang ◽  
Xue Gong ◽  
Xiaoling Song ◽  
Yong Yin ◽  
Benjamin Lev ◽  
...  

Author(s):  
Houssem Felfel ◽  
Omar Ayadi ◽  
Faouzi Masmoudi

In this paper, a multi-objective, multi-product, multi-period production and transportation planning problem in the context of a multi-site supply chain is proposed. The developed model attempts simultaneously to maximize the profit and to maximize the product quality level. The objective of this paper is to provide the decision maker with a front of Pareto optimal solutions and to help him to select the best Pareto solution. To do so, the epsilon-constraint method is adopted to generate the set of Pareto optimal solutions. Then, the technique for order preference by similarity to ideal solution (TOSIS) is used to choose the best compromise solution. The multi-criteria optimization and compromise solution (VIKOR), a commonly used method in multiple criteria analysis, is applied in order to evaluate the selected solutions using TOPSIS method. This paper offers a numerical example to illustrate the solution approach and to compare the obtained results using TOSIS and VIKOR methods.


2020 ◽  
Vol 10 (7) ◽  
pp. 2403
Author(s):  
Yanjun Shi ◽  
Lingling Lv ◽  
Fanyi Hu ◽  
Qiaomei Han

This paper addresses waste collection problems in which urban household and solid waste are brought from waste collection points to waste disposal plants. The collection of waste from the collection points herein is modeled as a multi-depot vehicle routing problem (MDVRP), aiming at minimizing the total transportation distance. In this study, we propose a heuristic solution method to address this problem. In this method, we firstly assign waste collection points to waste disposal plants according to the nearest distance, then each plant solves the single-vehicle routing problem (VRP) respectively, assigning customers to vehicles and planning the order in which customers are visited by vehicles. In the latter step, we propose the sector combination optimization (SCO) algorithm to generate multiple initial solutions, and then these initial solutions are improved using the merge-head and drop-tail (MHDT) strategy. After a certain number of iterations, the optimal solution in the last generation is reported. Computational experiments on benchmark instances showed that the initial solutions obtained by the sector combination optimization algorithm were more abundant and better than other iterative algorithms using only one solution for initialization, and the solutions with distance gap were obtained using the merge-head and drop-tail strategy in a lower CPU time compared to the Tabu search algorithm.


2013 ◽  
Vol 365-366 ◽  
pp. 194-198 ◽  
Author(s):  
Mei Ni Guo

mprove the existing genetic algorithm, make the vehicle path planning problem solving can be higher quality and faster solution. The mathematic model for study of VRP with genetic algorithms was established. An improved genetic algorithm was proposed, which consist of a new method of initial population and partheno genetic algorithm revolution operation.Exploited Computer Aided Platform and Validated VRP by simulation software. Compared this improved genetic algorithm with the existing genetic algorithm and approximation algorithms through an example, convergence rate Much faster and the Optimal results from 117.0km Reduced to 107.8km,proved that this article improved genetic algorithm can be faster to reach an optimal solution. The results showed that the improved GA can keep the variety of cross and accelerate the search speed.


Author(s):  
Kosuke Kato ◽  
◽  
Masatoshi Sakawa ◽  
Keiichi Ishimaru ◽  
Satoshi Ushiro ◽  
...  

Urban district heating and cooling (DHC) systems operate large freezers, heat exchangers, and boilers to stably and economically supply hot and cold water, steam, etc., based on customer demand. We formulate an operation-planning problem as a nonlinear integer programming problem for an actual DHC plant. To reflect actual decision making appropriately, we incorporate contract-violation penalties into the running cost consisting of fuel and arrangements expenses. We, then, solve operation-planning problems with and without penalties, demonstrating the effectiveness of taking penalties into consideration.


2018 ◽  
Vol 33 (4) ◽  
pp. 3678-3690 ◽  
Author(s):  
Rafael Bruno S. Brandi ◽  
Andre Luis Marques Marcato ◽  
Bruno Henriques Dias ◽  
Tales Pulinho Ramos ◽  
Ivo Chaves da Silva Junior

Sign in / Sign up

Export Citation Format

Share Document