Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem.
Markus LeitnerGünther R. RaidlPublished in: SAINT (2008)
Keyphrases
- facility location problem
- variable neighborhood search
- prize collecting
- single machine scheduling problem
- facility location
- approximation algorithms
- metaheuristic
- tabu search
- traveling salesman problem
- precedence constraints
- heuristic methods
- travel time
- hybrid method
- minimum spanning tree
- routing problem
- lagrangian relaxation
- vehicle routing problem
- benchmark instances
- branch and bound algorithm
- integer programming
- simulated annealing
- single machine
- search procedure
- scheduling problem
- processing times
- job shop scheduling problem
- combinatorial optimization
- shortest path