A Lattice Boltzmann Method-like Algorithm for the Maximal Covering Location Problem on the Complex Network: Application to Location of Railway Emergency-Rescue Spot

Huizhu Wang, Jianqin Zhou () and Ling Zhou
Additional contact information
Huizhu Wang: School of Economics and Management, Beijing Jiaotong University, Beijing 100044, China
Jianqin Zhou: School of Economics and Management, Beijing Jiaotong University, Beijing 100044, China
Ling Zhou: Materials Management Department, China State Railway Group Co., Ltd., Beijing 100844, China

Mathematics, 2024, vol. 12, issue 2, 1-20

Abstract: Inspired by the core idea of the lattice Boltzmann method (LBM), which is successfully used in complex and nonlinear processes, we developed a lattice Boltzmann method-like (LBM-like) algorithm to effectively solve the maximal covering location problem with continuous- and inhomogeneous-edge demand on the complex network. The LBM-like algorithm developed has three key components, including the basic map, transfer function and effect function. The basic map is responsible for reasonably mapping complex networks with multiple branches and circles. Transfer functions are used to describe the complex covering process of the facility on the network, by splitting the entire covering process into several single-step covering processes, while the effect function is responsible for recording and processing the coverage effect of each covering process, based upon the requirement of an objective function. This LBM-like algorithm has good applicability to a complex network, intuitiveness, relatively low computational complexity, and open developability. Furthermore, the idea of the greedy algorithm was coupled with the LBM-like algorithm, to form two types of hybrid algorithms for improving the computational efficiency for the location problem, with multiple facilities, on a large-scale network. Finally, we successfully applied the LBM-like algorithm to the location problem of an emergency rescue spot on a real railway network, to underline the practicality of the proposed algorithm.

Keywords: maximal covering location problem; complex network; lattice Boltzmann method-like; edge demand; hybrid algorithms (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/2/218/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/2/218/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:2:p:218-:d:1315736

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().