On the use of genetic algorithms to solve location problems

Authors:
Jorge H. Jaramillo;Joy Bhadury;Rajan Batta
Affiliations:
Department of Industrial Engineering, National Center for Geographic, Information and Analysis, State University of New York at Buffalo, 342 Bell Hall, Buffalo, NY;Department of Management and Finance, California State University, Hayward, Hayward, CA;Department of Industrial Engineering, National Center for Geographic, Information and Analysis, State University of New York at Buffalo, 342 Bell Hall, Buffalo, NY
Venue:
Computers and Operations Research - Location analysis
Year:
2002

Citing 4
Cited 27

Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Modern heuristic techniques for combinatorial problems

Modern heuristic techniques for combinatorial problems
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms

Genetic Algorithms

A Distributed Evolutionary Simulated Annealing Algorithm for Combinatorial Optimisation Problems

Journal of Heuristics
A hybrid optimization/simulation approach for a distribution network design of 3PLS

Computers and Industrial Engineering - Special issue: Sustainability and globalization: Selected papers from the 32 nd ICC&IE
Solution approaches for facility location of medical supplies for large-scale emergencies

Computers and Industrial Engineering
Optimizing the size and locations of facilities in competitive multi-site service systems

Computers and Operations Research
A multiperiod set covering location model for dynamic redeployment of ambulances

Computers and Operations Research
A discrete particle swarm optimization algorithm for uncapacitated facility location problem

Journal of Artificial Evolution and Applications - Particle Swarms: The Second Decade
Ant Based Heuristics for the Capacitated Fixed Charge Location Problem

ANTS '08 Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence
A steady-state genetic algorithm for multi-product supply chain network design

Computers and Industrial Engineering
Solving the multiple competitive facilities location and design problem on the plane

Evolutionary Computation
Efficient heuristics for wireless network tower placement

Information Technology and Management
Location problems optimization by a self-organizing multiagent approach

Multiagent and Grid Systems - Engineering Environments in Multiagent Systems
Self-Organizing Multiagent Approach to Optimization in Positioning Problems

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
The Uncapacitated Time-Space Fixed-Charge Network Flow Problem: An Empirical Investigation of Procedures for Arc Capacity Assignment

INFORMS Journal on Computing
Adopting co-evolution and constraint-satisfaction concept on genetic algorithms to solve supply chain network design problems

Expert Systems with Applications: An International Journal
A hybrid algorithm for capacitated plant location problem

Expert Systems with Applications: An International Journal
A linear relaxation-based heuristic approach for logistics network design

Computers and Industrial Engineering
Efficient optimization of maximal covering location problems using extreme value estimation

Winter Simulation Conference
Parallel algorithms for continuous multifacility competitive location problems

Journal of Global Optimization
DisABC: A new artificial bee colony algorithm for binary optimization

Applied Soft Computing
Efficient metaheuristics to solve the intermodal terminal location problem

Computers and Operations Research
Two artificial intelligence heuristics in solving multiple allocation hub maximal covering problem

ICIC'06 Proceedings of the 2006 international conference on Intelligent Computing - Volume Part I
A continuous particle swarm optimization algorithm for uncapacitated facility location problem

ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
Locating performance monitoring mobile agents in scalable active networks

AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Location allocation modeling for healthcare facility planning in Malaysia

Computers and Industrial Engineering
Using Logic-Based Benders Decomposition to Solve the Capacity-and Distance-Constrained Plant Location Problem

INFORMS Journal on Computing
Optimal provisioning for virtual network request in cloud-based data centers

Photonic Network Communications
A novel differential evolution algorithm for binary optimization

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper seeks to evaluate the performance of genetic algorithms (GA) as an alternative procedure for generating optimal or near-optimal solutions for location problems. The specific problems considered are the uncapacitated and capacitated fixed charge problems, the maximum covering problem, and competitive location models. We compare the performance of the GA-based heuristics developed against well-known heuristics from the literature, using a test base of publicly available data sets.