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

A simple reservation and allocation model of shared parking lots

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES 2016年 71卷 303-312页

作者： Shao, Chaoyi Yang, Hai Zhang, Yi Ke, Jintao Hong Kong Univ Sci & Technol Dept Civil & Environm Engn Hong Kong Hong Kong Peoples R China Tsinghua Univ Dept Automat Beijing Peoples R China Zhejiang Univ Dept Civil Engn Hangzhou Zhejiang Peoples R China

With increasing auto demands, efficient parking management is by no means less important than road traffic congestion control. This is due to shortages of parking spaces within the limited land areas of the city centers in many metropolises. The parking problem becomes an integrated part of traffic planning and management. On the other hand, it is a fact that many private parking spots are available during daytime in nearby residential compound because those residents drive their cars out to work. These temporarily vacant parking lots can be efficiently utilized to meet the parking demand of other drivers who are working at nearby locations or drivers who come for shopping or other activities. This paper proposes a framework and a simple model for embracing shared use of residential parking spaces between residents and public users. The proposed shared use is a winning strategy because it maximizes the use of private resources to benefit the community as a whole. It also creates a new business model enabled by the fast-growing mobile apps in our daily lives. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： Shared parking Parking management Reservation and allocation binary integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Strategic placements of PMUs for power network observability considering redundancy measurement

引用

MEASUREMENT 2019年 134卷 606-623页

作者： Babu, Rohit Bhattacharyya, Biplab Indian Sch Mines Indian Inst Technol Dept Elect Engn Dhanbad 826004 Jharkhand India

This paper proposes a mixed integer nonlinear programming (MINLP) formulation with binary-valued variables for the optimal installation of the phasor measurement units (PMUs) in a power network. The MINLP framework has been solved by a two-phase branch-and-bound algorithm (BBA) for the optimal PMU placement (OPP) problem. The present work deals with the solution of the OPP problem without considering the radial buses including in the optimal solution. PMU is pre-assigned to each bus connected to a radial bus such that the radial buses are excluded from the list of potential PMU locations. The programming technique is used to determine the optimum number of PMUs and their locations to make the interconnected power network completely observable. The proposed BBA may provide multiple solutions at the lowest objective value, each time the optimizer routine restarts. Therefore, the obtained optimal solutions are being ranked regarding the measurement redundancy index. The two-phase branch-and-bound algorithm is applied to IEEE standard test systems as well as to New England 39-bus and a northern regional power grid 246-bus system. The proposed algorithm has been compared with the existing programming techniques in the recent literature. The simulation results obtained by the proposed BBA indicate the effectiveness and the efficiency to detect the desired target. (C) 2018 Elsevier Ltd. All rights reserved.

关键词： binary integer linear programming Branch-and-bound Interconnected power network Mixed-integer nonlinear programming Measurement redundancy Optimal PMU placement Observability analysis Phasor measurement unit Two-phase branch-and-bound algorithm

来源：评论

学校读者我要写书评

暂无评论

An improved method of delineating rectangular management zones using a semivariogram-based technique

引用

COMPUTERS AND ELECTRONICS IN AGRICULTURE 2016年 121卷 74-83页

作者： Zhang Xiaohu Jiang Li Qiu Xiaolei Qiu Jianxiu Wang Juan Zhu Yan Nanjing Agr Univ Natl Engn & Technol Ctr Informat Agr Jiangsu Key Lab Informat Agr Jiangsu Collaborat Innovat Ctr Modern Crop Prod 1 Weigang Rd Nanjing 210095 Jiangsu Peoples R China Sun Yat Sen Univ Guangdong Prov Key Lab Urbanizat & Geosimulat Sch Geog & Planning Guangzhou 510275 Guangdong Peoples R China Chinese Univ Hong Kong Dept Geog & Resource Management Shatin Hong Kong Peoples R China

Management zone delineation is of great importance for precision agriculture applications. Compared with oval management zones, rectangular management zones are more practical for variable rate technology and fertilization machinery, and they are also easy to use for farmers in developing regions. This research proposes an improved method for delineating rectangular management zones, which applies a semivariogram analysis to interpolating grid data with an optimal grid size. By using a well-designed grid size, optimal grids are considered when generating instances and solving binary integer linear programming (BILP) problems. These improvements greatly reduce the computational time as well as the total variance of the delineated management zones. The experimental results indicate that the proposed method provides a practical method of applying rectangular management zone delineation that performs better and is more efficient compared with conventional algorithms. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Management zones Semivariogram Kriging interpolation binary integer linear programming

来源：评论

学校读者我要写书评

暂无评论

On the Separating Redundancy of the Duals of First-Order Generalized Reed-Muller Codes

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2019年第1期E102A卷 310-315页

作者： Liu, Haiyang Li, Yan Ma, Lianrong Chinese Acad Sci Inst Microelect Beijing 100029 Peoples R China China Agr Univ Dept Math Sci Beijing 100083 Peoples R China Tsinghua Univ Dept Math Sci Beijing 100084 Peoples R China

The separating redundancy is an important property in the analysis of the error-and-erasure decoding of a linear block code. In this work, we investigate the separating redundancy of the duals of first-order generalized Reed-Muller (GRM) codes, a class of nonbinary linear block codes that have nice algebraic properties. The dual of a first-order GRM code can be specified by two positive integers m and q and denoted by R (m, q), where q is the power of a prime number and q not equal 2. We determine the first separating redundancy value of R (m, q) for any m and q. We also determine the second separating redundancy values of R (m, q) for any q and m = 1 and 2. For m >= 3, we set up a binary integer linear programming problem, the optimum of which gives a lower bound on the second separating redundancy of R (m, q).

关键词： separating redundancy separating matrix generalized Reed-Muller (GRM) codes duals binary integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Globally Optimal Selection of Ground Stations in Satellite Systems With Site Diversity

引用

IEEE WIRELESS COMMUNICATIONS LETTERS 2020年第7期9卷 1101-1104页

作者： Efrem, Christos N. Panagopoulos, Athanasios D. Natl Tech Univ Athens Sch Elect & Comp Engn Athens 15780 Greece

The availability of satellite communication systems is extremely limited by atmospheric impairments, such as rain (for radio frequencies) and cloud coverage (for optical frequencies). A solution to this problem is the site diversity technique, where a network of geographically distributed ground stations (GSs) can ensure, with high probability, that at least one GS is available for connection to the satellite at each time period. However, the installation of redundant GSs induces unnecessary additional costs for the network operator. In this context, we study an optimization problem that minimizes the number of required GSs, subject to availability constraints. First, the problem is transformed into a binary-integer-linear-programming (BILP) problem, which is proven to be NP-hard. Subsequently, we design a branch-and-bound (B&B) algorithm, with global-optimization guarantee, based on the linear-programming (LP) relaxation and a greedy method as well. Finally, numerical results show that the proposed algorithm significantly outperforms state-of-the-art methods, and has low complexity in the average case.

关键词： Complexity theory Satellite broadcasting Optical fiber networks Optimized production technology Probability Satellites Satellite communications site diversity ground stations selection cardinality minimization combinatorial optimization binary integer linear programming NP-hardness linear-programming relaxation branch-and-bound method

来源：评论

学校读者我要写书评

暂无评论

An Approach for Optimal Placement of Phasor Measurement Unit for Power Network Observability Considering Various Contingencies

引用

IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY-TRANSACTIONS OF ELECTRICAL ENGINEERING 2018年第2期42卷 161-183页

作者： Babu, Rohit Bhattacharyya, Biplab Indian Inst Technol Indian Sch Mines Dept Elect Engn Dhanbad 826004 Jharkhand India

Phasor measurement units (PMUs) play an important role in power system operations. They provide synchronized phasor measurement of voltage and current for preservation and control of electrical power networks. In this work, depth-of-one (DOU1) and depth-of-two (DOU2) unobservability has been considered for optimal PMU placement (OPP) problem. Further, cases ignoring and considering zero injection buses are also taken into account for minimizing the PMUs locations. The influence of DOU1 and DOU2 consisting of the single PMUs outage have also been taken into consideration. Furthermore, this article also proposed the effect of single branch outage on OPP problem. Moreover, to show the scalability of the proposed approach, both single PMU outage and branch outage are considered together. Thus, the critical branch based on line stability index utilizing load flow measurement is determined. Then, binary integer linear programming approach has been developed in this paper to determine the strategic locations of PMUs considering various contingencies. The efficacy and robustness of the proposed methodology are confirmed by implementing on standard IEEE test systems and outcomes thereby authorizing the reliability of the proposed approach. Obtained results have been compared with the standard approaches published in the referred journals, and the results achieved by the proposed methodology outperform the other comparative approaches;thus, the proposed methodology, successfully, accomplishes complete observability of the power networks.

关键词： binary integer linear programming Observability Optimal PMU placement Phasor measurement unit

来源：评论

学校读者我要写书评

暂无评论

Weak Bus-Oriented Installation of Phasor Measurement Unit for Power Network Observability

引用

INTERNATIONAL JOURNAL OF EMERGING ELECTRIC POWER SYSTEMS 2017年第5期18卷 1-14页

作者： Babu, Rohit Bhattacharyya, Biplab Indian Inst Technol Indian Sch Mines Elect Engn Dhanbad Bihar India

Phasor measurement unit (PMU) is a GPS-based monitoring equipment employed for the improvement of the stability and reliability of the electrical grid. In this work, an optimal PMU placement has been considered to utilize the least number of units in order to make the power network fully observable. Further, this article also suggests to not only determine the minimal number and optimal locations of PMUs but also installation of the maximum number of PMUs on the weakest bus in an electrical network. Thus, the weak bus based on line stability index utilizing load flow measurement is determined. Then a novel numerical methodology which depends upon binary integer linear programming, constrained by weak bus measurement is proposed in this paper. Also, the effect of a single PMU loss considering weak buses is shown. The developed approach has been conducted on standard IEEE -14, -118, -300 and New England 39-bus test systems. Finally, obtained results and comparison with different weak bus methodologies are shown and examined.

关键词： phasor measurement unit line stability index weak bus measurement binary integer linear programming optimal PMU placement observability

来源：评论

学校读者我要写书评

暂无评论

An optimization framework for task allocation in the edge/hub/cloud paradigm

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2024年 155卷 354-366页

作者： Kouloumpris, Andreas Stavrinides, Georgios L. Michael, Maria K. Theocharides, Theocharis Univ Cyprus Dept Elect & Comp Engn 1 Panepistimiou AvePOB 20537 CY-1678 Nicosia Cyprus Univ Cyprus KIOS Res & Innovat Ctr Excellence 1 Panepistimiou AvePOB 20537 CY-1678 Nicosia Cyprus

With the advent of the Internet of Things (IoT), novel critical applications have emerged that leverage the edge/hub/cloud paradigm, which diverges from the conventional edge computing perspective. A growing number of such applications require a streamlined architecture for their effective execution, often comprising a single edge device with sensing capabilities, a single hub device (e.g., a laptop or smartphone) for managing and assisting the edge device, and a more computationally capable cloud server. Typical examples include the utilization of an unmanned aerial vehicle (UAV) for critical infrastructure inspection or a wearable biomedical device (e.g., a smartwatch) for remote patient monitoring. Task allocation in this streamlined architecture is particularly challenging, due to the computational, communication, and energy limitations of the devices at the network edge. Consequently, there is a need for a comprehensive framework that can address the specific task allocation problem optimally and efficiently. To this end, we propose a complete, binary integer linear programming (BILP) based formulation for an application -driven design -time approach, capable of providing an optimal task allocation in the targeted edge/hub/cloud environment. The proposed method minimizes the desired objective, either the overall latency or overall energy consumption, while considering several crucial parameters and constraints often overlooked in related literature. We evaluate our framework using a realworld use -case scenario, as well as appropriate synthetic benchmarks. Our extensive experimentation reveals that the proposed approach yields optimal and scalable results, enabling efficient design space exploration for different applications and computational devices.

关键词： Task flow graph Task allocation Latency optimization Energy optimization binary integer linear programming Edge/hub/cloud continuum

来源：评论

学校读者我要写书评

暂无评论

Optimal Placement of Phasor Measurement Units with linear and Non-linear Models (vol 43, pg 357, 2015)

引用

ELECTRIC POWER COMPONENTS AND SYSTEMS 2015年第6期43卷 721-721页

作者： Nikolaos, Theodorakatos Korres, George Manousakis, Nikolaos ECE Department National Technical University of Athens Athens Greece

—This article presents a non-linear programming-based model for the optimal placement of phasor measurement units. The optimal phasor measurement units placement is formulated to minimize the number of phasor measurement units required for full system observability and to maximize the measurement redundancy at all buses in a power system. A sequential quadratic programming algorithm is used for the solution of the proposed model. The existence of power flow and injection measurements, the limited phasor measurement units channel capacity, the lack of communication facilities in substations, and the single phasor measurement units loss are also incorporated into the initial proposed formulation. The non-linear programming model is applied to IEEE 14- and 118-bus test systems in MATLAB. The accuracy and the effectiveness of the proposed method is verified by comparing the simulation results to those obtained by a binary integer programming model also implemented in MATLAB. The comparative study shows that the proposed non-linear programming model yields the same number of phasor measurement units as the binary integer programming model. A remarkable advantage of the non-linear programming against binary integer linear programming is its capability to give more than one optimal solution, each one having the same minimum number of phasor measurement units (same minimum objective value), but at different locations.

关键词： Phasor measurement unit observability optimal placement optimization binary integer linear programming mixed integer linear programming non-linear programming sequential quadratic programming

来源：评论

学校读者我要写书评

暂无评论

A Novel Approach for Optimal PMU Placement Considering Channel Limit

A Novel Approach for Optimal PMU Placement Considering Chann...

引用

International Conference on Power System Technology (PowerCon)

作者： Rokkamand, Venkatesh Bhimasingu, Ravikumar Crompton Greaves Ltd Global R&D Ctr Bombay 400040 Maharashtra India Indian Inst Technol Hyderabad Dept Elect Engn Hyderabad 502205 Andhra Pradesh India

ISBN: (纸本)9781479950324

This paper presents a simple approach for finding the optimal placement of Phasor Measurement Units (PMUs) considering bus connectivity matrix and line connectivity matrix. The approach apart from minimizing number of PMUs also minimizes the number of branch current phasors. In this approach, a method is proposed in which the OPP problem is solved while considering PMUs with limit on the number of channels. Conventional binary integer linear programming (BILP) is adopted to solve the optimization problem. The approach guarantees the optimum number of PMUs and minimum number of channels. The proposed approach is illustrated on a sample 7-bus system and extended to IEEE 14-bus, IEEE 24-bus, IEEE 30-bus, New England 39-bus, IEEE 57-bus and IEEE 118-bus systems for illustration purpose.

关键词： phasor measurement units channel limit zero injections binary integer linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：