Less is more approach: basic variable neighborhood search for the obnoxious p-median problem.
Nenad MladenovicAbdulaziz AlkandariJun PeiRaca TodosijevicPanos M. PardalosPublished in: Int. Trans. Oper. Res. (2020)
Keyphrases
- variable neighborhood search
- metaheuristic
- tabu search
- heuristic methods
- routing problem
- traveling salesman problem
- hybrid method
- single machine scheduling problem
- vehicle routing problem
- benchmark instances
- minimum spanning tree
- path relinking
- simulated annealing
- search procedure
- optimal solution
- scheduling problem
- ant colony optimization
- combinatorial optimization problems
- job shop scheduling problem
- search space
- neural network
- combinatorial problems