An optimization algorithm for a capacitated vehicle routing problem with time windows

Abstract

In this paper, vehicle routing problem (VRP) with time windows and real world constraints are considered as a real-world application on google maps. Also, tabu search is used and Hopfield neural networks is utilized. Basic constraints consist of customer demands, time windows, vehicle speed, vehicle capacity and working hours. Recently, cost and on-time delivery are the most important factors in logistics. Thus, the logistic applications attract attention of companies. In logistic management, determining the locations of delivery points and deciding the path are the vital components that should be considered. Deciding the paths of vehicles provides companies to use their vehicles efficiently. And with utilizing optimized paths, big amounts of cost and time savings will be gained. The main aim of the work is providing the best path according to the needs of the customers, minimizing the costs with utilizing the VRP and presenting an application for companies that need logistic management. To compare the results, simulated annealing is used on special scenarios. And t-test is performed in the study for the visited path in km with p-value of 0.05.

A Decision Support Tool for Urban Freight Transport Planning Based on a Multi-Objective Evolutionary Algorithm

“…The CVRP-TW, in turn, can adopt different variants, since time windows may exit for different elements of the service, be it the time of arrival at the clients' stores, the working time of drivers, the hours of activity of depots, etc. [26]- [33]. Finally, the Time Dependent Vehicle Routing Problem (TD-CVRP), takes into account the variations of traffic density in different areas, causing fluctuations in the speed of the vehicles, independently of the distances traveled.…”

“…The meta-heuristics that have been applied in the UFT context are ant colony optimization [30], artificial bee colony [34], biogeography-based algorithms [23], the firefly algorithm [19], evolutionary algorithms [15], [17], [18], [24], [25], [31], [21], taboo search [33], [38] and simulated annealing [29], [40], among others. From the articles that address multi-objective versions of VRP with more than 20 nodes (clients), in more than 80% of them use, as said, meta-heuristics, and among them, in particular Evolutionary Multi-Objective Algorithms (MOEAs) [36].…”

Impacto de la innovación y la gestión de las organizaciones

“…El objetivo de este sistema es minimizar la distancia que ofrezcan como resultado las rutas que brinden un camino más corto. En la totalidad de los artículos descritos se concuerda con que esta es una de las variables de mayor afectación sobre el modelo, debido a que a partir de allí se plantea realizar una minimización de distancia y en consecuencia de los tiempos, según lo demostrado por Kirci (2016) en su caso aplicativo al establecer como objetivo minimizar la distancia total de entre los contenedores al depósito.…”

“…La ubicación de estos se realiza de forma heurística teniendo en cuenta el ser situados en sitios públicos que no generen inconformidades en los hogares debido a la higiene, estética, junto a la cantidad de basuras producidas en la zona. Tal como se menciona en artículos como "An optimization algorithm for a capacitated vehicle routing problema with time windows" (Kirci, 2016) y "A survey of recent advances in vehicle routing problems" (Oluyinka y Joshua, 2016).…”

Mejoramiento al sistema de recolección de residuos sólidos de Villavicencio mediante un modelo de transporte (comunas 2, 3, 6 y 8)

“…El objetivo de este sistema es minimizar la distancia que ofrezcan como resultado las rutas que brinden un camino más corto. En la totalidad de los artículos descritos se concuerda con que esta es una de las variables de mayor afectación sobre el modelo, debido a que a partir de allí se plantea realizar una minimización de distancia y en consecuencia de los tiempos, según lo demostrado por Kirci (2016) en su caso aplicativo al establecer como objetivo minimizar la distancia total de entre los contenedores al depósito.…”