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

2nd International Advance Computing Conference

作者： Kabat, Manas Ranjan Patel, Manoj Kumar Tripathy, Chita Ranjan Veer Surendra Sai Univ Technol Dept Comp Sc & Engg Sambalpur Orissa India

ISBN: (纸本)9781424447909

Many multimedia communication applications require a source to transmit messages to multiple destinations subject to delay and delay-variation constraints. To support delay constrained multicast communications, computer networks have to guarantee an upper bound end-to-end delay from the source node to each of the destination nodes. On the other hand, if the same message fails to arrive at each destination node at the same time, there will probably arise inconsistency and unfairness problem among users. The problem to find a minimum cost multicast tree with delay and delay variation constraints has been proven to be NP-Complete. In this paper, we present a more efficient heuristic algorithm, namely, Economic Delay and Delay Variation Bounded Multicast algorithm (EDVBMA), based on a novel heuristic function, to construct a least cost delay and delay variation bounded multicast tree. A noteworthy feature of this algorithm is that it has very high probability of finding the optimal solution in polynomial time with low computational complexity.

关键词： QoS routing Multicast tree Shortest path heuristic algorithm EDVBMA

来源：评论

学校读者我要写书评

暂无评论

The heuristic algorithm Based on Learning-Competing Model and Its Application to Task Assignment Problem

The Heuristic Algorithm Based on Learning-Competing Model an...

引用

6th International Symposium on Neural Networks

作者： Wang, Zhe Wang, Hongwei Chen, Xi Jiang, Yi Huazhong Univ Sci & Technol Inst Syst Engn Wuhan 430074 Peoples R China

ISBN: (纸本)9783642015069

A universal model-learning-competing one is established for solving task assignment problem in National Economy Mobilization(NEM), in which local search was focused in learning model and global search in competing Thereafter the strong points of the two models were amalgamated in the algorithm. A team of parameters was used to coordinating the correlation of the two models. Applying learning-competing model 10 an actual case, using greed algorithm in learning model, genetic algorithm competing model, the results obtained were in coincidence with the analysis.

关键词： heuristic algorithm Combinatorial optimization Learning-competing mode Task assignment

来源：评论

学校读者我要写书评

暂无评论

Multi School Bus Routing Problem with Road Safety Factor via A heuristic algorithm 34

Multi School Bus Routing Problem with Road Safety Factor via...

引用

34th Chinese Control and Decision Conference (CCDC)

作者： Liang Botian Liu Xinglu Kin, Chan Wai Tsinghua Univ Tsinghua Shenzhen Int Grad Sch Shenzhen 5180000 Peoples R China

ISBN: (纸本)9781665478960

In this paper, a heuristic algorithm is used to consider the multi-school bus route planning problem with road safety factor. According to the requirements of school bus route planning, constraints such as school bus capacity, station capacity, and maximum operating time are considered, and the safety factor of the road is integrated. Finally, the safest and optimal path scheme is obtained through the corresponding algorithm. This paper proposes the construction method of road safety index, applies it to specific cases, and proposes a corresponding heuristic algorithm in order to solve the problem. Finally, numerical examples are used to illustrate the effectiveness and superiority of the proposed method.

关键词： Multi school bus routing problem SBRP VRP Safety factor heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

A Novel Greedy heuristic algorithm for University Course Timetabling Problem 11

A Novel Greedy Heuristic Algorithm for University Course Tim...

引用

11th World Congress on Intelligent Control and Automation

作者： Zhang, Dezhen Guo, Saijun Zhang, Weishi Yan, Shujuan Dalian Maritime Univ Coll Informat Sci & Technol Dalian Liaoning Provin Peoples R China

ISBN: (纸本)9781479958252

Although the university course timetabling problem (UCTP) is an old, classical problem in the field of optimization problems, there are still a few challenges for the practical-relevant problems considering customers' requirements. In particular with respect to the UCTP of China, the timetable planning based on the uniform teaching resources of a university for all degree types of undergraduates and graduates, is still not considered and tackled in the previous researches. In this paper, a novel greedy heuristic approach for UCTP is presented with considering complex multi-constraint conditions on the basis of the uniform teaching resources of a university, which include students, teachers and classrooms with feasible timeslots, respectively. Firstly, the constraints are modelled and then the objective function is proposed based on the evenness for all the curriculums of a student and a teacher's satisfaction for his/her lecturing time. Secondly, transform the constraints to relational calculus among of the variables expressed by relation algebra;thereby the heuristic rules are formed by the relational calculus. And the greedy strategies are applied to search the optimal solutions in the remaining parts of feasible solution space. A greedy heuristic algorithm is designed to implement the approach. Finally, a course timetabling instance from a graduate school is carried out and the result adopted in the graduate school show that the novel greedy heuristic algorithm is effective and the runtime is significantly shortened comparing with the earlier approaching used in the timetabling system.

关键词： University Course Timetabling Problem heuristic algorithm Greedy Approach Relational Operation Optimization

来源：评论

学校读者我要写书评

暂无评论

Developing a new heuristic algorithm for efficient reliability optimization

引用

International Journal of Information Technology (Singapore) 2022年第5期14卷 2505-2511页

作者： Garg, Deepika Dahiya, Tripti Shrivastava, Avinash K. GD Goenka University Haryana Gurugram India International Management Institute West Bengal Kolkata India

Due to massive globalisation across the world, a rampant industrialisation has been witnessed which has led to the usage of complex machinery in the industries. Desired output is generated when components of the system are in close synchronization with each other. Reliability optimization is one of the major parameter to determine the performance of a complex system under various limitations like cost, time, volume, etc. In this paper, a new heuristic algorithm has been developed to attain requisite reliability while solving constrained redundancy reliability optimization problem for complex systems using the sets of minimal paths. The proposed heuristic algorithm is applied to a problem of five unit system with linear constraints. Comparative analysis of the proposed heuristic algorithm with existing heuristic algorithms is done to observe the effectiveness of new heuristic algorithm vis-à-vis other existing algorithms and it is perceived that the proposed heuristic algorithm is providing finer results with respect to system reliability and computational efforts. © 2022, The Author(s), under exclusive licence to Bharati Vidyapeeth's Institute of Computer Applications and Management.

关键词： Complex network heuristic algorithm Minimal path sets Redundancy allocation

来源：评论

学校读者我要写书评

暂无评论

Path Planning for Cellular-connected UAV using heuristic algorithm and Reinforcement Learning 25

Path Planning for Cellular-connected UAV using Heuristic Alg...

引用

25th International Conference on Advanced Communication Technology (ICACT) - New Cyber Security Risks for Enterprise Amidst COVID-19 Pandemic

作者： Bao, Junqi Yang, Yunchu Wang, Yapeng Yang, Xu Du, Zhenyu Macao Polytechn Univ Fac Sci Appl Macau Peoples R China

ISBN: (纸本)9791188428106

With the development of Unmanned Aerial Vehicle (UAV), a novel technology called cellular-connected UAV has been proposed to make UAV complete its mission more efficiently. We consider a scenario where UAV must take off from a random start point, travel over some specific points (e.g. collecting data from sparce sensors in large area) and reach a random end point while keep connected to the Ground Base Station. One of the major challenges is to plan the flying path of UAV while satisfies all constraints. We abstract the path planning problem into Travel Salesman Problem (TSP) and use A* combine with Genetic algorithm, Simulated Annealing algorithm and Reinforcement Learning Model to solve TSP to get the best path for cellular-connected UAV. In addition, we did experiments and recorded the results to analyze the advantages and disadvantages of these algorithms.

关键词： UAV Cellular-connected UAV path planning heuristic algorithm Reinforcement Learning Travel Salesman Problem

来源：评论

学校读者我要写书评

暂无评论

An Improved heuristic algorithm for the Special Case of the Set Covering Problem

An Improved Heuristic Algorithm for the Special Case of the ...

引用

IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)

作者： Gonen Avrahami, T. Israeli, U. HIT Fac Management Technol Holon Israel

ISBN: (纸本)9781479909865

The set covering problem is well known as an NPcomplete problem. A common heuristic family of algorithms that solves the problem is the Greedy type algorithm. In this study, we have to cover N sites by allocating a minimum number of servers. Each server covers a predefined pattern and, by locating it to a site K, it covers its neighbours according to its pattern. The Improved heuristic algorithm (IHA) presented here looks, at each iteration, for the most '' problematic '' site to be covered and selects the best server that covers it. The study compares the IHA with the Greedy algorithm. The results show that in most cases, for symmetric severs, the IHA finds a better solution (more than 10,000 problems were tested). For big problems of above 600 sites, the probability of finding a better solution is over 80%. However, the computing time of the IHA is much higher than that of the Greedy algorithm. Analyzing some cases where the Greedy algorithm found better solutions than the IHA brought us to the conclusion that the weakness of the IHA resides in the selection part of the minimal server's location. However, we have not yet determined the best solution for these cases.

关键词： Set Covering Problem Greedy algorithm Improved Greedy algorithm heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

USAGE OF heuristic algorithm FOR OPTIMIZATION OF PRECISE GNSS RTK MEASUREMENT 15th

USAGE OF HEURISTIC ALGORITHM FOR OPTIMIZATION OF PRECISE GNS...

引用

15th International Multidisciplinary Scientific Geoconference (SGEM)

作者： Bartonek, Dalibor Bures, Jiri Brno Univ Technol Fac Civil Engn Inst Geodesy Brno Czech Republic European Polytech Inst Kunovice Czech Republic

ISBN: (纸本)9786197105346

The contribution deals with formulation of technology for precise positioning with use of global navigation satellite systems (GNSS) in railway engineering during construction and maintenance of railway line and its spatial position. The technology was developed for Railway Infrastructure Administration, state organization (SZDC) in order to solve automated maintenance of spatial position of railway line on territory of the Czech Republic. There is a dense network of railways length about 9,600 km covering an area of about 68,300 km(2). The paper describes basic context of GNSS technology usage for railway precise positioning, and proposition of algorithm for field GNSS measurement optimization with use of the shortest Hamilton's path in graph method with additional conditions in nodes. The core of the algorithm is a dynamic data structure which is based on events list. The optimization of field measurement solves its time demands and economic effectiveness. The technology enables precise position determination with absolute difference limit from 10 to 15 mm within GNSS CZEPOS permanent network on territory of the Czech Republic. The algorithm was realized in Borland Delphi and verified in field on selected railway lines.

关键词： precise GNSS measurement heuristic algorithm optimization

来源：评论

学校读者我要写书评

暂无评论

Enhancing Voltage Magnitude Regulation in Microgrids: An Improved heuristic algorithm 12

Enhancing Voltage Magnitude Regulation in Microgrids: An Imp...

引用

2024 IEEE Andescon Conference

作者： Felix de Souza, Ana Luiza Silva Santos, Luiza Higino Rider, Marcos J. Univ Estadual Campinas Dept Syst & Energy Campinas Brazil

ISBN: (纸本)9798350355291;9798350355284

Microgrids are essential for transforming the global electrical system towards decentralization and modernization, integrating diverse technologies such as renewable energy resources and energy storage systems. Effective management of distributed energy resources is the key to achieving the benefits of microgrids. Consequently, heuristic rules have emerged as a common approach to improve microgrid operation due to their efficiency and real-time decision-making capabilities. This paper proposes an enhancement to an existing heuristic algorithm for operating the battery energy storage system (BESS) in microgrids. The improved algorithm aims to provide better control of voltage magnitude, thus maintaining adequate voltage levels and improving the efficiency of the microgrid. Experimental studies in a real laboratory microgrid, located at the Universidade Estadual de Campinas (UNICAMP), validate the effectiveness of the enhanced proposed algorithm, demonstrating reduced voltage magnitude variations and voltage regulation compared to the original algorithm. The improved algorithm was also tested under different scenarios to evaluate its performance under varying conditions, further demonstrating its robustness and adaptability.

关键词： Microgrids voltage magnitude regulation heuristic algorithm battery energy storage system smart electrical grids laboratory

来源：评论

学校读者我要写书评

暂无评论

Constructive heuristic algorithm in Multi-Start Structure Applied in Distribution Systems Expansion Planning

Constructive Heuristic Algorithm in Multi-Start Structure Ap...

引用

IEEE URUCON Conference (IEEE URUCON)

作者： De Almeida, Matheus Mendonca da Rocha, Carlos Roberto Barros de Freitas, Ricardo Luiz Univ Estadual Oeste Parana UNIOESTE CECE Ctr Engn & Ciencias Exatas Foz Do Iguacu Parana Brazil

ISBN: (纸本)9781665424431

This paper presents a constructive heuristic algorithm in a multi-start structure applied to planning the expansion of medium voltage overhead distribution lines to supply electricity to current and future customers. This algorithm, through its multi-start feature, establishes a set of viable radial topologies, considering the lowest construction costs, lowest electrical losses, and lowest voltage profiles of a system. For this process, the algorithm considers normalized weights and random numbers aiming at a larger search field for a solution. The problem is represented by a nonlinear mathematical model and the solution is constructively obtained in an iterative way. At each iteration, a sensitivity indicator is used to decide which circuit to build. Computational tests were performed to evaluate the algorithm's performance. The results obtained in the simulations showed that the algorithm finds a set of viable and good-quality solutions.

关键词： heuristic algorithm Power distribution lines Expansion Planning Nonlinear mathematical model

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：