Finding the K shortest paths in a time-schedule network with constraints on arcs

2013 ◽  
Vol 40 (12) ◽  
pp. 2975-2982 ◽  
Author(s):  
Wen Jin ◽  
Shuiping Chen ◽  
Hai Jiang
Keyword(s):  
Shortest Paths ◽  
Time Schedule ◽  
Schedule Network

scholarly journals A new algorithm for finding the K shortest paths in a time-schedule network with constraints on arcs

2016 ◽  
Vol 11 (2) ◽  
pp. 170-177 ◽  
Author(s):  
Jianyuan Guo ◽  
Limin Jia
Keyword(s):  
Major Part ◽  
Shortest Paths ◽  
Past Research ◽  
Mass Transit ◽  
Time Schedule ◽  
Transit Network ◽  
Label Algorithm ◽  
Urban Mass Transit ◽  
Beijing China ◽  
Schedule Network

Time-schedule network with constraints on arcs (TSNCA) means network with a list of pre-defined departure times for each arc. Compared to past research on finding the K shortest paths in TSNCA, the algorithm in this paper is suitable for networks having parallel arcs with the same direction between two nodes. A node label algorithm for finding the K shortest paths between two nodes is proposed. Temporal-arcs are put into the labels of nodes and arranged by ascending order. The number of temporal-arcs is limited to K in every label of node to improve the effectiveness of the algorithm. The complexity of this algorithm is [Formula: see text], where [Formula: see text] is the maximum number of departure times from a node, [Formula: see text] is the number of arcs in network, and [Formula: see text] is the number of nodes in network. Experiments are carried out on major part of real urban mass transit network in Beijing, China. The result proves that the algorithm is effective and practical.

Finding theKth shortest path in a time-schedule network

2005 ◽  
Vol 52 (1) ◽  
pp. 93-102 ◽  
Author(s):  
Yen-Liang Chen ◽  
Kwei Tang
Keyword(s):  
Shortest Path ◽  
Time Schedule ◽  
Schedule Network

Evidence for a Blood Ganglion Barrier in the Superior Cervical Ganglion of the Rat

1982 ◽  
Vol 40 ◽  
pp. 204-204
Author(s):  
D. M. DePace
Keyword(s):  
Blood Vessels ◽  
Superior Cervical Ganglion ◽  
Peripheral Nerves ◽  
Time Schedule ◽  
Transmission Electron ◽  
Cervical Ganglion ◽  
The Central Nervous System ◽  
Cervical Ganglia ◽  
Capillary Circulation ◽  
And Control

The majority of blood vessels in the superior cervical ganglion possess a continuous endothelium with tight junctions. These same features have been associated with the blood brain barrier of the central nervous system and peripheral nerves. These vessels may perform a barrier function between the capillary circulation and the superior cervical ganglion. The permeability of the blood vessels in the superior cervical ganglion of the rat was tested by intravenous injection of horseradish peroxidase (HRP). Three experimental groups of four animals each were given intravenous HRP (Sigma Type II) in a dosage of.08 to.15 mg/gm body weight in.5 ml of.85% saline. The animals were sacrificed at five, ten or 15 minutes following administration of the tracer. Superior cervical ganglia were quickly removed and fixed by immersion in 2.5% glutaraldehyde in Sorenson's.1M phosphate buffer, pH 7.4. Three control animals received,5ml of saline without HRP. These were sacrificed on the same time schedule. Tissues from experimental and control animals were reacted for peroxidase activity and then processed for routine transmission electron microscopy.

eMap: A Web Application for Identifying and Visualizing Electron or Hole Hopping Pathways in Proteins

2019 ◽  
Author(s):  
Ruslan N. Tazhigulov ◽  
James R. Gayvert ◽  
Melissa Wei ◽  
Ksenia B. Bravaya
Keyword(s):  
Web Application ◽  
Shortest Paths ◽  
Coarse Grained ◽  
Decay Parameter ◽  
Electron Hole ◽  
Web Based ◽  
Aromatic Amino Acid Residue ◽  
Pathways Model ◽  
Visualization Tools ◽  
Effective Decay

<p>eMap is a web-based platform for identifying and visualizing electron or hole transfer pathways in proteins based on their crystal structures. The underlying model can be viewed as a coarse-grained version of the Pathways model, where each tunneling step between hopping sites represented by electron transfer active (ETA) moieties is described with one effective decay parameter that describes protein-mediated tunneling. ETA moieties include aromatic amino acid residue side chains and aromatic fragments of cofactors that are automatically detected, and, in addition, electron/hole residing sites that can be specified by the users. The software searches for the shortest paths connecting the user-specified electron/hole source to either all surface-exposed ETA residues or to the user-specified target. The identified pathways are ranked based on their length. The pathways are visualized in 2D as a graph, in which each node represents an ETA site, and in 3D using available protein visualization tools. Here, we present the capability and user interface of eMap 1.0, which is available at https://emap.bu.edu.</p>

Visualization of Task Time Schedule Uncertainty in Project Management

2018 ◽  
Vol 30 (6) ◽  
pp. 1055
Author(s):  
Qiang Lu ◽  
Longlong Mao ◽  
Bingjie Chai ◽  
Jianbo Tan
Keyword(s):  
Project Management ◽  
Time Schedule ◽  
Task Time

Computer algorithms

2018 ◽  
Author(s):  
Mark Newman
Keyword(s):  
Data Structures ◽  
Analysis Of Algorithms ◽  
Shortest Paths ◽  
Minimum Cut ◽  
Network Data ◽  
Computer Algorithms ◽  
Breadth First Search ◽  
Augmenting Path ◽  
Basic Concepts ◽  
Maximum Flows

This chapter introduces some of the fundamental concepts of numerical network calculations. The chapter starts with a discussion of basic concepts of computational complexity and data structures for storing network data, then progresses to the description and analysis of algorithms for a range of network calculations: breadth-first search and its use for calculating shortest paths, shortest distances, components, closeness, and betweenness; Dijkstra's algorithm for shortest paths and distances on weighted networks; and the augmenting path algorithm for calculating maximum flows, minimum cut sets, and independent paths in networks.

scholarly journals Lower bounds for computing geometric spanners and approximate shortest paths

2001 ◽  
Vol 110 (2-3) ◽  
pp. 151-167 ◽  
Author(s):  
Danny Z. Chen ◽  
Gautam Das ◽  
Michiel Smid
Keyword(s):  
Lower Bounds ◽  
Shortest Paths ◽  
Geometric Spanners

Shortest Paths on Cubes

2021 ◽  
Vol 52 (2) ◽  
pp. 121-132
Author(s):  
Richard Goldstone ◽  
Rachel Roca ◽  
Robert Suzzi Valli
Keyword(s):  
Shortest Paths
Sign in / Sign up

Export Citation Format

Share Document