Solving NP-complete Problems with Metaheuristics
An Introduction to Tabu Search, Simulated Annealing and Late Acceptance
- Track: HPC and computational science devroom
- Room: AW1.126
- Day: Saturday
- Start: 17:00
- End: 17:20
Some scientific research problems inherently suffer from an NP-complete problem. This session will explain several meta-heuristic algorithms which can handle such problems in reasonable time.
This session will also do lightning introduction of OptaPlanner, an open source Apache licensed Java library, which implements those algorithms.
Specifically, these algorithms will be explained:
- First Fit
- First Fit Decreasing
- Hill Climbing
- Tabu Search
- Simulated Annealing
- Late Acceptance
Speakers
 |
Geoffrey De Smet |