multi-criteria shortest path problems (mspp) are called as np-hard. for mspps, a unique solution for optimizing all the criteria simultaneously will rarely exist in reality. algorithmic and approximation schemes are available to solve these problems; however, the complexity of these approaches often prohibits their implementation on real-world applications. this paper describes the development ...

Multi-criteria shortest path problems (MSPP) are called as NP-Hard. For MSPPs, a unique solution for optimizing all the criteria simultaneously will rarely exist in reality. Algorithmic and approximation schemes are available to solve these problems; however, the complexity of these approaches often prohibits their implementation on real-world applications. This paper describes the development ...

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

We consider a stochastic shortest path problem with associative criteria in which for each node of a graph we choose a probability distribution over the set of successor nodes so as to reach a given target node optimally. We formulate such a problem as an associative Markov decision processes. We show that an optimal value function is a unique solution to an optimality equation and find an opti...

The aim of the paper is to show an example of interaction between the AI and OR elds of research using the Constraint Programming (CP) framework to glue them together. We solve a shortest path problem using the c-semiring-based framework for programming over soft constraints (SCLP), which is an extension of classical constraint solving and programming. The SCLP approac handle uniformly several ...

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