Optimization of Military Convoy Routing
Name
Meelis Tapo
Abstract
Convoy movement problem is a mathematical optimization problem which tries to find optimal routing and scheduling solution for concurrent military convoy movements. In this thesis several optimization methodologies are designed and tested to find best suited algorithm for solving practical convoy routing instances in Estonia. Encouraging results are obtained by using a mixed integer programming model together with simple heuristics, by creating an exact branch-and-bound methodology and by developing fixed-order based routing approach. Bachelor’s thesis also provides a complementary application to compare qualities of designed methods, to present calculated routes and schedules and to display convoy movement animations on the map of Estonia. Thesis illustrates that methods of mathematical optimization can be used to solve realworld instances of convoy movement problem fast and with quality results and hence improve decisionmaking in operational convoy planning practice.
Graduation Thesis language
English
Graduation Thesis type
Bachelor - Computer Science
Supervisor(s)
Bahman Ghandchi, Dirk Oliver Theis
Defence year
2017