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

A constructive heuristic algorithm for Distribution System Planning

IEEE TRANSACTIONS ON POWER SYSTEMS 2010年第3期25卷 1734-1742页

作者： Lavorato, Marina Rider, Marcos J. Garcia, Ariovaldo V. Romero, Ruben Univ Estadual Campinas Dept Elect Energy Syst Campinas SP Brazil UNESP Univ Estadual Paulista Dept Engn Eletr Fac Engn Ilha Solteira Ilha Solteira SP Brazil

A constructive heuristic algorithm (CHA) to solve distribution system planning (DSP) problem is presented. The DSP is a very complex mixed binary nonlinear programming problem. A CHA is aimed at obtaining an excellent quality solution for the DSP problem. However, a local improvement phase and a branching technique were implemented in the CHA to improve its solution. In each step of the CHA, a sensitivity index is used to add a circuit or a substation to the distribution system. This sensitivity index is obtained by solving the DSP problem considering the numbers of circuits and substations to be added as continuous variables (relaxed problem). The relaxed problem is a large and complex nonlinear programming and was solved through an efficient nonlinear optimization solver. Results of two tests systems and one real distribution system are presented in this paper in order to show the ability of the proposed algorithm.

关键词： AMPL constructive heuristic algorithm distribution system planning KNITRO mixed binary nonlinear programming power systems optimization

来源：评论

学校读者我要写书评

暂无评论

Scheduling multiple agile earth observation satellites with an edge computing framework and a constructive heuristic algorithm

引用

JOURNAL OF SYSTEMS ARCHITECTURE 2019年 95卷 55-66页

作者： He, Yongming Chen, Yingwu Lu, Jimin Chen, Cheng Wu, Guohua Natl Univ Def Technol Coll Syst Engn Changsha 410073 Hunan Peoples R China Cent S Univ Sch Traff & Transportat Engn Changsha 410075 Hunan Peoples R China

The effective scheduling of multiple agile earth observation satellites plays a key role in improving the efficiency of the agile satellite observation system. Due to the complex constraints and large solution space (increases exponentially with the problem size), it has been a big challenge to effectively solve the multiple agile satellites scheduling problem. In this study, an edge computing framework is proposed in order to solve this problem in a flexible manner. In this framework, a central node and several edge nodes are included. The central node corresponds to the operation center of the satellite observation system while each edge node corresponds to an agile satellite. The central node filters tasks for edge nodes according to the time of scheduling period and visible time windows. Tasks in each edge node are scheduled according to the order of scheduling periods by a constructive heuristic algorithm based on the density of residual tasks (HADRT). The efficiency of this algorithm is proved. The time and space complexity are analyzed in detail. The proposed method is compared with other three advanced methods, and the experimental results show that HADRT could achieve higher task completion rate and reward rate than other algorithms with acceptable computing time.

关键词： Agile earth observation satellites scheduling Edge computing Optimization model constructive heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

Multi-step simultaneous changes constructive heuristic algorithm for Transmission Network Expansion Planning

引用

ELECTRIC POWER SYSTEMS RESEARCH 2009年第4期79卷 586-594页

作者： Bustamante-Cedeno, Enrique Arora, Sant Univ Minnesota Dept Mech Engn Ind & Syst Engn Div Minneapolis MN 55455 USA

In this paper, a constructive heuristic algorithm (CHA) is presented to solve the Transmission Network Expansion Planning Problem (TNEP), a complex non-convex Mixed Integer Non-Linear Programming (MINLP) problem with multiple local minima. In the proposed algorithm, the non-linearities are resolved through the following feature: when discrete decision variables are given, the model becomes linear in the continuous variables. A CHA is developed which improves the current solution by implementing multiple step simultaneous changes over a number of saturated transmission lines, in contrast to the approach traditionally followed. which implements one change at a time. Solutions to test problems are computed. (C) 2008 Elsevier B.V. All rights reserved.

关键词： Transmission Network Expansion Planning constructive heuristic algorithm Mixed Integer Non-Linear Programming Non-convex optimization Power deregulation

来源：评论

学校读者我要写书评

暂无评论

Transmission Expansion Planning Via a constructive heuristic algorithm in Restructured Electricity Industry

Transmission Expansion Planning Via a Constructive Heuristic...

引用

3rd International Conference on Electric Power and Energy Conversion Systems (EPECS)

作者： Khorasani, H. Pourakbari-Kasmaei, M. Romero, R. Univ Estadual Paulista Dept Elect & Comp Engn Ilha Solteira SP Brazil

ISBN: (纸本)9781479906871;9781479906888

The transmission expansion planning problem in modern power systems is a large-scale, mixed-integer, nonlinear and non-convex problem. this paper presents a new mathematical model and a constructive heuristic algorithm (CHA) for solving transmission expansion planning problem under new environment of electricity restructuring. CHA finds an acceptable solution in an iterative process, where in each step a circuit is chosen using a sensitivity index and added to the system. The proposed model consider multiple generation scenarios therefore the methodology finds high quality solution in which it allows the power system operate adequacy in an environment with multiple generators scenarios. Case studies and simulation results using test systems show possibility of using constructive heuristic algorithm in an open access system.

关键词： Transmission expansion planning constructive heuristic algorithm Open access Multiple generating scenarios hybrid model

来源：评论

学校读者我要写书评

暂无评论

Distribution Network Planning Using a constructive heuristic algorithm

Distribution Network Planning Using a Constructive Heuristic...

引用

General Meeting of the IEEE-Power-and-Energy-Society

作者： Lavorato, Marina Rider, Marcos J. Garcia, Ariovaldo V. Romero, Ruben Univ Estadual Campinas Dept Elect Energy Syst Campinas SP Brazil Univ Estadual Paulista Fac Engn Ilha Solteira Solteira SP Brazil

ISBN: (纸本)9781424442409

An optimization technique to solve distribution network planning (DNP) problem is presented. This is a very complex mixed binary nonlinear programming problem. A constructive heuristic algorithm (CHA) aimed at obtaining an excellent quality solution for this problem is presented. In each step of the CHA, a sensitivity index is used to add a circuit or a substation to the distribution network. This sensitivity index is obtained solving the DNP problem considering the numbers of circuits and substations to be added as continuous variables (relaxed problem). The relaxed problem is a large and complex nonlinear programming and was solved through an efficient nonlinear optimization solver. A local improvement phase and a branching technique were implemented in the CHA. Results of two tests using a distribution network are presented in the paper in order to show the ability of the proposed algorithm.

关键词： Distribution network planning constructive heuristic algorithm mixed binary nonlinear programming power systems optimization KNITRO AMPL

来源：评论

学校读者我要写书评

暂无评论

High-performance hybrid genetic algorithm to solve transmission network expansion planning

引用

IET GENERATION TRANSMISSION & DISTRIBUTION 2017年第5期11卷 1111-1118页

作者： Gallego, Luis A. Garces, Lina P. Rahmani, Mohsen Romero, Ruben A. Univ Estadual Londrina Dept Elect Engn Londrina Brazil Univ Fed Goias Elect Mech & Comp Engn Sch Goiania Go Brazil Carnegie Mellon Univ Engn & Publ Policy Dept Pittsburgh PA 15213 USA Univ Estadual Paulista Dept Elect Engn Ilha Solteira Brazil

In this study, a high-performance hybrid genetic algorithm (HGA) is proposed to solve static and multistage transmission network expansion planning (TNEP) problem. The main features of the HGA are: (i) it avoids homogenised solutions by using a special genetic algorithm as the backbone of the procedure, (ii) uses a powerful path-relinking algorithm for the deep exploration of local solutions, (iii) employs an efficient constructive heuristic algorithm for finding high-quality initial solutions and for improving solution qualities and (iv) uses a fast relaxation strategy for solving the linear programming problems required for calculating the fitness functions. This procedure will result in an intelligent exploration of a large search space in less amount of time. The proposed methodology is tested with three electrical systems: South Brazilian 46-bus, Colombian 93-bus and the North-Northeast Brazilian 87-bus.

关键词： power transmission planning genetic algorithms linear programming high-performance hybrid genetic algorithm transmission network expansion planning static transmission network expansion planning problem multistage TNEP problem high-performance HGA path-relinking algorithm constructive heuristic algorithm fast relaxation strategy linear programming problem fitness function South Brazilian 46-bus electrical system Colombian 93-bus electrical system North-Northeast Brazilian 87-bus electrical system

来源：评论

学校读者我要写书评

暂无评论

Power system transmission network expansion planning using AC model

引用

IET GENERATION TRANSMISSION & DISTRIBUTION 2007年第5期1卷 731-742页

作者： Rider, M. J. Garcia, A. V. Romero, R. Univ Estadual Campinas Dept Elect Energy Syst Campinas SP Brazil Univ Estadual Paulista Fac Engn Ilha Soltiera Ilha Soltiera SP Brazil

An optimisation technique to solve transmission network expansion planning problem, using the AC model, is presented. This is a very complex mixed integer nonlinear programming problem. A constructive heuristic algorithm aimed at obtaining an excellent quality solution for this problem is presented. An interior point method is employed to solve nonlinear programming problems during the solution steps of the algorithm. Results of the tests, carried out with three electrical energy systems, show the capabilities of the method and also the viability of using the AC model to solve the problem.

关键词： transmission network expansion planning power transmission planning optimisation technique integer programming load flow complex mixed integer nonlinear programming problem Power system planning and layout Optimisation techniques constructive heuristic algorithm heuristic programming AC model Power system management, operation and economics electrical energy system interior point method power system transmission network a.c. transmission nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

Angular bisector insertion algorithm for solving small-scale symmetric and asymmetric traveling salesman problem

引用

JOURNAL OF COMBINATORIAL OPTIMIZATION 2022年第1期43卷 235-252页

作者： Lin, Jian Zeng, Xiangfei Liu, Jianxun Li, Keqin Hunan Univ Sci & Technol Key Lab Knowledge Proc & Networked Mfg Xiangtan 411201 Peoples R China SUNY Coll New Paltz Dept Comp Sci New York NY 12561 USA

Different algorithmic performances are required in different engineering fields for solving both the symmetric and asymmetric traveling salesman problem (STSP and ATSP), both of which are commonly referred to as TSP. In the background of small-scale TSP, according to the principle of the optimal Hamiltonian loop, this paper describes an angular bisector insertion algorithm (ABIA) that can solve TSP. The main processes of ABIA are as follows. First, the angular bisector of the point group is constructed. Second, the farthest vertex perpendicular to the angular bisector is identified as the search criterion. Finally, for both STSP and ATSP, initial loop formation rules and vertex insertion rules are constructed. Experiments were conducted for all STSP and ATSP instances with up to 100 points in the TSPLIB database. The performance of ABIA was compared with that of the 2-point farthest insertion algorithm, convex hull insertion algorithm, branch-and-bound algorithm, and a genetic algorithm. The experimental results show that, for small-scale TSP (up to 40 points), the runtime of ABIA is second only to the convex hull insertion algorithm, and the gap between ABIA and the optimal solution is second only to the exact algorithm. ABIA offers good overall performance in solving small-scale TSP.

关键词： Angle bisector insertion algorithm Asymmetric traveling salesman problem (ATSP) constructive heuristic algorithm Hamiltonian cycle Traveling salesman problem (TSP)

来源：评论

学校读者我要写书评

暂无评论

Uniform voltage distribution based constructive algorithm for optimal reconfiguration of electric distribution networks

引用

ELECTRIC POWER SYSTEMS RESEARCH 2013年 104卷 146-155页

作者： Bayat, Akbar Zanjan Elect Distribut Co Zanjan Iran

This paper introduces a new heuristic method called uniform voltage distribution based constructive algorithm (UVDA) especially intended for optimal reconfiguration of large-scale distribution networks. The algorithm starts with expanding a subnetwork through tracing maximum bus voltage and performing a series of branch exchange operation concurrently. By the aid of tracing nature of UVDA, no radial constraints are imposed. To exemplify the presented method, UVDA has been rigorously explained in details using a widely studied 33 bus test system. The validity of the proposed algorithm was confirmed through successful performance on numerous practical distribution networks, ranged from 16-bus system with 3 tie-switches up to 835-bus system with 146 tie-switches. Furthermore, comparisons are made with the other recent approaches available in the literatures. The test results demonstrate that the proposed algorithm successfully finds a globally optimal configuration for all the test systems in a conspicuously short time. (c) 2013 Elsevier B.V. All rights reserved.

关键词： constructive heuristic algorithm Maximum bus voltage tracing Subnetwork expanding Electric distribution network Radial reconfiguration Globally optimal configuration

来源：评论

学校读者我要写书评

暂无评论

New construction heuristic algorithm for solving the vehicle routing problem with time windows

IET COLLABORATIVE INTELLIGENT MANUFACTURING

引用

IET COLLABORATIVE INTELLIGENT MANUFACTURING 2019年第3期1卷 90-96页

作者： Liu, Jun Feng, Shuo Niu, Qun Ji, Lijuan Lanzhou Univ Technol Sch Mech & Elect Engn Lanzhou Peoples R China

The vehicle routing problem with time windows (VRPTW) is the most important and widely studied combinational optimisation problem. However, most constructive heuristics create a new path when the customer violates the constraint and cannot insert into any existing path, causing the time window constraint to be tight and generating more paths. Aiming at the above problems, a new constructive heuristic algorithm is proposed. The algorithm firstly uses the convex hull of the customer location to determine the initial seed client and reduces the redundant path;meanwhile, the calculation method of the traditional optimal insertion position is improved, and the calculation efficiency is improved to some extent;in addition, for customers who cannot insert any feasible path, the exchange operator is introduced to give the current solution a disturbance instead of directly creating a new seed client and a new path to further reduce the redundant path. The experimental results show that the algorithm can effectively solve the close time window of VRPTW for evenly distributed customers, and even provide a strict time window for evenly distributed customers and a certain amount of hybrid geographic cluster customers.

关键词： search problems optimisation vehicle routing redundant path VRPTW evenly distributed customers strict time window hybrid geographic cluster customers construction heuristic algorithm vehicle routing problem constructive heuristics time window constraint constructive heuristic algorithm customer location initial seed client combinational optimisation problem

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：