Search

This paper presents an effective perturbation-based thresholding search for two popular and challenging packing problems with minimal containers: packing N identical circles in a square and packing N identical spheres in a cube. Following the penalty function approach, we handle these constrained optimization problems by solving a series of unconstrained optimization subproblems with fixed containers. The proposed algorithm relies on a two-phase search strategy that combines a thresholding search method reinforced by two general-purpose perturbation operators and a container adjustment method. The performance of the algorithm is assessed relative to a large number of benchmark instances widely studied in the literature. Computational results show a high performance of the algorithm on both problems compared with the state-of-the-art results. For circle packing, the algorithm improves 156 best-known results (new upper bounds) in the range of 2 ≤ N ≤ 400 and matches 242 other best-known results. For sphere packing, the algorithm improves 66 best-known results in the range of 2 ≤ N ≤ 200 , whereas matching the best-known results for 124 other instances. Experimental analyses are conducted to shed light on the main search ingredients of the proposed algorithm consisting of the two-phase search strategy, the mixed perturbation and the parameters. History: Accepted by Erwin Pesch, Area Editor for Heuristic Search & Approximation Algorithms. Funding: This work was supported by the National Natural Science Foundation of China [Grants 61703213 and 61933005]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.1290) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2022.0004) at (http://dx.doi.org/10.5281/zenodo.7579558). [ABSTRACT FROM AUTHOR]

For an unbalanced cooperative game, its grand coalition can be stabilized by some instruments, such as subsidization and penalization, that impose new cost terms to certain coalitions. In this paper, we study an alternative instrument, referred to as cost adjustment, that does not need to impose any new coalition-specific cost terms. Specifically, our approach is to adjust existing cost coefficients of the game under which (i) the game becomes balanced so that the grand coalition becomes stable, (ii) a desired way of cooperation is optimal for the grand coalition to adopt, and (iii) the total cost to be shared by the grand coalition is within a prescribed range. Focusing on a broad class of cooperative games, known as integer minimization games, we formulate the problem on how to optimize the cost adjustment as a constrained inverse optimization problem. We prove NP -hardness and derive easy-to-check feasibility conditions for the problem. Based on two linear programming reformulations, we develop two solution algorithms. One is a cutting-plane algorithm, which runs in polynomial time when the corresponding separation problem is polynomial time solvable. The other needs to explicitly derive all the inequalities of a linear program, which runs in polynomial time when the linear program contains only a polynomial number of inequalities. We apply our models and solution algorithms to two typical unbalanced games, including a weighted matching game and an uncapacitated facility location game, showing that their optimal cost adjustments can be obtained in polynomial time. History: Accepted by Area Editor Andrea Lodi for Design & Analysis of Algorithms—Discrete. Funding: This work was supported by the National Natural Science Foundation of China [Grants 72022018 and 72091210]; the Research Grants Council of the Hong Kong SAR, China [Grant 16210020]; Hong Kong Polytechnic University [Grant P0032007]; and the Youth Innovation Promotion Association, Chinese Academy of Sciences [Grant 2021454]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/ijoc.2022.0268. [ABSTRACT FROM AUTHOR]

Rainfall runoff pollution is one of the main causes of water quality deterioration in urban water system. Setting up initial rainwater storage tank could be one of the rapid and effective methods to control runoff pollution. In order to speed up the water environment management processes, the Chinese government has adopted the Public-Private-Partnership (PPP) mode in the water environment treatment to deal with the shortage of funds. Ensuring water quality and controlling water environment management cost are key to PPP projects. Therefore, factors such as pollutant accumulation characteristics of the catchment, land space availability, sewage treatment plants capacity, and river water management cost should be considered during the design of the initial rainwater storage tank on the premise of ensuring water quality. The empirical design method can hardly meet these requirements simultaneously. Under the background of PPP water environment treatment project, a constrained economic optimization model of the initial rainwater storage tank was presented in this paper. The relationship between the total cost of the water environment management and the interception rate of the initial rainwater storage tanks was established by means of Artificial Neural Network (ANN), while the penalty function was used to transform the constrained optimization problem into an unconstrained optimization problem. The interception rate of the initial rainwater storage tanks was then optimized by means of Particle Swarm Optimization (PSO), and the designed volume of the storage tanks was calculated according to the relationship between the interception rate of the storage tank and the cumulative runoff of the related catchment. Finally, a case study of a PPP demonstration project in a plain city in China was conducted. The results demonstrated that compared with the specification method, the total volume of the initial rainwater storage tank increased by 38.7%, the interception rate increased by 68.4%, and the total cost of river water treatment decreased by 5.7% under the constraints of land space availability and sewage treatment capacity. In addition, the optimized method proposed in this paper could reflect the pollutant accumulation characteristics of the catchment. It not only reduce the total cost of the water environment management but also effectively reduce the impact of non-point source pollution on urban water system, and could be more widely used in other areas and PPP projects. [ABSTRACT FROM AUTHOR]

We study adjustable distributionally robust optimization problems, where their ambiguity sets can potentially encompass an infinite number of expectation constraints. Although such ambiguity sets have great modeling flexibility in characterizing uncertain probability distributions, the corresponding adjustable problems remain computationally intractable and challenging. To overcome this issue, we propose a greedy improvement procedure that consists of solving, via the (extended) linear decision rule approximation, a sequence of tractable subproblems—each of which considers a relaxed and finitely constrained ambiguity set that can be iteratively tightened to the infinitely constrained one. Through three numerical studies of adjustable distributionally robust optimization models, we show that our approach can yield improved solutions in a systematic way for both two-stage and multistage problems. History: Accepted by Pascal Van Hentenryck, Area Editor for Computational Modeling: Methods & Analysis. Funding: Financial support by the Early Career Scheme from the Hong Kong Research Grants Council [Project No. CityU 21502820], the CityU Start-Up Grant [Project No. 9610481], the CityU Strategic Research Grant [Project No. 7005688], the National Natural Science Foundation of China [Project No. 72032005], and Chow Sang Sang Group Research Fund sponsored by Chow Sang Sang Holdings International Limited [Project No. 9229076] is gratefully acknowledged. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2021.0181), as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2021.0181). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR]

The parameters of fractures, such as fracture geometries, placement, and conductivity, are critical for the production of horizontal wells in tight gas reservoirs. Current studies on fracture parameter optimization, especially those using the optimization algorithms, are often based on the assumptions that the fractures are uniformly placed with equal length and conductivity. However, non-uniform designs of fracture spacing have been proved to be effective in reducing fracture interference as well as increasing the well production, especially with strong rock heterogeneity. In addition, most of the current literature focuses on identifying optimal hydraulic fracture geometries without considering the fracture propagation process, which may oversimplify the evaluation of completion cost and result in fracture geometries that cannot be realized in practice. In this paper, an automatic optimization process, which could efficiently couple the fracture propagation, is proposed to optimize the fracture parameters. The genetic algorithm (GA) with penalty function method is used to optimize the constraint and non-linear problem. A modified PKN fracture propagation model is established to quickly predict the hydraulic fracture geometries. Fracture locations and fluid injection volume are sequentially optimized with consideration of heterogeneous rock properties. Model parameters are taken from typical tight gas horizontal wells in Jinqiu gas field in Sichuan Province, China. The results show the importance of permeability on both fracture length and production in tight gas well. The lower the permeability, the more significant the production increase after fracture location optimization. More fractures tend to be placed in area with small permeability and fewer fractures are required in highly permeable regions. With an increase in rock heterogeneity, the distribution of fractures becomes more uneven. Conversely, increasing the number of fractures can lead to a more even distribution of fractures. More fluid should be injected in low-permeability regions according to the optimization results. The optimization method is applied to a practical tight gas well in Sichuan Basin and the cumulative gas production can be increased by 6.5% to 8% when compared with the initial uniform designs. • A modified PKN model is proposed for quick prediction of fracture propagation, validated against numerical simulations. • GA is used to optimize fracture locations by considering rock heterogeneity's impact on fracture propagation and production. • Sequential optimization of fracture placement and injection volume is conducted with its reliability verified. [ABSTRACT FROM AUTHOR]

Recognizing and classifying natural or artificial geo-objects under complex geo-scenes using remotely sensed data remains a significant challenge due to the heterogeneity in their spatial distribution and sampling bias. In this study, we propose a deep learning method of surface complexity analysis based on multiscale entropy. This method can be used to reduce sampling bias and preserve entropy-based invariance in learning for the semantic segmentation of land use and land cover (LULC) images. Our quantitative models effectively identified and extracted local surface complexity scores, demonstrating their broad applicability. We tested our method using the Gaofen-2 image dataset in mainland China and accurately estimated multiscale complexity. A downstream evaluation revealed that our approach achieved similar or better performance compared to several representative state-of-the-art deep learning methods. This highlights the innovative and significant contribution of our entropy-based complexity analysis and its applicability in improving LULC semantic segmentations through optimal stratified sampling and constrained optimization, which can also potentially be used to enhance semantic segmentation under complex geo-scenes using other machine learning methods. [ABSTRACT FROM AUTHOR]

In recent years, the ever-increasing charging demand of electric vehicles (EVs) imposes challenges on both power supply security and reliability in the distribution system. In this paper, an EV accommodation capability evaluation model of a distribution system, with high penetrations of flexible resources, is established. Firstly, according to the actual classifications of EVs and transportation rules, a Monte Carlo simulation is used to simulate the charging behaviors of EVs so as to obtain the relevant parameters of EV charging. Then, a coordinated charging optimization model for various types of EVs is proposed based on the charging characteristics of EVs. The presented model comprises a mixed-integer linear programming problem and a constrained optimization problem which are respectively solved by CPLEX (the Simplex method implemented in the °C programming language) and the particle swarm optimization (PSO) algorithm. Last of all, a real-life distribution system in the coastal areas of China is served for demonstrating the feasibility and efficiency of the proposed approach. Moreover, the impacts of flexible resources, distribution network zoning rules, and EV growth on the EV accommodation capability of a distribution system are also discussed. [ABSTRACT FROM AUTHOR]

Abstract: This paper addresses super-efficiency issue based on input relaxation model in stochastic data envelopment analysis. The proposed model is not limited to using the input amounts of evaluating DMU, and one can obtain a total ordering of units by using this method. The input relaxation super-efficiency model is developed in stochastic data envelopment analysis, and its deterministic equivalent, also, is derived which is a nonlinear program. Moreover, it is shown that the deterministic equivalent of the stochastic super-efficiency model can be converted to a quadratic program. As an empirical example, the proposed method is applied to the data of textile industry of China to rank efficient units. Finally, when allowable limits of data variations for evaluating DMU are permitted, the sensitivity analysis of the proposed model is discussed. [Copyright &y& Elsevier]

Timely and accurate monitoring of the spatiotemporal changes in drought is very important for the reduction in the social losses caused by drought. The Optimized Meteorological Drought Index (OMDI), originally established in southwestern China, showed great potential for drought monitoring over large regions on a large scale. However, the applicability of the index requires further evaluation, especially when used throughout China, which has a different agricultural divisions, variable climatic conditions, complex terrain and diverse land cover. In addition, the OMDI model relies on training data to construct local parameters for the model. On a large scale, it is of great significance to use multisource remote sensing data sets to construct OMDI model parameters. In this paper, the constrained optimization method was used to establish weights for the MODIS-derived Vegetation Conditional Index (VCI), TRMM-derived Precipitation Condition Index (PCI), and GLDAS-derived Soil Moisture Condition Index (SMCI) and calculate the OMDI based on the Standard Precipitation Index (SPI), Standardized Precipitation Evapotranspiration Index (SPEI) and weather stations. The accuracy of the OMDI model was evaluated by using the correlation coefficient. Moreover, the spatiotemporal changes in drought were also analyzed through trend analysis, Mann-Kendall (MK) statistics and the Hurst index on the monthly and annual scales. The results showed that (1) the highest positive correlation between the OMDI and the SPI was SPI-1, which was higher than that for any other month interval, such as 3 months, 6 months, 9 months and 12 months of the SPI. The results indicated that the OMDI was suitable to monitor meteorological drought. (2) In the nine agricultural subareas in China, the degree of drought in the Yangtze River (DYR) area had the most severe evolution and change frequency. This region was very sensitive to drought in the past two decades. (3) The area with OMDI variation coefficient less than 0.1 accounted for 94%, indicating that the degree of drought fluctuates little; The linear tendency rate is 0.0004, and the area greater than 0 reaches 66.44%, indicating that the drought is developing in a lightning trend. (4) The Hurst index value is mostly higher than 0.5 (the area ratio is 56.31%), and the area of "Positive-Consistent" and "Negative- Opposite" accounted for 54.02%, indicating that more than half of China's area drought changes will show a trend of mitigation in the future. [Display omitted] • OMDI model was improved based on multi-source remote sensing data sets. •OMDI model was improved based on constrained optimization theory. •Drought dynamics was monitored on large scale based on remote sensing technology. •Drought conditions in China were valuated both on month scale and annual scale. •Change trend in the future was analyzed using Linear trend and OMDI Hurst index. [ABSTRACT FROM AUTHOR]