Probabilistic bounds on the k-Traveling Salesman Problem and the Traveling Repairman Problem.
Moïse BlanchardAlexandre JacquillatPatrick JailletPublished in: CoRR (2022)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- ant colony optimization
- combinatorial problems
- optimization problems
- ant colony optimization algorithm
- combinatorial optimization problems
- hamiltonian cycle
- transportation networks
- discrete particle swarm optimization
- lower bound
- crossover operator
- genetic local search
- traveling salesman
- vehicle routing problem
- upper bound
- bayesian networks
- information theoretic
- valid inequalities
- discrete optimization problems
- metaheuristic
- probabilistic model
- particle swarm optimization
- simulated annealing
- scheduling problem
- search algorithm
- genetic algorithm