A multi-objective genetic algorithm for a bi-objective facility location problem with partial coverage
From MaRDI portal
(Redirected from Publication:286207)
Recommendations
- A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover
- A new multi-objective model for a capacitated hub covering problem solving by two multi-objective evolutionary algorithms
- Multi-objective emergency facility location problem based on genetic algorithm
- A maximal covering location model in the presence of partial coverage
- Approximating the Pareto-front of a planar bi-objective competitive facility location and design problem
Cites work
- scientific article; zbMATH DE number 1253041 (Why is no real title available?)
- scientific article; zbMATH DE number 867338 (Why is no real title available?)
- A crossover operator that uses Pareto optimality in its definition
- A fuzzy multi-objective covering-based vehicle location model for emergency services
- A fuzzy multi-objective programming for optimization of fire station locations through genetic algorithms
- A maximal covering location model in the presence of partial coverage
- A multi-objective model for locating fire stations
- A single-point mutation evolutionary programming
- Covering models and optimization techniques for emergency response facility location and planning: a review
- Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem
- Evolutionary Algorithms for Solving Multi-Objective Problems
- Generalized coverage: new developments in covering location models
- Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network
- Multi-criteria location planning for public facilities in tsunami-prone coastal areas
- Multi-objective optimization using evolutionary algorithms
- Multiple criteria facility location problems: a survey
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- On the use of genetic algorithms to solve location problems
- Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example
- Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing
- Solving the maximal covering location problem with heuristic concentration
- The Maximum Coverage Location Problem
- The \(p\)-median problem: a survey of metaheuristic approaches
- The gradual covering decay location problem on a network.
Cited in
(5)- k-balanced center location problem: a new multi-objective facility location problem
- Solving the semi-desirable facility location problem using bi-objective particle swarm
- A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover
- Joint production and preventive maintenance scheduling for a single degraded machine by considering machine failures
- A reference point-based evolutionary algorithm for approximating regions of interest in multiobjective problems
This page was built for publication: A multi-objective genetic algorithm for a bi-objective facility location problem with partial coverage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q286207)
