The Vehicle Routing Problem (VRP) algorithm aims to find optimal routes for one or multiple vehicles visiting a set of locations and delivering a specific amount of goods demanded by these locations. Problems related to the distribution of goods, normally between warehouses and customers or stores, are generally considered vehicle routing problems. For this article's example, let’s consider a real (and awesome) brewery that needs to deliver beer kegs to different bars and restaurants throughout multiple locations.
Vehicle Routing Problem - A beer distribution example in Asheville
Hospitality | Manufacturing | Retail | Travel
The analytical platform modernization
If you are an Enterprise Miner user, do not miss the opportunity to try out Model Studio in SAS Viya. I am sure you will love it!
Optimal tour of Brisbane based on a multi-modal transportation system
A few months ago, I published an article about network optimization and how to find an optimal tour when visiting multiple places of interest by using different types of transportation, like buses, trains, tram, metro, and even walking. For a real-world case, I decided to run these optimal tours in
How to plan an optimal tour using Network Optimization in SAS Viya
A good public transportation system is crucial to develop smart cities, particularly in great metropolitan areas. Network optimization algorithms can be applied to better understand urban mobility, particularly based on a multimodal public transportation network.