An efficient genetic algorithm for the \(p\)-median problem

From MaRDI portal
Publication:1413747

DOI10.1023/A:1026130003508zbMath1038.90046OpenAlexW12382059MaRDI QIDQ1413747

Osman Alp, Zvi Drezner, Erhan Erkut

Publication date: 17 November 2003

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1026130003508




Related Items (57)

The planar multifacility collection depots location problemA branch and cut algorithm for the hierarchical network design problemA bibliography for some fundamental problem categories in discrete location scienceA neural model for the \(p\)-median problemThe Methods for Approximation of Principal Points for Binary Distributions on the Basis of SubmodularityVariable neighborhood search for the pharmacy duty scheduling problemNew heuristic algorithms for solving the planar \(p\)-median problemThe Weber obnoxious facility location model: a big arc small arc approachA new heuristic for solving the \(p\)-median problem in the planeThe \(r\)-interdiction median problem with probabilistic protection and its solution algorithmThe \(p\)-median problem: a survey of metaheuristic approachesA genetic algorithm for the \(p\)-median problem with pos/neg weightsHeuristic algorithms for siting alternative-fuel stations using the flow-refueling location modelIterative Prediction-and-Optimization for E-Logistics Distribution Network DesignSolving the \(p\)-median problem on regular and lattice networksA scatter search-based heuristic to locate capacitated transshipment pointsA Lagrangian search method for the \(P\)-median problemDesign and analysis of hybrid metaheuristics for the reliability \(p\)-median problemA hybrid artificial bee colony algorithm for the \(p\)-median problem with positive/negative weightsMean-variance value at risk criterion for solving a \(p\)-median location problem on networks with type-2 intuitionistic fuzzy weightsAn improved genetic algorithm for the berth scheduling with ship-to-ship transshipment operations integrated modelImproving emergency services efficiency during Islamic pilgrimage through optimal allocation of facilitiesA capacitated biobjective location problem with uniformly distributed demands in the UAV‐supported delivery operationDecision support for the selection of optimal tower site locations for early‐warning wildfire detection systems in South AfricaLocation Science in CanadaA trajectory based heuristic for the planar \(p\)-median problemExtensions to the planar \(p\)-median problemDesigning a supply chain network under the risk of disruptions\(k\)-means genetic algorithms with greedy genetic operatorsA branch-and-cut method for the obnoxious \(p\)-median problemScheduling quay cranes and yard trucks for unloading operations in container portsThe maximin gradual cover location problemGASUB: finding global optima to discrete location problems by a genetic-like algorithmAn ant colony algorithm for the pos/neg weighted \(p\)-median problemA bilevel mixed-integer program for critical infrastructure protection planningAn effective heuristic for the \(P\)-median problem with application to ambulance locationAnt colony optimization for finding medians of weighted graphsAn exact solution approach for the interdiction median problem with fortificationNew genetic algorithms based approaches to continuous \(p\)-median problemHybrid biobjective evolutionary algorithms for the design of a hospital waste management networkMultiobjective optimization for multimode transportation problemsModel-based capacitated clustering with posterior regularizationOptimizing the location of a production firmA GIS-based optimization framework for competitive multi-facility location-routing problemDirectional approach to gradual cover: the continuous caseAffinity propagation and uncapacitated facility location problemsA multi-objective integrated facility location-hardening model: analyzing the pre- and post-disruption tradeoffSolving multiple facilities location problems with separated clustersGenetic Algorithms with the Crossover-Like Mutation Operator for the k-Means ProblemPharmacy duty scheduling problemA genetic algorithm for a single product network design model with lead time and safety stock considerationsUsing Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location ProblemOptimal location with equitable loadsExemplar-based clustering via simulated annealingAn exact approach for the r-interdiction median problem with fortificationThe \(p\)-median problem in fuzzy environment: proving fuzzy vertex optimality theorem and its applicationMetaheuristic applications on discrete facility location problems: a survey


Uses Software



This page was built for publication: An efficient genetic algorithm for the \(p\)-median problem