Evolutionary Computation plus Dynamic Programming for the Bi-Objective Travelling Thief Problem.
Junhua WuSergey PolyakovskiyMarkus WagnerFrank NeumannPublished in: CoRR (2018)
Keyphrases
- evolutionary computation
- bi objective
- dynamic programming
- evolutionary algorithm
- multi objective
- knapsack problem
- efficient solutions
- multi objective optimization
- routing problem
- genetic programming
- computational intelligence
- ant colony optimization
- genetic algorithm
- machine learning and data mining
- nature inspired algorithms
- network design
- multiple objectives
- fitness function
- nsga ii
- fuzzy logic
- swarm intelligence
- cooperative coevolution
- state space
- optimization problems
- shortest path problem
- reinforcement learning
- differential evolution
- greedy algorithm
- optimization algorithm
- linear programming
- neural network
- multi objective evolutionary algorithms
- particle swarm optimization
- markov decision processes
- metaheuristic
- power system
- scatter search
- test problems
- evolutionary approaches
- real time
- multiobjective optimization
- simulated annealing
- routing algorithm
- particle swarm optimization pso
- random walk
- optimal policy