Mostrar el registro sencillo del ítem

Solving Vehicle Routing Problems With Intermediate Stops Using VRPSolver Models

hal.structure.identifierUniversidade Federal Fluminense [Rio de Janeiro] [UFF]
dc.contributor.authorROBOREDO, Marcos
hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
hal.structure.identifierFormulations étendues et méthodes de décomposition pour des problèmes génériques d'optimisation [EDGE]
dc.contributor.authorSADYKOV, Ruslan
hal.structure.identifierUniversidade Federal Fluminense [Rio de Janeiro] [UFF]
dc.contributor.authorUCHOA, Eduardo
dc.date.accessioned2024-04-04T02:37:10Z
dc.date.available2024-04-04T02:37:10Z
dc.date.issued2022-12-07
dc.identifier.issn0028-3045
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/190783
dc.description.abstractEnIn 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.
dc.language.isoen
dc.publisherWiley
dc.title.enSolving Vehicle Routing Problems With Intermediate Stops Using VRPSolver Models
dc.typeArticle de revue
dc.identifier.doi10.1002/net.22137
dc.subject.halInformatique [cs]/Recherche opérationnelle [cs.RO]
bordeaux.journalNetworks
bordeaux.page399-416
bordeaux.volume81
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.issue3
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.peerReviewedoui
hal.identifierhal-03899372
hal.version1
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-03899372v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Networks&rft.date=2022-12-07&rft.volume=81&rft.issue=3&rft.spage=399-416&rft.epage=399-416&rft.eissn=0028-3045&rft.issn=0028-3045&rft.au=ROBOREDO,%20Marcos&SADYKOV,%20Ruslan&UCHOA,%20Eduardo&rft.genre=article


Archivos en el ítem

ArchivosTamañoFormatoVer

No hay archivos asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem