A basic variable neighborhood search heuristic for the uncapacitated multiple allocation p-hub center problem.
Jack BrimbergNenad MladenovicRaca TodosijevicDragan UrosevicPublished in: Optim. Lett. (2017)
Keyphrases
- variable neighborhood search
- neighborhood search
- benchmark instances
- tabu search
- metaheuristic
- heuristic methods
- traveling salesman problem
- exact algorithms
- single machine scheduling problem
- routing problem
- minimum spanning tree
- vehicle routing problem
- search procedure
- hybrid method
- memetic algorithm
- job shop scheduling problem
- solution quality
- computational efficiency
- dynamic programming
- test problems
- column generation
- neural network
- resource allocation
- lower bound
- optimal solution