Novel trip agglomeration methods for efficient extraction of urban mobility patterns

DOI10.1007/S11067-024-09641-3MaRDI QIDQ7018722zbMATH OpenFDO

Authors Praveen Kumar, Partha Chakroborty, Hemant Gehlot

Publication date 5 March 2025

Published in Networks and Spatial Economics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11067-024-09641-3

zbMATH Keywords

agglomeration methodstravel demand representationtrip based agglomerationurban mobility patterns

Mathematics Subject Classification ID

Operations research and management science (90Bxx) Mathematical programming (90Cxx) Operations research, mathematical programming (90-XX)

Cites work

• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• A Tight Analysis of the Greedy Algorithm for Set Cover
• Application of complex networks theory in urban traffic network researches
• Approximation algorithms for combinatorial problems
• Graph-theoretical analysis of the Swiss road and railway networks over time
• Network flows. Theory, algorithms, and applications.

This page was built for publication: Novel trip agglomeration methods for efficient extraction of urban mobility patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7018722)