A quick bus line selection algorithm based on self-adapted backbone network

A backbone network and bus line technology, applied in the direction of calculation, data processing applications, instruments, etc., can solve problems such as the inability to meet the maximum number of transfers, high time complexity, and difficulty in meeting the actual needs of inquirers

Inactive Publication Date: 2008-05-28
XI AN JIAOTONG UNIV
View PDF0 Cites 20 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Dijkstra's algorithm is a single-source shortest path algorithm in the network graph, and Floyd's algorithm is a multi-source shortest path algorithm. The time complexity required to realize the bus line selection of any two stations is O(|V| 2 ), O(|V| 3 ), and it does not meet the preferred goal of "minimum number of transfers", and it is difficult to meet the actual needs of the inquirer
At

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

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A quick bus line selection algorithm based on self-adapted backbone network
  • A quick bus line selection algorithm based on self-adapted backbone network
  • A quick bus line selection algorithm based on self-adapted backbone network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0049] The algorithm steps are as follows:

[0050] Algorithm input: start site v start , terminal site v end , Algorithm output: the set of reachable lines.

[0051] Step1: loop variable i=1, variable L(v start ) = L(v end ) = φ. take l from L i , if v start ∈V(l i ), then L(v start ) = L(v start )U{l i}; if v end ∈V(l i ), then L(v end ) = L(v end )U{l i}; If i≠520, then i=i+1 and go to Step1.

[0052] Step2: If L(v start )∩L(v end )≠φ, record these direct lines and EXIT.

[0053] Step3: loop variable i=1, variable V B (L(v start )) = φ. from L(v start ) to take the element l i , let V B (L(v start )) = V B (L(v start ))∪{v j |v j ∈V(l i )∩v j ∈ V n} (i.e. line l i All the backbone sites on the V B (L(v start )), where V n Already determined by the algorithm established by the backbone network), if istart )|, i=i+1 go to Step3.

[0054] Step4: loop variable i=1, variable V B (L(v end )) = φ. from L(v end ) in any element l i , let V ...

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 provides a self-adapting backbone net based fast public transportation route selection algorithm, which mainly applies to the field of city bus or subway route search, and can solve the problem that the prior bus route search and selection algorithm does not support multiple transfers and the search time is too long. The invention proposes the self-adapting backbone net construction technology, which comprises the following steps: first a self-adapting backbone net in a public transportation network is constructed and then feasible route combinations between any two stops are chosen according to the following principles in order: firstly, if a direct route exists between the two stops, backbone net passing is not necessary; secondly, if no direct routes exist between the two stops, transfers are needed among backbone stops with as few transfer times as possible; thirdly, the optimal route combinations are then selected from all feasible route combinations according to different traveling demands of passengers.

Description

1. Technical field [0001] Providing accurate, timely and optimized bus line information services for the masses is an important measure to facilitate the lives of the masses, improve the operating efficiency of the bus network, and enhance the image of the city. To provide this kind of service, it is necessary to design a reasonable bus route selection algorithm. The bus route is fixed, and there are many factors that people have to consider and each has its own emphasis, such as the minimum number of transfers, distance, cost, time, etc. In view of this, the selection algorithm considers various factors comprehensively, designs a reasonable travel plan according to the request of the queryer, and provides the optimal plan under various factors for selection. 2. Background technology [0002] Literature [1] demonstrates that: passengers' choice of bus lines is affected by many factors, among which "number of transfers" is the primary factor. Literature [1] gives a question...

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
IPC IPC(8): G06Q10/00G06Q10/04
Inventor 常飞王嘉寅吴楠茜
Owner XI AN JIAOTONG UNIV
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
Try Eureka
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap