This paper presents an overview of the multiobjective shortest path problem (MSPP) and a review of essential and recent issues regarding the methods to its solution. The paper further explores a multiobjective evolutionary algorithm as applied to the MSPP and describes its behavior in terms of diversity of solutions, computational complexity, and optimality of solutions. Results show that the evolutionary algorithm can find diverse solutions to the MSPP in polynomial time (based on several network instances) and can be an alternative when other methods are trapped by the tractability problem
Runtime analysis of evolutionary algorithms has become an important part in the theoretical analysis...
Many real-world problems involve two types of difficulties: 1) multiple, conflicting objectives and ...
This paper presents an approach to the shortest path routing problem that uses one of the most popul...
For many years researchers and decision makers (DMs) faced with multicriteria shortest path problems...
The use of multi-graphs in modelling multi-objective transportation problems is gaining popularity, ...
The shortest path routing problem is a multiobjective nonlinear optimization problem with constraint...
This paper compares different solution approaches for the multi-objective shortest path problem (MSP...
The shortest path routing problem is a multiobjective nonlinear optimization problem with constraint...
Abstract: Problem statement: A new multi-objective approach, Strength Pareto Evolutionary Algorithm ...
This paper explores the potential of using genetic algorithm to solve the shortest path problem in O...
: In this paper we analyse the labelling algorithm for the multiobjective shortest path problem co...
This paper explores the potential of using genetic algorithm to solve the shortest path problem in O...
Many real-world problems are multiobjective optimization problems, and evolutionary algorithms are q...
Shortest path problems are fundamental network optimization problems arising in many contexts and ha...
We present a natural fitness function f for the multiobjective shortest path problem, which is a fun...
Runtime analysis of evolutionary algorithms has become an important part in the theoretical analysis...
Many real-world problems involve two types of difficulties: 1) multiple, conflicting objectives and ...
This paper presents an approach to the shortest path routing problem that uses one of the most popul...
For many years researchers and decision makers (DMs) faced with multicriteria shortest path problems...
The use of multi-graphs in modelling multi-objective transportation problems is gaining popularity, ...
The shortest path routing problem is a multiobjective nonlinear optimization problem with constraint...
This paper compares different solution approaches for the multi-objective shortest path problem (MSP...
The shortest path routing problem is a multiobjective nonlinear optimization problem with constraint...
Abstract: Problem statement: A new multi-objective approach, Strength Pareto Evolutionary Algorithm ...
This paper explores the potential of using genetic algorithm to solve the shortest path problem in O...
: In this paper we analyse the labelling algorithm for the multiobjective shortest path problem co...
This paper explores the potential of using genetic algorithm to solve the shortest path problem in O...
Many real-world problems are multiobjective optimization problems, and evolutionary algorithms are q...
Shortest path problems are fundamental network optimization problems arising in many contexts and ha...
We present a natural fitness function f for the multiobjective shortest path problem, which is a fun...
Runtime analysis of evolutionary algorithms has become an important part in the theoretical analysis...
Many real-world problems involve two types of difficulties: 1) multiple, conflicting objectives and ...
This paper presents an approach to the shortest path routing problem that uses one of the most popul...