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

dijkstra algorithm interactive training software development for network analysis applications in GIS

ENERGY EDUCATION SCIENCE AND TECHNOLOGY PART A-ENERGY SCIENCE AND RESEARCH 2011年第1期28卷 445-452页

作者： Karas, Ismail Rakip Demir, Sait Karabuk Univ Fac Engn Dept Comp Engn Karabuk Turkey Sirnak Univ Fac Engn Dept Comp Engn Sirnak Turkey

Process of route optimization is one of the basic applications of Network Analyses in Geographic Information Systems. In mathematical background of network analysis applications are graph theory and graph algorithms. Primary graph algorithm employed in process of route optimization is dijkstra's algorithm. dijkstra's algorithm is placed on the top of linear methods which yield exact solutions. Geographic Information Systems analyses such as the shortest route, the shortest duration and route with the least traffic are solved through dijkstra's algorithm. In this study, an interactive training software program, developed for educational use in Geographic Information Systems and Graph Theory classes at postgraduate degree, is introduced. This software provides students with the opportunity to use dijkstra's algorithm on graphs which they have designed by themselves and teaches details of algorithm, its working principles and structure of data to them, step by step, through interactive messages and graphics.

关键词： Geographic information systems Graph theory Interactive learning Network analysis Route optimization dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

The Storage of Weighted Directed Graph in Relational Database and Implementation of dijkstra algorithm 1

引用

International Conference on Computer Science and Education (CSE 2011)

作者： Li, Yanchen Feng, Yuan Hong, Feng Bi, Ying Ocean Univ China Coll Info Sci & Tech Qingdao Peoples R China Hisense Trans Tech Ltd Qingdao Peoples R China QingDao Hismile Coll Coll Bus Adm Qingdao Peoples R China

ISBN: (数字)9783642224560

ISBN: (纸本)9783642224553

As an important data structure, map is widely used in modern enterprise management software. Route planning, decision support, finding the critical path, and other activities all need the algorithms in graph theory. And once the map becomes more complex. it has to be stored in database. While the traditional adjacency matrix and adjacency list stored in the database have their limitations. If still achieve the appropriate algorithm using a programming language, software and database will exchange large amounts of data when the software and database are not in the same computer. So this method will inevitably affect the efficiency of the algorithm, and this situation is extremely difficult to optimize. Based on the characteristics of relational database, our paper designs a storage model of a directed graph in relational database. Using the SQL language and set operations, we successfully achieve the dijkstra algorithm. In the process of dijkstra algorithm, we use the mechanism of UPDATE in SQL instead of the inner loop steps in dijkstra algorithm, thus the time cost by database operations is reduced greatly and the efficiency is raised.

关键词： Weighted directed graph Relational database dijkstra algorithm Sql

来源：评论

学校读者我要写书评

暂无评论

Orthogonal Analysis of the Weights based on the Factors Influencing the Total Time of Community Opening

Orthogonal Analysis of the Weights based on the Factors Infl...

引用

2017 2nd International Conference on Education,Sports,Arts and Management Engineering(ICESAME 2017)

作者： Zengji Wang School of North China Electric Power University

According to the urban planning and construction, open community becomes more and more popular in recent years. However, the study of the impact of people on the travel after the opening of the community is not deep. Moreover, the impact of each factor on the degree of travel is not the same. Therefore, this paper takes the total travel time of the crowd as the total index and the free flow time in the district, the influence coefficient of the internal road delay, the free flow time of the external roads, the influence coefficient of the external road delay, the intersection delay time as the five influencing factors of the index. Then we use dijkstra algorithm getting the simulation data and carry out two levels of seven factors orthogonal test. Later we use the range analysis method to get the weight. Furthermore, the influence degree of each factor on travel time is obtained.

关键词： community opening orthogonal analysis factors' weight dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Shortest Path algorithm for IKEA Warehousing System

A Hybrid Shortest Path Algorithm for IKEA Warehousing System

引用

2017 2nd International Conference on Computational Modeling, Simulation and Applied Mathematics（CMSAM 2017)

作者： Si-yu TIAN Yu XIA Northeastern University

Shortest Path algorithms can be utilized to find the shortest distance between one vertex to another in a graph for logistics applications. In IKEA warehouses, the efficiency is reduced when customers squander time repeating routes in picking up their desired furniture. The shortest path algorithm implemented in this paper is to be a proper means of demonstrating the most efficient route with restricted intermediate nodes for customers. Since the traditional shortest path algorithm presents random intermediate nodes along the shortest path from entrance to exit. We proposed a shortest path algorithm that is suited to this circumstance as we used Greedy algorithm to divide the original problems into three, as well as dijkstra algorithm for calculating the shortest distance between two nodes. The data required in the dijkstra algorithm is stored in IKEA warehousing relational database which is designed in this paper for simulation.

关键词： IKEA Warehousing Relational database Graph theory Shortest path algorithm Greedy algorithm dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Towards an agent based traffic regulation and recommendation system for the on-road air quality control

引用

SPRINGERPLUS 2016年第1期5卷 1页

作者： Sadiq, Abderrahmane El Fazziki, Abdelaziz Ouarzazi, Jamal Sadgal, Mohamed Cadi Ayyad Univ Comp Syst Engn Lab Fac Sci Marrakech 4000 Morocco Cadi Ayyad Univ Fac Sci URAC 20 LPCME Marrakech 4000 Morocco

This paper presents an integrated and adaptive problem-solving approach to control the on-road air quality by modeling the road infrastructure, managing traffic based on pollution level and generating recommendations for road users. The aim is to reduce vehicle emissions in the most polluted road segments and optimizing the pollution levels. For this we propose the use of historical and real time pollution records and contextual data to calculate the air quality index on road networks and generate recommendations for reassigning traffic flow in order to improve the on-road air quality. The resulting air quality indexes are used in the system's traffic network generation, which the cartography is represented by a weighted graph. The weights evolve according to the pollution indexes and path properties and the graph is therefore dynamic. Furthermore, the systems use the available pollution data and meteorological records in order to predict the on-road pollutant levels by using an artificial neural network based prediction model. The proposed approach combines the benefits of multi-agent systems, Big data technology, machine learning tools and the available data sources. For the shortest path searching in the road network, we use the dijkstra algorithm over Hadoop MapReduce framework. The use Hadoop framework in the data retrieve and analysis process has significantly improved the performance of the proposed system. Also, the agent technology allowed proposing a suitable solution in terms of robustness and agility.

关键词： Air quality management Multi-agent systems Traffic regulation and recommendation dijkstra algorithm Hadoop Artificial neural networks

来源：评论

学校读者我要写书评

暂无评论

Application of Multi-objective Path Planning in the Selection of Travel Routes

Application of Multi-objective Path Planning in the Selectio...

引用

2017 2nd International Conference on Advances in Management Engineering and Information Technology(AMEIT 2017)

作者： Jie SUN Shui-fang YIN College of Science Wuhan University of Science and Technology

In order to meet the traveler's planning on the travel routes,the optimal single-objective path model with the shortest time and the lowest cost and the shortest multi-objective path model based on cost and time were established separately with reference to the mathematic modeling competition set for the graduate students and in combination with the influence of weather on the travel according to different ways of *** algorithm was adopted to solve the models so as to obtain the optimal multi-objective path,which can provide multiple possible choices for the travelers.

关键词： Multi-objective dijkstra algorithm Travel routes Time Cost

来源：评论

学校读者我要写书评

暂无评论

A Path Planning Method for Substation Laser Inspection Robot Based on Improved Ant Colony algorithm

A Path Planning Method for Substation Laser Inspection Robot...

引用

2nd International Conference on Computer Engineering,Information Science & Application Technology(ICCIA 2017)

作者： Yan Deng Hongyu Hu Xiaolu Tian Jiake Liu Mingyang Liu Yafei Wang Shandong Luneng Intelligence Technology co. LTD Jiangxi Electric Power Company Lanzhou University

ISBN: (纸本)9781510845008

In order to shorten the inspection path and time-consuming, improve the intelligence degree of the laser inspection robot and apply to the large-scale TSP in the substation, the paper proposes a path planning method based on the improved ant colony algorithm, the navigation method, the walking characteristics, the inspection task and the road environment. This method uses the topological method to model the road environment. The dijkstra algorithm and the improved ant colony algorithm are used to plan the inspection path of the laser inspection robot. In this way, the laser inspection robot can re-plan the new inspection path for the remaining undetected task points after encountering an obstacle, and finally return to the starting point. In this paper, Visual Studio C++ is used to test the improved ant colony algorithm and Greedy algorithm. The results show that the improved ant colony algorithm has obvious advantages in path length and the number of passing points, which can realize that the inspection route of the laser inspection robot is optimal or sub-optimal. At the same time, the dynamic simulation of the method is carried out based on MATLAB. The simulation results show that the method can realize self-real-timely avoid obstacle and re-plan the new inspection route after encountering an obstacle. It can ensure the completion of the inspection task. And the method has good applicability, robustness and high efficiency.

关键词： Laser Inspection Robot Path plan Topology Undirected Graph Ant Colony algorithm dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

DC Emergency Power Control Strategy for AC/DC Multi-Channel Interconnected System

DC Emergency Power Control Strategy for AC/DC Multi-Channel ...

引用

The 9th Asia-Pacific Power and Energy Engineering Conference (APPEEC 2017)

作者： Yicong Wang Dejun Shao Zhiqiang Zhang Youping Xu Xiaojie Pan Haishun Sun State Key Laboratory of Advanced Electromagnetic Engineering and Technology Huazhong University of Science and Technology Central China Branch of State Grid Corporation of China China Electric Power Research Institute

Inter-regional transmission line fault often results in power flow transferring,tie-line overloading and system islanding. Traditional control methods such asgenerator tripping and load shedding are costly, and also have undesirable impacts on theloadside. In this paper, a new emergency power control strategy is proposed for multi-channel interconnected system by using the overload capacity of non-fault DC lines. First of all, the capacity of emergency power control can be acquired by critical transmission power of a certain tie-line for stability. Secondly, the shortest electric distance can be calculated by dijkstra algorithm, and then the priority of emergency control of the DC lines can be obtained by the entropy weight method. When the inter-regional transmission power decreases and the effect of single DC line emergency control is poor, the multi-channel cooperative emergency control strategy is proposed to ensure the system stability. Simulation results verify the effectiveness of the method proposed.

关键词： DC Emergency Control Critical Stable Transmission Power dijkstra algorithm Entropy Weight Multi-Channel Cooperated Emergency Control

来源：评论

学校读者我要写书评

暂无评论

Research on Road Finding Under Complicated Constraints Based on Ant Colony algorithm

Research on Road Finding Under Complicated Constraints Based...

引用

2017 2nd International Conference on Computer, Mechatronics and Electronic Engineering(CMEE 2017)

作者： Ke WANG Yi-fan PENG Xiu-qi ZHANG Yougar School of Resources and Environment University of Electronic Science and Technology of China School of Optoelectronic Information University of Electronic Science and Technology of China School of computer Science and Engineering University of Electronic Science and Technology of China

This paper proposes a novel method which combines dijkstra algorithm(DA) and ant colony optimization(ACO) algorithm. This method is competent to satisfy the cost priority of path-finding under constraint and complex conditions. First, build a network pruning, and use the dijkstra algorithm to generate a secondary synthesis network diagram, and then make use of ant colony algorithm in the secondary synthesis network diagram to search for paths. Simulation results based on network topology show this improved algorithm is efficient and feasible to search for paths under complex constraints.

关键词： Complex constraint path-finding(CCP) Ant colony algorithm dijkstra algorithm Secondary synthesis network diagram

来源：评论

学校读者我要写书评

暂无评论

Research on Loading and Routing Problem of Finished Car Logistics

Research on Loading and Routing Problem of Finished Car Logi...

引用

International Conference on Logistics, Informatics and Service Sciences (LISS)

作者： Li, Zhenping Zhang, Yuan Beijing Wuzi Univ Sch Informat Beijing 101149 Peoples R China

ISBN: (纸本)9781509011025

This paper mainly discusses the loading and routing problem of finished car logistics. Finished car logistics is a special commodity business which is produced accompany with the development of the whole vehicle economic. The logistics company loads up the finished cars in accordance with the customers' order, and arranges a suitable route to transport finished cars from manufacturer or distribution center to the customer. This paper discusses the loading and routing problem of finished car logistics where the logistics company uses double-deck transporter to transport multiple types of finished cars. The integer programming model is established, and the corresponding algorithm is designed. At first, according to the length of each layer of double-deck transporter and the size of commercial cars to be transported, the possible loading plan for each layer of car transporter is listed. Then, the disjoint shortest path from the distribution center to each customer is obtained by using the improved dijkstra algorithm. For each shortest path, the demand of a customer who is far away from the distribution center should be met more priority than that of the customers who are nearer to the distribution center. Based on this idea, a heuristic loading algorithm is designed, and the loading and routing program with the shortest total traveling distance of all transporters is obtained. Finally, the feasibility of the model and algorithm is verified by an example with two types of transporters, three types of finished cars and nine customers. This paper ensures that all transporters' traveling distance is shortest and the full loading rate of each transporter can reaches 95%.

关键词： finished car logistics loading and routing problem mathematical model dijkstra algorithm heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：