A cross entropy-based metaheuristic algorithm for large-scale capacitated facility location problems

Journal of the Operational Research Society

Volumn 60, Issue 10, 2009, Pages 1439-1448

  Caserta, M ^a   Quionez Rico E ^b  

^a UNIVERSITY OF HAMBURG   (Germany)

^b UNIVERSITY OF TEXAS AT EL PASO   (United States)

Author keywords

Cross entropy; Heuristics; Integer programming; Local search; Location

Indexed keywords

INTEGER PROGRAMMING; LOCAL SEARCH (OPTIMIZATION); LOCATION; STOCHASTIC SYSTEMS;

BENCH-MARK PROBLEMS; CAPACITATED FACILITY LOCATION PROBLEMS; COMPUTATIONAL RESULTS; CROSS ENTROPY; HEURISTICS; LOCAL SEARCH; META HEURISTIC ALGORITHM; STOCHASTIC PARAMETERS;

ENTROPY;

EID: 69549121713     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2008.77     Document Type: Article

References (23)

1. Aardal K (1998). Capacitated facility location: Separation algorithms and computational experience. Math Program 81: 149-175.
2. Agarwal PK and Sharir M (1998). Efficient algorithms for geometric optimization. ACM Comput Surveys 30: 412-458.
3. Andrews M and Zhang L (1998). The access network design problem. In: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society: Piscataway, NJ, pp 40-49.
4. Barahona F and Chudak F (2005). Near-optimal solutions to large scale facility location problems. Discrete Optim 2: 35-50.
5. Barcelo J and Casanovas J (1984). A heuristic Lagrangean algorithm for the capacitated plant location problem. Eur J Opl Res 15: 212-226.
6. Barcelo J, Hallefjord A, Fernandez E and Jornsten K (1990). Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing. OR-Spektrum 12: 79-88.
7. Beasley JE (1993). Lagrangean heuristics for location problems. Eur J Opl Res 65: 383-399.
8. Caserta M and Quinonez E (2007). A cross entropy-Lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times. Comput Opns Res 36: 530-548.
9. Cornuejols G, Nemhauser GL and Wolsey LA (1990). The uncapacitated facility location problem. In: Mirchandani PB and Francis RM (eds). Discrete Location Theory. John Wiley and Sons, Inc.: New York, pp 119-171.
10. De Boer P, Kroese DP, Mannor S and Rubinstein RY (2005). A tutorial on the cross-entropy method. Ann Opns Res 134: 19-67.
11. Díaz JA (2001). Algorithmic approaches for the single source capacitated facility location problem. PhD thesis, Universitat Polytecnica de Catalunya, Barcelona, Spain.
12. Díaz JA and Fernandez E (2002). A branch-and-price algorithm for the single source capacitated plant location problem. J Opl Res Soc 53: 728-740.
13. Filho VJ and Galvao RD (1998). A tabu search heuristic for the concentrator location problem. Location Sci 6: 189-209.
14. Goldberg AV (1997). An efficient implementation of a scaling minimum-cost flow algorithm. J Algorithms 22: 1-29.
15. Guha S, Meyerson A and Munagala K (2000). Hierarchical placement and network design problems. In: Proceedings of the 41th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society: Piscataway, NJ, pp 603-612.
16. Jamin S, Jin C, Jin Y, Raz D, Shavitt Y and Zhang L (2000). On the placement of internet instrumentations. In: Proceedings of IEEE INFO-COM'00. IEEE Computer and Communication Societies: Tel Aviv, Israel.
17. Klose A and Drexl A (2005). Facility location models for distribution system design. Eur J Opl Res 162: 4-29.
18. Li B, Golin M, Italiano G and Deng X (1999). On the optimal placement of web proxies in the internet. In: Proceedings of IEEE INFOCOM'99. IEEE Computer and Communication Societies: New York, pp 1282-1290.
19. Lougee-Heimer R (2003). The common optimization interface for operations research. IBM J Res Dev 47: 57-66.
20. Qiu L, Padmanabhan VN and Voelker G (2001). On the placement of web server replicas. In: Proceedings of IEEE INFOCOM'01. IEEE Computer and Communication Societies: Piscataway, NJ, PP 1587-1596.
21. Rubinstein RY (2002). The cross-entropy method and rare events for maximal cut and partition problems. ACM Trans Modell Comput Simul 12: 27-53.
22. Rubinstein RY and Kroese DP (2004). The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte Carlo Simulation, and Machine Learning. Springer-Verlag: Berlin.
23. Sridharan R (1995). The capacitated plant location problem. Eur J Opl Res 87: 203-213.