Extensive facility location problems on networks: an updated review

Puerto, Justo; Ricca, Federica; Scozzari, Andrea

doi:10.1007/s11750-018-0476-5

Cited by 29 publications

(13 citation statements)

References 65 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Some related vehicle routing problems that address the demand allocation to the visited nodes along the route is found in the extensive facility location problem literature [8,9,10]. Recently, [11], provide an updated review afterward commented and referenced by three specialized researchers [12,13,14], who provide remarkable future research directions. This family of the network design problems is characterized as connected structures aimed at serving a set of clients.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Obreque et al: The generalized median tour problem: modeling, solving and an application (9), and (11), which we will refer as model A. The second model, is represented by constraints (1) -(9), (11), and (18) -(21), which we will refer as model B. This procedure deletes subtours by iteratively adding constraints (12) to A, and (17) to B.…”

Section: G Separation Algorithmmentioning

confidence: 99%

“…In our problem, we add this feature to normalize the magnitude for both terms of the objective an make them comparable [40]. θ is the set of feasible solutions by (2)- (11), and Y ∈ θ is a feasible solution. α ∈ [0, 1] is a weight of 22.…”

Section: B Real-world Instancementioning

confidence: 99%

See 2 more Smart Citations

The Generalized Median Tour Problem: Modeling, Solving and an Application

et al. 2020

View full text Add to dashboard Cite

We introduce, formulate, and solve the Generalized Median Tour Problem, which is motivated in the health supplies distribution for urban and rural areas. A region comprises districts that must be served by a specialized vehicle visiting its health facilities. We propose a distribution strategy to serve these health facilities efficiently. A single tour is determined that visits a set of health facilities (nodes) composed of disjoint clusters. The tour must visit at least one facility within each cluster, and the unvisited facilities are assigned to the closest facility on the tour. We minimize the sum of the total tour distance and the access distance traveled by the unvisited facilities. Efficient formulations are proposed and several solution strategies are developed to avoid subtours based on branch & cut. We solve a set of test instances and a real-world instance to show the efficiency of our solution approaches.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Section: G Separation Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

The Generalized Median Tour Problem: Modeling, Solving and an Application

et al. 2020

View full text Add to dashboard Cite

show abstract

“…At last, we emphasize that the facility location literature is largely studied in Operational Research area. State-of-the-art papers dealing with the main mathematical models and solution techniques can be found at: [19][20][21][22][23][24][25][26][27][28][29][30][31]. We also found facility location surveys focused on specific areas such as healthcare facilities [32], perishable agri-food chains [33]; and one dedicated to mapping the Brazilian context [34].…”

Section: Introductionmentioning

confidence: 99%

Strategic planning of freight transportation to support smart cities design: The Brazilian soybean case

Guimarães

Skroder

Ribeiro

et al. 2020

redin

View full text Add to dashboard Cite

Freight transportation can impact the effectiveness of smart city development if it is not well planned. Commodities with international flows such as soy can cause traffic in urban areas where ports are installed, negatively influencing economic (e.g. delays and fines), social (e.g. population quality of life) and environmental (e.g. intensification of pollutant and greenhouse gases emissions) dimensions. Thus, this paper aims to apply a location-allocation mathematical model to determine the ideal location of logistics integration centers - LICs dedicated to soybean transportation. We believe that, by properly locating structures that allow intermodality, the use of road transport would decrease by replacing it with intermodal alternatives with less environmental impact, reducing road congestion in urban centers under port influence. In addition, the total costs of the network would be optimized, promoting positive economic impacts on the soybean logistics chains. Therefore, eight scenarios were established varying the model's input parameters (such as investment and minimum volume of soybean moved through a LIC). The model was implemented in the Mosel language using the Xpress IVE solver version 1.24.24. The costs of each scenario were investigated, and the benefits related to the currently configuration (with no LIC) were pointed out. In the end, it was observed that the applied model might support government strategic planning (including, here, the design of smart cities).

show abstract

“…Here, we want to find optimal locations for new facilities such as schools, warehouses, hospitals, garbage dumps, mega airports, railway stations, ect. According to the specific applications, we often study the planar locations, locations on networks, or the facilily location problems with various types of objective functions; see Hamacher [17], Kariv and Hakimi [18,19], Drezner and Hamacher [9], Puerto et al [31], and references therein.…”

mentioning

confidence: 99%

Inverse group 1-median problem on trees

Nguyen¹,

Hieu²,

Pham³

2021

Journal of Industrial &Amp; Management Optimization

View full text Add to dashboard Cite

In location theory, group median generalizes the concepts of both median and center. We address in this paper the problem of modifying vertex weights of a tree at minimum total cost so that a prespecified vertex becomes a group 1-median with respect to the new weights. We call this problem the inverse group 1-median on trees. To solve the problem, we first reformulate the optimality criterion for a vertex being a group 1-median of the tree. Based on this result, we prove that the problem is N P-hard. Particularly, the corresponding problem with exactly two groups is however solvable in O(n 2 log n) time, where n is the number of vertices in the tree.

show abstract

Extensive facility location problems on networks: an updated review

Cited by 29 publications

References 65 publications

The Generalized Median Tour Problem: Modeling, Solving and an Application

The Generalized Median Tour Problem: Modeling, Solving and an Application

Strategic planning of freight transportation to support smart cities design: The Brazilian soybean case

Inverse group 1-median problem on trees

Contact Info

Product

Resources

About