A simulated annealing-based heuristic for the single allocation maximal covering hub location problem.
Mohamad Saeed JabalameliFarnaz BarzinpourAli SabouryNader Ghaffari-NasabPublished in: Int. J. Metaheuristics (2012)
Keyphrases
- simulated annealing
- tabu search
- evolutionary algorithm
- genetic algorithm
- hill climbing
- solution quality
- combinatorial optimization
- genetic algorithm ga
- metaheuristic
- simulated annealing algorithm
- resource allocation
- global optimum
- solution space
- search procedure
- neighborhood search
- optimal solution
- stochastic search
- linear programming
- search strategies
- neural network
- job shop scheduling problem