On the vehicle routing problem with stochastic demands and duration constraints: formulations and a hybrid metaheuristic - Université d'Angers Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

On the vehicle routing problem with stochastic demands and duration constraints: formulations and a hybrid metaheuristic

Résumé

The vehicle routing problem with stochastic demands (VRPSD) consists in designing transportation routes of minimal expected cost to satisfy a set of customers with random demands of known probability distributions. In this research we present two strategies to deal with route duration constraints in the VRPSD. To solve the resulting problem, we proposed a greedy randomized adaptive search procedure (GRASP) with a post optimization procedure. The GRASP component uses a set of randomized route-first, cluster-second heuristics to generate starting solutions and a variable neighborhood descent (VND) procedure to carry on the local search phase. The post optimizer selects the best possible routes to assemble the final solution from the set of all routes found in the local optima reached by the GRASP. We discuss extensive computational experiments analysing the cost of considering route duration constraints on the VRPSD. In addition, we report state-of-the-art solutions for a established set of benchmarks for the classical VRPSD.
Fichier principal
Vignette du fichier
Mendoza2013b.pdf (58.89 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00874293 , version 1 (16-10-2017)

Identifiants

  • HAL Id : hal-00874293 , version 1

Citer

Jorge E. Mendoza, Louis-Martin Rousseau, Juan Villegas. On the vehicle routing problem with stochastic demands and duration constraints: formulations and a hybrid metaheuristic. 10th Metaheuristics International Conference (MIC), Aug 2013, Singapore, Singapore. pp.1 - 1. ⟨hal-00874293⟩

Collections

UNIV-ANGERS
52 Consultations
597 Téléchargements

Partager

Gmail Facebook X LinkedIn More