Laboratoire de Génie Informatique et d’Automatique de l’Artois

Le Problème de Tournées de Véhicules avec des Demandes Evidentielles

Mots clés :

Problème de tournées de véhicules, Demandes incertaines, Fonctions de croyance

Ce benchmark n’est décrit qu’en anglais.

This page contains data sets that were used to test the Capacitated Vehicle Routing Problem with Evidential Demands (CVRPED).
The CVRPED was solved via a metaheuristic algorithm when modelled by evidential extensions of classical stochastic programming approaches. More specifically, the CVRPED was solved when modelled by an evidential extension of chance constrained programming, as well as when modelled by an evidential extension of stochastic programming with recourse.

Two data sets can be found on this page : The CVRPED instances and the CVRPED+ instances.