Improving the quality of heuristic solutions for the capacitated vertex p-center problem through iterated greedy local search with variable neighborhood descent
DOI10.1016/J.COR.2014.12.013zbMATH Open1348.90412OpenAlexW2167418772MaRDI QIDQ337640FDOQ337640
Roger Z. Ríos-Mercado, Dagoberto R. Quevedo-Orozco
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.12.013
combinatorial optimizationmetaheuristicsvariable neighborhood descentcapacitated \(p\)-center problemdiscrete locationiterated greedy local search
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A column generation approach to capacitated \(p\)-median problems
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Location analysis: a synthesis and survey
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Shifting representation search for hybrid flexible flowline problems
- An exact algorithm for the capacitated vertex \(p\)-center problem
- Lagrangean duals and exact solution to the capacitated \(p\)-center problem
- A new formulation and resolution method for the \(p\)-center problem
- Large-scale local search heuristics for the capacitated vertexp-center problem
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- A branch‐and‐price algorithm for the capacitated p‐median problem
- Iterated greedy local search methods for unrelated parallel machine scheduling
Cited In (6)
- The stratified \(p\)-center problem
- A constructive heuristic for the uniform capacitated vertex \(k\)-center problem
- The capacitated single-source p-center problem in the presence of fixed cost and multilevel capacities using VNS and aggregation technique
- Mathematical Models and Search Algorithms for the Capacitated p-Center Problem
- An iterated greedy algorithm with variable neighborhood descent for the planning of specialized diagnostic services in a segmented healthcare system
- Dynamically second-preferred \(p\)-center problem
Uses Software
This page was built for publication: Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337640)
