2001
DOI: 10.1051/ro:2001107
|View full text |Cite
|
Sign up to set email alerts
|

Solving the simple plant location problem by genetic algorithm

Abstract: Abstract. The simple plant location problem (SPLP) is considered and a genetic algorithm is proposed to solve this problem. By using the developed algorithm it is possible to solve SPLP with more than 1000 facility sites and customers. Computational results are presented and compared to dual based algorithms.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
72
0
1

Year Published

2003
2003
2022
2022

Publication Types

Select...
6
4

Relationship

0
10

Authors

Journals

citations
Cited by 139 publications
(73 citation statements)
references
References 21 publications
0
72
0
1
Order By: Relevance
“…Sun [19] examined tabu search procedure against the Lagrangean method and heuristic procedures reported by Ghosh [2]. Genetic algorithms (GA) are also applied by Kratica and Jaramillo [20,21]. Finally, there are also artificial neural network approaches to solve UFL problems in Gen et al [22] and Vaithyanathan et al [23].…”
Section: Literature Reviewmentioning
confidence: 99%
“…Sun [19] examined tabu search procedure against the Lagrangean method and heuristic procedures reported by Ghosh [2]. Genetic algorithms (GA) are also applied by Kratica and Jaramillo [20,21]. Finally, there are also artificial neural network approaches to solve UFL problems in Gen et al [22] and Vaithyanathan et al [23].…”
Section: Literature Reviewmentioning
confidence: 99%
“…In the context of performing economic activities efficiently, various objects have been considered as facilities, such as manufacturing plants, storage facilities, warehouses, libraries, fire stations, hospitals or wireless service stations. Several techniques have been applied to the UFLP such as the swarm intelligence algorithms or a meta-heuristics algorithm; particle swarm optimization (PSO) [3], ant colony optimization (ACO) [5], artificial bee colony algorithm (ABC) [9], and genetic algorithm [7].…”
Section: Introductionmentioning
confidence: 99%
“…The CPL is a well-known combinatorial optimization problem and a number of decision problems can be obtained as special cases of CPL. There are substantial numbers of heuristic solution algorithms proposed in the literature (See Rolland et al, 1996;Holmberg & Ling, 1997;Delmaire et al, 1999;Kratica et al, 2001;He et al, 2003;Uno et al, 2005). As well, exact solution methods have been studied by many authors.…”
Section: Introductionmentioning
confidence: 99%