We consider several combinatorial optimization problems which combine the classic shop scheduling problems, namely open shop scheduling or job shop scheduling, and the shortest path problem. The objective of the obtained problem is to select a subset of jobs that forms a feasible solution of the shortest path problem, and to execute the selected jobs on the open (or job) shop machines to minimi...

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

We introduce networks with additive losses and gains on the arcs. If a positive flow of x units enter an arc a, then x + g(a) units exit. Arcs may increase or consume flow, i.e., they are gainy or lossy. Such networks have various applications, e.g., in financial analysis, transportation, and data communication. Problems in such networks are generally intractable. In particular, the shortest pa...

Discounted Cost Register Automata (DCRA) associate costs with strings in a regular manner using the operation of discounted sum. The min-cost optimization problem for DCRAs corresponds to computing shortest paths in graphs with more general forms of discounting than the well-studied notion of future discounting. We present solutions to two classes of such shortest path problems: in presence of ...

There exit several high speed computation applications that requires minimum distance computation between nodes in weighted graph. Dedicated techniques exist for this purpose are called as shortest path computation. Depending upon need of application, there are three type of shortest path problems; Single Source Shortest Path (SSSP), Single Destination Shortest Path (SDSP) and All Pair Shortest...

The motion planning problems for non-holonomic car-like robots have been extensively studied in the literature. The curvature-constrained shortest-path problem is to plan a path (from an initial connguration to a nal connguration, where a connguration is deened by a location and an orientation) in the presence of obstacles, such that the path is a shortest among all paths with a prescribed curv...

We introduce the universal shortest path problem (Univ-SPP) which generalizes both classical and new shortest path problems. Starting with the definition of the even more general universal combinatorial optimization problem (UnivCOP), we show that a variety of objective functions for general combinatorial problems can be modeled if all feasible solutions have the same cardinality. Since this as...

Shortest path problems appear as subproblems in numerous optimization problems. In most papers concerning multiple objective shortest path problems, additivity of the objective is a de-facto assumption, but in many real-life situations objectives and criteria, can be non-additive. The purpose of this paper is to give a general framework for dominance tests for problems involving a number of non...

Shortest path problems are a well-studied class of problems in theoretical computer science. One particularly applicable type of shortest path problem is to find the geodesic shortest path on a terrain. This type of algorithm finds the shortest path between two points that stays on the surface of a terrain. The most popular methods for finding such a shortest path involve a variant of Dijkstra’...