A Linear-Time Sweeping Algorithm for Discretization of Continuum Approximation for Network Location Problems

Continuous approximation is regarded as a scalable and insightful method in solving near-optimum solutions to various location problems. However, a continuous approximation solution is only a continuous density function and cannot be directly applied for discrete location design in engineering practices. Ouyang and Daganzo (2006) proposed an efficient disc model to discretize a continuous location solution. This paper proposes an alternative direct sweeping algorithm to discretize a continuous solution from a continuum approximation location model. This algorithm is based on the idea of spatial searching and has only a linear computational complexity. Through the numerical examples, the authors study the performance of their proposed algorithm. The results of case studies indicate that this algorithm can solve discrete facility locations more efficiently and has a robust performance compared with the existing algorithm.

• Supplemental Notes:
  • This paper was sponsored by TRB committee ADB30 Standing Committee on Transportation Network Modeling.
• Corporate Authors:

  Transportation Research Board

  ,    
• Authors:
  • Fan, Hongqiang
  • Yun, Lifen
  • Li, Xiaopeng
• Conference:
  • Transportation Research Board 98th Annual Meeting
  • Location: Washington DC, United States
  • Date: 2019-1-13 to 2019-1-17
• Date: 2019

Language

• English

Media Info

• Media Type: Digital/other
• Features: Figures; References; Tables;
• Pagination: 8p

Subject/Index Terms

• TRT Terms: Algorithms; Case studies; Continuum (Mathematics); Facilities; Location; Networks; Time
• Subject Areas: Planning and Forecasting; Terminals and Facilities; Transportation (General);

Filing Info

• Accession Number: 01698256
• Record Type: Publication
• Report/Paper Numbers: 19-03780
• Files: TRIS, TRB, ATRI
• Created Date: Mar 1 2019 3:51PM