A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application

Wollenweber, Jens

doi:10.1007/s00291-007-0114-3

Cited by 23 publications

(12 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Pacheco et al (2008) use VNS to solve the classical maximum covering location problem for locating health resources. Wollenweber (2008) uses several hybrids with VNS for a multi-stage facility location problem with staircase costs and splitting of commodities.…”

Section: Location Problemsmentioning

confidence: 99%

Variable neighbourhood search: methods and applications

Hansen

Mladenović

Moreno-Pérez

2008

4OR

256

View full text Add to dashboard Cite

Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building heuristics, based upon systematic changes of neighbourhoods both in descent phase, to find a local minimum, and in perturbation phase to emerge from the corresponding valley. It was first proposed in 1997 and has since then rapidly developed both in its methods and its applications. In the present paper, these two aspects are thoroughly reviewed and an extensive bibliography is provided. Moreover, one section is devoted to newcomers. It consists of steps for developing a heuristic for any particular problem. Those steps are common to the implementation of other metaheuristics.

show abstract

Section: Location Problemsmentioning

confidence: 99%

Variable neighbourhood search: methods and applications

Hansen

Mladenović

Moreno-Pérez

2008

4OR

256

View full text Add to dashboard Cite

show abstract

“…Wollenweber (2008) uses several hybrids with VNS for a multi-stage facility location problem with staircase costs and splitting of commodities.…”

Section: Location Problemsmentioning

confidence: 99%

Variable neighbourhood search: methods and applications

2009

View full text Add to dashboard Cite

show abstract

“…In this paper, we present a computational study of local search strategies for the classical uncapacitated facility location problem [2,16]. The problem is very well suited for this type of study not only for its NP-hardness [38], but also because of a wide range of its multiplicative, capacitated and dynamic variants [20,39,44]. In addition, the problem has very good scaling properties, as well as relatively less constrained search space that does not seem to change its structural properties heavily by scaling.…”

Section: Introductionmentioning

confidence: 99%

Instance Scale, Numerical Properties and Design of Metaheuristics: A Study for the Facility Location Problem

Chalupa

Nielsen

2019

IFAC-PapersOnLine

View full text Add to dashboard Cite

Metaheuristics are known to be strong in solving large-scale instances of computationally hard problems. However, their efficiency still needs exploration in the context of instance structure, scale and numerical properties for many of these problems. In this paper, we present an in-depth computational study of two local search metaheuristics for the classical uncapacitated facility location problem. We investigate four problem instance models, studied for the same problem size, for which the two metaheuristics exhibit intriguing and contrasting behaviours. The metaheuristics explored include a local search (LS) algorithm that chooses the best moves in the current neighbourhood, while a randomised local search (RLS) algorithm chooses the first move that does not lead to a worsening. The experimental results indicate that the right choice between these two algorithms depends heavily on the distribution of coefficients within the problem instance. This is also put further into context by finding optimal or near-optimal solutions using a mixed-integer linear programming problem solver. Since the facility location problem is a relatively simple example of a choice-and-assignment problem, similar phenomena are likely to be discovered in a number of other, possibly more complex computational problems in science and engineering.

show abstract

A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application

Cited by 23 publications

References 33 publications

Variable neighbourhood search: methods and applications

Variable neighbourhood search: methods and applications

Variable neighbourhood search: methods and applications

Instance Scale, Numerical Properties and Design of Metaheuristics: A Study for the Facility Location Problem

Contact Info

Product

Resources

About