An efficient GVNS for solving Traveling Salesman Problem with Time Windows.
Nenad MladenovicRaca TodosijevicDragan UrosevicPublished in: Electron. Notes Discret. Math. (2012)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- discrete optimization problems
- ant colony optimization
- vehicle routing problem
- combinatorial optimization problems
- optimization problems
- hamiltonian cycle
- ant colony optimization algorithm
- combinatorial problems
- metaheuristic
- traveling salesman
- transportation networks
- branch and bound
- discrete particle swarm optimization
- simulated annealing
- genetic local search
- neural network
- discrete optimization
- valid inequalities
- crossover operator
- quadratic assignment problem
- evolutionary algorithm
- subtour elimination
- reinforcement learning