A matheuristic for the Distance-Constrained Close-Enough Arc Routing Problem
Year of publication: |
2019
|
---|---|
Authors: | Corberán, Ángel ; Plana, Isaac ; Reula, Miguel ; Sanchis, José M. |
Published in: |
Top : transactions in operations research. - [Berlin] : Springer, ISSN 1134-5764, ZDB-ID 1205918-3. - Vol. 27.2019, 2, p. 312-326
|
Subject: | Close-Enough Arc Routing Problem | Generalized directed Rural Postman Problem | Distance constraints | Matheuristic | multi-start | Tourenplanung | Vehicle routing problem | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Ávila, Thais, (2017)
-
The min-max close-enough arc routing problem
Bianchessi, Nicola, (2022)
-
A new formulation and an effective matheuristic for the airport gate assignment problem
Karsu, Özlem, (2023)
- More ...
-
On the Distance-Constrained Close Enough Arc Routing Problem
Corberán, Ángel, (2021)
-
The min-max close-enough arc routing problem
Bianchessi, Nicola, (2022)
-
The profitable close-enough arc routing problem
Bianchessi, Nicola, (2022)
- More ...