It is my pleasure to share with you my thesis titled "Hyperheuristics in Logistics"; Ecole Centrale De Lille; 2016.
Success in using exact methods for large scale combinatorial optimization is still limited
to certain problems or to specific classes of instances of problems. The alternative way is
either using metaheuristics or matheuristics.In the context of combinatorial optimization,
we are interested in heuristics to choose heuristics invoked to solve the addressed problem.
In this thesis, we focus on hyperheuristic optimization in logistic problems. We focus on
proposing a hyperheuristic framework that carries out a search in the space of heuristic
algorithms and learns how to change the incumbent heuristic in a systematic way along
the process.We propose HHs for two optimization problems in logistics: the workover
rig scheduling problem and the hub location routing problem. Then, we compare the
performances of several HHs described in the literature for the latter problem, which
embed different heuristic selection methods such as a random selection, a choice function,
a Q-Learning approach, and an ant colony based algorithm. The computational results
prove the efficiency of HHs for the two problems in hand, and the relevance of including
Lagrangian relaxation information for the second problem.
No comments:
Post a Comment