Improving the quality of heuristic solutions for the capacitated vertex p-center problem through iterated greedy local search with variable neighborhood descent
Year of publication: |
2015
|
---|---|
Authors: | Quevedo-Orozco, Dagoberto R. ; Ríos-Mercado, Roger Z. |
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. 62.2015, p. 133-144
|
Subject: | Combinatorial optimization | Discrete location | Capacitated p-center problem | Metaheuristics | Iterated greedy local search | Variable neighborhood descent | Heuristik | Heuristics | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem | Tourenplanung | Vehicle routing problem |
-
Relaxation heuristics for the set multicover problem with generalized upper bound constraints
Umetani, Shunji, (2018)
-
Juan, Angel A., (2015)
-
Probabilistic Tabu Search for the Cross-Docking Assignment Problem
Guemri, Oualid, (2019)
- More ...
-
Operations research and systems (alio/informs joint international meeting)
Ríos-Mercado, Roger Z., (2012)
-
Operations research and systems
Ríos-Mercado, Roger Z.,
-
Ríos-Mercado, Roger Z., (2020)
- More ...