Variable neighborhood search for the p-median
From MaRDI portal
Publication:4228784
Recommendations
- The parallel variable neighborhood search for the \(p\)-median problem
- Large neighborhood search for the \(p\)-median problem
- A revised variable neighborhood search for the discrete ordered median problem
- A parallel variable neighborhood search approach for the obnoxious p‐median problem
- Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
- Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches
- Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases
- A modified variable neighborhood search for the discrete ordered median problem
- Large neighborhood local search for the \(p\)-median problem
- Variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
Cited in
(only showing first 100 items - show all)- Location Science in Canada
- A genetic algorithm for the p-median problem with pos/neg weights
- Reformulation descent applied to circle packing problems
- Genetic algorithms for solving the discrete ordered median problem
- Improved starting solutions for the planar \(p\)-median problem
- The maximum capture problem with random utilities: problem formulation and algorithms
- A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times
- Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs
- The parallel variable neighborhood search for the \(p\)-median problem
- Hybrid metaheuristics: an introduction
- Memetic algorithms: The polynomial local search complexity theory perspective
- Large neighborhood local search for the \(p\)-median problem
- Heuristics for location models
- A modified variable neighborhood search for the discrete ordered median problem
- An exact column-generation approach for the lot-type design problem
- Variable neighborhood search for minimum sum-of-squares clustering on networks
- Problems of discrete optimization: challenges and main approaches to solve them
- The planar multifacility collection depots location problem
- An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems
- Genetic local search for the \(p\)-median problem with client preferences
- A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems
- BEAMR: an exact and approximate model for the \(p\)-median problem
- Categorical data fuzzy clustering: an analysis of local search heuristics
- Solving the wire-harness design problem at a European car manufacturer
- A VNS metaheuristic with stochastic steps for Max 3-cut and Max 3-section
- A new variable neighborhood search algorithm for the multi depot heterogeneous vehicle routing problem with time windows
- A parallel variable neighborhood search for \(\alpha\)-neighbor facility location problems
- Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases
- VNSOptClust: A Variable Neighborhood Search Based Approach for Unsupervised Anomaly Detection
- A parallel variable neighborhood search approach for the obnoxious p‐median problem
- A multi-period vaccines supply chain network design with capacity expansion and different replenishment cycles under uncertain demand
- Discrete facility location in machine learning
- An optimization model for combined selecting, planting and harvesting sugarcane varieties
- A modified \(p\)-median model for the emergency facilities location problem and its variable neighbourhood search-based algorithm
- Pharmacy duty scheduling problem
- A variable neighbourhood search algorithm for the flexible job-shop scheduling problem
- Layout optimisation for an installation port of an offshore wind farm
- Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
- Heuristic methods for the optimal statistic median problem
- The \(p\)-median problem: a survey of metaheuristic approaches
- An ant colony algorithm for the pos/neg weighted \(p\)-median problem
- Allocation search methods for a generalized class of location-allocation problems
- Dynamic vehicle routing using an improved variable neighborhood search algorithm
- Variable neighbourhood search: Methods and applications
- A neural model for the \(p\)-median problem
- Attraction probabilities in variable neighborhood search
- A tabu search algorithm for solving the extended maximal availability location problem
- K-medoids inverse regression
- Variable neighborhood search: Principles and applications
- Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem
- Stabilized column generation
- Variable neighbourhood search: methods and applications
- A location-routing problem in glass recycling
- Optimal location with equitable loads
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- Exemplar-based clustering via simulated annealing
- COBRA: A new formulation of the classic \(p\)-median location problem
- Variable neighborhood search for location routing
- A revised variable neighborhood search for the discrete ordered median problem
- Making a state-of-the-art heuristic faster with data mining
- Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS
- The \(p/q\)-\texttt{ACTIVE} uncapacitated facility location problem: investigation of the solution space and an LP-fitting heuristic
- Computational study of large-scale \(p\)-median problems
- A hybrid heuristic for the \(p\)-median problem
- Determining optimal resource recycling boundary at regional level: a case study on Tokyo metropolitan area in Japan
- Exact and heuristic solutions to minimize total waiting time in the blood products distribution problem
- The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods
- Multipurpose shopping trips and location
- Scalable vertiport hub location selection for air taxi operations in a metropolitan region
- A Lagrangian search method for the \(P\)-median problem
- The multi-compartment vehicle routing problem with flexible compartment sizes
- Affinity propagation and uncapacitated facility location problems
- A variable neighborhood search for the median location problem with interconnected facilities
- Ordered \(p\)-median problems with neighbourhoods
- Bi-objective optimisation model for installation scheduling in offshore wind farms
- A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application
- Large neighborhood search for the \(p\)-median problem
- A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem
- Solving large \(p\)-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search
- Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches
- The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem
- A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation
- The gravity \(p\)-median model
- A model for clustering data from heterogeneous dissimilarities
- Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
- Heuristic procedures for solving the discrete ordered median problem
- Solving two location models with few facilities by using a hybrid heuristic: a real health resources case
- Variable neighbourhood structures for cycle location problems
- Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem
- Analysis of decomposition algorithms with Benders cuts for p-median problem
- Optimizing frequent time-window selection for association rules mining in a temporal database using a variable neighbourhood search
- New heuristic algorithms for solving the planar p-median problem
- Variable neighborhood search for the pharmacy duty scheduling problem
- A fast swap-based local search procedure for location problems
- A metaheuristic to solve a location-routing problem with nonlinear costs
- A hierarchical model for the location of perinatal facilities in the municipality of Rio de Janeiro
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
- New local searches for solving the multi-source Weber problem
- A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks
This page was built for publication: Variable neighborhood search for the p-median
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4228784)
