Development, application, and comparison of hybrid meta-heuristics for urban land-use allocation optimization: Tabu search, genetic, GRASP, and simulated annealing algorithms.
Mahmoud MohammadiMahin NastaranAlireza SahebgharaniPublished in: Comput. Environ. Urban Syst. (2016)
Keyphrases
- tabu search
- metaheuristic
- simulated annealing
- optimization problems
- combinatorial optimization
- simulated annealing and tabu search
- genetic algorithm
- hybrid algorithm
- benchmark instances
- test problems
- combinatorial optimization problems
- hill climbing
- optimization method
- heuristic methods
- evolutionary algorithm
- benchmark problems
- search procedure
- vehicle routing problem
- iterated local search
- path relinking
- solution quality
- combinatorial problems
- ant colony optimization
- scatter search
- search methods
- feasible solution
- job shop scheduling problem
- memetic algorithm
- multi start
- search heuristics
- tabu search algorithm
- solution space
- particle swarm optimization
- initial solution
- traveling salesman problem
- urban land
- search space
- suboptimal solutions
- optimal solution
- max min
- knapsack problem
- test instances
- nature inspired
- particle swarm optimization pso
- branch and bound algorithm
- genetic algorithm ga
- tabu list
- objective function
- single machine scheduling problem
- variable neighborhood search
- global optimization
- scheduling problem
- computational complexity
- lower bound
- multi objective
- flowshop
- linear programming