Capacitated vehicle routing problem for PSS uses based on ubiquitous computing: An emerging markets approach

The vehicle routing problem under capacity constraints based on ubiquitous computing in a perspective of deploying PSS (Product-Service Systems) configurations for urban goods transport, is addressed. It takes into account the specificities of city logistics under an emerging markets context. In this case, it involved: i) low logistical capabilities of decision makers; ii) limited availability of data; and iii) restricted access to high performance technology to compute optimal transportation routes. Therefore, the use of free download software providing inexpensive solutions (time and resources) is proposed. The paper shows the implementation of results to a software tool based on Graph Theory used to analyze and solve a CVRP (Capacitated Vehicle Routing Problem). The case of a local food delivery company located in a large city in Mexico was used. Based on small fleet vehicles with the same technical specifications and comparable load capacity.