Eureka AIR delivers breakthrough ideas for toughest innovation challenges, trusted by R&D personnel around the world.

A Fast Bus Interchange Method Based on Spatial Node Clustering Method

A clustering method and technology of spatial nodes, applied in the field of network science and public transportation, can solve the problems of long calculation time, shortened calculation time, poor real-time performance, etc., and achieve the effect of reducing scale, real-time transfer scheme, and real-time delivery

Inactive Publication Date: 2015-10-28
唐山鼎信电器仪表工程有限公司
View PDF1 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] In order to overcome the disadvantages of long calculation time and poor real-time performance of the existing urban bus transfer algorithm, the present invention proposes a fast bus transfer method based on the spatial node clustering method that effectively shortens the calculation time and has good real-time performance

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0024] The present invention will be further described below.

[0025] A fast bus transfer method based on the spatial node clustering method, comprising the following steps:

[0026] Step 1: Establish the neighborhood relationship network T of urban bus stops. In network T, when the actual physical space distance between two sites is less than or equal to a certain threshold L, there is an edge between these two sites.

[0027] Step 2: Use the spatial node clustering method to cluster the sites of the network T to reduce the scale of the computing network. Specifically, the clustering method is done by finding all the largest complete subgraphs in the network T (a complete subgraph refers to a subgraph of the network in which all nodes are connected to each other; the largest complete subgraph are those complete subgraphs that cannot be contained by other complete subgraphs).

[0028] It is worth noting that the algorithm for finding the maximum complete subgraph of a netw...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention relates to a rapid bus transfer method based on a space node clustering method, which comprises the following steps of: establishing an adjacent relation network T of a city bus station; carrying out station clustering on the network T by using the space node clustering method to achieve the purpose of reducing the computer network scale; mapping largest complete sub graphs obtained by operation into nodes and generating a new network P by using the nodes for storage; updating a weighted value of a network P connecting side at a certain time according to actual limit and real-time information; finding the nodes SC and DC attributed to a starting station S and a destination station D inquired and designated by a user in the network P through lasting stored information; calculating a shortest cost path formed by the nodes between the SC and the DC; and reversely generating an optimal transfer scheme between the starting station S and the destination station D through the stored information. The rapid bus transfer method has the beneficial effects that the calculation time is effectively shortened, and the real-time performance is good.

Description

technical field [0001] The invention relates to the fields of network science and public transportation, in particular to a fast bus transfer method based on a spatial node clustering method. Background technique [0002] The urban public transportation system is an important infrastructure of the city, and it is a necessary tool to maintain the orderly operation of the city. At present, our country is in a period of rapid social and economic development, vigorously developing urban transportation and carrying out reasonable planning of transportation have been put on the agenda. As a soft facility for urban traffic operation, the urban public transport service system carries the travel of most people in the city. Optimizing and improving the urban public transport service system plays a vital role in relieving urban congestion and improving passenger travel. [0003] Solving the problem of urban public transport transfer is an important aspect of improving the urban publi...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): G06Q10/04
Inventor 杨旭华陈光赵久强汪向飞
Owner 唐山鼎信电器仪表工程有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com