New genetic algorithms based approaches to continuous p-median problem
From MaRDI portal
(Redirected from Publication:539099)
New genetic algorithms based approaches to continuous \(p\)-median problem
New genetic algorithms based approaches to continuous \(p\)-median problem
Recommendations
- scientific article; zbMATH DE number 1803759
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
- An efficient genetic algorithm for the \(p\)-median problem
- A genetic algorithm for solving a capacitated \(p\)-median problem
- New heuristic algorithms for solving the planar p-median problem
Cites work
- A continuous location-allocation problem with zone-dependent fixed cost
- A genetic algorithm based approach for the uncapacitated continuous location-allocation problem
- An efficient genetic algorithm for the \(p\)-median problem
- Application of genetic algorithms in production and operations management: a review
- Branch and peg algorithms for the simple plant location problem
- Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems
- Component scheduling for chip shooter machines: A hybrid genetic algorithm approach.
- Extension of a hybrid genetic algorithm for nonlinear programming problems with equality and inequality constraints.
- Feature Article—Genetic Algorithms for the Operations Researcher
- Genetic algorithms for MD-optimal follow-up designs
- scientific article; zbMATH DE number 1803754 (Why is no real title available?)
- scientific article; zbMATH DE number 107465 (Why is no real title available?)
- scientific article; zbMATH DE number 1079755 (Why is no real title available?)
- scientific article; zbMATH DE number 1138446 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- Location-Allocation Problems
- On the use of genetic algorithms to solve location problems
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Solution methods for thep-median problem: An annotated bibliography
- The \(p\)-median problem: a survey of metaheuristic approaches
Cited in
(19)- An efficient genetic algorithm for the \(p\)-median problem
- Hybrid genetic algorithms with selective crossover for the capacitated p-Median problem
- 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
- GASUB: finding global optima to discrete location problems by a genetic-like algorithm
- 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
- scientific article; zbMATH DE number 1803759 (Why is no real title available?)
- scientific article; zbMATH DE number 1138446 (Why is no real title available?)
- scientific article; zbMATH DE number 2040689 (Why is no real title available?)
- scientific article; zbMATH DE number 6961910 (Why is no real title available?)
- Genetic Algorithms with the Crossover-Like Mutation Operator for the k-Means Problem
- Modified genetic algorithm with greedy heuristic for continuous and discrete p-median problems
- A genetic algorithm for solving a capacitated \(p\)-median problem
- The \(p\)-median problem in fuzzy environment: proving fuzzy vertex optimality theorem and its application
- Genetic algorithms for solving the discrete ordered median problem
- Planning a capacitated road network with flexible travel times: a genetic algorithm
This page was built for publication: New genetic algorithms based approaches to continuous \(p\)-median problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q539099)