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

Cost efficiency in water supply systems: An applied review on optimization models for the pump scheduling problem

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2025年第1期323卷 1-19页

作者： Bras, Marlene Moura, Ana Andrade-Campos, Antonio Univ Aveiro Dept Econ Management Ind Engn & Tourism Res Unit Governance Competitiveness & Publ Pol GOV Aveiro Portugal Univ Aveiro Ctr Mech Technol & Automat DEM TEMA Dept Mech Engn Aveiro Portugal Intelligent Syst Associate Lab LASI Guimaraes Portugal

The need for efficient pump operation in water supply systems (WSS) has become increasingly important over time, driven by the growing energy consumption and the associated energy costs. Forecasts for 2050 anticipate a global increase in water demand by 55%, indicating an increasing surge in WSS energy consumption. Control of pumping stations, which consume 70% of the energy in WSS, is the most critical area for optimization. This optimization challenge is commonly referred as the pump scheduling problem (PSP), and can be addressed using a variety of mathematical formulations. While numerous formulations exist to solve this optimization problem, the large majority of the studies are focus on the optimization techniques, sidelining the problem formulation. Due to the unique physical characteristics of each WSS, individual mathematical formulations may exhibit different levels of performance. In addition to general pumps' operation optimization, the employment of variable speed pumps (VSP) can lead to significant energy savings compared to fixed speed pumps (FSP). However, despite their apparent benefits, many established optimization models for the PSP have not yet incorporated VSP decision variables into their formulations. Therefore, this work aims to review the main mathematical formulations for the pump scheduling problem for WSS with VSP and to present a quantitative comparative study of three mathematical formulations applied to a case study in the literature. The comparative analysis here presented revealed that the optimization model based on duty cycles is more cost-efficient when compared to alternative approaches discussed in the literature.

关键词： Nonlinear programming linear programming Water supply systems Pump scheduling problem Optimization models

来源：评论

学校读者我要写书评

暂无评论

Developing an efficient and optimized irrigation plan under varying water-supply regimes

引用

AIN SHAMS ENGINEERING JOURNAL 2025年第2期16卷

作者： Agrawal, Purushottam Sinha, Jitendra Jangre, Nilima Kumar, Fanesh Kamalkant Sinha, Alok Singh, Ashwin Banerjee, Ashes Venkatesh, Akella Satya Pasupuleti, Srinivas Indian Sch Mines Indian Inst Technol Dept Environm Sci & Engn Dhanbad 826004 India Indira Gandhi Krishi Vishwavidyalaya Dept Soil & Water Engn SVCEAT & RS Raipur 492012 India Banda Univ Agr & Technol Coll Agr Engn & Technol Banda 210001 India Swami Vivekananda Univ Dept Civil Engn Kolkata 700121 India Indian Sch Mines Indian Inst Technol Dept Appl Geol Dhanbad 826004 India Indian Sch Mines Indian Inst Technol Dept Civil Engn Dhanbad 826004 Jharkhand India

Crop development relies on water availability, needs, and application, necessitating large irrigation projects to ensure sustainable and equitable agriculture in the long term. This study investigates water losses and gaps during paddy cultivation in India's tropical semi-arid region, where agriculture is the primary economic driver for communities. Given the population's heavy reliance on rice, paddy cultivation was closely examined to identify irrigation-related vulnerabilities. An optimal irrigation plan was developed based on the analysis of the current water supply scenario for four different paddy production situations: 1) Rainfed (10 ha), 2) Rain + Canal irrigated (2174 ha), 3) Rain + Borewell + Rivulet irrigated (165 ha), and 4) Rain + Canal + Borewell irrigated (243 ha). The dependable water availability from rains and canals was calculated at a 75 % probability of exceedance to formulate an optimal water supply for the crop. Under this plan, the required water depth is reduced from 32.9 mm to 7.4 mm, saving 0.6167 Mm3 of water. In areas with optimized canal supply, no borewell water is needed for the canal-irrigated land supported by borewells (243 ha).

关键词： Crop water requirement Rainfed Canal irrigation linear programming Probability

来源：评论

学校读者我要写书评

暂无评论

Angular Reconstructive Discrete Embedding With Fusion Similarity for Multi-View Clustering

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2025年第1期37卷 45-59页

作者： Bian, Jintang Xie, Xiaohua Wang, Chang-Dong Yang, Lingxiao Lai, Jian-Huang Nie, Feiping Sun Yat Sen Univ Sch Comp Sci & Engn Guangzhou 510006 Peoples R China Guang Dong Prov Key Lab Informat Secur Technol Guangzhou 510006 Peoples R China Northwestern Polytech Univ Sch Comp Sci Sch Artificial Intelligence Opt & Elect iOPEN Xian 710072 Peoples R China Northwestern Polytech Univ Key Lab Intelligent Interact & Applicat Minist Ind & Informat Technol Xian 710072 Peoples R China

Effectively and efficiently mining valuable clustering patterns is a challenging problem when handling large-scale data from diverse sources. Existing approaches adopt anchor graph learning or binary representation embedding to reduce computational complexity. Normally, anchor graph learning can not directly obtain the clustering assignment except adopt the post-processing stage, such as graph cut or k-means clustering. The binary representation embedding neglects the structure information in Hamming space. In order to overcome these limitations, this paper proposes a novel, effective, and efficient angular reconstructive discrete embedding method with fusion similarity for a multi-view clustering (AFMC) that can jointly learn the global and local structure preserving binary representation and clustering assignment. Specifically, we propose to use angular reconstructive error minimization to maintain the global similarity correlation of binary representations of heterogeneous features in a common Hamming space. Moreover, we design a multi-view discrete ridge regression with fusion similarity term to handle the out-of-sample problem and preserve the local manifold structure. In addition, we propose an efficient optimization algorithm with linear computational complexity to solve the non-convex and non-smooth objective function. The experimental results demonstrate that AFMC outperforms several state-of-the-art large-scale multi-view clustering methods.

关键词： Clustering methods Vectors Correlation Manifolds Hypercubes Optimization Costs Computational complexity linear programming Eigenvalues and eigenfunctions Angular reconstructive embedding binary representation learning large-scale clustering multi-view learning

来源：评论

学校读者我要写书评

暂无评论

Bike network planning in limited urban space

引用

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL 2025年 192卷

作者： Wiedemann, Nina Nobel, Christian Ballo, Lukas Martin, Henry Raubal, Martin Swiss Fed Inst Technol Inst Cartog & Geoinformat Zurich Switzerland Swiss Fed Inst Technol Inst Operat Res Zurich Switzerland Swiss Fed Inst Technol Inst Transport Planning & Syst Zurich Switzerland

The lack of cycling infrastructure in urban environments hinders the adoption of cycling as a viable mode for commuting, despite the evident benefits of (e-)bikes as sustainable, efficient, and health-promoting transportation modes. Bike network planning is a tedious process, relying on heuristic computational methods that frequently overlook the broader implications of introducing new cycling infrastructure, in particular the necessity to repurpose car lanes. In this work, we call for optimizing the trade-off between bike and car networks, effectively pushing for Pareto optimality. This shift in perspective gives rise to a novel linear programming formulation towards optimal bike network allocation. Our experiments, conducted using both real-world and synthetic data, testify the effectiveness and superiority of this optimization approach compared to heuristic methods. In particular, the framework provides stakeholders with a range of lane reallocation scenarios, illustrating potential bike network enhancements and their implications for car infrastructure. Crucially, our approach is adaptable to various bikeability and car accessibility evaluation criteria, making our tool a highly flexible and scalable resource for urban planning. This paper presents an advanced decision-support framework that can significantly aid urban planners in making informed decisions on cycling infrastructure development.

关键词： Cycling infrastructure Urban planning linear programming Pareto optimality

来源：评论

学校读者我要写书评

暂无评论

Voxel-Sensitive Attention-Based Lattice Structure Residual Network for Low-Dose CT Image Denoising Using Wavelet-Based Structure Loss

引用

IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT 2025年 74卷

作者： Saidulu, Naragoni Kumar, Vinit Muduli, Priya Ranjan Indian Inst Technol BHU Varanasi Dept Elect Engn Varanasi 221005 India

Low-dose computed tomography (LDCT) imaging safeguards patients from potentially harmful X-rays. However, the signal-to-noise ratio (SNR) and computed tomography (CT) image quality deteriorate due to lower X-ray flux in the LDCT imaging modality. The custom design of deep networks with vanilla convolution layers ignores sensitive voxel information. Hence, voxel details for reconstructing low-contrast regions and high-frequency lesion edges may be lost during noise suppression. In addition, existing techniques do not satisfactorily address the problem of adversarial learning-induced structural deformation. This article proposes a LDCT denoising method based on Wasserstein GAN (WGAN) with three novel contributions. First, we introduce a novel build block called a voxel-sensitive attention-based lattice residual block (VSA-LRB). The generator network with stacked VSA-LRB can preserve the long-range pixel dependency while aggregating the voxel-sensitive features extracted along the spatial (H x W) and depthwise (D) directions. Furthermore, we train the proposed denoising network to learn efficient structural features via our proposed wavelet-based structural loss. The error is estimated on the wavelet-domain structural feature space, extracted by a dedicated pretrained CT-specific structure-aware network (CT-SANet). Hence, the wavelet-based loss function effectively mitigates structural distortions. We introduce a differential content loss to improve high-frequency lesion boundaries. The proposed method is validated qualitatively and quantitatively using two publicly available datasets: the "2016 NIH-AAPM-Mayo Clinic LDCT Grand Challenge dataset" and the "Low-dose-CT Image and Projection dataset." The proposed method demonstrates a superior performance when compared with state-of-the-art techniques.

关键词： Computed tomography Noise reduction Lattices Feature extraction Convolution Training Three-dimensional displays Mathematical models X-rays linear programming Differential content loss lattice residual block (LRB) low-dose computed tomography (LDCT) denoising voxel-sensitive attention (VSA) wavelet-based structure loss

来源：评论

学校读者我要写书评

暂无评论

A new gray optimization model for disposing or re-commercializing unsold goods in reverse logistics networks with a cross-docking center

引用

KYBERNETES 2025年第5期54卷 2806-2836页

作者： Rajabzadeh, Mohsen Mousavi, Seyed Meysam Azimi, Farzad Shahed Univ Dept Ind Engn Tehran Iran

PurposeThis paper investigates a problem in a reverse logistics (RLs) network to decide whether to dispose of unsold goods in primary stores or re-commercialize them in outlet centers. By deducting the costs associated with each policy from its revenue, this study aims to maximize the profit from managing unsold ***/methodology/approachA new mixed-integer linear programming model has been developed to address the problem, which considers the selling prices of products in primary and secondary stores and the costs of transportation, cross-docking and returning unwanted items. As a result of uncertain nature of the cost and time parameters, gray numbers are used to deal with it. In addition, an innovative uncertain solution approach for gray programming problems is presented that considers objective function satisfaction level as an indicator of *** to the results, higher costs, including transportation, cross-docking and return costs, make sending goods to outlet centers unprofitable and more goods are disposed of in primary stores. Prices in primary and secondary stores heavily influence the number of discarded goods. Higher prices in primary stores result in more disposed of goods, while higher prices in secondary stores result in fewer. As a result of the proposed method, the objective function satisfaction level can be viewed as a measure of ***/valueAn integral contribution of this study is developing a new mixed-integer linear programming model for selecting the appropriate goods for re-commercialization and choosing the best outlet center based on the products' price and total profit. Another novelty of the proposed model is considering the matching percentage of boxes with secondary stores' desired product lists and the probability of returning goods due to non-compliance with delivery dates. Moreover, a new uncertain solution approach is developed to solve mathematical programming problems with gray parameters

关键词： Reverse logistics networks Re-commercializing Cross-docking linear programming Gray programming

来源：评论

学校读者我要写书评

暂无评论

Control Law Learning Based on LQR Reconstruction With Inverse Optimal Control

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2025年第2期70卷 1350-1357页

作者： Qu, Chendi He, Jianping Duan, Xiaoming Shanghai Jiao Tong Univ Dept Automat Shanghai 200240 Peoples R China

Designing controllers to generate various trajectories has been studied for years, while recently, recovering an optimal controller from trajectories receives increasing attention. In this article, we reveal that the inherent linear quadratic regulator (LQR) problem of a moving agent can be reconstructed based on its trajectory observations only, which enables one to learn the control law of the target agent autonomously. Specifically, we propose a novel inverse optimal control method to identify the weighting matrices of a discrete-time finite horizon LQR, and we also provide the corresponding identifiability conditions. Then, we obtain the optimal estimate of the control horizon using binary search, and finally, reconstruct the LQR problem with aforementioned estimates. The strength of the learning control law with optimization problem recovery lies in less computation consumption and strong generalization ability. We apply our algorithm to the future control input prediction and the discrepancy loss is further derived. Simulations and hardware experiments on a self-designed robot platform illustrate the effectiveness of our work.

关键词： Trajectory Optimization linear programming Estimation Object recognition Mobile agents Mathematical models Sensitivity analysis Search problems Robots Inverse optimal control linear systems LQR control

来源：评论

学校读者我要写书评

暂无评论

Model-Free False Data Injection Attack in Networked Control Systems: A Feedback Optimization Approach

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2025年第2期70卷 783-798页

作者： Luo, Xiaoyu Fang, Chongrong He, Jianping Zhao, Chengcheng Paccagnan, Dario Shanghai Jiao Tong Univ Dept Automat Shanghai 200240 Peoples R China Zhejiang Univ State Key Lab Ind Control Technol Hangzhou 310027 Peoples R China Zhejiang Univ Inst Cyberspace Res Hangzhou 310027 Peoples R China Imperial Coll London Dept Comp London SW7 2AZ England

Security issues have gathered growing interest within the control systems community, as physical components and communication networks are increasingly vulnerable to cyber attacks. In this context, recent literature has studied increasingly sophisticated false data injection attacks, with the aim to design mitigative measures that improve the systems' security. Notably, data-driven attack strategies-whereby the system dynamics is oblivious to the adversary-have received increasing attention. However, many of the existing works on the topic rely on the implicit assumption of linear system dynamics, significantly limiting their scope. Contrary to that, in this work, we design and analyze a truly model-free false data injection attack that applies to general linear and nonlinear systems. More specifically, we aim at designing an injected signal that steers the output of the system toward a (maliciously chosen) trajectory. We do so by designing a zeroth-order feedback optimization policy and jointly using probing signals for real-time measurements. We then characterize the quality of the proposed model-free attack through its optimality gap, which is affected by the dimensions of the attack signal, the number of iterations performed, and the convergence rate of the system. Finally, we extend the proposed attack scheme to systems with internal noise. Extensive simulations show the effectiveness of the proposed attack scheme.

关键词： Optimization Trajectory System dynamics Steady-state Analytical models linear programming Cyberattack Data-driven false data injection (FDI) attacks zeroth-order feedback optimization

来源：评论

学校读者我要写书评

暂无评论

A SOLUTION METHOD FOR ARBITRARY POLYHEDRAL CONVEX SET OPTIMIZATION PROBLEMS

引用

SIAM JOURNAL ON OPTIMIZATION 2025年第1期35卷 330-346页

作者： Loehne, Andreas Friedrich Schiller Univ Jena Fac Math & Comp Sci D-07737 Jena Germany

We provide a solution method for the polyhedral convex set optimization problem. that is, the problem to minimize a set-valued maping F: (RRq)-R-n paired right arrows with polyhedral convex graph with respect to a set ordering relation which is gelerated by a polyhedral convex cone C subset of R-q. The methods proven to be correct and finite without any further assumption to the problem.

关键词： set optimization vector linear programming multiple objective linear program- ming linear programming

来源：评论

学校读者我要写书评

暂无评论

Distributed Randomized Gradient-Free Convex Optimization With Set Constraints Over Time-Varying Weight-Unbalanced Digraphs

引用

IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING 2025年第2期12卷 610-622页

作者： Zhu, Yanan Li, Qinghai Li, Tao Wen, Guanghui Nanjing Univ Informat Sci & Technol Sch Automat Nanjing 210044 Peoples R China Southeast Univ Sch Math Dept Syst Sci Nanjing 210096 Peoples R China

This paper explores a class of distributed constrained convex optimization problems where the objective function is a sum of $N$ convex local objective functions. These functions are characterized by local non-smoothness yet adhere to Lipschitz continuity, and the optimization process is further constrained by $N$ distinct closed convex sets. To delineate the structure of information exchange among agents, a series of time-varying weight-unbalance directed graphs are introduced. Furthermore, this study introduces a novel algorithm, distributed randomized gradient-free constrained optimization algorithm. This algorithm marks a significant advancement by substituting the conventional requirement for precise gradient or subgradient information in each iterative update with a random gradient-free oracle, thereby addressing scenarios where accurate gradient information is hard to obtain. A thorough convergence analysis is provided based on the smoothing parameters inherent in the local objective functions, the Lipschitz constants, and a series of standard assumptions. Significantly, the proposed algorithm can converge to an approximate optimal solution within a predetermined error threshold for the consisdered optimization problem, achieving the same convergence rate of ${\mathcal O}(\frac{\ln (k)}{\sqrt{k} })$ as the general randomized gradient-free algorithms when the decay step size is selected appropriately. And when at least one of the local objective functions exhibits strong convexity, the proposed algorithm can achieve a faster convergence rate, ${\mathcal O}(\frac{1}{k})$. Finally, rigorous simulation results verify the correctness of theoretical findings.

关键词： Optimization Stochastic processes Convergence Prediction algorithms linear programming Convex functions Vectors Smoothing methods Directed graphs Closed box Convergence rate distributed multi-agent optimization randomized gradient-free time-varying weight-unbalanced digraphs

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：