On the use of genetic algorithms to solve location problems

Computers and Operations Research

Volumn 29, Issue 6, 2002, Pages 761-779

  Jaramillo, Jorge H ^a   Bhadury, Joy ^b   Batta, Rajan ^a  

^a The State University of New York   (United States)

^b CALIFORNIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS; OPTIMIZATION;

LOCATION PROBLEMS;

OPERATIONS RESEARCH;

GENETIC ALGORITHM;

EID: 0036567990     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(01)00021-1     Document Type: Article

References (22)

1. Heuristics for the capacitated plant location model
2. The simple plant location problem: Survey and synthesis
3. Locations with spatial interaction: Competitive locations and games
4. A genetic algorithm for the set covering problem
5. Genetic algorithms applied to computationally difficult set covering problems
6. Discrete space location-allocation solutions for genetic algorithms
7. p)-medianoid and (r/p)-centroid problems
8. On optimal population size of genetic algorithms
9. Lagrangean heuristics for location problems
10. A parametric decomposition algorithm for the solution of uncapacitated location problems
11. Market capture by two competitors: The preemptive location problem