Budget constrained location problem with opening and closing of facilities

Capacity management in public service facility networks: a model, computational tests and a case study

“…Within this class, the first contribution can be retrieved in Leorch et al (1996) approach that developed an application of the problem to the military context, dealing with the closure of some sites after the drawdown of an army from a region. Wang et al (2003) introduced a model addressing the situation in which, due to some occurring changes in the distribution of the demand, relocation of the existing facilities in the location space was required in order to improve the service level, explicitly taking into account user perspective. In this case, the problem was modeled by considering, simultaneously, the possibility of opening new facilities and closing existing ones (however, not including the possibility of altering the capacity of single facilities).…”

“…Leorch et al (1996); Wang et al (2003); ReVelle et al (2007) Multi-Period Models Van Roy and Erlenkotter (1982), Min (1988);Shulman (1991), Chardaire et al (1996); Canel and Khumawala (1997); Melo et al (2006); Dias et al (2007), Wilhelm et al (2013).…”

“…This may mean that these models could not be suitable to represent situations in which closing or downsizing facilities constitute strategic actions having a long-range effect. Moreover, most of the models reproduce situations in which the reorganization problem arises because of a change in the distribution of the demand that has made obsolete and inefficient the current configuration (Wang et al, 2003), with the only notable difference represented by the cited work of ReVelle et al (2007), in which the reorganization is needed due to economic conditions that make the current system economically unaffordable, even if currently the best-one from the user perspective. The process by means of which every user selects his preferred facility represents another crucial aspect to be taken into account in rationalization actions.…”

Bi-objective vibration damping optimization for congested location–pricing problem

“…Wang et al [46] presented a congested FLP to minimize aggregate traveling and waiting times. Wang et al [47] presented several heuristic algorithms to solve location problems with budget limitations.…”

“…Additionally, since exact or hard computing approaches cannot solve NP-hard problems [47,38,39], soft computing approaches are applied. Unlike hard computing techniques, soft computing approaches deal with imprecision, uncertainty, and approximation to determine robustness and lowcost solutions.…”