Add to ORKGThis paper explores the potential of using genetic algorithm to solve the shortest path problem in Open Shortest Path First (OSPF) and Multi-protocol Label Switching (MPLS). The most critical task for developing a genetic algorithm to this problem is how to encode a path in a graph into a chromosome. The proposed approach has been tested on ten randomly generated problems with different weights. The experimental results are very encouraging and the algorithm can find the optimum solution rapidly with high probability
The shortest path routing problem is a multiobjective nonlinear optimization problem with constraint...
This paper proposes a general algorithm framework for solving dynamic sequence optimization problems...
This paper compares different solution approaches for the multi-objective shortest path problem (MSP...
This paper explores the potential of using genetic algorithm to solve the shortest path problem in O...
Abstract. This paper presents a genetic algorithm based on a strategy to find the shortest path in a...
This paper presents an approach to the shortest path routing problem that uses one of the most popul...
Though shortest path routing algorithm such as OSPFs Dijkstra algorithm is well established, finding...
This paper presents an overview of the multiobjective shortest path problem (MSPP) and a review of e...
With the increase in traffic, internet service providers are trying their best to provide maximum ut...
The shortest path problem has many different versions. In this manuscript, we proposed a muti-constr...
The use of multi-graphs in modelling multi-objective transportation problems is gaining popularity, ...
This paper considers uni cast routing problem for networks where transmission requests are establish...
Providers (ISPs) try to meet the increasing traffic demand with new technology and improved utilizat...
With the increase in traffic, internet service providers are trying their best to provide maximum ut...
In delivering packages, goods, and in doing a business, location is a critical variable to control. ...
The shortest path routing problem is a multiobjective nonlinear optimization problem with constraint...
This paper proposes a general algorithm framework for solving dynamic sequence optimization problems...
This paper compares different solution approaches for the multi-objective shortest path problem (MSP...
This paper explores the potential of using genetic algorithm to solve the shortest path problem in O...
Abstract. This paper presents a genetic algorithm based on a strategy to find the shortest path in a...
This paper presents an approach to the shortest path routing problem that uses one of the most popul...
Though shortest path routing algorithm such as OSPFs Dijkstra algorithm is well established, finding...
This paper presents an overview of the multiobjective shortest path problem (MSPP) and a review of e...
With the increase in traffic, internet service providers are trying their best to provide maximum ut...
The shortest path problem has many different versions. In this manuscript, we proposed a muti-constr...
The use of multi-graphs in modelling multi-objective transportation problems is gaining popularity, ...
This paper considers uni cast routing problem for networks where transmission requests are establish...
Providers (ISPs) try to meet the increasing traffic demand with new technology and improved utilizat...
With the increase in traffic, internet service providers are trying their best to provide maximum ut...
In delivering packages, goods, and in doing a business, location is a critical variable to control. ...
The shortest path routing problem is a multiobjective nonlinear optimization problem with constraint...
This paper proposes a general algorithm framework for solving dynamic sequence optimization problems...
This paper compares different solution approaches for the multi-objective shortest path problem (MSP...