Microcomputer-based algorithms for large scale shortest path problems

ALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS

We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...

algorithms for biobjective shortest path problems in fuzzy networks

we consider biobjective shortest path problems in networks with fuzzy arc lengths. considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. the rst and second approaches are extensions of the labeling method to solve the sing...

Parallel Shortest Path Algorithms for Solving Large-Scale Instances

We present an experimental study of parallel algorithms for solving the single source shortest path problem with non-negative edge weights (NSSP) on large-scale graphs. We implement Meyer and Sander’s ∆-stepping algorithm and report performance results on the Cray MTA-2, a multithreaded parallel architecture. The MTA-2 is a high-end shared memory system offering two unique features that aid the...

Parallel algorithms for geometric shortest path problems

The original goal of this project was to investigate and compare the experimental performance and ease of programming of algorithms for geometric shortest path finding using shared memory and message passing programming styles on a shared memory machine. However, due to the extended unavailability of a suitable shared memory machine, this goal was only partially met, though a system suitable fo...

Approximation algorithms for geometric shortest path problems a