Discrete self-organizing migration algorithm and p-location problems

DOI10.17535/crorr.2020.0019zbMath1456.90098OpenAlexW3114558980MaRDI QIDQ5147667

Marek Kvet, Jaroslav Janáček

Publication date: 27 January 2021

Published in: Croatian Operational Research Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.17535/crorr.2020.0019

zbMATH Keywords

path-relinking methoddiscrete self-organizing migration algorithmlarge location problemsmeme usage

Mathematics Subject Classification ID

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

Related Items

Efficient incrementing heuristics for generalized \(p\)-location problems

Cites Work

• Unnamed Item
• Unnamed Item
• The gravity \(p\)-median model
• Computational study of large-scale \(p\)-median problems
• Heuristic solution of an extended double-coverage ambulance location problem for Austria
• A new compact formulation for the discrete \(p\)-dispersion problem
• Attaining flexibility in seru production system by means of Shojinka: an optimization model and solution approaches
• Lean holistic fuzzy methodology employing cross-functional worker teams for new product development projects: a real case study from high-tech industry
• Self-Organizing Migrating Algorithm
• A New Formulation and Resolution Method for the p-Center Problem
• Solving Large p-Median Problems with a Radius Formulation
• Min-max optimization and the radial approach to the public service system design with generalized utility
• Particle Swarm Optimization
• Handbook of metaheuristics