Commuting route planning method and device and computer equipment

A route planning and commuting technology, applied in the computer field, can solve problems such as poor timeliness, understanding and control of commuting travel for those who cannot commute, and commuting routes that cannot meet the needs of users for commuting.

Active Publication Date: 2020-05-08
BEIJING DIDI INFINITY TECH & DEV
View PDF4 Cites 5 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] However, due to the poor timeliness and insufficient sample size of the travel rules determined by the existing macroscopic survey and research methods, it is impossible to fully understand and control the commuting travel of commuters, resulting in the planned commuting routes that cannot meet the commuting needs of many users

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
  • Commuting route planning method and device and computer equipment
  • Commuting route planning method and device and computer equipment
  • Commuting route planning method and device and computer equipment

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0140] Such as figure 1 As shown, it is a flow chart of a commuting route planning method provided in Embodiment 1 of the present application. The execution subject of the method may be a computer device. The above-mentioned commuting route planning method includes the following steps:

[0141] S101. Obtain the historical travel order information of each user in the commuting route planning area.

[0142] Here, the commuting route planning area may refer to an area for planning commuting routes. Considering the application scenarios of the commuting route planning method provided in the embodiment of the present application, the above-mentioned commuting route planning area may be an area corresponding to a city (such as Beijing), or an area corresponding to an administrative district (such as Haidian District), or It may be other areas where commuter route planning can be performed, which is not specifically limited in this embodiment of the present application.

[0143] Fo...

Embodiment 2

[0152] Such as figure 2 As shown, the process of determining the commuting start position and commuting end position provided by Embodiment 2 of the present application specifically includes:

[0153] S201. For each user, extract the historical travel start position and historical travel end position included in each historical travel order information of the user;

[0154] S202. By clustering the user's historical travel start position and historical travel end position, the user's commute start position and commute end position are obtained.

[0155] Here, for each user, based on the cluster analysis results of the extracted historical travel start position and historical travel end position, the user’s commute start position and commute end position can be determined, that is, how to use the clustering method from a The core step of Embodiment 2 of the present application is to determine the user's commute start position and commute end position from among the user's mult...

Embodiment 3

[0160] Such as image 3 As shown, the method for generating a commuting route provided in Embodiment 3 of the present application specifically includes the following steps:

[0161] S301. Based on the commuting start position and commuting end position of each user, select a preferred stop pair for commuting routes from the various bus stops; the preferred stop pair includes a preferred starting stop and a preferred ending stop;

[0162] S302. Determine a set of candidate intermediate sites within a set distance range from a preferred site in the preferred site pair;

[0163] S303. For each candidate intermediate site in the candidate intermediate site set, predict the number of potential users of the commuting route consisting of the preferred start site, the preferred end site, and the candidate intermediate site;

[0164] S304. According to the number of potential users corresponding to each candidate intermediate site in the candidate intermediate site set, select a candi...

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 the technical field of computers, in particular to a commuting route planning method, which comprises the steps of obtaining historical travel order information of each user in a commuting route planning area; determining a commuting starting point position and a commuting ending point position of each user according to historical travel order information; and generating acommuting route based on the commuting starting point position and the commuting ending point position of each user and the position of each bus station in the commuting route planning area. By adoption of the scheme, the commuting route can be automatically planned according to the commuting starting point position, the commuting ending point position of the user and the bus station positions, the problem that timeliness and comprehensiveness are poor when commuting route planning is conducted in a questionnaire survey mode and the like is solved, the comprehensiveness of commuting route planning is good, and the practicability is better. The invention further provides a commuting route planning device, computer equipment and a computer readable storage medium.

Description

technical field [0001] The present application relates to the field of computer technology, in particular, to a commuting route planning method and device, and computer equipment. Background technique [0002] Commuting traffic refers to the process of going back and forth between home and work (or school), usually with at least two trips in a working day. According to the survey, commuters account for 60%-70% of all travel groups during morning and evening rush hours in cities. It can be seen that commuting traffic, as the main component of urban morning and evening peak passenger flow, attracts commuters to choose public transportation, which plays an important role in alleviating urban traffic congestion. [0003] In order to meet the needs of a large number of commuters, many cities have adopted corresponding policies, such as opening commuter lines. Existing commuting routes are planned according to the travel rules of commuter traffic after macroscopic investigation ...

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 Applications(China)
IPC IPC(8): G01C21/34
CPCG01C21/3492
Inventor 沈诗语陈梦珂高峰杜泽龙赵鹿芸
Owner BEIJING DIDI INFINITY TECH & DEV
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