The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search.
Nacima LabadiRenata MansiniJan MelechovskýRoberto Wolfler CalvoPublished in: Eur. J. Oper. Res. (2012)
Keyphrases
- variable neighborhood search
- metaheuristic
- vehicle routing problem
- optimal solution
- traveling salesman problem
- tabu search
- linear programming
- benchmark instances
- routing problem
- optimization problems
- linear program
- combinatorial optimization
- combinatorial optimization problems
- simulated annealing
- ant colony optimization
- path relinking
- search space
- scatter search
- feasible solution
- genetic algorithm
- test instances
- np hard
- combinatorial problems
- travel time
- valid inequalities
- solution space
- minimum spanning tree
- single machine scheduling problem
- objective function
- constraint propagation
- particle swarm optimization
- neural network
- special case
- memetic algorithm
- heuristic methods
- evolutionary algorithm
- lower bound
- knapsack problem
- column generation