Developing effective meta-heuristics for a probabilistic location model via experimental design
From MaRDI portal
Publication:856202
Recommendations
- A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
- APPLYING METAHEURISTICS TO FEEDER BUS NETWORK DESIGN PROBLEM
- Metaheuristic applications on discrete facility location problems: a survey
- On metaheuristics for solving the parameter estimation problem in dynamic systems: a comparative study
- A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs
Cites work
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 1253041 (Why is no real title available?)
- scientific article; zbMATH DE number 1253066 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 783783 (Why is no real title available?)
- scientific article; zbMATH DE number 821272 (Why is no real title available?)
- scientific article; zbMATH DE number 1391176 (Why is no real title available?)
- A Reliability Model Applied to Emergency Service Vehicle Location
- A dynamic model and parallel tabu search heuristic for real-time ambulance relocation
- A genetic algorithm for the set covering problem
- A statistical analysis of simulated annealing applied to the \(p\)-median problem
- Ambulance location and relocation models.
- Designing and reporting on computational experiments with heuristic methods
- Fast heuristics for large scale covering-location problems
- Future paths for integer programming and links to artificial intelligence
- Lagrangean heuristics for location problems
- Metaheuristics: A bibliography
- On the use of genetic algorithms to solve location problems
- Optimization by simulated annealing
- Solving an ambulance location model by tabu search
- Solving large-scale maximum expected covering location problems by genetic algorithms: a comparative study
- Strategic facility location: A review
- The Location of Emergency Service Facilities
- The Maximum Availability Location Problem
- Towards unified formulations and extensions of two classical probabilistic location models
Cited in
(6)- A taxonomy for emergency service station location problem
- Improving the performance of metaheuristics: an approach combining response surface methodology and racing algorithms
- Covering models and optimization techniques for emergency response facility location and planning: a review
- Covering Problems
- Designing and reporting on computational experiments with heuristic methods
- A multiperiod set covering location model for dynamic redeployment of ambulances
This page was built for publication: Developing effective meta-heuristics for a probabilistic location model via experimental design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856202)
