Multiobjective solution of the uncapacitated plant location problem

European Journal of Operational Research

Volumn 145, Issue 3, 2003, Pages 509-529

  Fernández, Elena ^a   Puerto, Justo ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF SEVILLE   (Spain)

Author keywords

Discrete location problems; Dynamic programming; Multiobjective combinatorial optimization

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; HEURISTIC METHODS; LINEAR PROGRAMMING;

MULTIOBJECTIVE COMBINATORIAL OPTIMIZATION;

OPERATIONS RESEARCH;

EID: 0037448812     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00223-0     Document Type: Article

References (33)

1. Azevedo J.A., Martins E.Q.V. An algorithm for the multiobjective shortest path problem on acycil networks. Investigacao Operational. 11:1991;52-69.
2. Captivo, M.E., Climaco, J., Figueira, J., Martins, E., Santos, J.L., Solving multiple criteria knapsack problems using labeling algorithms. Paper presented at IO2000, Setúbal. Available from //www.mat.uc.pt/̃eqvm/cientificos/investigacao/Artigos/figueira.ps.gz.
3. Carrizosa E., Conde E., Fernández F.R., Puerto J. Efficiency in Euclidean constrained location problems. Operations Research Letters. 14:1993;291-295.
4. Cornuejols G., Nemhauser G.L., Wolsey L.A. The uncapacitated facility location problem. Mirchandani P.B., Francis R.L. Discrete Location Theory; Wiley-Interscience Series Discrete Mathematical Optimisation. 1990;55-117 Wiley, New York.
5. Delmaire H., Díaz J.A., Fernández E., Ortega M. Reactive GRASP and Tabu search based heuristics for the single source capacitated plant location problem. INFOR. 37(3):1999;194-225.
6. Ehrgott, M., Gandibleux, X., 2000. An Annotated Bibliography of Multicriteria Combinatorial Optimization. OR-Spektrum 22 (4), 425-460.
7. Erlenkotter D. A dual-based procedure for uncapacitated facility location. Operations Research. 26:1978;992-1009.
8. Gandibleux X., Jaszkiewicz A., Freville A., Slowiñski R. (Eds.), 2000. Multi-objective Metaheuristics. Journal of Heuristics. 6(3):2000;291-431. special issue.
9. Gal T. Linear parametric programming - A brief survey. Mathematical Programming Study. 21:1984;43-68.
10. Hamacher H.W., Labbé M., Nickel S. Multicriteria network location problems with sum objective. Networks. 33:1998;79-92.
11. Hamacher H.W., Nickel S. Multicriteria planar location problems. European Journal of Operational Research. 94:1996;66-86.
12. Hansen P., Perreur J., Thisse J.F. Location theory, dominance and convexity: Some further results. Operations Research. 28:1980;1241-1250.
13. Hindi K.S., Pienkosz K. Efficient solution of large scale, single source, capacitated plant location problem. Journal of the Operational Research Society. 50:1999;268-274.
14. Isermann H. The enumeration of the set of all efficient solutions of a linear multiple-objective programming. Operational Research Quarterly. 28:1977;711-725.
15. Klamroth K., Wiecek M. Dynamic programming approach to the multiple criteria knapsack problem. Naval Research Logistics. 47:2000;57-76.
16. Klein D., Hannan E. An algorithm for the multiple objective integer linear programming problem. European Journal of Operational Research. 9:1982;378-385.
17. Kouvelis P., Yu G. Robust Discrete Optimization and Applications. 1997;Kluwer Academic Publishers, Dordrecht.
18. Krarup J., Pruzan P.M. The simple plant location problem: survey and synthesis. European Journal of Operational Research. 12:1983;36-81.
19. Lee S.M., Green G.I., Kim C. A multiple criteria model for the location-allocation problem. Computers and Operations Research. 8:1981;1-8.
20. Ogryczak W. On the distribution approach to location problems. Computers and Industrial Engineering. 37:1999;595-612.
21. Pelegrín B., Fernández F.R. Determination of efficient points in multiple objective location problems. Naval Research Logistics Quarterly. 35:1988;697-905.
22. Puerto J., Fernández F.R. Multicriteria mini-sum facility location problems. Journal of the Multicriteria Decision Analysis. 8:1999;268-280.
23. Ramesh R., Zionts S., Karwan M. A class of practical interactive branch and bounds algorithms for multicriteria integer programming. European Journal of Operational Research. 26:1986;161-172.
24. Rasmussen L.M. Zero-one programming with multiple criteria. European Journal of Operational Research. 26:1986;83-95.
25. Ross G.T., Soland R.M. A multicriteria approach to location of public facilities. European Journal of Operational Research. 4:1980;307-321.
26. Solanki R. Generating the noninferior set in mixed biobjective linear programs: an application to a location problem. Computers and Operations Research. 18:1991;1-15.
27. Steuer, R., 1995. Manual for the ADBASE. Multiple Objective Linear Programming Package, University of Georgia, Athens, Georgia.
28. Ulungu E.L., Teghem J. Multi-objective combinatorial optimization problems: A survey. Journal of Multi-criteria Decision Analysis. 3:1994;83-104.
29. Villarreal B., Karwan M.H. Multicriteria Integer Programming: A (hybrid) dynamic programming recursive approach. Mathematical Programming. 21:1981;204-233.
30. Wendell R.E., Hurter A.P. Location theory, dominance and convexity. Operations Research. 21:1973;314-320.
31. Wendell R.E., Hurter A.P. Jr., Lowe T.J. Efficient points in location problems. AIIE-Trans. 9(3):1977;238-246.
32. Zionts S. A survey of multiple criteria integer programming methods. Annals of Discrete Mathematics. 5:1979;389-398.
33. Zionts S., Wallenius J. Identifying efficient vectors: some theory and computational results. Operations Research. 23:1980;785-793.