On the cardinality of the Pareto set in bicriteria shortest path problems.
Matthias Müller-HannemannKarsten WeihePublished in: Ann. Oper. Res. (2006)
Keyphrases
- shortest path problem
- bicriteria
- pareto set
- multiple objectives
- multi objective
- multi objective optimization
- pareto optimal
- shortest path
- bi objective
- knapsack problem
- multi objective evolutionary algorithms
- evolutionary algorithm
- optimization algorithm
- directed acyclic graph
- fitness function
- combinatorial optimization problems
- multiobjective optimization
- neural network
- particle swarm optimization
- directed graph
- genetic programming
- search algorithm
- objective function