Descripteur
Documents disponibles dans cette catégorie (14)
Ajouter le résultat dans votre panier Affiner la recherche Interroger des sources externes
Etendre la recherche sur niveau(x) vers le bas
Multi-agent reinforcement learning to unify order-matching and vehicle-repositioning in ride-hailing services / Mingyue Xu in International journal of geographical information science IJGIS, vol 37 n° 2 (February 2023)
[article]
Titre : Multi-agent reinforcement learning to unify order-matching and vehicle-repositioning in ride-hailing services Type de document : Article/Communication Auteurs : Mingyue Xu, Auteur ; Peng Yue, Auteur ; Fan Yu, Auteur ; et al., Auteur Année de publication : 2023 Article en page(s) : pp 380 - 402 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] appariement de données localisées
[Termes IGN] apprentissage profond
[Termes IGN] autopartage
[Termes IGN] Chine
[Termes IGN] distribution spatiale
[Termes IGN] interaction humain-espace
[Termes IGN] modèle de Markov
[Termes IGN] système d'information urbain
[Termes IGN] système multi-agents
[Termes IGN] taxi
[Termes IGN] transmission de données
[Termes IGN] zone d'activité économiqueRésumé : (auteur) The popularity of ride-hailing platforms has significantly improved travel efficiency by providing convenient and personalized transportation services. Designing an effective ride-hailing service generally needs to address two tasks: order matching that assigns orders to available vehicles and proactive vehicle repositioning that deploys idle vehicles to potentially high-demand regions. Recent studies have intensively utilized deep reinforcement learning to solve the two tasks by learning an optimal dispatching strategy. However, most of them generate actions for the two tasks independently, neglecting the interactions between the two tasks and the communications among multiple drivers. To this end, this paper provides an approach based on multi-agent deep reinforcement learning where the two tasks are modeled as a unified Markov decision process, and the colossal state space and competition among drivers are addressed. Additionally, a modifiable agent-specific state representation is proposed to facilitate knowledge transferring and improve computing efficiency. We evaluate our approach on a public taxi order dataset collected in Chengdu, China, where a variable number of simulated vehicles are tested. Experimental results show that our approach outperforms seven existing baselines, reducing passenger rejection rate, driver idle time and improving total driver income. Numéro de notice : A2023-058 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2022.2119477 Date de publication en ligne : 07/09/2022 En ligne : https://doi.org/10.1080/13658816.2022.2119477 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=102396
in International journal of geographical information science IJGIS > vol 37 n° 2 (February 2023) . - pp 380 - 402[article]Recurrent origin–destination network for exploration of human periodic collective dynamics / Xiaojian Chen in Transactions in GIS, vol 26 n° 1 (February 2022)
[article]
Titre : Recurrent origin–destination network for exploration of human periodic collective dynamics Type de document : Article/Communication Auteurs : Xiaojian Chen, Auteur ; Jiayi Xie, Auteur ; Changjiang Xiao, Auteur ; et al., Auteur Année de publication : 2022 Article en page(s) : pp 317 - 340 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] données localisées dynamiques
[Termes IGN] flux
[Termes IGN] origine - destination
[Termes IGN] planification urbaine
[Termes IGN] réseau neuronal récurrent
[Termes IGN] série temporelle
[Termes IGN] taxi
[Termes IGN] Wuhan (Chine)Résumé : (auteur) While daily periodic movements of individuals have been widely studied, their collective dynamics are not understood. To capture periodic collective dynamics, this article represents individual daily movements as a time series of directed weighted origin–destination (OD) networks, and proposes an approach to identify a sub-network called the “recurrent OD network”, which contains frequent edges appearing in each day. Taxi trajectory data over a period of 6 months in Wuhan, China are used for the case study. Here, we extracted the recurrent OD networks for each 2-h period on a given day, and compared them with the corresponding “major OD network” defined by both frequent and infrequent edges. Results show that the recurrent OD networks coincidentally exhibit spatially localized community structures and distinctive patterns of inflow and outflow for each region within a day. Overall, both methodology and findings in this study might make significant contributions in a range of fields, such as urban planning, regional economic development, and infectious disease control. Numéro de notice : A2022-179 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/tgis.12849 Date de publication en ligne : 05/10/2021 En ligne : https://doi.org/10.1111/tgis.12849 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=99838
in Transactions in GIS > vol 26 n° 1 (February 2022) . - pp 317 - 340[article]SNN_flow: a shared nearest-neighbor-based clustering method for inhomogeneous origin-destination flows / Qiliang Liu in International journal of geographical information science IJGIS, vol 36 n° 2 (February 2022)
[article]
Titre : SNN_flow: a shared nearest-neighbor-based clustering method for inhomogeneous origin-destination flows Type de document : Article/Communication Auteurs : Qiliang Liu, Auteur ; Jie Yang, Auteur ; Min Deng, Auteur ; et al., Auteur Année de publication : 2022 Article en page(s) : pp 253 - 279 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] analyse de groupement
[Termes IGN] classification ascendante hiérarchique
[Termes IGN] classification barycentrique
[Termes IGN] flux
[Termes IGN] méthode de Monte-Carlo
[Termes IGN] mobilité urbaine
[Termes IGN] noeud
[Termes IGN] origine - destination
[Termes IGN] Pékin (Chine)
[Termes IGN] réseau routier
[Termes IGN] taxi
[Termes IGN] trajet (mobilité)Résumé : (auteur) Identifying clusters from individual origin–destination (OD) flows is vital for investigating spatial interactions and flow mapping. However, detecting arbitrarily-shaped and non-uniform flow clusters from network-constrained OD flows continues to be a challenge. This study proposes a shared nearest-neighbor-based clustering method (SNN_flow) for inhomogeneous OD flows constrained by a road network. To reveal clusters of varying shapes and densities, a normalized density for each OD flow is defined based on the concept of shared nearest-neighbor, and flow clusters are constructed using the density-connectivity mechanism. To handle large amounts of disaggregated OD flows, an efficient method for searching the network-constrained k-nearest flows is developed based on a local road node distance matrix. The parameters of SNN_flow are statistically determined: the density threshold is modeled as a significance level of a significance test, and the number of nearest neighbors is estimated based on the variance of the kth nearest distance. SNN_flow is compared with three state-of-the-art methods using taxicab trip data in Beijing. The results show that SNN_flow outperforms existing methods in identifying flow clusters with irregular shapes and inhomogeneous distributions. The clusters identified by SNN_flow can reveal human mobility patterns in Beijing. Numéro de notice : A2022-163 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2021.1899184 Date de publication en ligne : 16/03/2021 En ligne : https://doi.org/10.1080/13658816.2021.1899184 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=99786
in International journal of geographical information science IJGIS > vol 36 n° 2 (February 2022) . - pp 253 - 279[article]Machine learning for the distributed and dynamic management of a fleet of taxis and autonomous shuttles / Tatiana Babicheva (2021)
Titre : Machine learning for the distributed and dynamic management of a fleet of taxis and autonomous shuttles Titre original : Machine Learning pour la gestion distribuée et dynamique d’une flotte de taxis et navettes autonomes Type de document : Thèse/HDR Auteurs : Tatiana Babicheva, Auteur ; Leïla Kloul, Directeur de thèse ; Dominique Barth, Directeur de thèse Editeur : Bures-sur-Yvette : Université Paris-Saclay Année de publication : 2021 Importance : 190 p. Format : 21 x 30 cm Note générale : bibliographie
Thèse de Doctorat de l'Université Paris-Saclay, InformatiqueLangues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique
[Termes IGN] apprentissage par renforcement
[Termes IGN] autopartage
[Termes IGN] calcul d'itinéraire
[Termes IGN] méthode heuristique
[Termes IGN] navigation autonome
[Termes IGN] OpenStreetMap
[Termes IGN] optimisation (mathématiques)
[Termes IGN] réseau neuronal artificiel
[Termes IGN] réseau routier
[Termes IGN] taxi
[Termes IGN] trafic routier
[Termes IGN] trafic urbain
[Termes IGN] véhicule électrique
[Termes IGN] ville intelligenteIndex. décimale : THESE Thèses et HDR Résumé : (auteur) In this thesis are investigated methods to manage shared electric autonomous taxi urban systems under online context in which customer demands occur over time, and where vehicles are available for ride-sharing and require electric recharging management. We propose the heuristics based on problem decomposition which include road network repartition and highlighting of subproblems such as charging management, empty vehicle redistribution and dynamic ride-sharing.The set of new methods for empty vehicle redistribution is proposed, such as proactive, meaning to take into account both current demand and anticipated future demand, in contrast to reactive methods, which act based on current demand only.We provide the reinforcement learning in different levels depending on granularity of the system.We propose station-based RL model for small networks and zone-based RL model, where the agents are zones of the city obtained by partitioning, for huge ones. The complete information optimisation is provided in order to analyse the system performance a-posteriori in offline context.The evaluation of the performance of proposed methods is provided in set of road networks of different nature and size. The proposed method provides promising results outperforming the other tested methods and the real data on the taxi system performance in terms of number of satisfied passengers under fixed fleet size. Note de contenu : 1- Introduction
2- State-of-the-art
3- Modelling the electrical aTaxisystem
4- Functional architecture of aTaxi system management
5- Reinforcement learning for aTaxi system optimisation
6- Evaluation scenarii
7- Numerical evaluation of aTaxi systems
8- Conclusion and discussionNuméro de notice : 28591 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Thèse française Note de thèse : thèse de Doctorat : Informatique : Paris-Saclay : 2021 Organisme de stage : Données et Algorithmes pour une ville intelligente et durable (UVSQ) DOI : sans En ligne : https://tel.hal.science/tel-03230845/ Format de la ressource électronique : URL Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=97968 STME: An effective method for discovering spatiotemporal multi‐type clusters containing events with different densities / Chao Wang in Transactions in GIS, Vol 24 n° 6 (December 2020)
[article]
Titre : STME: An effective method for discovering spatiotemporal multi‐type clusters containing events with different densities Type de document : Article/Communication Auteurs : Chao Wang, Auteur ; Zhenhong Du, Auteur ; Yuhua Gu, Auteur ; et al., Auteur Année de publication : 2020 Article en page(s) : pp 1559 - 1577 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] analyse de groupement
[Termes IGN] classification barycentrique
[Termes IGN] données spatiotemporelles
[Termes IGN] exploration de données
[Termes IGN] exploration de données géographiques
[Termes IGN] New York (Etats-Unis ; ville)
[Termes IGN] origine - destination
[Termes IGN] Pékin (Chine)
[Termes IGN] taxiRésumé : (Auteur) Clustering on spatiotemporal point events with multiple types is an important step for exploratory data mining and can help us reveal the correlation of event types. In this article, we present an effective method for discovering spatiotemporal multi‐type clusters containing events with different densities and event types (STME). Particularly, the type of events in a cluster can be different, and clusters with similar densities but different internal compositions should be distinguished. We use the distance to the kth nearest neighbour to define the size of the searched neighbourhood, and expand clusters by the concept of cluster reachable, ensuring that the proportion of various types of events in the cluster remains stable. The concept of clustering priority is also proposed to make the cluster always expand from the region with the highest density, which improves the robustness of clustering. Moreover, the density of multiple types of events in clusters is estimated to discover the internal structure of clusters and further explore the correlation between events. The effectiveness of the STME algorithm is demonstrated in several simulated and real data sets, including points of interest data in Beijing and the origins and destinations of taxi trips in New York. Numéro de notice : A2020-768 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/tgis.12662 Date de publication en ligne : 19/07/2020 En ligne : https://doi.org/10.1111/tgis.12662 Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=96660
in Transactions in GIS > Vol 24 n° 6 (December 2020) . - pp 1559 - 1577[article]Unfolding spatial-temporal patterns of taxi trip based on an improved network kernel density estimation / Boxi Shen in ISPRS International journal of geo-information, vol 9 n° 11 (November 2020)PermalinkA graph convolutional network model for evaluating potential congestion spots based on local urban built environments / Kun Qin in Transactions in GIS, Vol 24 n° 5 (October 2020)PermalinkExtracting activity patterns from taxi trajectory data: a two-layer framework using spatio-temporal clustering, Bayesian probability and Monte Carlo simulation / Shuhui Gong in International journal of geographical information science IJGIS, vol 34 n° 6 (June 2020)PermalinkExtracting commuter-specific destination hotspots from trip destination data – comparing the boro taxi service with Citi Bike in NYC / Andreas Keler in Geo-spatial Information Science, vol 23 n° 2 (June 2020)PermalinkUber movement data: a proxy for average one-way commuting times by car / Yeran Sun in ISPRS International journal of geo-information, vol 9 n° 3 (March 2020)PermalinkAn OD flow clustering method based on vector constraints: a case study for Beijing taxi origin-destination data / Xiaogang Guo in ISPRS International journal of geo-information, vol 9 n° 2 (February 2020)PermalinkSMSM: a similarity measure for trajectory stops and moves / Andre L. Lehmann in International journal of geographical information science IJGIS, vol 33 n° 9 (September 2019)PermalinkTravel time estimation at intersections based on low-frequency spatial-temporal GPS trajectory big data / Luliang Tang in Cartography and Geographic Information Science, vol 43 n° 5 (November 2016)PermalinkDensity-based clustering for data containing two types of points / Tao Pei in International journal of geographical information science IJGIS, vol 29 n° 2 (February 2015)Permalink