Solving the capacitated dispersion problem with variable neighborhood search approaches : from basic to skewed VNS
Year of publication: |
2022
|
---|---|
Authors: | Mladenovic, Nenad ; Todosijević, Raca ; Urošević, Dragan ; Ratli, Mustapha |
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. 139.2022, p. 1-17
|
Subject: | Heuristics | Variable neighborhood search | Capacitated Dispersion Problem | Combinatorial optimization | Heuristik | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm |
-
An effective hybrid search algorithm for the multiple traveling repairman problem with profits
Ren, Jintong, (2023)
-
A revised Variable Neighborhood Search for the Discrete Ordered Median Problem
Olender, Paweł, (2019)
-
An effective iterated two-stage heuristic algorithm for the multiple Traveling Salesmen Problem
Zheng, Jiongzhi, (2022)
- More ...
-
Solving the capacitated clustering problem with variable neighborhood search
Brimberg, Jack, (2019)
-
Solving the maximum min-sum dispersion by alternating formulations of two different problems
Amirgaliyeva, Zhazira, (2017)
-
Solving multifacility Huff location models on networks using metaheuristic and exact approaches
Grohmann, Sanja, (2017)
- More ...