In this paper we present the implementation of police patrols based on an intelligent model of VRP using an algorithm of variable neighborhood search, which allows to solve vehicle routing situations, obtaining results that show optimization, problems arising from transportation, distribution and logistics; in most markets, transport means a value added to goods, for which the use of computerized methods of transportation resulting in significant savings.Most optimization problems of the real world are dynamic, that is, because the information available about the situation you want to solve is variable over time.One example is the problem of routing of dynamic order in which is required to develop a service plan for a set of clients using a fleet of vehicles, in order to include in the plan to new customers who send their orders along the route or the workday.We use MATLAB for algorithm development, data visualization, and numeric computation.With ant colony algorithm to calculate the total time of the patrols.
No takes yet. Share an insight, caveat, or question.
Loranca et al. (2017) studied this question.