New genetic algorithms based approaches to continuous \(p\)-median problem

DOI10.1007/s11067-008-9084-5zbMath1213.90163MaRDI QIDQ539099

M. N. Neema, A. Ohgai, K. M. Maniruzzaman

Publication date: 27 May 2011

Published in: Networks and Spatial Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11067-008-9084-5

zbMATH Keywords

genetic algorithms; \(p\)-median problem; hybrid algorithms; continuous space; alternating location-allocation heuristic

Mathematics Subject Classification ID

90B85: Continuous location

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Genetic Algorithms with the Crossover-Like Mutation Operator for the k-Means Problem, An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem, A model for locating park-and-ride facilities on urban networks based on maximizing flow capture: a case study of Isfahan, Iran, Modeling parking behavior under uncertainty: a static game theoretic versus a sequential neo-additive capacity modeling approach, The \(p\)-median problem in fuzzy environment: proving fuzzy vertex optimality theorem and its application, Planning a capacitated road network with flexible travel times: a genetic algorithm, Agent-based modelling of locating public transport facilities for conventional and electric vehicles, Targeted advertising in the public transit network using smart card data, \(k\)-means genetic algorithms with greedy genetic operators

Uses Software

• Genocop

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A continuous location-allocation problem with zone-dependent fixed cost
• The \(p\)-median problem: a survey of metaheuristic approaches
• An efficient genetic algorithm for the \(p\)-median problem
• A genetic algorithm based approach for the uncapacitated continuous location-allocation problem
• Component scheduling for chip shooter machines: A hybrid genetic algorithm approach.
• Branch and peg algorithms for the simple plant location problem
• Genetic algorithms for MD-optimal follow-up designs
• Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems
• Solution methods for thep-median problem: An annotated bibliography
• Location-Allocation Problems
• Feature Article—Genetic Algorithms for the Operations Researcher
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Application of genetic algorithms in production and operations management: a review
• Extension of a hybrid genetic algorithm for nonlinear programming problems with equality and inequality constraints.
• On the use of genetic algorithms to solve location problems