Briseida Sarasola

Learn More
Keywords: Vehicle routing problem (VRP) Dynamic vehicle routing problem (DVRP) Degree of dynamism (dod) Particle swarm optimization (PSO) Variable neighborhood search (VNS) Adaptive memory Performance measures for dynamic problems a b s t r a c t Combinatorial optimization problems are usually modeled in a static fashion. In this kind of problems, all data(More)
In dynamic optimization problems, changes occur over time. These changes could be related to the optimization objective, the problem instance, or involve problem constraints. In most cases, they are seen as an ordered sequence of sub-problems or environments that must be solved during a certain time interval. The usual approaches tend to solve each(More)
  • 1