Maximum size of the pareto cost sets for multi-constrained optimal routing.
Derya Yiltas-KaplanPublished in: Turkish J. Electr. Eng. Comput. Sci. (2017)
Keyphrases
- pareto optimal
- maximum number
- expected cost
- minimum cost
- multi objective
- high cost
- maintenance cost
- dynamic programming
- differential evolution
- cost sensitive
- total cost
- neural network
- optimal planning
- routing problem
- constant factor
- optimal cost
- routing decisions
- average cost
- storage requirements
- optimal control
- multi objective optimization
- routing algorithm
- computational complexity