Efficient algorithms under dynamic graphs to solve the capacitated arc routing problem with feasible sparse graph
Year of publication: |
2019
|
---|---|
Authors: | Tfaili, Sara ; Dkhil, Hamdi ; Sbihi, Abdelkader ; Yassine, Adnan |
Published in: |
RAIRO / Operations research. - Les Ulis : EDP Sciences, ISSN 0399-0559, ZDB-ID 1481534-5. - Vol. 53.2019, 1, p. 303-322
|
Subject: | Routing problems | graph theory | sparsity | tabu search | Graphentheorie | Graph theory | Tourenplanung | Vehicle routing problem | Algorithmus | Algorithm | Heuristik | Heuristics |
-
Solving shortest path problems with a weight constraint and replenishment arcs
Smith, Olivia J., (2012)
-
Basu, Sumanta, (2013)
-
An exact algorithm for the elementary shortest path problem with resource constraints
Lozano, Leonardo, (2016)
- More ...
-
Dkhil, Hamdi, (2018)
-
The dry port location problem : a review and research agenda
Mtir, Ghada, (2021)
-
Al Samrout, Marwa, (2024)
- More ...