Jogging with APL along the shortest path

In this paper we examine the classical shortest path problem and illustrate the modelling issues involved in formulating APL codes for a number of generalizations thereof, including multiobjective problems. We also comment on APL's ability to cope with ...

Uncertainty theory provides a new tool to deal with the shortest path problem with nondeterministic arc lengths. With help from the operational law of uncertainty theory, this paper gives the uncertainty distribution of the shortest path length. Also, ...

We consider the problem of constructing shortest path maps in two dimensions under angle constraint. Shortest path maps are used for planning short length paths from a fixed source point s to varying goal points. In the standard shortest path map the ...