Internet Service of Vehicle Fleet Routing with Tabu Search and OSRM

This paper studies the development of an internet service to deal with a modification of the well-known Vehicle Routing Problem with Time Windows (VRPTW). Driven from an industrial application, the main focus is given on the effectiveness of simple metaheuristic approaches capable to provide high quality results in short computational times. Attention will be also given on environmental impacts and as such, the primary objective is to minimize the number of vehicles required to serve all customers and the secondary objective is to minimize the distance traveled. In an attempt to provide an efficient application for real-life problems, the target is to develop an internet service which automates the optimization procedure with python parsers. Routes are provided in a leaflet.js routing application, which utilised the Open Source Routing Machine (OSRM) routing engine, that enables schedulers to tackle VRPTW problems with real-life operational constraints.