Centre for Operational Research and Logistics
Exact Methods, Heuristics and Metaheuristics
Expertise and Interest
Our members investigate and develop a variety of exact, heuristic, and metaheuristic methods to solve a variety of Operational Research and Logistics problems.
Classical exact resolution methods (i.e. enumerative, branch and bound, dynamic programming, linear and integer programming, etc.) allow the finding of optimal solutions, but they are often extremely time-consuming when solving real-world problems (i.e. problems with large dimensions, hardly constrained problems, multimodal and/or time-varying problems).
Heuristic and metaheuristic techniques are powerful and flexible search methodologies that have successfully tackled practical difficult problems. Heuristic and meta-heuristic algorithms seek to produce good-quality solutions in reasonable computation times and good enough for practical purposes.