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

DOI10.1016/J.COR.2021.105622MaRDI QIDQ2669792zbMATH OpenOpenAlexFDO

Authors Raca Todosijević, Dragan Urošević, Mustapha Ratli, 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)

Recommendations

• Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem
• A variable neighborhood search algorithm for the capacitated vehicle routing problem
• A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems
• Solving the capacitated clustering problem with variable neighborhood search
• Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach
• A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
• Skewed general variable neighborhood search for the location routing scheduling problem
• Two-phase variable neighborhood scatter search for the capacitated vehicle routing problem with stochastic demand

Cites work

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

Cited in

(7)

• General variable neighborhood search for the optimization of software quality
• VNS variants for the Max-Mean dispersion problem
• Variable neighborhood search: the power of change and simplicity
• Solving the capacitated clustering problem with variable neighborhood search
• Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach
• Formulations and valid inequalities for the capacitated dispersion problem
• A decision support system based on an artificial multiple intelligence system for vegetable crop land allocation problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669792)