A quadratic time exact algorithm for continuous connected 2-facility location problem in trees

Ding, Wei; Qiu, Ke

doi:10.1007/s10878-017-0213-2

Cited by 3 publications

(3 citation statements)

References 79 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Diverse solutions for the total outer-connected domination problem have been proposed. Li, Liu, Ma, Zhang, and Zhang (2018) presented a specially devised linear-time algorithm for trees. Utilizing the tree structure, their algorithm efficiently computes the minimal total outer-connected dominating set.…”

Section: Prior Methodologies For Total Outer-connected Dominationmentioning

confidence: 99%

Some Characterizations of Total Outer-connected Domination in Graphs

C. Canada

2024

IJERM

View full text Add to dashboard Cite

This research related to total outer-connected dominance regarding graphs aids in revealing significant insights. Theoretical analysis establishes connections with tree-like structures, emphasizing the relationship with outer planarity. Effective algorithms, integrating the linear-time algorithm for trees and the genetic algorithm for general graphs, show effectiveness in locating minimal total outer-connected dominating sets. Practical implications aid in enlightening applications in wireless sensor networks, social networks, and network design, focusing on the benefits of defect tolerance and information dissemination. This research study aids in contributing towards the increased level of understanding, delivering the practical algorithms, suggesting real- world applications, and providing guidance to future research directions for total outer-connected dominance within the graph.

show abstract

Section: Prior Methodologies For Total Outer-connected Dominationmentioning

confidence: 99%

Some Characterizations of Total Outer-connected Domination in Graphs

C. Canada

2024

IJERM

View full text Add to dashboard Cite

show abstract

“…This model can be applied to reduce the distance between fire stations and fire sites, which can result in quicker alarm response times and thereby enhance the reliability of fire truck response. Furthermore, the model can be used to improve the ability of CZ city to assess and manage fire-related risks and effectively protect the lives and property of its residents [35].…”

Section: P-center Modelmentioning

confidence: 99%

A Case Study for an Assessment of Fire Station Selection in the Central Urban Area

Huang,

Shu

2023

Safety

View full text Add to dashboard Cite

With the continual acceleration of urbanization, the amount of urban infrastructure and the quality of public services are increasing in many cities. A pressing concern in this context is the growing problem of incompatible fire protection construction, indicating a need for urban fire stations with well-planned layouts. However, research on optimizing the layout and placement of fire stations by considering the various factors affecting station layouts is lacking. The current study addressed this gap by establishing an optimal fire station layout by using a geographic information system (GIS) and elucidated the trends of GIS application in firefighting and rescue operations. The study’s findings reveal the benefits of avoiding blind spots, enhancing the selection of fire station sites, and optimizing service coverage. Furthermore, this study optimized the layout of CZ city’s downtown fire stations, which could enhance CZ city’s firefighting capabilities.

show abstract

“…Although these models are different from each other in their objective and structure, they are, in fact, derived from the same four main models [7]. Many research studies have been undertaken using these models: Yu and Liu, for example, have studied min-max cover problems, while Ding and Qiu [8,9] applied an algorithm for the facility location problem with the goal of minimizing total cost. Xu and et al [10] examined the mixed center location problem, developing three heuristics to solve it.…”

Section: Introductionmentioning

confidence: 99%

The Capacitated Location-Allocation Problem Using the VAOMP (Vector Assignment Ordered Median Problem) Unified Approach in GIS (Geospatial Information Systam)

et al. 2020

View full text Add to dashboard Cite

The Vector Assignment Ordered Median Problem (VAOMP) is a new unified approach for location-allocation problems, which are one of the most important forms of applied analysis in GIS (Geospatial Information System). Solving location-allocation problems with exact methods is difficult and time-consuming, especially when the number of objectives and criteria increases. One of the most important criteria in location-allocation problems is the capacity of facilities. Firstly, this study develops a new VAOMP approach by including capacity as a criterion, resulting in a new model known as VAOCMP (Vector Assignment Ordered Capacitated Median Problem). Then secondly, the results of applying VAOMP, in scenario 1, and VAOCMP, in scenario 2, for the location-allocation of fire stations in Tehran, with the objective of minimizing the arrival time of fire engines to an incident site to no more than 5 min, are examined using both the Tabu Search and Simulated Annealing algorithms in GIS. The results of scenario 1 show that 52,840 demands were unable to be served with 10 existing stations. In scenario 2, given that each facility could not accept demand above its capacity, the number of demands without service increased to 59,080, revealing that the number of stations in the study area is insufficient. Adding 35 candidate stations and performing relocation-reallocation revealed that at least three other stations are needed for optimal service. Thirdly, and finally, the VAOMP and VAOCMP were implemented in a modest size problem. The implementation results for both algorithms showed that the Tabu Search algorithm performed more effectively.

show abstract

A quadratic time exact algorithm for continuous connected 2-facility location problem in trees

Cited by 3 publications

References 79 publications

Some Characterizations of Total Outer-connected Domination in Graphs

Some Characterizations of Total Outer-connected Domination in Graphs

A Case Study for an Assessment of Fire Station Selection in the Central Urban Area

The Capacitated Location-Allocation Problem Using the VAOMP (Vector Assignment Ordered Median Problem) Unified Approach in GIS (Geospatial Information Systam)

Contact Info

Product

Resources

About