An asymptotic approximation of the traveling salesman problem with uniform non-overlapping time windows.
Omar RifkiThierry GaraixChristine SolnonPublished in: CASE (2021)
Keyphrases
- traveling salesman problem
- ant colony optimization
- combinatorial optimization
- vehicle routing problem
- marginal likelihood
- ant colony optimization algorithm
- combinatorial problems
- satisfy the triangle inequality
- transportation networks
- optimization problems
- traveling salesman
- crossover operator
- combinatorial optimization problems
- valid inequalities
- hamiltonian cycle
- discrete particle swarm optimization
- upper bound
- approximation algorithms
- metaheuristic
- routing problem
- discrete optimization problems
- simulated annealing