A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem
Year of publication: |
2021
|
---|---|
Authors: | Malheiros, Igor ; Ramalho, Rodrigo ; Passeti, Bruno ; Bulhões, Teobaldo ; Subramanian, Anand |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 129.2021, p. 1-13
|
Subject: | Dial-a-ride | Iterated local search | Matheuristics | Routing | Algorithmus | Algorithm | Tourenplanung | Vehicle routing problem | Heuristik | Heuristics | Theorie | Theory |
-
An iterated local search algorithm for the single-vehicle cyclic inventory routing problem
Vansteenwegen, Pieter, (2014)
-
Domínguez Rivero, Oscar L., (2016)
-
Matheuristic algorithms for the parallel drone scheduling traveling salesman problem
Dell'Amico, Mauro, (2020)
- More ...
-
Computing the worst-case due dates violations with budget uncertainty
Malheiros, Igor, (2024)
-
The static bike relocation problem with multiple vehicles and visits
Bulhões, Teobaldo, (2018)
-
On the exact solution of a large class of parallel machine scheduling problems
Bulhões, Teobaldo, (2020)
- More ...