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 | Theorie | Theory | Heuristik | Heuristics | Tourenplanung | Vehicle routing problem | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem |
-
The consistent electric-Vehicle routing problem with backhauls and charging management
Nolz, Pamela C., (2022)
-
Probabilistic Tabu Search for the Cross-Docking Assignment Problem
Guemri, Oualid, (2019)
-
Relaxation heuristics for the set multicover problem with generalized upper bound constraints
Umetani, Shunji, (2018)
- More ...
-
A scatter search based hyper-heuristic for sequencing a mixed-model assembly line
Cano-Belman, Jaime, (2010)
-
A decomposition approach for the piece-mold-machine manufacturing problem
Ibarra-Rojas, Omar J., (2011)
-
New models for commercial territory design
Salazar-Aguilar, María Angélica, (2011)
- More ...