A Flexible Model and Efficient Solution Strategies for Discrete Location Problems

The probabilistic p -center problem: Planning service for potential customers

“…Thus, we can use the tools developed for discrete ordered median problems (DOMPs) (Nickel and Puerto, 2005). The formulation providing the best computational results for the DOMP is based on covering variables (Marín et al, 2009). However, the rationale behind this formulation cannot be adopted for the general K-P pCP .…”

“…In order to be able to compare the obtained solutions with the optimal value, in this case we only considered homogeneous instances, which, as mentioned above, fit the structure of the DOMP. We implemented the formulation of the DOMP from Marín et al (2009) and we run it with a time limit between 2 and 8 hours, depending on the instance size. The obtained results are given in Table 2.…”

A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem

“…Later, they were extended to the discrete setting by Nickel [2001], Boland et al [2006]. The Discrete Ordered Median Problem (DOMP) has been widely studied since the 90's and there is a number of different formulations, solution approaches and applications available in the literature 1 INTRODUCTION (Boland et al [2006], Domínguez-Marín [2003], Marín et al [2009Marín et al [ , 2010, Nickel [2001], Nickel andPuerto [1999, 2005], Perea and Puerto [2013], Puerto [2008], Puerto et al [ , 2014).…”

Ordered median hub location problems with capacity constraints

“…The SA-OMHLP distinguishes among segmented origin-destination deliveries giving different scaling factors to the origin-hub, hub-hub and hub-destination links. The cost of each origin-first hub link is scaled by a factor that depends on the position of this cost in the ordered sequence of costs from each origin to its corresponding first hub [3,32,35]. Moreover, the overall interhub cost and hub-destination cost are multiplied by other economy of scale factors.…”