Route of UniMAP’s shuttle bus: Optimization

Abstract

At the moment, UniMAP operates distributively across Perlis. Students need to be transfered from one location to another as a daily routine. Since the main campus is still not available, UniMAP or especially Jabatan Pembangunan is having harder time to manage the transportation of students as the number increases each year. As mentioned in the 7th strategy in UniMAP Strategic Planning 2008-2010, UniMAP is aiming to optimize cost in its operations. Since the route length will effect the cost of operation, thus this study proposed an optimal route for UniMAP’s shuttle bus service in terms of minimum route length. The problem is formulated as Traveling Salesman Problem and is solved using Branch & Bound (B&B) Solution Algorithm.