logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Network-based formulations and solution algorithm for paratransit districting

delete2026-05-09
delete0
PRE
AI
C
Chinonso Okorie
S
Shijie Chen
Y
Yanshuo Sun *
DOI：10.1016/j.trc.2026.105738delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
• We study the ADA paratransit districting problem using a discrete optimization approach. • Two network-based formulations are presented to divide a paratransit service region into two zones. • An efficient heuristic algorithm can yield optimal or near-optimal solutions for large-scale instances. • A real-world case study is conducted for a major metropolitan in the U.S to yield practical insights. • Model extensions to accommodate multiple zones and various demand patterns are presented.
Keywords:
paratransit districting
discrete optimization
network-based formulations
heuristic algorithm
service region partitioning

Journal

T
transportation research part c: emerging technologies
IF:
0
Papers:
196
Citations:
0

Organization

No organization information available