Dynamic fastest paths with multiple unique destinations (DynFast-MUD) - A specialized traveling salesman problem with intermediate cities.
Jeffrey MillerMuhammad AliPublished in: ITSC (2009)
Keyphrases
- traveling salesman problem
- ant colony optimization
- combinatorial optimization
- traveling salesman
- hamiltonian cycle
- combinatorial problems
- combinatorial optimization problems
- ant colony optimization algorithm
- optimization problems
- nature inspired
- genetic local search
- crossover operator
- vehicle routing problem
- transportation networks
- valid inequalities
- discrete particle swarm optimization
- discrete optimization problems
- subtour elimination
- neural network