Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
From MaRDI portal
Publication:6066720
DOI10.1111/itor.12646OpenAlexW2920612161MaRDI QIDQ6066720
Nenad Mladenović, Jun Pei, A. Alkandari, Panos M. Pardalos, Raca Todosijević
Publication date: 16 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12646
Related Items
Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS, A variable neighborhood search algorithm for an integrated physician planning and scheduling problem, Fat-tailed distributions for continuous variable neighborhood search, A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem, The uncapacitated r‐allocation p‐hub center problem, A variable neighborhood search for flying sidekick traveling salesman problem, Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming, An efficient implementation of a VNS heuristic for the weighted fair sequences problem, The obnoxious competitive facility location model, Physician scheduling problem in mobile cabin hospitals of China during Covid-19 outbreak, Variable Neighborhood Programming as a Tool of Machine Learning, Parallel iterative solution-based Tabu search for the obnoxious \(p\)-median problem, Variable neighborhood programming for symbolic regression, An efficient heuristic for a hub location routing problem, Less is more approach in optimization: a road to artificial intelligence
Cites Work
- Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem
- The \(p\)-median problem: a survey of metaheuristic approaches
- A branch-and-cut method for the obnoxious \(p\)-median problem
- Variable neighbourhood search: methods and applications
- The obnoxious \(p\) facility network location problem with facility interaction
- A new adaptive multi-start technique for combinatorial global optimizations
- Variable neighborhood search
- Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems
- Variable neighborhood search: basics and variants
- Solving the capacitated clustering problem with variable neighborhood search
- First vs. best improvement: an empirical study
- Obnoxious Facility Location on Graphs
- Variable neighborhood search for the p-median
- Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
- Variable neighborhood search algorithms for the vehicle routing problem with two‐dimensional loading constraints and mixed linehauls and backhauls
- A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks
- A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands
- A parallel variable neighborhood search approach for the obnoxious p‐median problem
- Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS
