DOI: 10.1007/978-3-540-87527-7_22
|View full text |Cite
|
Sign up to set email alerts
|

Ant Based Heuristics for the Capacitated Fixed Charge Location Problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 18 publications
0
2
0
Order By: Relevance
“…As indicated before, we consider in this work the capacitated plant and warehouse location and capacity acquisition problem. The aim in this problem is to decide concurrently on the optimal location and capacity size of each new plant and each new warehouse to be established [29][30][31].…”
Section: Defining the Logistic Networkmentioning
confidence: 99%
“…As indicated before, we consider in this work the capacitated plant and warehouse location and capacity acquisition problem. The aim in this problem is to decide concurrently on the optimal location and capacity size of each new plant and each new warehouse to be established [29][30][31].…”
Section: Defining the Logistic Networkmentioning
confidence: 99%
“…The aim of the CFL & CAP is to decide simultaneously on the optimal location and capacity size of each new facility to be established [8][9][10][11][12][13]. In this problem, we are given a set of customer locations with known demands and a set of potential facility locations.…”
Section: Introductionmentioning
confidence: 99%