Vehicle Route Optimization for Student Transportation in A GIS and Programming Environment: Case Study of Mawo Secondary School, Minna.

Abstract

Route optimization in Vehicle Routing Problem (VRP) is an age long field of research that has attracted interest amidst most professionals in the built environment because of its many variants and types. It often becomes confusing as to which solution approach is best suited for certain VRP at hand. This paper has presented a brief theoretical description aimed at enhancing easy discrimination of the difference between the major variants of the Capacitated VRP (CVRP) and their solution algorithms using the conventional dikjstra’s algorithm for the Chinese Postman’s Problem (CPP) and the generic algorithm for the Travelling Salesman’s Problem (TSP) in ArcView and MATLAB respectively. Analysis of the results obtained within the study area show that the CPP (with a realistic path distance of 38.772Km) is better suited for CVRP in existing road networks than the TSP (with an unrealistic path distance of 19.165Km)