Abstract
In this paper, we analyze flexible models for capacitated discrete location problems with setup costs. We introduce a major extension with regards to standard models which consists of distinguishing three different points of view of a location problem in a logistics system. We develop mathematical programming formulations for these models using discrete ordered objective functions with some new features. We report on the computational behavior of these formulations tested on a randomly generated battery of instances.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Berbeglia G, Cordeau J-F, Gribkovskaia I, Laporte G (2007) Static pickup and delivery problems: a classification scheme and survey. TOP 15(1):1–31
Boland N, Domínguez-Marín P, Nickel S, Puerto J (2006) Exact procedures for solving the discrete ordered median problem. Comput Oper Res 33:3270–3300
Domínguez-Marín P, Nickel S, Mladenović N, Hansen P (2005) Heuristic procedures for solving the discrete ordered median problem. Ann Oper Res 136:145–173
Drezner Z (ed) (1995) Facility location: a survey of applications and methods. Springer, New York
Drezner Z, Hamacher HW (eds) (2002) Facility location: applications and theory. Springer, Berlin
Elloumi S, Labbé M, Pochet Y (2004) A new formulation and resolution method for the p-center problem. INFORMS J Comput 16(1):84–94
Kalcsics J, Nickel S, Puerto J, Tamir A (2002) Algorithmic results for ordered median problems. Oper Res Lett 41:149–158
Kalcsics J, Nickel S, Puerto J (2003) Multifacility ordered median problems on networks: a further analysis. Networks 41:1–12
Kalcsics J, Nickel S, Puerto J, Rodríguez-Chía AM (2008, submitted) Distribution systems design with role dependent objectives. EJOR
Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems. II: The p-medians. SIAM J Appl Math 37:539–560
Marín Á. (2007) An extension to rapid transit network design problem. TOP 15(2):231–241
Marín A, Nickel S, Puerto J, Velten S (2006) A flexible model and efficient solution strategies for discrete location problems. In: OR proceedings 2005. Springer, Berlin
Marín A, Nickel S, Puerto J, Velten S (2009) A flexible model and efficient solution strategies for discrete location problems. Discrete Appl Math. 157:1128–1145. doi:10.1016/j.dam.2008.03.013
Newman AM, Yano CA, Kaminsky PM (2005) Third party logistics planning with routing and inventory costs. In: Geunes J, Pardalos P (eds) Supply chain optimization. Springer, USA, pp 87–122
Nickel S (2001) Discrete ordered Weber problems. In: Fleischmann B, Lasch R, Derigs U, Domschke W, Rieder U (eds) Operations research proceedings 2000. Springer, Berlin, pp 71–76
Nickel S, Puerto J (1999) A unified approach to network location problems. Networks 34:283–290
Nickel S, Puerto J (2005) Location theory—a unified approach. Springer, Berlin
Nickel S, Puerto J, Rodríguez-Chía AM, Weissler A (2005) Multicriteria planar ordered median problems. J Optim Theory Appl 126:657–683
Ogryczak W, Śliwiński T (2003) On solving linear programs with the ordered weighted averaging objective. Eur J Oper Res 148:80–91
Ogryczak W, Tamir A (2003) Minimizing the sum of the k largest functions in linear time. Inf Process Lett 85(3):117–122
Plastria F, Elosmani M (2008) On the convergence of Weiszfeld algorithm for continuous single facility location-allocation problem. TOP 16(2):388–406
Puerto J, Fernández FR (1995) The symmetrical single facility location problem. Technical report, Faculty of Mathematics, University of Sevilla
Puerto J, Fernández FR (2000) Geometrical properties of the symmetrical single facility location problem. J Nonlinear Convex Anal 1(3):321–342
Puerto J, Rodríguez-Chía AM (2005) On the exponential cardinality of fds for the ordered p-median problem. Oper Res Lett 33:641–651
Puerto J, Rodríguez-Chía AM, Fernández-Palacín F (1997) Ordered weber problems with attraction and repulsion. Stud Locat Anal 11:127–141
Rodríguez-Chía A, Nickel S, Puerto J, Fernández FR (2000) A flexible approach to location problems. Math Methods Oper Res 51:69–89
Stanimirovic Z, Kratica J, Dugosija D (2007) Genetic algorithms for solving the discrete ordered median problem. Eur J Oper Res 182:983–1001
Tamir A (2008) Improved algorithms for the multicut and multiflow problems in rooted trees. TOP 16(1):114–125
Zhou G, Min H, Gen M (2002) The balanced allocation of customers to multiple distribution centers in a supply chain network: a genetic algorithm approach. Comput Ind Eng 43:251–261
Author information
Authors and Affiliations
Corresponding author
Additional information
J. Kalcsics’ and S. Nickel’s research has been partially supported by the German Academic Exchange Service (DAAD) (grant number: D/03/40310).
J. Puerto’s and A.M. Rodríguez-Chía’s research has been partially supported by the Spanish Ministry of Education and Science grants number MTM2007-67433-C02-(01,02), HA2003-0121, P06-FQM-01364 and P06-FQM-01366. Fundación Séneca de la Región de Murcia 08716/PI/08.
Rights and permissions
About this article
Cite this article
Kalcsics, J., Nickel, S., Puerto, J. et al. The ordered capacitated facility location problem. TOP 18, 203–222 (2010). https://doi.org/10.1007/s11750-009-0089-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11750-009-0089-0