A variable neighborhood search for the budget-constrained maximal covering location problem with customer preference ordering.
Lazar MrkelaZorica StanimirovicPublished in: Oper. Res. (2022)
Keyphrases
- variable neighborhood search
- metaheuristic
- tabu search
- preference ordering
- hybrid method
- traveling salesman problem
- vehicle routing problem
- search procedure
- single machine scheduling problem
- routing problem
- heuristic methods
- minimum spanning tree
- benchmark instances
- simulated annealing
- genetic algorithm
- support vector machine
- utility function
- hybrid algorithm
- learning algorithm