Computational Modelling Group

Walton P. Coutinho

Postgraduate Research Student
Mathematics (FSHS)
Complete this online contact form to contact Walton.

My main research interests are in nonlinear and combinatorial optimisation. I am currently working on the development of algorithms for vehicle routing problems under motion constraints with applications to UAVs (i.e., drones, gliders). Problems like this are very challenging because they usually combine routing and trajectory optimisation, which are very challenging problems on their own. My current research is concerned about the Glider Routing and Trajectory Optimisation Problem (GRTOP) with applications to disaster assessment and response. In my previous research, I worked on the development of path planning algorithms for rotary wing drones and on the development of exact algorithms for the Close-enough Travelling Salesman Problem.


This is an optimal solution for Close-Enough Traveling Salesman Problem (CETSP) over an instance with 1000 vertices. In the CETSP, rather than visiting the vertex (customer) itself, the salesman must visit a specific region containing such vertex. To solve this problem, we proposed a simple yet effective exact algorithm, based on Branch-and-Bound and Second-Order Cone Programming (SOCP).

This is another CETSP solution for an instance with 100 vertices in a two-dimensional space.