Solving Vehicle Routing Problems With Intermediate Stops Using VRPSolver Models
SADYKOV, Ruslan
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Formulations étendues et méthodes de décomposition pour des problèmes génériques d'optimisation [EDGE]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Formulations étendues et méthodes de décomposition pour des problèmes génériques d'optimisation [EDGE]
SADYKOV, Ruslan
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Formulations étendues et méthodes de décomposition pour des problèmes génériques d'optimisation [EDGE]
< Réduire
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Formulations étendues et méthodes de décomposition pour des problèmes génériques d'optimisation [EDGE]
Langue
en
Article de revue
Ce document a été publié dans
Networks. 2022-12-07, vol. 81, n° 3, p. 399-416
Wiley
Résumé en anglais
In this paper, we propose graph-based models for several vehicle routing problems with intermediate stops: the capacitated multi-trip vehicle routing problem with time windows, the multi-depot vehicle routing problem with ...Lire la suite >
In this paper, we propose graph-based models for several vehicle routing problems with intermediate stops: the capacitated multi-trip vehicle routing problem with time windows, the multi-depot vehicle routing problem with inter-depot routes, the arc routing problem with intermediate facilities under capacity and length restrictions and the green vehicle routing problem. In these models, the set of feasible routes is represented by a set of resource constrained paths in one or several graphs. Intermediate stops are supported by the possibility to define negative resource consumption for some arcs. The models that we propose are then solved by VRPSolver, which implements a generic branch-cut-and-price exact algorithm. Thus, a simple parameterization enables us to use several state-of-the-art algorithmic components: automatic stabilization by dual price smoothing, limited-memory rank-1 cuts, reduced cost-based arc elimination, enumeration of elementary routes, and hierarchical strong branching. For each problem, we numerically compare the proposed methodology with the best exact approach found in the literature. State-of-the-art computational results were obtained for all problems except one.< Réduire
Origine
Importé de halUnités de recherche