An Iterative Fixing Variable Heuristic for Solving a Combined Blending and Distribution Planning Problem.
Bilge BilgenPublished in: Numerical Methods and Applications (2006)
Keyphrases
- variable ordering
- forward search
- finding an optimal solution
- combinatorial optimization
- optimal planning
- state space search
- planning problems
- domain independent planning
- international planning competition
- heuristic search
- search algorithm
- admissible heuristics
- search heuristics
- classical planning
- heuristic function
- branch and bound algorithm
- domain independent
- enforced hill climbing
- solving problems
- optimal solution
- problems in artificial intelligence
- simulated annealing
- mixed integer program
- constraint satisfaction
- sliding tile
- lower bound
- probability distribution
- plan quality
- stochastic local search
- heuristic search algorithms
- branch and bound
- np complete
- planning process
- state space
- timetabling problem
- solution quality
- ai planning
- production planning
- real time search algorithms
- heuristic methods
- planning domains