On the use of genetic algorithms to solve location problems
From MaRDI portal
Recommendations
- Solving large-scale maximum expected covering location problems by genetic algorithms: a comparative study
- Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems
- A simple and effective evolutionary algorithm for the capacitated location-routing problem
- A genetic algorithm for the set covering problem
- An efficient genetic algorithm for the \(p\)-median problem
Cites work
- A genetic algorithm for the set covering problem
- A Parametric Decomposition Approach for the Solution of Uncapacitated Location Problems
- Genetic algorithms applied to computationally difficult set covering problems
- Heuristics for the capacitated plant location model
- scientific article; zbMATH DE number 9247 (Why is no real title available?)
- scientific article; zbMATH DE number 44281 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 1253066 (Why is no real title available?)
- scientific article; zbMATH DE number 1488569 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 821272 (Why is no real title available?)
- Lagrangean heuristics for location problems
- The simple plant location problem: Survey and synthesis
Cited in
(51)- Allocation search methods for a generalized class of location-allocation problems
- A genetic algorithm for a single product network design model with lead time and safety stock considerations
- A robust and efficient algorithm for planar competitive location problems
- A randomized heuristics for the mapping problem: The genetic approach
- Experiences with applying a genetic algorithm to determine an information systems architecture
- A genetic algorithm based approach for the uncapacitated continuous location-allocation problem
- Bilevel programming and applications
- Efficient metaheuristics to solve the intermodal terminal location problem
- Solving large-scale maximum expected covering location problems by genetic algorithms: a comparative study
- Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems
- Covering models and optimization techniques for emergency response facility location and planning: a review
- Designing a supply chain network under the risk of disruptions
- Genetic algorithm for obstacle location-allocation problems with customer priorities
- A novel differential evolution algorithm for binary optimization
- Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example
- Optimizing the size and locations of facilities in competitive multi-site service systems
- Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences
- A multiperiod set covering location model for dynamic redeployment of ambulances
- GASUB: finding global optima to discrete location problems by a genetic-like algorithm
- Capacitated plant selection in a decentralized manufacturing environment: a bilevel optimization approach
- Metaheuristic applications on discrete facility location problems: a survey
- A model for locating park-and-ride facilities on urban networks based on maximizing flow capture: a case study of Isfahan, Iran
- Heuristic algorithms for siting alternative-fuel stations using the flow-refueling location model
- Solving the simple plant location problem by genetic algorithm
- Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem
- A multi-objective genetic algorithm for a bi-objective facility location problem with partial coverage
- Robust facility location problem for hazardous waste transportation
- scientific article; zbMATH DE number 6006811 (Why is no real title available?)
- A genetic algorithm for the linear transportation problem
- \((r|p)\)-centroid problems on networks with vertex and edge demand
- Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing
- GENETIC ALGORITHM SOLUTION FOR MULTI-PERIOD TWO-ECHELON INTEGRATED COMPETITIVE/UNCOMPETITIVE FACILITY LOCATION PROBLEM
- Feature Article—Genetic Algorithms for the Operations Researcher
- scientific article; zbMATH DE number 1954153 (Why is no real title available?)
- Locating sugar cane loading stations under variations in cane supply
- scientific article; zbMATH DE number 1870070 (Why is no real title available?)
- Using traditional heuristic algorithms on an initial genetic algorithm population applied to the transmission expansion planning problem
- ON THE BEHAVIOR OF PARALLEL GENETIC ALGORITHMS FOR OPTIMAL PLACEMENT OF ANTENNAE IN TELECOMMUNICATIONS
- New genetic algorithms based approaches to continuous \(p\)-median problem
- A HYBRID GENETIC ALGORITHM FOR THE EARLY/TARDY SCHEDULING PROBLEM
- Wartime logistics model for multi‐support unit location–allocation problem with frontline changes
- Improving emergency services efficiency during Islamic pilgrimage through optimal allocation of facilities
- Discrete cooperative coverage location models with alternative facility types in a probabilistic setting
- A comparison between optimization tools to solve sectorization problem
- Population-based algorithm for discrete facility location with ranking of candidate locations
- A simple and effective exact method for the medianoid problem with multipurpose trips
- Heuristic procedures for solving the discrete ordered median problem
- A genetic algorithm-based heuristic for the dynamic integrated forward/reverse logistics network for 3PLs
- Developing effective meta-heuristics for a probabilistic location model via experimental design
- A memetic algorithm for multi-objective dynamic location problems
- A GIS-based optimization framework for competitive multi-facility location-routing problem
This page was built for publication: On the use of genetic algorithms to solve location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5959394)
