A vehicular waiting time heuristic for dynamic vehicle routing problem

Abstract

In the last years, the Vehicle Routing Problem (VRP) has been receiving increasing a special attention due its importance in the distribution of products. Considering demands that can appear during the service day, this work solves the Dynamic VRP (DVRP) with support of the environment simulator, capable to emulate the behavior of the vehicular fleet in a geographic 2D space. This work presents two main contributions: (i) the environment simulator that can be used to standardize DVRP test cases; and (ii) a Vehicular Waiting Time Heuristic (VWTH), that delays the attendance of demand with the meaning of reducing the total distance traveled by vehicular fleet. The proposed heuristic is tested by four optimization algorithms (Simulated Annealing, GRASP, Memetic Algorithm and Hill Climbing), and submitted to statistical tests for better conclusions. The tests showed, with 95% of confidence, that the VWTH is able to improve significantly the metaheuristics results.

Intervenção pedagógica no ensino da administração pública: impactos e perspectivas

“…Além disso, é preciso demonstrar que a própria noção de educação está transcendendo os limites tradicionais das salas de aula, estendendo-se para os ambientes digitais presentes no cotidiano dos alunos. (Oliveira;Silva, 2023, p. 184) Esses autores sublinham a relevância e pertinência das ferramentas digitais no cenário educacional contemporâneo, enfatizando que uma variedade de opções tecnológicas, como computadores e aplicativos, está disponível para enriquecer o processo de aprendizagem. Contudo, destacam a necessidade premente de integrar essas ferramentas a abordagens pedagógicas coerentes, alinhadas aos princípios e objetivos educacionais.…”

Pro-active Dynamic Vehicle Routing

“…Following the concept of waiting strategies, de Oliveira et al (2008) propose an approach for a capacitated DVRPTW considering the objective of minimizing travel distance. The authors evaluate four different metaheuristics: a Simulated Annealing algorithm, a Greedy Randomized Adaptive Search Procedure heuristic, a Memetic Algorithm, and a hill climber heuristic.…”