A Bucket Graph Based Labelling Algorithm for Vehicle Routing
| hal.structure.identifier | Reformulations based algorithms for Combinatorial Optimization [Realopt] | |
| dc.contributor.author | SADYKOV, Ruslan | |
| hal.structure.identifier | Universidade Federal Fluminense [Rio de Janeiro] [UFF] | |
| dc.contributor.author | PESSOA, Artur | |
| hal.structure.identifier | Universidade Federal Fluminense [Rio de Janeiro] [UFF] | |
| dc.contributor.author | UCHOA, Eduardo | |
| dc.date.accessioned | 2024-04-04T02:48:59Z | |
| dc.date.available | 2024-04-04T02:48:59Z | |
| dc.date.issued | 2021 | |
| dc.identifier.issn | 0041-1655 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/191785 | |
| dc.description.abstractEn | We consider the Shortest Path Problem with Resource Constraints (SPPRC) arising as a subproblem in state-of-the-art Branch-Cut-and-Price algorithms for vehicle routing problems. We propose a variant of the bi-directional label correcting algorithm in which the labels are stored and extended according to the so-called bucket graph. Such organization of labels helps to decrease significantly the number of dominance checks and the running time of the algorithm. We also show how the forward/backward route symmetry can be exploited and how to eliminate arcs from the bucket graph using reduced costs. The proposed algorithm can be especially beneficial for vehicle routing instances with large vehicle capacity and/or with time window constraints. Computational experiments were performed on instances from the distance constrained vehicle routing problem, including multi-depot and site-dependent variants, on the vehicle routing problem with time windows, and on the "nightmare" instances of the heterogeneous fleet vehicle routing problem. Significant improvements over the best algorithms in the literature were achieved and many instances could be solved for the first time. | |
| dc.language.iso | en | |
| dc.publisher | INFORMS | |
| dc.title.en | A Bucket Graph Based Labelling Algorithm for Vehicle Routing | |
| dc.type | Article de revue | |
| dc.identifier.doi | 10.1287/trsc.2020.0985 | |
| dc.subject.hal | Informatique [cs]/Recherche opérationnelle [cs.RO] | |
| bordeaux.journal | Transportation Science | |
| bordeaux.page | 4-28 | |
| bordeaux.volume | 55 | |
| bordeaux.hal.laboratories | Institut de Mathématiques de Bordeaux (IMB) - UMR 5251 | * |
| bordeaux.issue | 1 | |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-02378624 | |
| hal.version | 1 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-02378624v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Transportation%20Science&rft.date=2021&rft.volume=55&rft.issue=1&rft.spage=4-28&rft.epage=4-28&rft.eissn=0041-1655&rft.issn=0041-1655&rft.au=SADYKOV,%20Ruslan&PESSOA,%20Artur&UCHOA,%20Eduardo&rft.genre=article |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||