A Local Search Heuristic for Solving the Maximum Dispersion Problem.
Mahdi MoeiniDavid GoerzenOliver WendtPublished in: ACIIDS (1) (2018)
Keyphrases
- combinatorial optimization
- stochastic local search
- search algorithm
- search heuristics
- tabu search
- simulated annealing
- timetabling problem
- random sat instances
- optimal solution
- memetic algorithm
- search procedure
- finding an optimal solution
- variable neighborhood descent
- systematic search
- metaheuristic
- job shop scheduling problem
- iterated local search
- traveling salesman problem
- domain independent planning
- multi start
- hill climbing
- search strategies
- branch and bound
- tree search
- branch and bound search
- variable ordering
- neighborhood search
- satisfiability problem
- branch and bound algorithm
- admissible heuristics
- greedy search
- initial solution
- exact algorithms
- genetic algorithm
- partial solutions
- search space
- sliding tile