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.013zbMath1348.90412OpenAlexW2167418772MaRDI QIDQ337640

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

zbMATH Keywords

combinatorial optimizationmetaheuristicsdiscrete locationvariable neighborhood descentcapacitated \(p\)-center problemiterated greedy local search

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items

Dynamically second-preferred \(p\)-center problem ⋮ The stratified \(p\)-center problem ⋮ Mathematical Models and Search Algorithms for the Capacitated p-Center Problem ⋮ The capacitated single-source p-center problem in the presence of fixed cost and multilevel capacities using VNS and aggregation technique ⋮ An iterated greedy algorithm with variable neighborhood descent for the planning of specialized diagnostic services in a segmented healthcare system

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
• Iterated greedy local search methods for unrelated parallel machine scheduling
• Shifting representation search for hybrid flexible flowline problems
• Lagrangean duals and exact solution to the capacitated \(p\)-center problem
• A column generation approach to capacitated \(p\)-median problems
• Location analysis: a synthesis and survey
• An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
• An exact algorithm for the capacitated vertex \(p\)-center problem
• A New Formulation and Resolution Method for the p-Center Problem
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Large-scale local search heuristics for the capacitated vertexp-center problem
• A branch‐and‐price algorithm for the capacitated p‐median problem