PAC: Partial Area Cluster for adjusting the distribution of transportation platforms in modern cities

• URL: http://arxiv.org/abs/2107.04124v2
• Date: Thu, 29 Jul 2021 14:47:39 GMT
• Title: PAC: Partial Area Cluster for adjusting the distribution of transportation platforms in modern cities
• Authors: Jiaming Pei, Jinhai Li, Jiyuan Xu, Q.Dat Luong
• Abstract summary: Unreasonable distribution of transportation platforms results in low utilization rate. "partial area cluster" (PAC) proposed to improve the utilization by changing and renewing the original distribution. Experience has shown that the use of public transport resources has increased by 20%.
• Score: 0.6423239719448168
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In the modern city, the utilization rate of public transportation attached importance to the efficiency of public traffic. However, the unreasonable distribution of transportation platforms results in a low utilization rate. In this paper, we researched and evaluated the distribution of platforms -- bus and subway -- and proposed a method, called "partial area cluster" (PAC), to improve the utilization by changing and renewing the original distribution. The novel method was based on the K-means algorithm in the field of machine learning. PAC worked to search the suitable bus platforms as the center and modified the original one to the subway. Experience has shown that the use of public transport resources has increased by 20%. The study uses a similar cluster algorithm to solve transport networks' problems in a novel but practical term. As a result, the PAC is expected to be used extensively in the transportation system construction process.

Related papers

• Score-Based Diffusion Policy Compatible with Reinforcement Learning via Optimal Transport [45.793758222754036]
  Diffusion policies have shown promise in learning complex behaviors from demonstrations. This paper explores improving diffusion-based imitation learning models through online interactions with the environment. We propose OTPR, a novel method that integrates diffusion policies with RL using optimal transport theory.
  arXiv  Detail & Related papers  (2025-02-18T08:22:20Z)
• Enhanced Importance Sampling through Latent Space Exploration in Normalizing Flows [69.8873421870522]
  importance sampling is a rare event simulation technique used in Monte Carlo simulations. We propose a method for more efficient sampling by updating the proposal distribution in the latent space of a normalizing flow.
  arXiv  Detail & Related papers  (2025-01-06T21:18:02Z)
• Federated Learning for Discrete Optimal Transport with Large Population under Incomplete Information [7.004936173632888]
  We introduce a discrete optimal transport framework to handle large-scale, heterogeneous target populations. We address two scenarios: one where the type distribution of targets is known, and one where it is unknown. In the case of unknown distribution, we develop a federated learning-based approach that enables efficient computation of the optimal transport scheme.
  arXiv  Detail & Related papers  (2024-11-12T14:46:31Z)
• Generalized Schrödinger Bridge Matching [54.171931505066]
  Generalized Schr"odinger Bridge (GSB) problem setup is prevalent in many scientific areas both within and without machine learning. We propose Generalized Schr"odinger Bridge Matching (GSBM), a new matching algorithm inspired by recent advances. We show that such a generalization can be cast as solving conditional optimal control, for which variational approximations can be used.
  arXiv  Detail & Related papers  (2023-10-03T17:42:11Z)
• Short Run Transit Route Planning Decision Support System Using a Deep Learning-Based Weighted Graph [0.0]
  We propose a novel deep learning-based methodology for a decision support system that enables public transport planners to identify short-term route improvements rapidly. By seamlessly adjusting specific sections of routes between two stops during specific times of the day, our method effectively reduces times and enhances PT services. Using self-supervision, we train a deep learning model for predicting lateness values for road segments. These lateness values are then utilized as edge weights in the transportation graph, enabling efficient path searching.
  arXiv  Detail & Related papers  (2023-08-24T14:37:55Z)
• Unsupervised embedding and similarity detection of microregions using public transport schedules [0.0]
  This thesis develops a method to embed public transport availability information into vector space. Public transport timetables were collected from 48 European cities. A method was also proposed to identify regions with similar characteristics of public transport offers.
  arXiv  Detail & Related papers  (2021-11-03T11:56:48Z)
• A Deep Value-network Based Approach for Multi-Driver Order Dispatching [55.36656442934531]
  We propose a deep reinforcement learning based solution for order dispatching. We conduct large scale online A/B tests on DiDi's ride-dispatching platform. Results show that CVNet consistently outperforms other recently proposed dispatching methods.
  arXiv  Detail & Related papers  (2021-06-08T16:27:04Z)
• Unavailable Transit Feed Specification: Making it Available with Recurrent Neural Networks [8.968417883198374]
  In general, the demand for public transport services, with an increasing reluctance to use them, is their quality. The approach proposed in this paper, using innovative methodologies resorting on data mining and machine learning techniques, aims to make available the unavailable data about public transport.
  arXiv  Detail & Related papers  (2021-02-20T12:17:20Z)
• Vehicular Cooperative Perception Through Action Branching and Federated Reinforcement Learning [101.64598586454571]
  A novel framework is proposed to allow reinforcement learning-based vehicular association, resource block (RB) allocation, and content selection of cooperative perception messages (CPMs) A federated RL approach is introduced in order to speed up the training process across vehicles. Results show that federated RL improves the training process, where better policies can be achieved within the same amount of time compared to the non-federated approach.
  arXiv  Detail & Related papers  (2020-12-07T02:09:15Z)
• Congestion-aware Evacuation Routing using Augmented Reality Devices [96.68280427555808]
  We present a congestion-aware routing solution for indoor evacuation, which produces real-time individual-customized evacuation routes among multiple destinations. A population density map, obtained on-the-fly by aggregating locations of evacuees from user-end Augmented Reality (AR) devices, is used to model the congestion distribution inside a building.
  arXiv  Detail & Related papers  (2020-04-25T22:54:35Z)
• Large-Scale Optimal Transport via Adversarial Training with Cycle-Consistency [30.305690062622283]
  We propose an end-to-end approach for large-scale optimal transport, which directly solves the transport map and is compatible with general cost function. We demonstrate the effectiveness of the proposed method against existing methods with large-scale real-world applications.
  arXiv  Detail & Related papers  (2020-03-14T14:06:46Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.