Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS

DOI10.1016/j.cor.2021.105622OpenAlexW3217231748MaRDI QIDQ2669792

Raca Todosijević, Mustapha Ratli, Dragan Urošević, Nenad Mladenović

Publication date: 9 March 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2021.105622

zbMATH Keywords

heuristicscombinatorial optimizationvariable neighborhood searchcapacitated dispersion problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (2)

Variable neighborhood search: the power of change and simplicity ⋮ Formulations and valid inequalities for the capacitated dispersion problem

Cites Work

• The discrete p-dispersion problem
• Variable neighbourhood search: methods and applications
• The equitable dispersion problem
• Analytical models for locating undesirable facilities
• Computational aspects of the maximum diversity problem
• Variable neighborhood search
• Variable neighborhood search: basics and variants
• Effective metaheuristic algorithms for the minimum differential dispersion problem
• Solving the maximum min-sum dispersion by alternating formulations of two different problems
• Facility dispersion problems under capacity and cost constraints
• Maximum diversity/similarity models with extension to part grouping
• An empirical comparison of heuristic methods for creating maximally diverse groups
• The Knapsack Sharing Problem
• Heuristic algorithms for the maximum diversity problem
• Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
• Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
• Heuristics for the capacitated dispersion problem

This page was built for publication: Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS