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

shortest path based simulated annealing algorithm for dynamic facility layout problem under dynamic business environment

引用

EXPERT SYSTEMS WITH APPLICATIONS 2009年第8期36卷 11221-11232页

作者： Dong, Ming Wu, Chang Hou, Forest Shanghai Jiao Tong Univ Antai Coll Econ & Management Shanghai 200052 Peoples R China Intel Prod Shanghai Ltd Shanghai 200131 Peoples R China

This paper studies a new kind of dynamic multi-stage facility layout problem under dynamic business environment, in which new machines may be added into, or old machines may be removed from the plant. We define this problem first on the basis of unequal area machines and continual presentation of layouts. Compared with nodes and arcs of the flow chart, we convert this problem into a shortest path problem by studying its cost function and machine adding/removing heuristic rules, and the corresponding mathematical model for this problem is established. An auction algorithm is proposed here to solve the shortest path problem. Finally, a shortest path based simulated annealing algorithm is presented to solve the optimization problem. Parameters of the SP based SA algorithm are discussed to improve the performance of the algorithm. Some cases are used to verify the proposed algorithm. (C) 2009 Elsevier Ltd. All rights reserved.

关键词： Dynamic layout Adding/removing machines shortest path algorithm Simulated annealing algorithm

来源：评论

学校读者我要写书评

暂无评论

shortest path algorithms for Social Network Strengths 5th

Shortest Path Algorithms for Social Network Strengths

引用

5th International Conference on Frontiers in Intelligent Computing - Theory and Applications (FICTA)

作者： Ahmad, Amreen Ahmad, Tanvir Vijay, Harsh Jamia Millia Islamia Dept Comp Engn New Delhi India

ISBN: (纸本)9789811031533;9789811031526

In social media directed links can represent anything from close friendship to common interests. Such directed links determine the flow of information and hence indicate an individual influence on others. The influence of a person X over person Y is defined as the ratio of Y's investment that Y makes on X. Most contemporary networks return source-target paths in an online social network as a result of search ranked by degrees of separation. This approach fails to reflect tie of social strength (i.e., intimacy of two people in terms of interaction), and does not reflect asymmetric nature of social relations (i.e., if a person X invests time or effort in person Y, then the reverse is not necessarily true). In this paper, it is proved that in social graph result can prove to be more effective by incorporating the concept of directed and weighted influence edges taking into account both asymmetry and tie strength. The study is based on two real-world networks: Twitter capturing its retweet data and DBLP capturing its author-coauthor relationship. The experiments have been conducted based on two algorithms-Dijkstra shortest path algorithm and influence-based strongest path algorithm. Then a comparative study was done capturing different cases in which strongest path algorithm was better than shortest path algorithm in different cases.

关键词： Influence-based strongest path algorithm shortest path algorithm Asymmetric influence Strength of ties

来源：评论

学校读者我要写书评

暂无评论

Heuristic shortest path algorithms for transportation applications: State of the art

引用

COMPUTERS & OPERATIONS RESEARCH 2006年第11期33卷 3324-3343页

作者： Fu, L Sun, D Rilett, LR Univ Waterloo Dept Civil Engn Waterloo ON N2L 3G1 Canada Chongqing Univ Coll Automat Chongqing 400044 Peoples R China Univ Nebraska Mid Amer Transportat Ctr Lincoln NE 68588 USA

There are a number of transportation applications that require the use of a heuristic shortest path algorithm rather than one of the standard, optimal algorithms. This is primarily due to the requirements of some transportation applications where shortest paths need to be quickly identified either because an immediate response is required (e.g., in-vehicle route guidance systems) or because the shortest paths need to be recalculated repeatedly (e.g., vehicle routing and scheduling). For this reason a number of heuristic approaches have been advocated for decreasing the computation time of the shortest path algorithm. This paper presents a survey review of various heuristic shortest path algorithms that have been developed in the past. The goal is to identify the main features of different heuristic strategies, develop a unifying classification framework, and summarize relevant computational experience. (c) 2005 Elsevier Ltd. All rights reserved.

关键词： artificial intelligence traffic network shortest path algorithm heuristics heuristic shortest path algorithm in-vehicle route guidance system (RGS) intelligent transportation systems (ITS)

来源：评论

学校读者我要写书评

暂无评论

Estimating managed lanes door-to-door travel timesavings using shortest path algorithms

Estimating managed lanes door-to-door travel timesavings usi...

引用

作者： Chang, Chia-Huai Georgia Institute of Technology

学位级别：硕士

Implementing managed lanes, such as high-occupancy toll lanes, within existing urban highway corridors has become increasingly common in cities that want to provide a reliable transportation option but lack sufficient right-of-way to construct new corridors. This study develops a framework that utilizes a shortest path algorithm to compare before and after commute routes and estimate the change in door-to-door travel time offered by managed lane facilities. Using this modeling approach, a case study is explored for the Northwest Corridor (NWC) managed lane facility located in the Atlanta, Georgia, region. The shortest path routines predict that the facility provides a 21.0% - 27.1% decrease in door-to-door travel time for the NWC managed lane users, and a 5.8% – 12.0% travel time decrease for non-NWC general-purpose lane users, for corridor travelers departing home between 6:30 and 8:30 A.M. (traversing the corridor between 6:30 A.M. and 10:00 A.M.). This framework can be easily customized and applied to any other commute route/time change assessment for major managed lane projects.

关键词： Managed lanes shortest path algorithm Commute time savings

来源：评论

学校读者我要写书评

暂无评论

Improved calculation method of shortest path with cellular automata model

引用

KYBERNETES 2012年第3-4期41卷 508-517页

作者： Wang, Min Qian, Yongsheng Guang, Xiaoping Lanzhou Jiaotong Univ Sch Traff & Transportat Lanzhou 730070 Peoples R China

Purpose - shortest path problem has always been a hot topic in the study of graph theory, because of its wide application field, extending from operational research to the disciplines of geography, automatic control, computer science and traffic. According to its concrete application, scholars in the relevant field have presented many algorithms, but most of them are solely improvements based on Dijkstra algorithm. The purpose of this paper is to enrich the kinds of (and improve the efficiency of) the shortest path algorithms. Design/methodology/approach - This paper puts forward an improved calculation method of shortest path using cellular automata model, which is designed to search the shortest path from one node to another node. Cellular state set is adjusted with combination of breeding and mature states. Evolution rule is improved to enhance its parallelism. At the same time, recording manner of cellular state turnover is modified to record all information sources. Findings - The result indicates that the improved algorithm is correct and more efficient, in that it could reduce the times of cellular state turnover;meanwhile, it can solve multi-paths problem. Originality/value - In this paper, cellular state set in exiting shortest path algorithm based on cellular automata theory is adjusted;evolution rule is improved;and recording manner of cellular state turnover is modified to record all information sources. All of which make the parallelism of this algorithm enhanced and the multi-paths problem solved.

关键词： Graph theory Programming and algorithm theory Cellular automata shortest path algorithm Cellular state Parallelism Multi-paths

来源：评论

学校读者我要写书评

暂无评论

New matrix operator-based algorithm to the shortest path problem

引用

Dianzi Keji Daxue Xuebao/Journal of the University of Electronic Science and Technology of China 2005年第6期34卷 778-781页

作者： Zhao, Jian-Hong Yang, Jian-Yu Lei, Wei-Li School of Electronic Engineering UEST of China Chengdu 610054 China

This paper defines the adjacent cost matrix and the path matrix based on the directed weighted-graph, and defines a new operator that 'summarization then minimum' replace 'multiplication then summarization' between two adjacent cost matrixs, named 'minimum of summarization sequence between two multiplication position elements of the two matrixs'. Based on this new matrix operator, this paper proposes a new algorithm to the shortest path problem within a directed graph. This algorithm can get the global shortest path out for any types of graph. Dijkstra algorithm is a well-known good solution to the shortest path problem, but it will result out a fake path to some kinds of graph. The algorithm presented by this paper completely overcome this phenomena out of Dijikstra algorithm.

关键词： Dijkstra algorithm Matrix operator Minimum of summarization sequence Routing algorithm shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

Inferring anatomical therapeutic chemical (ATC) class of drugs using shortest path and random walk with restart algorithms

引用

BIOCHIMICA ET BIOPHYSICA ACTA-MOLECULAR BASIS OF DISEASE 2018年第6期1864卷 2228-2240页

作者： Chen, Lei Liu, Tao Zhao, Xian Shanghai Maritime Univ Coll Informat Engn Shanghai 201306 Peoples R China

The anatomical therapeutic chemical (ATC) classification system is a widely accepted drug classification scheme. This system comprises five levels and includes several classes in each level. Drugs are classified into classes according to their therapeutic effects and characteristics. The first level includes 14 main classes. In this study, we proposed two network-based models to infer novel potential chemicals deemed to belong in the first level of ATC classification. To build these models, two large chemical networks were constructed using the chemical-chemical interaction information retrieved from the Search Tool for Interactions of Chemicals (STITCH). Two classic network algorithms, shortest path (SP) and random walk with restart (RWR) algorithms, were executed on the corresponding network to mine novel chemicals for each ATC class using the validated drugs in a class as seed nodes. Then, the obtained chemicals yielded by these two algorithms were further evaluated by a permutation test and an association test. The former can exclude chemicals produced by the structure of the network, i.e., false positive discoveries. By contrast, the latter identifies the most important chemicals that have strong associations with the ATC class. Comparisons indicated that the two models can provide quite dissimilar results, suggesting that the results yielded by one model can be essential supplements for those obtained by the other model. In addition, several representative inferred chemicals were analyzed to confirm the reliability of the results generated by the two models. This article is part of a Special Issue entitled: Accelerating Precision Medicine through Genetic and Genomic Big Data Analysis edited by Yudong Cai & Tao Huang.

关键词： Anatomical therapeutic chemical Chemical chemical interaction shortest path algorithm Random walk with restart algorithm

来源：评论

学校读者我要写书评

暂无评论

Embedded Backups for Link Failure Recovery in shortest path Trees

Embedded Backups for Link Failure Recovery in Shortest Path ...

引用

2nd International Conference on Software Engineering and Computing Systems (ICSECS 2011)

作者： Qureshi, Muhammad Aasim Hassan, Mohd Fadzil Univ Teknol PETRONAS Comp & Informat Sci Dept Perak Malaysia

ISBN: (纸本)9783642221903

shortest path Tree Problem has always been a popular problem but with the devise of Dijkstra's algorithm, SPT and many related problems received immense intention of researchers. shortest path Tree plays an important role in many applications like robot navigation, games, transportation and communication routing, etc. In many applications like network and vehicle routing, fast and reliable recovery from the failure is desired. Recovery from these failed links need means and/or plan, with least additional healing cost for the prolongation of the process with no or minimum delay. This paper presents an approach to recover from undesirable state of link failure(s) back to the normal state of working. A shortest path tree is being extracted from the graph with alternate path at each point (junction) keeping the cost as low as possible.

关键词： shortest path algorithm recovery alternate shortest path multiple links failure recovery

来源：评论

学校读者我要写书评

暂无评论

Fast bidirectional shortest path on GPU

引用

IEICE ELECTRONICS EXPRESS 2016年第6期13卷 20160036-20160036页

作者： Tangjittaweechai, Lalinthip Ekpanyapong, Mongkol Watewai, Thaisiri Athikulwongse, Krit Lim, Sung Kyu Tavares, Adriano Asian Inst Technol Microelect & Embedded Syst Bangkok Thailand Chulalongkorn Univ Chulalongkorn Business Sch Bangkok 10330 Thailand Natl Elect & Comp Technol Ctr Bangkok Thailand Georgia Inst Technol Sch Elect & Comp Engn Atlanta GA 30332 USA Univ Minho Ctr Algoritmi Dept Ind Elect P-4719 Braga Portugal

The bidirectional shortest path problem has important applications in VLSI floor planning and other areas. We introduce a new algorithm to solve bidirectional shortest path problems using parallel architectures provided by general purpose computing on graphics processing units. The algorithm performs parallel searches from the source and sink using Dijkstra's classic approach modified with pruning and early termination. We achieve substantial speedup over a parallel method that performs a single parallel search on the GPGPU from the source to all other nodes but early terminates when the shortest path to the specified target node is found. Experimental results demonstrate a speedup of nearly 2x over the parallel method that performs a parallel search from the source with early termination on the GPGPU.

关键词： shortest path algorithm single pair GPGPU parallel bidirectional search

来源：评论

学校读者我要写书评

暂无评论

Study of WeChat Platform-Based shortest path Waiting System

World Scientific Research Journal

引用

World Scientific Research Journal 2019年第8期5卷 22-28页

作者： Jiaqi Wang Shi Pan Jiayang Wang Wenhao Chen Wendi Zhu Yuting Zhang

With the rapid development of the internet, mobile medical care also develops rapidly, but the ＂three long and one short＂ problems in the hospital is still unsolved. We present a system of rational planning of walking route for patients based on WeChat platform. We firstly introduce the intelligent guidance and the considering the spatial distance among different departments, the shortest path waiting system is designed by using the backtracking method. The simulation results of the shortest path algorithm in this paper show that the algorithm can effectively plan the clinic route to save time while providing convenience for patients.

关键词： shortest path algorithm Backtracking Smart leading examining WeChat platform

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：