in this paper, shortest path design problem (spdp) in which the path is incident to all cells is considered. the bi-directional path is one of the known types of configuration of networks for automated guided vehi-cles (agv).to solve this problem, two algorithms are developed. for each algorithm an integer linear pro-gramming (ilp) is determined. the objective functions of both algorithms are t...

This paper studies the problem of finding the shortest path between two points in presence of single-point visibility constraints. In this type of constraints, there should be at least one point on the output path from which a fixed viewpoint is visible. The problem is studied in various domains including simple polygons, polygonal domains, polyhedral surfaces. The method is based on partitioni...

One part of the production of modern hearing aids is the integration of a ventilation tube. This is usually done by applying a shortest path search algorithm on a non-convex ear impression. For the functionality of this so-called vent the path search algorithm has to fulfill several constraints like smoothness and space consumption of the vent. The proposed solution is based upon a modified ver...

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...

In this paper a hybrid implementation for Bellman-Ford to solve shortest path problems is proposed using OpenCL. Here first parallel implementation for Bellman-Ford for single source shortest path (SSSP) problem and all pair shortest path (APSP) are analyzed on CPU and GPU and based on this analysis work is divided among CPU and GPU and hybrid implementation is done. As proper resource utilizat...

There are always more than one shortest paths between two components in software architecture, and in the application of path selection with additional constraints, several optimal or near optimal paths are desired. Traditional A algorithm has been successfully used in software testing activities such as finding the shortest path, selecting test suites and test suites prioritization. Little wor...