An adaptive large neighborhood search approach for multiple traveling repairman problem with profits
Year of publication: |
2019
|
---|---|
Authors: | Avci, Mualla Gonca ; Avci, Mustafa |
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. 111.2019, p. 367-385
|
Subject: | Traveling repairman problem | Routing problems with profits | Time dependency | Adaptive large neighborhood search |
-
A branch-and-cut algorithm for the orienteering arc routing problem
Archetti, Claudia, (2016)
-
A matheuristic for the team orienteering arc routing problem
Archetti, Claudia, (2015)
-
Rigid wages and contracts: Time- versus state-dependent wages in the Netherlands
Grajales-Olarte, Anderson, (2019)
- More ...
-
A branch-and-cut approach for the distributed no-wait flowshop scheduling problem
Avci, Mustafa, (2022)
-
The wildfire suppression problem with multiple types of resources
Avci, Mualla Gonca, (2024)
-
Avci, Mualla Gonca, (2018)
- More ...