OVERVIEW
In my doctoral thesis, I extensively employed tabu search, variable neighborhood search, and variable neighborhood tabu search (VNTS) to address the waste collection vehicle routing problem with time windows. This involved developing and implementing algorithms to efficiently optimize routing solutions under various constraints and objectives. Beyond my thesis work, I am keenly interested in applying these metaheuristic approaches and optimization techniques to tackle a wide range of combinatorial problems.
PUBLICATION CHART
LIST OF PUBLICATION
RESEARCH PIE
LIST OF RESEARCH
CONSULTATION
INTELLECTUAL PROPERTIES
UNDERGRADUATE
POSTGRADUATE
SUPERVISION