Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems

DOI10.1016/0305-0548(95)00063-1zbMath0847.90091OpenAlexW2022109498MaRDI QIDQ1915982

Christopher R. Houck, Michael G. Kay, Jeffrey A. Joines

Publication date: 13 October 1996

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(95)00063-1

zbMATH Keywords

genetic algorithm location-allocation heuristic multifacility location ALA method

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Continuous location (90B85) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (27)

Stability analysis and memetic computation using differential evolution for in-host HIV model ⋮ Hybrid genetic algorithm for optimization problems with permutation property ⋮ Logistic evolutionary product-unit neural networks: Innovation capacity of poor Guatemalan households ⋮ A simulation model to enable the optimization of ambulance fleet allocation and base station location for increased patient survival ⋮ Hybridizing harmony search algorithm with sequential quadratic programming for engineering optimization problems ⋮ A heuristic genetic algorithm for product portfolio planning ⋮ Optimizing the GARCH model -- an application of two global and two local search methods ⋮ Design of PID controller based on a self-adaptive state-space predictive functional control using extremal optimization method ⋮ Multiprogramming genetic algorithm for optimization problems with permutation property ⋮ A fuzzy multi-objective programming for optimization of fire station locations through genetic algorithms ⋮ An efficient heuristic algorithm for the capacitated \(p\)-median problem ⋮ A planar facility location-allocation problem with fixed and/or variable cost structures for rural electrification ⋮ A cellular heuristic for the multisource Weber problem. ⋮ A many-objective population extremal optimization algorithm with an adaptive hybrid mutation operation ⋮ \(k\)-means genetic algorithms with greedy genetic operators ⋮ Self-organizing feature maps for solving location--allocation problems with rectilinear distances. ⋮ Genetic algorithm for obstacle location-allocation problems with customer priorities ⋮ An improved configuration checking-based algorithm for the unicost set covering problem ⋮ LOCATING SUGAR CANE LOADING STATIONS UNDER VARIATIONS IN CANE SUPPLY ⋮ Methods to compare expensive stochastic optimization algorithms with random restarts ⋮ Spatial point process models for location-allocation problems ⋮ New genetic algorithms based approaches to continuous \(p\)-median problem ⋮ An intelligent genetic algorithm designed for global optimization of multi-minima functions ⋮ Allocation search methods for a generalized class of location-allocation problems ⋮ Heuristics for Location Models ⋮ Solving large-scale maximum expected covering location problems by genetic algorithms: a comparative study ⋮ An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem

Uses Software

Genocop

Cites Work

This page was built for publication: Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems