Randomized Algorithm for the Maximum-Profit Routing Problem.
Bogdan ArmaseluPublished in: CoRR (2023)
Keyphrases
- routing problem
- randomized algorithm
- maximum profit
- knapsack problem
- greedy algorithm
- vehicle routing problem
- lower bound
- multicommodity flow
- routing algorithm
- global optimization
- dynamic programming
- optimization problems
- shortest path
- traveling salesman problem
- optimal solution
- metaheuristic
- particle swarm optimization
- worst case
- travel time
- np hard
- machine learning
- neural network
- linear programming
- upper bound
- genetic algorithm