19,431 research outputs found
Open source environment to define constraints in route planning for GIS-T
Route planning for transportation systems is strongly related to shortest path algorithms, an optimization problem extensively studied in the literature. To find the shortest path in a network one usually assigns weights to each branch to represent the difficulty of taking such branch. The weights construct a linear preference function ordering the variety of alternatives from the most to the least attractive.Postprint (published version
Temperature and Disorder Chaos in Low Dimensional Directed Paths
The responses of a dimensional directed path to temperature and
to potential variations are calculated exactly, and are governed by the same
scaling form. The short scale decorrelation (strong correlation regime) leads
to the overlap length predicted by heuristic approaches; its temperature
dependence and large absolute value agree with scaling and numerical
observations. Beyond the overlap length (weak correlation regime), the
correlation decays algebraically. A clear physical mechanism explains the
behavior in each case: the initial decorrelation is due to `fragile droplets,'
which contribute to the entropy fluctuations as , while the residual
correlation results from accidental intersections of otherwise uncorrelated
configurations.Comment: four pages, revtex4; minor modifications in the text and typos
correcte
- …