A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand

Journal of Heuristics

Volumn 18, Issue 2, 2012, Pages 297-315

  Rainwater, Chase ^a   Geunes, Joseph ^b   Romeijn, H Edwin ^c  

^a 3202 Bell Engineering Center   (United States)

^b University of Florida   (United States)

^c UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Assignment problem; Facility location; Neighborhood search

Indexed keywords

ASSIGNMENT PROBLEMS; ATTRACTIVE SOLUTIONS; CAPACITATED FACILITY LOCATION PROBLEMS; COMPUTATIONAL TESTS; CUSTOMER DEMANDS; FACILITY LOCATIONS; FIXED CHARGES; FIXED-CHARGE PROBLEMS; HEURISTIC SOLUTIONS; HIGH QUALITY; LARGE-SCALE PROBLEM; NEIGHBORHOOD SEARCH; OPTIMIZATION PROBLEMS; POTENTIAL BENEFITS; PROBLEM INSTANCES; SINGLE SOURCE; VERY LARGE-SCALE NEIGHBORHOOD SEARCH;

HEURISTIC ALGORITHMS; OPTIMIZATION;

HEURISTIC METHODS;

EID: 84862217556     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-011-9179-x     Document Type: Article

References (29)

1. Adlakha, V., Kowalski, K.: A simple heuristic for solving small fixed-charge transportation problems. Omega 31(3), 205-211 (2003) (Pubitemid 36649598)
2. Ahuja, R.K., Orlin, J.B., Sharma, D.: Multi-exchange neighborhood search algorithms for the capacitated minimum spanning tree problem. Math. Program. 91, 71-97 (2001) (Pubitemid 33758908)
3. Ahuja, R.K., Olrin, J.B., Punnen, A.: A survey of very large scale neighborhood search techniques. Discrete Appl. Math. 123, 75-102 (2002)
4. Ahuja, R.K., Orlin, J.B., Pallottino, S., Scaparra, M.P., Scutella, M.G.: A multi-exchange heuristic for the single-source capacitated facility location problem. Manag. Sci. 50(6), 749-760 (2004)
5. Ahuja, R.K., Huang, W., Romeijn, H.E., Morales, D.R.: A heuristic approach to the multi-period singlesourcing problem with production and inventory capacities and perishability constraints. INFORMS J. Comput. 19, 14-26 (2007)
6. Balakrishnan, A., Geunes, J.: Production planning with flexible product specifications: an application to specialty steel manufacturing. Oper. Res. 51(1), 94-112 (2003)
7. Barcelo, J., Casanovas, J.: A heuristic Lagrangian algorithm for the capacitated plant location problem. Eur. J. Oper. Res. 15(2), 212-226 (1984) (Pubitemid 15451962)
8. Beasley, J.E.: Lagrangian heuristics for location problems. Eur. J. Oper. Res. 65, 383-399 (1993)
9. Delmaire, H., Diaz, J.A., Fernandez, E., Ortega, M.: Comparing new heuristics for the capacitated plant location problem. Technical Report DR97/10, Department of Statistics and Operations Research, Universitat Politecnica de Catalunya, Barcelona, Spain (1997)
10. Demaire, H., Diaz, J.A., Fernandez, E., Ortega, M.: Reactive grasp and tabu search based heuristics for the single source capacitated plant location problem. Inf. Syst. Oper. Res. 37(3), 194-225 (1999)
11. Erlenkotter, D.: A dual-based procedure for uncapacitated facility location. Oper. Res. 26(6), 992-1009 (1978) (Pubitemid 9412214)
12. Ford, L.R., Fulkerson, D.R.: Solving the transportation problem. Manag. Sci. 3(1), 24-32 (1956)
13. Freling, R., Romeijn, H.E., Romero Morales, D., Wagelmans, A.P.M.: A branch-and-price algorithm for the multi-period single-sourcing problem. Oper. Res. 51(6), 922-939 (2003)
14. Fukasawa, R., Longo, H., Lysgaard, J., de Aragao, M.P., Reis, M., Uchoa, E.,Werneck, R.: Robust branchandcut-and-price for the capacitated vehicle routing problem. Math. Program. 106, 491-511 (2006)
15. Ghosh, D.: Neighborhood search heuristics for the uncapacitated facility location problem. Eur. J. Oper. Res. 150(1), 150-162 (2003)
16. Gray, P.: Exact solution of the fixed-charge transportation problem. Oper. Res. 19(6), 1529-1538 (1971)
17. Hindi, K.S., Pienkosz, K.: Efficient solution of large scale, single-source, capacitated plant location problems. J. Oper. Res. Soc. 50(3), 268-274 (1999)
18. Klincewicz, J.G., Luss, H.: A Lagrangian relaxation heuristic for capacitated facility location with singlesource constraints. J. Oper. Res. Soc. 37(5), 495-500 (1986) (Pubitemid 16548603)
19. Lee, J.K., Kim, Y.D.: Search heuristics for resource constrained project scheduling. J. Risk 47(5), 678-689 (1996)
20. Lin, S., Kernighan, V.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498-516 (1973)
21. Pigatti, A., Poggi de Aragao, M., Uchoa, E.: Stabilized branch-and-cut-and-price for the generalized assignment problem. Electr. Notes Discrete Math. 19, 389-395 (2005)
22. Rainwater, C., Geunes, J., Romeijn, H.E.: Capacitated facility location problem with single-source constraints and flexible demand. Technical report, Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida, June (2008)
23. Rainwater, C., Geunes, J., Romeijn, H.E.: The generalized assignment problem with flexible jobs. Discrete Appl. Math. (2008). doi:10.1016/j.dam.2008. 04.017
24. Ralphs, T.K., Kopman, L., Pulleybank, W.R., Trotter, L.E.: On the capacitated vehicle routing problem. Math. Program. 94, 343-359 (2003)
25. Reinelt, G.: TSPLIB-a traveling salesman problem library. ORSA J. Comput. 3, 376-384 (1991)
26. Savelsbergh, M.P.W.: A branch-and-price algorithm for the generalized assignment problem. Oper. Res. 45(6), 831-841 (1997)
27. Sun, M.: Solving the uncapacitated facility location problem using tabu search. Comput. Oper. Res. 33, 2563-2589 (2006) (Pubitemid 43098901)
28. Thompson, P., Orlin, J.B.: The theory of cyclic transfers. Technical Report 200-89, Operations Research Center, Massachusetts Institute of Technology, Cambridge MA (1989)
29. Thompson, P.M., Psaraftis, H.N.: Cycle transfer algorithms for multi-vehicle routing and scheduling problems. Oper. Res. 41, 935-946 (1993)