A genetic algorithm based approach for the uncapacitated continuous location-allocation problem
From MaRDI portal
Recommendations
- Genetic algorithm for solving uncapacitated multiple allocation hub location problem
- A genetic algorithm for the uncapacitated single allocation planar hub location problem
- Solving the uncapacitated hub location problem using genetic algorithms
- Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems
- GENETIC ALGORITHM SOLUTION FOR MULTI-PERIOD TWO-ECHELON INTEGRATED COMPETITIVE/UNCOMPETITIVE FACILITY LOCATION PROBLEM
- An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
- SOLVING THE UNCAPACITATED MULTIPLE ALLOCATION p-HUB CENTER PROBLEM BY GENETIC ALGORITHM
- On the use of genetic algorithms to solve location problems
Cited in
(20)- An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems
- Metaheuristic applications on discrete facility location problems: a survey
- An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
- New genetic algorithms based approaches to continuous \(p\)-median problem
- Accelerating the convergence in the single-source and multi-source Weber problems
- Finding all pure strategy Nash equilibria in a planar location game
- A guided reactive GRASP for the capacitated multi-source Weber problem
- A fuzzy multi-objective programming for optimization of fire station locations through genetic algorithms
- Region-rejection based heuristics for the capacitated multi-source Weber problem
- A continuous location and maintenance routing problem for offshore wind farms: mathematical models and hybrid methods
- Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
- Solving large \(p\)-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search
- Genetic algorithm for obstacle location-allocation problems with customer priorities
- A genetic algorithm for the uncapacitated single allocation planar hub location problem
- New heuristic algorithms for solving the planar p-median problem
- A perturbation-based heuristic for the capacitated multisource Weber problem
- Using injection points in reformulation local search for solving continuous location problems
- A planar facility location-allocation problem with fixed and/or variable cost structures for rural electrification
- Simulation and optimization of ant colony optimization algorithm for the stochastic uncapacitated location-allocation problem
- An efficient heuristic algorithm for the capacitated \(p\)-median problem
This page was built for publication: A genetic algorithm based approach for the uncapacitated continuous location-allocation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1417715)
