New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems.
V. N. SastryT. N. JanakiramanS. Ismail MohideenPublished in: Int. J. Comput. Math. (2005)
Keyphrases
- multi objective
- multiple objectives
- multi objective optimization
- bi objective
- pareto set
- computational complexity
- multiobjective optimization
- shortest path problem
- worst case
- optimization problems
- optimization algorithm
- evolutionary algorithm
- data structure
- combinatorial optimization problems
- shortest path
- pareto optimal solutions
- learning algorithm
- trade off
- genetic algorithm
- genetic programming
- optimal path
- linear programming
- cost function
- objective function