Optimally solving a versatile Traveling Salesman Problem on tree networks with soft due dates and multiple congestion scenarios.
Stefan BockPublished in: Eur. J. Oper. Res. (2020)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- transportation networks
- discrete optimization problems
- minimum spanning tree
- ant colony optimization
- combinatorial optimization problems
- hamiltonian cycle
- combinatorial problems
- optimization problems
- traveling salesman
- crossover operator
- discrete optimization
- ant colony optimization algorithm
- vehicle routing problem
- simulated annealing
- graph coloring
- discrete particle swarm optimization
- knapsack problem
- travel time
- constraint programming
- valid inequalities
- index structure