A hybrid metaheuristic to solve the vehicle routing problem with stochastic demand and probabilistic duration constraints

Jorge E. Mendoza (1) , Louis-Martin Rousseau (2) , Juan G. Villegas (3)

1 LISA - Laboratoire d'Ingéniérie des Systèmes Automatisés
2 CIRRELT - Centre Interuniversitaire de Recherche sur les Réseaux d'Entreprise, la Logistique et le Transport
3 Departamento de Ingenier a Industrial

The vehicle routing problem with stochastic demands and probabilistic distance constraints (VRPSD-PDC) can be defined on a complete and undirected graph G = (V, E), where V = {0, . . . , n} is the vertex set and E = {(v, u) : v, u ∈ V, v ̸= u} is the edge set. Vertices v = 1, . . . , n represent the customers and vertex v = 0 represents the depot. A distance de is associated with edge e = (v, u) = (u, v) ∈ E, and it represents the travel cost between vertices v and u.

Domaines: Sciences de l'ingénieur [physics]

Jorge E. Mendoza, Louis-Martin Rousseau, Juan G. Villegas. A hybrid metaheuristic to solve the vehicle routing problem with stochastic demand and probabilistic duration constraints. TRISTAN VIII, Jun 2013, San Pedro de Atacama, Chile. ⟨hal-00845978⟩