Dynamic programming operators for the bi-objective Traveling Thief Problem.
Roberto SantanaSiddhartha ShakyaPublished in: CEC (2020)
Keyphrases
- bi objective
- dynamic programming
- efficient solutions
- knapsack problem
- multi objective
- set covering problem
- multi objective optimization
- ant colony optimization
- multiple objectives
- network design
- nsga ii
- evolutionary algorithm
- routing problem
- shortest path problem
- test problems
- state space
- computer networks
- greedy algorithm
- communication networks
- linear programming