Variable neighborhood search for the p-median
From MaRDI portal
Publication:4228784
DOI10.1016/S0966-8349(98)00030-8zbMath0928.90043OpenAlexW1988423736MaRDI QIDQ4228784
Pierre Hansen, Nenad Mladenović
Publication date: 1 March 1999
Published in: Location Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0966-8349(98)00030-8
Related Items
Multipurpose shopping trips and location, Location Science in Canada, A variable neighbourhood search algorithm for the flexible job-shop scheduling problem, The planar multifacility collection depots location problem, Problems of discrete optimization: challenges and main approaches to solve them, A revised variable neighborhood search for the discrete ordered median problem, A modified \(p\)-median model for the emergency facilities location problem and its variable neighbourhood search-based algorithm, Dynamic vehicle routing using an improved variable neighborhood search algorithm, A variable neighborhood search heuristic for periodic routing problems, Making a state-of-the-art heuristic faster with data mining, The multi-compartment vehicle routing problem with flexible compartment sizes, A model for clustering data from heterogeneous dissimilarities, A neural model for the \(p\)-median problem, BEAMR: an exact and approximate model for the \(p\)-median problem, Analysis of decomposition algorithms with Benders cuts for \(p\)-median problem, Solving two location models with few facilities by using a hybrid heuristic: a real health resources case, Variable neighborhood search for the pharmacy duty scheduling 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, Bi-objective optimisation model for installation scheduling in offshore wind farms, Variable neighborhood search for location routing, An optimization model for combined selecting, planting and harvesting sugarcane varieties, A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation, The \(p\)-median problem: a survey of metaheuristic approaches, A genetic algorithm for the \(p\)-median problem with pos/neg weights, K-medoids inverse regression, Computational study of large-scale \(p\)-median problems, The \(p/q\)-\texttt{ACTIVE} uncapacitated facility location problem: investigation of the solution space and an LP-fitting heuristic, A variable neighborhood search for the network design problem with relays, Scalable Vertiport Hub Location Selection for Air Taxi Operations in a Metropolitan Region, A Lagrangian search method for the \(P\)-median problem, Genetic algorithms for solving the discrete ordered median problem, Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem, Variable neighbourhood structures for cycle location problems, 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, A hybrid artificial bee colony algorithm for the \(p\)-median problem with positive/negative weights, Discrete facility location in machine learning, Hybrid Metaheuristics: An Introduction, Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem, Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem, A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem, A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times, Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS, A VNS metaheuristic with stochastic steps for Max 3-cut and Max 3-section, Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs, Exact and heuristic solutions to minimize total waiting time in the blood products distribution problem, An ant colony optimisation algorithm for scheduling in agile manufacturing, Convex fuzzy \(k\)-medoids clustering, An effective VNS for the capacitated \(p\)-median problem, Categorical data fuzzy clustering: an analysis of local search heuristics, Alternative approach for learning and improving the MCDA method PROAFTN, An ant colony algorithm for the pos/neg weighted \(p\)-median problem, An exact column-generation approach for the lot-type design problem, New local searches for solving the multi-source Weber problem, Solving the wire-harness design problem at a European car manufacturer, Layout optimisation for an installation port of an offshore wind farm, A Tabu search algorithm for solving the extended maximal availability location problem, A fast swap-based local search procedure for location problems, An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems, Memetic algorithms: The polynomial local search complexity theory perspective, Determining optimal resource recycling boundary at regional level: a case study on Tokyo metropolitan area in Japan, A modified variable neighborhood search for the discrete ordered median problem, A location-routing problem in glass recycling, Variable neighbourhood search: methods and applications, Variable neighborhood search: Principles and applications, Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm, A metaheuristic to solve a location-routing problem with nonlinear costs, Reformulation descent applied to circle packing problems, The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods, A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems, Attraction probabilities in variable neighborhood search, A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application, Solving thep-Center problem with Tabu Search and Variable Neighborhood Search, J-MEANS: A new local search heuristic for minimum sum of squares clustering, Minimizing total tardiness on a single machine with controllable processing times, Affinity propagation and uncapacitated facility location problems, Allocation search methods for a generalized class of location-allocation problems, Pharmacy duty scheduling problem, VNSOptClust: A Variable Neighborhood Search Based Approach for Unsupervised Anomaly Detection, A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks, Near-optimal large-scale k-medoids clustering, Improved starting solutions for the planar p-median problem, Optimal location with equitable loads, Variable neighbourhood search: Methods and applications, The capacitated single-source p-center problem in the presence of fixed cost and multilevel capacities using VNS and aggregation technique, Exemplar-based clustering via simulated annealing, A New Variable Neighborhood Search Algorithm for the Multi Depot Heterogeneous Vehicle Routing Problem with Time Windows, The \(p\)-median problem in fuzzy environment: proving fuzzy vertex optimality theorem and its application, An iterated greedy algorithm with variable neighborhood descent for the planning of specialized diagnostic services in a segmented healthcare system, The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem, Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem, Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis, Stabilized column generation, Hybrid scatter search and path relinking for the capacitated \(p\)-median problem, Heuristics for Location Models, Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases, The maximum capture problem with random utilities: problem formulation and algorithms, A hierarchical model for the location of perinatal facilities in the municipality of Rio de Janeiro, Variable neighborhood search for minimum sum-of-squares clustering on networks, Heuristic procedures for solving the discrete ordered median problem
