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

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

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

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

90C06: Large-scale problems in mathematical programming

90B85: Continuous location

68T05: Learning and adaptive systems in artificial intelligence

Related Items

New genetic algorithms based approaches to continuous \(p\)-median problem, A heuristic genetic algorithm for product portfolio planning, Optimizing the GARCH model -- an application of two global and two local search methods, Multiprogramming genetic algorithm for optimization problems with permutation property, A fuzzy multi-objective programming for optimization of fire station locations through genetic algorithms, Spatial point process models for location-allocation problems, Allocation search methods for a generalized class of location-allocation problems, A cellular heuristic for the multisource Weber problem., Self-organizing feature maps for solving location--allocation problems with rectilinear distances., Solving large-scale maximum expected covering location problems by genetic algorithms: a comparative study, Hybrid genetic algorithm for optimization problems with permutation property, Logistic evolutionary product-unit neural networks: Innovation capacity of poor Guatemalan households, An intelligent genetic algorithm designed for global optimization of multi-minima functions, Hybridizing harmony search algorithm with sequential quadratic programming for engineering optimization problems

Uses Software

• Genocop

Cites Work

• Location-Allocation Problems
• Properties and Solution Methods for Large Location-Allocation Problems
• A computation procedure for the exact solution of location-allocation problems with rectangular distances
• The Transportation-Location Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item