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

10th Annual International Conference on Information Technology and Electrical Engineering (ICITEE)

作者： Zulfiqar, La Ode Mohamad Isnanto, R. Rizal Nurhayati, Oky Dwi Univ Diponegoro Informat Syst Semarang Indonesia Univ Diponegoro Comp Engn Semarang Indonesia

ISBN: (纸本)9781538647394

More than half of company's logistic budget is spent for the transportation matter. Hence, applying the efficient way to distribute things is exactly needed for the transportation system in order to gain better profit. The combination of dijkstra algorithm and Sweep algorithm is a novel method that able to resolve optimal distribution route planning. As we gain from our research that by utilizing this method we achieve the reduction of both distance travel and trip's time. We are gaining better solution for 9.3% in distance travel and successful cutting time travel for 500% from the original trip's time.

关键词： route optimization distribution dijkstra algorithm Sweep algorithm

来源：评论

学校读者我要写书评

暂无评论

Web Service Composition Using The Bidirectional dijkstra algorithm

引用

IEEE LATIN AMERICA TRANSACTIONS 2016年第5期14卷 2522-2528页

作者： Moo, F. Hernandez, R. Uc, V. Madera, F. Univ Autonoma Yucatan Comp Sci Merida Yucatan Mexico Univ Autonoma Yucatan Merida Yucatan Mexico Univ Autonoma Yucatan Fac Matemat Merida Yucatan Mexico

Web services are not always able to fulfill customer requirements on their own, so in those cases it can choose to make a composition of web services. However, this is a complex problem since it must take into account the large number of available services, performance requirements, and other factors related to quality of service (QoS). Representing the problem of web service composition as a graph, some methods were used that do not ensure optimum solution. In this work the bidirectional dijkstra algorithm is proposed to solve the problem of web services composition. Experimental results show that, as the number of web service classes increases, proposed algorithm performance improves.

关键词： web service composition dijkstra algorithm bidirectional search dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Application of dijkstra algorithm in open evaluation of community

Application of Dijkstra algorithm in open evaluation of comm...

引用

2017 2nd International Conference on Materials Science,Machinery and Energy Engineering(MSMEE 2017)

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

The Chinese government has formulated a policy that, in principle, is no longer a closed community. The existing closed area and unit compound should open gradually. The policy has aroused widespread concern and discussion. We use the dijkstra algorithm to simulate the district road network. Based on the study of the total time before and after the opening of the District, this paper studies whether the district is open or not. This method has two advantages, quantitative answers to the impact of the open area on the road network, and can find the Brasee paradox. Finally, we have a case study of a district in Changsha, China.

关键词： dijkstra algorithm closed community Brasee paradox

来源：评论

学校读者我要写书评

暂无评论

A Research on the Weighted Improvement of dijkstra algorithm in Optimal Path Calculation

A Research on the Weighted Improvement of Dijkstra Algorithm...

引用

2017 5th International Conference on Frontiers of Manufacturing Science and Measuring Technology(FMSMT 2017)

作者： Rongfu Wang Nanchang Institute of Science & Technology

ISBN: (纸本)9781510840232

dijkstra algorithm is the shortest path algorithm from one vertex to others, which has solved many shortest path problems. However, in some engineering practice, the shortest path is not the best path, so that it needs to define a weight to illustrate the importance of the two nodes. Based on the best evacuation route when a mine is flooded, the traditional dijkstra algorithm is improved in this paper. First, this paper interprets the dijkstra algorithm before improved, and uses it to calculate the mine shortest path to avoid water, then proposes a improvement method-introducing the concept of equivalent path and analyzing the influence factor and weight of equivalent path, then obtaining the conversion formula of the equivalent path and actual path. Instead of the actual path, the equivalent path can realize the adaptive improvement to the dijkstra algorithm, so that it can realize the calculation on the best path to avoid water when the water inrush occurs.

关键词： Safety Engineering dijkstra algorithm Improvement Water Inrush Disaster The Best Water Avoidance Path Equivalent Path

来源：评论

学校读者我要写书评

暂无评论

The establishment of an optimal migration model for refugees Based on dijkstra algorithm

The establishment of an optimal migration model for refugees...

引用

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

作者： Mingyue Sun School of North China Electricity Power University

ISBN: (纸本)9781510845008

In recent years, the problem of large-scale migration of refugees has not only become an international hotspot that has plagued many countries around the world. More than a million migrants and refugees crossed into Europe in 2015, sparking a crisis as countries struggle to cope with the influx, and creating division in the EU over how best to deal with resettling people [1]. Because of the limited choice of refugees, and limited capacity of the recipient countries, the first step is to deal with the allocation of refugees in various routes to different countries. In the second step, a lot of external events will be added to interfere. At this point, it is needed to test whether the model can maintain stability under the interference of certain dynamic factors. Therefore, the basic model needs to meet the conditions of dynamic planning, and dijkstra algorithm is chosen to optimize the migration route for the refugees. Its advantage is that when the dynamic interference occurs, only some parameters are adjusted slightly, and the basic model is still applicable. Bayes statistical model is used to predict the rate of refugees leaving the transit countries. And the proportion of leaving refugees at each point of action can be obtained. Then, the optimal allocation of the refugees can be calculated based on integer programming.

关键词： dijkstra algorithm Bayes statistical model Optimization

来源：评论

学校读者我要写书评

暂无评论

Research and Design of a SpaceWire Network Dynamic Reconfiguration Method Based on dijkstra algorithm 9

Research and Design of a SpaceWire Network Dynamic Reconfigu...

引用

9th International Symposium on Computational Intelligence and Design (ISCID)

作者： Du, Rui Fei, Haidong Zhang, Weigong Wang, Xingyou Beijing Microelect Technol Inst SOC Dept Beijing Peoples R China Capital Normal Univ Beijing Engn Res Ctr High Reliable Embedded Syst Beijing Peoples R China

ISBN: (纸本)9781509035588

SpaceWire is a full-duplex, point-to-point, high-speed serial data transfer standard which is intended for use in further on-board spacecraft, space missions and applications. However, space environment is harsh and complex which requires a communication network with high reliability. It is inevitable that SpaceWire network link fault or SpaceWire equipment damage is able to change the SpaceWire network status. Therefore, traditional static routing configuration cannot efficiently solve the network fault recovery problem. In this paper, our research is divided into three parts. First of all, we design a simulation and test platform for SpaceWire network by using 7 SpaceWire communication nodes and 3 SpaceWire routers. This SpaceWire network platform is the foundation for the next work. Secondly, we introduce the SpaceWire routing protocol and dijkstra algorithm principle. Thirdly, in order to improve the reliability of SpaceWire network and restore communication fault, we propose a SpaceWire network dynamic reconfiguration method based on dijkstra algorithm. By analyzing the check information from SpaceWire router ports and communication nodes, it dynamically calculates optimal routing paths and reconfigures the SpaceWire network routers when there is a fault on SpaceWire network. Based on the simulation and test platform for SpaceWire network, we complete the software design and implementation of this method. Verification result demonstrates that the method can perform real-time network reconfiguration and path optimization when a SpaceWire network fault occurs, improve the ability of self-adaptive of SpaceWire network and enhance the reliability and transmit efficiency as well.

关键词： SpaceWire network reconfiguration dijkstra algorithm network fault path optimization

来源：评论

学校读者我要写书评

暂无评论

Application of dijkstra algorithm for Solving Interval Valued Neutrosophic Shortest Path Problem

Application of Dijkstra Algorithm for Solving Interval Value...

引用

IEEE Symposium Series on Computational Intelligence (IEEE SSCI)

作者： Broumi, Said Bakali, Assia Talea, Mohamed Smarandache, Florentin Ben Msik Univ Lab Informat Proc Fac Sci Hassan 2BP 7955 Casablanca Morocco Ecole Royale Navale Blvd Sour JdidBP 16303 Casablanca Morocco Univ New Mexico Dept Math 705 Gurley Ave Gallup NM 87301 USA

In this paper, the authors propose an extended version of dijkstra' algorithm for finding the shortest path on a network where the edge weights are characterized by an interval valued neutrosophic numbers. Finally... 详细信息

ISBN: (纸本)9781509042401

关键词： dijkstra algorithm interval valued neutrosophic number Shortest path problem Network

来源：评论

学校读者我要写书评

暂无评论

dijkstra-algorithm Based Ray-Tracing by Controlling Proximity Node Mapping 31

Dijkstra-Algorithm Based Ray-Tracing by Controlling Proximit...

引用

31st IEEE International Conference on Advanced Information Networking and Applications (IEEE AINA)

作者： Uchida, Kazunori Barolli, Leonard Fukuoka Inst Technol Fukuoka 8110295 Japan

ISBN: (纸本)9781509062317

This paper is concerned with a discrete ray-tracing method by using dijkstra-algorithm (DA) to treat arbitrarily shaped obstacles which cause diffractions and reflections of incident rays. The computational space is divided in terms of regularly arrayed cubics with 8 apex-nodes and links of a node are limited to 26 proximate nodes of adjacent 8 cubics. Firstly, the original DA data provide shortest paths from a primary source node to all nodes except for inner nods of obstacles, and secondly, modifying the DA data by applying path-selection, path-linearization and checking line of sight (LOS) leads to incident and diffraction rays. Reflection rays are obtained by using distributed secondary source nodes. We show numerically how the optical rays are constructed starting from the original DA data. Ray examples reveal that the proposed method is effective to ray-tracing for complicated structures.

关键词： dijkstra algorithm Discrete Ray-Tracing Diffraction Reflection Propagation

来源：评论

学校读者我要写书评

暂无评论

Research on the Improvement of dijkstra algorithm in the Shortest Path Calculation

Research on the Improvement of Dijkstra Algorithm in the Sho...

引用

2017 4th International Conference on Machinery,Materials and Computer(MACMC 2017)

作者： Yong Huang College of Mathematics and Statistics Zhaotong University

ISBN: (纸本)9781510871038

dijkstra algorithm is proposed by Holland computer scientist dijkstra in 1959, and it is a typical shortest path algorithm, which can implement the shortest path planning in directed graphs. However, the traditional dijkstra algorithm can only compute simple shortest path planning problems, but it is not suitable for complex situations. Based on a project, this paper proposed an improved method of dijkstra algorithm. First, this paper interprets the dijkstra algorithm before being improved, and uses it to calculate the mine shortest path to avoid water, and then a method for improvement will be proposed later to introduce the concept of equivalent path and analyze the influence factor and weight of equivalent path. The conversion formula of the equivalent path and actual path will be obtained finally in the paper, where the equivalent path can realize the adaptive improvement to the dijkstra algorithm, and calculate on the best path to avoid water when the water inrush occurs.

关键词： dijkstra algorithm Improvement Water inrush disaster The best water avoidance path Equivalent path

来源：评论

学校读者我要写书评

暂无评论

Application of dijkstra algorithm to Proposed Tramway of a Potential World Class University

引用

Applied Mathematics 2016年第6期7卷 496-503页

作者： M. C. Agarana N. C. Omoregbe M. O. Ogunpeju Department of Mathematics Covenant University Ota Nigeria Department of Computer and Information Science Covenant University Ota Nigeria

Nowadays, the development of “smart cities” with a high level of quality of life is becoming a prior challenge to be addressed. In this paper, promoting the model shift in railway transportation using tram network towards more reliable, greener and in general more sustainable transportation modes in a potential world class university is proposed. “Smart mobility” in a smart city will significantly contribute to achieving the goal of a university becoming a world class university. In order to have a regular and reliable rail system on campus, we optimize the route among major stations on campus, using shortest path problem dijkstra algorithm in conjunction with a computer software called LINDO to arrive at the optimal route. In particular, it is observed that the shortest path from the main entrance gate (Canaan land entrance gate) to the Electrical Engineering Department is of distance 0.805 km.

关键词： Potential World Class University Optimization dijkstra algorithm Shortest Path Tramway

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：