[go: up one dir, main page]

CN112465396B - Bus scheduling method and system based on station events along line - Google Patents

Bus scheduling method and system based on station events along line Download PDF

Info

Publication number
CN112465396B
CN112465396B CN202011477309.1A CN202011477309A CN112465396B CN 112465396 B CN112465396 B CN 112465396B CN 202011477309 A CN202011477309 A CN 202011477309A CN 112465396 B CN112465396 B CN 112465396B
Authority
CN
China
Prior art keywords
bus
data
along
event information
information data
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202011477309.1A
Other languages
Chinese (zh)
Other versions
CN112465396A (en
Inventor
陈媛媛
曹凤虎
曹凤才
景宁
张瑞
王志斌
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
North University of China
Original Assignee
North University of China
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by North University of China filed Critical North University of China
Priority to CN202011477309.1A priority Critical patent/CN112465396B/en
Publication of CN112465396A publication Critical patent/CN112465396A/en
Application granted granted Critical
Publication of CN112465396B publication Critical patent/CN112465396B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0631Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06315Needs-based resource requirements planning or analysis
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/21Design, administration or maintenance of databases
    • G06F16/215Improving data quality; Data cleansing, e.g. de-duplication, removing invalid entries or correcting typographical errors
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/95Retrieval from the web
    • G06F16/953Querying, e.g. by the use of web search engines
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N20/00Machine learning
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00Computing arrangements based on biological models
    • G06N3/02Neural networks
    • G06N3/08Learning methods
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/067Enterprise or organisation modelling
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/10Services
    • G06Q50/26Government or public services
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y04INFORMATION OR COMMUNICATION TECHNOLOGIES HAVING AN IMPACT ON OTHER TECHNOLOGY AREAS
    • Y04SSYSTEMS INTEGRATING TECHNOLOGIES RELATED TO POWER NETWORK OPERATION, COMMUNICATION OR INFORMATION TECHNOLOGIES FOR IMPROVING THE ELECTRICAL POWER GENERATION, TRANSMISSION, DISTRIBUTION, MANAGEMENT OR USAGE, i.e. SMART GRIDS
    • Y04S10/00Systems supporting electrical power generation, transmission or distribution
    • Y04S10/50Systems or methods supporting the power network operation or management, involving a certain degree of interaction with the load-side end user applications

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • Databases & Information Systems (AREA)
  • Tourism & Hospitality (AREA)
  • General Engineering & Computer Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Data Mining & Analysis (AREA)
  • Marketing (AREA)
  • General Business, Economics & Management (AREA)
  • Software Systems (AREA)
  • Quality & Reliability (AREA)
  • Educational Administration (AREA)
  • Development Economics (AREA)
  • General Health & Medical Sciences (AREA)
  • Game Theory and Decision Science (AREA)
  • Operations Research (AREA)
  • Evolutionary Computation (AREA)
  • Artificial Intelligence (AREA)
  • Computing Systems (AREA)
  • Health & Medical Sciences (AREA)
  • Mathematical Physics (AREA)
  • Primary Health Care (AREA)
  • Molecular Biology (AREA)
  • Computational Linguistics (AREA)
  • Biophysics (AREA)
  • Biomedical Technology (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Medical Informatics (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Traffic Control Systems (AREA)

Abstract

The invention discloses a bus scheduling method and system based on a station event along a line. The invention captures the things which are about to happen in a period of time in the future based on the web crawler, meanwhile, the neural network model is utilized to realize the prediction of the pedestrian volume by combining with the prior knowledge in daily life, the scheduling is carried out according to the result of the prediction of the pedestrian volume, and the targeted advance scheduling is realized according to the result of the prediction of the pedestrian volume which is likely to appear in a period of time in the future.

Description

一种基于沿线站点事件的公交调度方法及系统A bus dispatching method and system based on station events along the route

技术领域Technical Field

本发明涉及公交调度技术领域,特别涉及一种基于沿线站点事件的公交调度方法及系统。The present invention relates to the technical field of public transportation dispatching, and in particular to a public transportation dispatching method and system based on line station events.

背景技术Background Art

公共交通工具(简称“公交”)是满足日常出行需求的重要组成部分,有效地对公交系统进行调度,避免交通瘫痪,提高居民出行效率,具有非常重要的社会意义。Public transportation (abbreviated as "bus") is an important part of meeting daily travel needs. Effectively dispatching the bus system, avoiding traffic paralysis, and improving residents' travel efficiency are of great social significance.

目前,已经投入使用的公交调度方法包括:(1)早、晚高峰期间,增加各个线路的车辆数量;(2)延长运营时间等。但是,目前的调度方法收效甚微,究其原因,是没有根据各个线路自身的特点进行个体化、自适应地调度,单纯地增加公交车辆的数量,可能会加剧交通瘫痪情况的发生。此外,上述方法无法应对在未来一段时间内可能会出现的人流量大小进行准确预测,因此无法实现有针对性的提前调度。Currently, the bus dispatching methods that have been put into use include: (1) increasing the number of vehicles on each line during the morning and evening peak hours; (2) extending the operating hours, etc. However, the current dispatching methods have little effect. The reason is that they do not conduct individualized and adaptive dispatching based on the characteristics of each line. Simply increasing the number of buses may aggravate the occurrence of traffic paralysis. In addition, the above methods cannot accurately predict the size of passenger flow that may occur in the future, so targeted advance dispatching cannot be achieved.

发明内容Summary of the invention

本发明的目的是提供一种基于沿线站点事件的公交调度方法及系统,以实现对在未来一段时间内可能会出现的人流量大小进行准确预测,实现有针对性的提前调度。The purpose of the present invention is to provide a bus dispatching method and system based on station events along the route, so as to accurately predict the size of passenger flow that may occur in the future and realize targeted advance dispatching.

为实现上述目的,本发明提供了如下方案:To achieve the above object, the present invention provides the following solutions:

一种基于沿线站点事件的公交调度方法,所述公交调度方法包括如下步骤:A bus dispatching method based on station events along the route, the bus dispatching method comprising the following steps:

采用网络爬虫技术和先验知识学习方法获取未来时段内各个公交线路沿线及周围相关机构的预计发生的公交调度相关事件信息数据;Use web crawler technology and prior knowledge learning methods to obtain information data on bus dispatch related events that are expected to occur along and around each bus route in the future period;

对所述公交调度相关事件信息数据进行数据清洗与特征提取,获得公交调度相关事件特征数据;Performing data cleaning and feature extraction on the bus dispatching related event information data to obtain bus dispatching related event feature data;

将公交调度相关事件特征数据输入用于人流预测的训练后的神经网络模型,获得未来时段内各个公交线路沿线的人流量;Input the characteristic data of bus dispatch related events into the trained neural network model for passenger flow prediction to obtain the passenger flow along each bus line in the future period;

根据未来时段内各个公交线路沿线的人流量对各个公交线路沿线的公交车进行调度。The buses along each bus line are dispatched according to the passenger flow along each bus line in the future period.

可选的,所述采用网络爬虫技术和先验知识学习方法获取未来时段内各个公交线路沿线及周围相关机构的预计发生的公交调度相关事件信息数据,具体包括:Optionally, the web crawler technology and prior knowledge learning method are used to obtain the bus dispatch related event information data expected to occur along and around each bus line in the future period, specifically including:

采用网络爬虫技术从各个公交线路沿线及周围相关机构的网站上,获取各个公交线路沿线及周围相关机构的预计发生的非周期性的公交调度相关事件信息数据;Using web crawler technology to obtain the information data of non-periodic bus dispatch related events expected to occur from the websites of relevant agencies along and around each bus route;

采用先验知识学习方法,对历史的周期性的公交调度相关事件进行分析,确定各个公交线路沿线的周期性的公交调度相关事件的分布规律;将未来时段与所述分布规律进行对比,确定未来时段的周期性的公交调度相关事件信息数据。The prior knowledge learning method is adopted to analyze the historical periodic bus scheduling related events, and determine the distribution pattern of periodic bus scheduling related events along each bus line; the future time period is compared with the distribution pattern to determine the periodic bus scheduling related event information data of the future time period.

可选的,对所述公交调度相关事件信息数据进行数据清洗与特征提取,获得公交调度相关事件特征数据,具体包括:Optionally, data cleaning and feature extraction are performed on the bus dispatching related event information data to obtain bus dispatching related event feature data, specifically including:

对所述公交调度相关事件信息数据进行缺失值处理、格式转换、重复数据去除处理和噪声数据去除处理,获得清洗后的公交调度相关事件信息数据;Performing missing value processing, format conversion, duplicate data removal processing and noise data removal processing on the bus dispatch related event information data to obtain cleaned bus dispatch related event information data;

利用数据拟合的方法,对清洗后的公交调度相关事件信息数据进行验证,获得验证通过的公交调度相关事件信息数据;Using the data fitting method, the cleaned bus dispatch related event information data is verified to obtain the verified bus dispatch related event information data;

采用拉依达准则对验证通过的公交调度相关事件信息数据进行数据异常值处理,获得异常值处理后的公交调度相关事件信息数据;The Laida criterion is used to process the data of public transportation dispatching related event information that has passed the verification, and the public transportation dispatching related event information data after the data outlier processing is obtained;

对异常值处理后的公交调度相关事件信息数据进行去噪平滑处理,获得去噪平滑处理后的公交调度相关事件信息数据;Performing denoising and smoothing processing on the bus dispatching related event information data after outlier processing to obtain the bus dispatching related event information data after denoising and smoothing processing;

对去噪平滑处理后的公交调度相关事件信息数据进行数据分割,获得多个数据段;Segment the bus dispatch related event information data after denoising and smoothing to obtain multiple data segments;

对每个数据段进行特征提取,获得每个数据段的特征数据;Perform feature extraction on each data segment to obtain feature data of each data segment;

将每个数据段的特征数据进行拼接,获得公交调度相关事件特征数据。The characteristic data of each data segment are spliced together to obtain the characteristic data of bus scheduling related events.

可选的,所述神经网络模型为衰减的最小平方模型。Optionally, the neural network model is a decaying least squares model.

可选的,所述根据未来时段内各个公交线路沿线的人流量对各个公交线路沿线的公交车进行调度,具体包括:Optionally, the dispatching of buses along each bus line according to the passenger flow along each bus line in the future period specifically includes:

根据未来时段内各个公交线路沿线的人流量,利用公式

Figure BDA0002836008440000031
计算各个公交线路沿线的未来时段内的最大断面客流量;其中,pi表示未来第i个公交线路沿线的未来时段内的最大断面客流量,Nl表示第i个公交线路沿线的人流量中的第l个站台的上车人数,Yl表示第i个公交线路沿线的人流量中的第l个站台的下车人数,Mi表示第i个公交线路沿线的的站台数量,L表示第i个公交线路沿线的前L个站台;According to the passenger flow along each bus line in the future period, the formula
Figure BDA0002836008440000031
Calculate the maximum cross-sectional passenger flow in the future time period along each bus line; where pi represents the maximum cross-sectional passenger flow in the future time period along the ith bus line, Nl represents the number of passengers boarding the ith platform in the passenger flow along the ith bus line, Yl represents the number of passengers getting off the ith platform in the passenger flow along the ith bus line, Mi represents the number of platforms along the ith bus line, and L represents the first L platforms along the ith bus line;

根据各个公交线路沿线的未来时段内的最大断面客流量,利用公式

Figure BDA0002836008440000032
计算各个公交线路沿线的未来时段内的最小车辆数;其中,ni表示第i个公交线路沿线的未来时段内的最小车辆数。According to the maximum cross-sectional passenger flow in the future period along each bus line, the formula
Figure BDA0002836008440000032
Calculate the minimum number of vehicles along each bus line in the future period; where ni represents the minimum number of vehicles along the ith bus line in the future period.

一种基于沿线站点事件的公交调度系统,所述公交调度系统包括:A bus dispatching system based on station events along the route, the bus dispatching system comprising:

知识获取模块,用于采用网络爬虫技术和先验知识学习方法获取未来时段内各个公交线路沿线及周围相关机构的预计发生的公交调度相关事件信息数据;The knowledge acquisition module is used to use web crawler technology and prior knowledge learning methods to obtain information data on bus dispatch related events that are expected to occur along and around various bus routes in the future period;

数据清洗与特征提取模块,用于对所述公交调度相关事件信息数据进行数据清洗与特征提取,获得公交调度相关事件特征数据;A data cleaning and feature extraction module, used to perform data cleaning and feature extraction on the bus dispatch related event information data to obtain bus dispatch related event feature data;

人流预测模块,用于将公交调度相关事件特征数据输入用于人流预测的训练后的神经网络模型,获得未来时段内各个公交线路沿线的人流量;The passenger flow prediction module is used to input the characteristic data of bus scheduling related events into the trained neural network model for passenger flow prediction to obtain the passenger flow along each bus line in the future period;

调度模块,用于根据未来时段内各个公交线路沿线的人流量对各个公交线路沿线的公交车进行调度。The dispatching module is used to dispatch buses along each bus line according to the passenger flow along each bus line in the future period.

可选的,所述知识获取模块,具体包括:Optionally, the knowledge acquisition module specifically includes:

网络爬虫子模块,用于采用网络爬虫技术从各个公交线路沿线及周围相关机构的网站上,获取各个公交线路沿线及周围相关机构的预计发生的非周期性的公交调度相关事件信息数据;The web crawler submodule is used to obtain the information data of the non-periodic bus dispatch related events expected to occur along each bus route and the surrounding relevant institutions from the websites of the relevant institutions along each bus route and the surrounding relevant institutions by using the web crawler technology;

先验知识学习子模块,用于采用先验知识学习方法,对历史的周期性的公交调度相关事件进行分析,确定各个公交线路沿线的周期性的公交调度相关事件的分布规律;将未来时段与所述分布规律进行对比,确定未来时段的周期性的公交调度相关事件信息数据。The prior knowledge learning submodule is used to adopt the prior knowledge learning method to analyze the historical periodic bus scheduling related events, determine the distribution pattern of periodic bus scheduling related events along each bus line; compare the future time period with the distribution pattern, and determine the periodic bus scheduling related event information data of the future time period.

可选的,所述数据清洗与特征提取模块,具体包括:Optionally, the data cleaning and feature extraction module specifically includes:

数据清洗子模块,用于对所述公交调度相关事件信息数据进行缺失值处理、格式转换、重复数据去除处理和噪声数据去除处理,获得清洗后的公交调度相关事件信息数据;A data cleaning submodule is used to perform missing value processing, format conversion, duplicate data removal processing and noise data removal processing on the bus dispatch related event information data to obtain cleaned bus dispatch related event information data;

数据验证子模块,用于利用数据拟合的方法,对清洗后的公交调度相关事件信息数据进行验证,获得验证通过的公交调度相关事件信息数据;The data verification submodule is used to verify the cleaned bus dispatch related event information data by using the data fitting method to obtain the verified bus dispatch related event information data;

数据异常值处理子模块,用于采用拉依达准则对验证通过的公交调度相关事件信息数据进行数据异常值处理,获得异常值处理后的公交调度相关事件信息数据;The data outlier processing submodule is used to process the data outliers of the verified bus dispatching related event information data using the Laida criterion to obtain the bus dispatching related event information data after outlier processing;

去噪平滑处理子模块,用于对异常值处理后的公交调度相关事件信息数据进行去噪平滑处理,获得去噪平滑处理后的公交调度相关事件信息数据;The denoising and smoothing processing submodule is used to perform denoising and smoothing processing on the bus dispatching related event information data after the outlier processing, so as to obtain the bus dispatching related event information data after the denoising and smoothing processing;

数据分割子模块,用于对去噪平滑处理后的公交调度相关事件信息数据进行数据分割,获得多个数据段;The data segmentation submodule is used to segment the bus dispatch related event information data after denoising and smoothing to obtain multiple data segments;

特征提取子模块,用于对每个数据段进行特征提取,获得每个数据段的特征数据;A feature extraction submodule is used to extract features from each data segment to obtain feature data of each data segment;

数据拼接子模块,用于将每个数据段的特征数据进行拼接,获得公交调度相关事件特征数据。The data splicing submodule is used to splice the characteristic data of each data segment to obtain the characteristic data of bus scheduling related events.

可选的,所述神经网络模型为衰减的最小平方模型。Optionally, the neural network model is a decaying least squares model.

可选的,所述调度模块,具体包括:Optionally, the scheduling module specifically includes:

最大断面客流量计算子模块,用于根据未来时段内各个公交线路沿线的人流量,利用公式

Figure BDA0002836008440000041
计算各个公交线路沿线的未来时段内的最大断面客流量;其中,pi表示未来第i个公交线路沿线的未来时段内的最大断面客流量,Nl表示第i个公交线路沿线的人流量中的第l个站台的上车人数,Yl表示第i个公交线路沿线的人流量中的第l个站台的下车人数,Mi表示第i个公交线路沿线的的站台数量,L表示第i个公交线路沿线的前L个站台;The maximum cross-section passenger flow calculation submodule is used to calculate the passenger flow along each bus line in the future period using the formula
Figure BDA0002836008440000041
Calculate the maximum cross-sectional passenger flow in the future time period along each bus line; where pi represents the maximum cross-sectional passenger flow in the future time period along the ith bus line, Nl represents the number of passengers boarding the ith platform in the passenger flow along the ith bus line, Yl represents the number of passengers getting off the ith platform in the passenger flow along the ith bus line, Mi represents the number of platforms along the ith bus line, and L represents the first L platforms along the ith bus line;

最小车辆数计算子模块,用于根据各个公交线路沿线的未来时段内的最大断面客流量,利用公式

Figure BDA0002836008440000051
计算各个公交线路沿线的未来时段内的最小车辆数;其中,ni表示第i个公交线路沿线的未来时段内的最小车辆数。The minimum vehicle number calculation submodule is used to calculate the minimum vehicle number according to the maximum cross-sectional passenger flow in the future period along each bus line using the formula
Figure BDA0002836008440000051
Calculate the minimum number of vehicles along each bus line in the future period; where ni represents the minimum number of vehicles along the ith bus line in the future period.

根据本发明提供的具体实施例,本发明公开了以下技术效果:According to the specific embodiments provided by the present invention, the present invention discloses the following technical effects:

本发明公开了一种基于沿线站点事件的公交调度方法及系统,所述公交调度方法:采用网络爬虫技术和先验知识学习方法获取未来时段内各个公交线路沿线及周围相关机构的预计发生的公交调度相关事件信息数据;对所述公交调度相关事件信息数据进行数据清洗与特征提取,获得公交调度相关事件特征数据;将公交调度相关事件特征数据输入用于人流预测的训练后的神经网络模型,获得未来时段内各个公交线路沿线的人流量;根据未来时段内各个公交线路沿线的人流量对各个公交线路沿线的公交车进行调度。本发明基于网络爬虫抓取未来一段时间内即将发生事情,同时结合日常地先验知识,利用神经网络模型实现人流量的预测,根据人流量预测结果进行调度,实现根据在未来一段时间内可能会出现的人流量大小预测结果,有针对性的提前调度。The present invention discloses a bus dispatching method and system based on line site events. The bus dispatching method: uses web crawler technology and prior knowledge learning methods to obtain bus dispatching related event information data that is expected to occur along each bus line and surrounding related institutions in the future period; performs data cleaning and feature extraction on the bus dispatching related event information data to obtain bus dispatching related event feature data; inputs the bus dispatching related event feature data into a trained neural network model for passenger flow prediction to obtain passenger flow along each bus line in the future period; dispatches buses along each bus line according to passenger flow along each bus line in the future period. The present invention is based on the web crawler to capture events that are about to occur in the future period, and at the same time combines daily prior knowledge, uses a neural network model to predict passenger flow, and dispatches according to the passenger flow prediction results, so as to achieve targeted advance dispatch according to the passenger flow size prediction results that may occur in the future period.

附图说明BRIEF DESCRIPTION OF THE DRAWINGS

为了更清楚地说明本发明实施例或现有技术中的技术方案,下面将对实施例中所需要使用的附图作简单地介绍,显而易见地,下面描述中的附图仅仅是本发明的一些实施例,对于本领域普通技术人员来讲,在不付出创造性劳动性的前提下,还可以根据这些附图获得其他的附图。In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative labor.

图1为本发明提供的一种基于沿线站点事件的公交调度方法的流程图;FIG1 is a flow chart of a bus dispatching method based on station events along the route provided by the present invention;

图2为本发明提供的一种基于沿线站点事件的公交调度系统的结构图;FIG2 is a structural diagram of a bus dispatching system based on station events along the route provided by the present invention;

图3为本发明实施例1提供的山西省太原市870路公交沿线站点图;FIG3 is a bus stop map along bus route 870 in Taiyuan, Shanxi Province provided in Example 1 of the present invention;

图4为本发明实施例1提供的全国复杂网络大会时的入场高峰时间段人流量预测结果图;FIG4 is a diagram showing the predicted results of the flow of people during the peak time period of the National Complex Network Conference provided by Example 1 of the present invention;

图5为本发明实施例2提供的全国计算机大会时的入场高峰时间段人流量预测结果图;FIG5 is a diagram showing the result of the prediction of the flow of people during the peak time period of the National Computer Conference provided by Example 2 of the present invention;

图6为本发明实施例2提供的山西省体育中心的入场高峰时间段人流量预测结果图。FIG. 6 is a diagram showing the predicted results of the flow of people during the peak admission period of the Shanxi Sports Center provided by Example 2 of the present invention.

具体实施方式DETAILED DESCRIPTION

本发明的目的是提供一种基于沿线站点事件的公交调度方法及系统,以实现对在未来一段时间内可能会出现的人流量大小进行准确预测,实现有针对性的提前调度。The purpose of the present invention is to provide a bus dispatching method and system based on station events along the route, so as to accurately predict the size of passenger flow that may occur in the future and realize targeted advance dispatching.

为使本发明的上述目的、特征和优点能够更加明显易懂,下面结合附图和具体实施方式对发明作进一步详细的说明。In order to make the above-mentioned objects, features and advantages of the present invention more obvious and easy to understand, the present invention is further described in detail below with reference to the accompanying drawings and specific embodiments.

公交线路在进行站点选择时会优先考虑沿线人口密度或人员流动相对较高的机构,譬如:车站、医院、学校、会议中心和酒店等。上述这些机构通常会发生一系列有规律的事件,譬如:周末及节假日期间车站站点的人流量通常要高于平时;开学季学校站点的人流量也会大量增加;有大型会议(学术会议、演唱会、体育赛事等)时,会议中心及周围酒店站点的人流量也会大幅增加。When selecting bus stops, bus routes will give priority to institutions with relatively high population density or personnel flow along the route, such as stations, hospitals, schools, conference centers and hotels. These institutions usually have a series of regular events, such as: the passenger flow at stations is usually higher than usual during weekends and holidays; the passenger flow at school stops will also increase significantly during the school season; when there are large conferences (academic conferences, concerts, sports events, etc.), the passenger flow at conference centers and surrounding hotel stops will also increase significantly.

因此,可以有效地利用公交沿线站点及周围机构可能会发生事件地先验知识,设计出一套自适应的公交运营调度策略。Therefore, we can effectively utilize the prior knowledge of possible events that may occur at bus stops and surrounding institutions to design an adaptive bus operation scheduling strategy.

如图1所示,本发明提供一种基于沿线站点事件的公交调度方法,所述公交调度方法包括如下步骤:As shown in FIG1 , the present invention provides a bus dispatching method based on station events along the route, and the bus dispatching method comprises the following steps:

步骤101,采用网络爬虫技术和先验知识学习方法获取未来时段内各个公交线路沿线及周围相关机构的预计发生的公交调度相关事件信息数据。Step 101, using web crawler technology and prior knowledge learning methods to obtain information data on bus scheduling related events that are expected to occur along and around various bus routes in the future period.

步骤101所述采用网络爬虫技术和先验知识学习方法获取未来时段内各个公交线路沿线及周围相关机构的预计发生的公交调度相关事件信息数据,具体包括:采用网络爬虫技术从各个公交线路沿线及周围相关机构的网站上,获取各个公交线路沿线及周围相关机构的预计发生的非周期性的公交调度相关事件信息数据;采用先验知识学习方法,对历史的周期性的公交调度相关事件进行分析,确定各个公交线路沿线的周期性的公交调度相关事件的分布规律;将未来时段与所述分布规律进行对比,确定未来时段的周期性的公交调度相关事件信息数据。Step 101 uses web crawler technology and prior knowledge learning methods to obtain information data on bus scheduling related events that are expected to occur in the future period for relevant agencies along and around each bus line, specifically including: using web crawler technology to obtain information data on non-periodic bus scheduling related events that are expected to occur for relevant agencies along and around each bus line from the websites of relevant agencies along and around each bus line; using prior knowledge learning methods to analyze historical periodic bus scheduling related events to determine the distribution pattern of periodic bus scheduling related events along each bus line; comparing the future period with the distribution pattern to determine the periodic bus scheduling related event information data for the future period.

周围相关机构包括公交沿线的车站、医院、学校、会议中心和酒店等。The surrounding related institutions include bus stations, hospitals, schools, conference centers and hotels along the bus routes.

步骤102,对所述公交调度相关事件信息数据进行数据清洗与特征提取,获得公交调度相关事件特征数据。Step 102: performing data cleaning and feature extraction on the bus dispatching related event information data to obtain bus dispatching related event feature data.

步骤102所述对所述公交调度相关事件信息数据进行数据清洗与特征提取,获得公交调度相关事件特征数据,具体包括:对所述公交调度相关事件信息数据进行缺失值处理、格式转换、重复数据去除处理和噪声数据去除处理,获得清洗后的公交调度相关事件信息数据;利用数据拟合的方法,对清洗后的公交调度相关事件信息数据进行验证,获得验证通过的公交调度相关事件信息数据;采用拉依达准则对验证通过的公交调度相关事件信息数据进行数据异常值处理,获得异常值处理后的公交调度相关事件信息数据;对异常值处理后的公交调度相关事件信息数据进行去噪平滑处理,获得去噪平滑处理后的公交调度相关事件信息数据;对去噪平滑处理后的公交调度相关事件信息数据进行数据分割,获得多个数据段;对每个数据段进行特征提取(即,对每个数据段进行缺失值处理、格式转换、重复数据去除处理和噪声数据去除处理),获得每个数据段的特征数据;将每个数据段的特征数据进行拼接,获得公交调度相关事件特征数据。The step 102 of performing data cleaning and feature extraction on the bus dispatching related event information data to obtain bus dispatching related event feature data specifically includes: performing missing value processing, format conversion, duplicate data removal processing and noise data removal processing on the bus dispatching related event information data to obtain cleaned bus dispatching related event information data; using a data fitting method to verify the cleaned bus dispatching related event information data to obtain verified bus dispatching related event information data; using the Laida criterion to perform data outlier processing on the verified bus dispatching related event information data to obtain outlier-processed bus dispatching related event information data; performing denoising and smoothing processing on the bus dispatching related event information data after outlier processing to obtain denoising and smoothing-processed bus dispatching related event information data; performing data segmentation on the bus dispatching related event information data after denoising and smoothing to obtain multiple data segments; performing feature extraction on each data segment (i.e., performing missing value processing, format conversion, duplicate data removal processing and noise data removal processing on each data segment) to obtain feature data of each data segment; and splicing the feature data of each data segment to obtain bus dispatching related event feature data.

步骤103,将公交调度相关事件特征数据输入用于人流预测的训练后的神经网络模型,获得未来时段内各个公交线路沿线的人流量。Step 103, inputting the characteristic data of bus scheduling related events into the trained neural network model for passenger flow prediction to obtain the passenger flow along each bus line in the future period.

所述神经网络模型为衰减的最小平方模型。The neural network model is a decaying least squares model.

步骤104,根据未来时段内各个公交线路沿线的人流量对各个公交线路沿线的公交车进行调度。Step 104, dispatching buses along each bus line according to the passenger flow along each bus line in the future time period.

在满载率为120%的情况下可推出公交车数量的最小值。由公交车上下车人数数据计算出每个时间段中所有公交车上最大断面客流量,由人数的最大值来求出在此时间段所需要的最少公交车的数量,假设每个时段的乘客是均匀来到站台,要满足每个时段的每位乘客都能够乘车,每辆车的容量上限为120人。The minimum number of buses can be derived when the full load rate is 120%. The maximum cross-sectional passenger flow on all buses in each time period is calculated based on the number of people getting on and off the buses, and the minimum number of buses required in this time period is calculated based on the maximum number of people. Assuming that passengers in each time period arrive at the platform evenly, in order to ensure that every passenger in each time period can board the bus, the upper limit of the capacity of each bus is 120 people.

步骤104所述根据未来时段内各个公交线路沿线的人流量对各个公交线路沿线的公交车进行调度,具体包括:根据未来时段内各个公交线路沿线的人流量,利用公式

Figure BDA0002836008440000081
计算各个公交线路沿线的未来时段内的最大断面客流量;其中,pi表示未来第i个公交线路沿线的未来时段内的最大断面客流量,Nl表示第i个公交线路沿线的人流量中的第l个站台的上车人数,Yl表示第i个公交线路沿线的人流量中的第l个站台的下车人数,Mi表示第i个公交线路沿线的的站台数量,L表示第i个公交线路沿线的前L个站台;根据各个公交线路沿线的未来时段内的最大断面客流量,利用公式
Figure BDA0002836008440000082
计算各个公交线路沿线的未来时段内的最小车辆数;其中,ni表示第i个公交线路沿线的未来时段内的最小车辆数。Step 104 is to dispatch buses along each bus line according to the passenger flow along each bus line in the future time period, specifically including: according to the passenger flow along each bus line in the future time period, using the formula
Figure BDA0002836008440000081
Calculate the maximum cross-sectional passenger flow in the future time period along each bus line; where pi represents the maximum cross-sectional passenger flow in the future time period along the i-th bus line, Nl represents the number of passengers boarding the l-th platform in the passenger flow along the i-th bus line, Yl represents the number of passengers getting off the l-th platform in the passenger flow along the i-th bus line, Mi represents the number of platforms along the i-th bus line, and L represents the first L platforms along the i-th bus line; according to the maximum cross-sectional passenger flow in the future time period along each bus line, use the formula
Figure BDA0002836008440000082
Calculate the minimum number of vehicles along each bus line in the future period; where ni represents the minimum number of vehicles along the ith bus line in the future period.

如图2所示,本发明还提供一种基于沿线站点事件的公交调度系统,所述公交调度系统包括:As shown in FIG2 , the present invention further provides a bus dispatching system based on station events along the route, the bus dispatching system comprising:

知识获取模块,用于采用网络爬虫技术和先验知识学习方法获取未来时段内各个公交线路沿线及周围相关机构的预计发生的公交调度相关事件信息数据。The knowledge acquisition module is used to use web crawler technology and prior knowledge learning methods to obtain information data on bus scheduling related events that are expected to occur along each bus route and surrounding related agencies in the future period.

所述知识获取模块,具体包括:网络爬虫子模块,用于采用网络爬虫技术从各个公交线路沿线及周围相关机构的网站上,获取各个公交线路沿线及周围相关机构的预计发生的非周期性的公交调度相关事件信息数据;先验知识学习子模块,用于采用先验知识学习方法,对历史的周期性的公交调度相关事件进行分析,确定各个公交线路沿线的周期性的公交调度相关事件的分布规律;将未来时段与所述分布规律进行对比,确定未来时段的周期性的公交调度相关事件信息数据。The knowledge acquisition module specifically includes: a web crawler submodule, which is used to use web crawler technology to obtain the expected non-periodic bus scheduling related event information data of the relevant institutions along and around each bus line from the websites of the relevant institutions along and around each bus line; a priori knowledge learning submodule, which is used to use a priori knowledge learning method to analyze the historical periodic bus scheduling related events and determine the distribution pattern of the periodic bus scheduling related events along each bus line; compare the future time period with the distribution pattern to determine the periodic bus scheduling related event information data of the future time period.

知识获取模块的主要功能是利用多种渠道搜索与公交线路站点相关的信息。The main function of the knowledge acquisition module is to use multiple channels to search for information related to bus routes and stops.

首先,利用网络爬虫子模块,将公交线路的各个沿线站点(譬如:车站、学校、医院、会议中心、酒店等)作为检索词,通过多种渠道(譬如:官方网站、新闻门户、微博和微信公众号等)检索各个沿线站点在未来一段事件内即将发生的相关事件(譬如:春运、开学季、大型会议、演出等)。First, the web crawler module is used to take the various stations along the bus line (such as stations, schools, hospitals, conference centers, hotels, etc.) as search terms, and through various channels (such as official websites, news portals, Weibo and WeChat public accounts, etc.), search for related events that will occur at each station along the line in the future (such as Spring Festival travel, the start of the school season, large-scale conferences, performances, etc.).

其次,利用先验知识学习子模块,预测未来一段时间内即将发生的相关事件(譬如:周末与节假日、出行规律等)。其具体方法为通过FFT算法对事件发生的频谱进行分析,得出各公交站点人流量的相关数据分布规律,然后进行时间序列的极大重叠离散小波分解,整合数据建立ARIMA模型,通过将未来时间点与历史事件的时间序列相比对,利用傅里叶谱分析事件发生的概率,进而预测未来一段时间内即将发生的相关事件。譬如在节假日或者上下班时间等时间段,可以通过模型以先验知识来预测人流的规律。Secondly, use the prior knowledge learning submodule to predict related events that will occur in the future (for example, weekends and holidays, travel patterns, etc.). The specific method is to analyze the frequency spectrum of the event through the FFT algorithm, obtain the distribution law of the relevant data of the flow of people at each bus stop, and then perform the maximum overlapping discrete wavelet decomposition of the time series, integrate the data to establish the ARIMA model, and compare the future time points with the time series of historical events. Use the Fourier spectrum to analyze the probability of the event, and then predict the related events that will occur in the future. For example, during holidays or commuting time, the model can be used to predict the law of human flow with prior knowledge.

数据清洗与特征提取模块,用于对所述公交调度相关事件信息数据进行数据清洗与特征提取,获得公交调度相关事件特征数据。The data cleaning and feature extraction module is used to perform data cleaning and feature extraction on the bus dispatch related event information data to obtain bus dispatch related event feature data.

数据清洗与特征提取模块的主要功能是对知识获取模块检索到的数据进行清洗和特征提取,利用FFT软件分析所得谱图结果,剔除拟合曲线偏离干扰数据,从而获得与公交线路沿线站点真实相关的事件信息和特征。譬如:会议的地址、会议的规模、参会人员的分布、出行(入场和退场)高峰事件段、公交首末班车时间等。其中,数据清理的步骤为:1)缺失值处理,根据事件的缺失率和重要性,分为去除字段、填充缺失值、重新取数据;2)格式与内容处理;3)去除重复的数据;4)噪音数据的处理。数据特征提取的步骤为:1)数据真实性判断,利用拟合技术等手段实现数据的真实性的验证;2)数据异常值处理,采取基于拉依达准则的数据异常值处理;3)数据去噪平滑处理;4)数据分割;5)特征数据的提取。The main function of the data cleaning and feature extraction module is to clean and extract features from the data retrieved by the knowledge acquisition module, analyze the obtained spectrum results using FFT software, remove the interference data that deviates from the fitting curve, and obtain event information and features that are truly related to the stations along the bus line. For example: the address of the meeting, the scale of the meeting, the distribution of participants, the peak event period of travel (entry and exit), the first and last bus times, etc. Among them, the steps of data cleaning are: 1) missing value processing, according to the missing rate and importance of the event, it is divided into removing fields, filling missing values, and re-obtaining data; 2) format and content processing; 3) removing duplicate data; 4) processing of noise data. The steps of data feature extraction are: 1) data authenticity judgment, using fitting technology and other means to verify the authenticity of the data; 2) data outlier processing, using data outlier processing based on the Laida criterion; 3) data denoising and smoothing processing; 4) data segmentation; 5) feature data extraction.

具体的,所述数据清洗与特征提取模块,具体包括:数据清洗子模块,用于对所述公交调度相关事件信息数据进行缺失值处理、格式转换、重复数据去除处理和噪声数据去除处理,获得清洗后的公交调度相关事件信息数据;数据验证子模块,用于利用数据拟合的方法,对清洗后的公交调度相关事件信息数据进行验证,获得验证通过的公交调度相关事件信息数据;数据异常值处理子模块,用于采用拉依达准则对验证通过的公交调度相关事件信息数据进行数据异常值处理,获得异常值处理后的公交调度相关事件信息数据;去噪平滑处理子模块,用于对异常值处理后的公交调度相关事件信息数据进行去噪平滑处理,获得去噪平滑处理后的公交调度相关事件信息数据;数据分割子模块,用于对去噪平滑处理后的公交调度相关事件信息数据进行数据分割,获得多个数据段;特征提取子模块,用于对每个数据段进行特征提取,获得每个数据段的特征数据;数据拼接子模块,用于将每个数据段的特征数据进行拼接,获得公交调度相关事件特征数据。Specifically, the data cleaning and feature extraction module specifically includes: a data cleaning submodule, which is used to perform missing value processing, format conversion, duplicate data removal processing and noise data removal processing on the bus scheduling related event information data to obtain the cleaned bus scheduling related event information data; a data verification submodule, which is used to verify the cleaned bus scheduling related event information data using a data fitting method to obtain the verified bus scheduling related event information data; a data outlier processing submodule, which is used to perform data outlier processing on the verified bus scheduling related event information data using the Laida criterion to obtain the bus scheduling related event information data after outlier processing; a denoising and smoothing processing submodule, which is used to perform denoising and smoothing processing on the bus scheduling related event information data after outlier processing to obtain the bus scheduling related event information data after denoising and smoothing processing; a data segmentation submodule, which is used to perform data segmentation on the bus scheduling related event information data after denoising and smoothing processing to obtain multiple data segments; a feature extraction submodule, which is used to perform feature extraction on each data segment to obtain feature data of each data segment; a data splicing submodule, which is used to splice the feature data of each data segment to obtain the feature data of bus scheduling related events.

人流预测模块,用于将公交调度相关事件特征数据输入用于人流预测的训练后的神经网络模型,获得未来时段内各个公交线路沿线的人流量。The passenger flow prediction module is used to input the characteristic data of bus scheduling related events into the trained neural network model for passenger flow prediction, and obtain the passenger flow along each bus line in the future period.

人流预测模块的主要功能是以数据清洗与特征提取模块收集、清洗、提取后得到的有效数据为基础,预测事件发生的时间段内有出行需求的人流量大小。在公交的调度过程中,由于人流量变化趋势具有很强的随机性而且非线性特征明显,因此使用传统的预测方法进行人流量预测并不适合。因此,本发明采用数据挖掘方法,采用人工神经网络系统,利用历史数据进行建模和预测。人工神经网络可以通过改变激励函数的种类来实现各种线性和各种非线性映射能力,同时,神经网络模型学习能力与自适应能力极强,因此能在很大程度上适应短时客流的特征,从而能够保证预测的可靠性。本发明选用衰减的最小平方算法作为人工神经网络的算法。预测模型建立的第一步是获得数据,因此以模块2中得到的有效数据为基础,选取相邻两周、相邻两天、相邻两个时段对应的数据来作为输入样本,利用人工神经网络模型进行客流预测,为了验证预测模型的正确性,数据样本可以被分为训练集和测试集,其比例为3:1。在利用神经网络模型进行预测前,需要将数据的归一化到[-1,1]之间,以简化预测,防止神经元输出饱和问题。当前期工作都完成后,就可以通过模拟软件如MATLAB等来编写基于人工神经网络的预测模型,然后对网络的训练参数进行设置,初始化网络,接着进行预测网络的训练,将训练样本输入,最后将训练好的网络进行测试。The main function of the passenger flow prediction module is to predict the size of the passenger flow with travel demand during the time period when the event occurs based on the valid data collected, cleaned and extracted by the data cleaning and feature extraction module. In the process of bus scheduling, since the trend of passenger flow change is highly random and has obvious nonlinear characteristics, it is not suitable to use traditional prediction methods to predict passenger flow. Therefore, the present invention adopts a data mining method, an artificial neural network system, and uses historical data for modeling and prediction. Artificial neural networks can achieve various linear and nonlinear mapping capabilities by changing the type of excitation function. At the same time, the neural network model has strong learning and adaptive capabilities, so it can adapt to the characteristics of short-term passenger flow to a large extent, thereby ensuring the reliability of prediction. The present invention selects the attenuated least squares algorithm as the algorithm of the artificial neural network. The first step in establishing the prediction model is to obtain data. Therefore, based on the valid data obtained in module 2, the data corresponding to two adjacent weeks, two adjacent days, and two adjacent time periods are selected as input samples, and the artificial neural network model is used to predict passenger flow. In order to verify the correctness of the prediction model, the data samples can be divided into a training set and a test set, and the ratio is 3:1. Before using the neural network model for prediction, the data needs to be normalized to between [-1,1] to simplify the prediction and prevent the problem of neuron output saturation. Once the preliminary work is completed, the prediction model based on the artificial neural network can be written through simulation software such as MATLAB, and then the training parameters of the network are set, the network is initialized, and then the prediction network is trained, the training samples are input, and finally the trained network is tested.

调度模块,用于根据未来时段内各个公交线路沿线的人流量对各个公交线路沿线的公交车进行调度。The dispatching module is used to dispatch buses along each bus line according to the passenger flow along each bus line in the future period.

调度模块的主要功能是以人流预测模块构建的人流量预测模型为基础建立优化的公交调度模型。本发明利用网络爬虫抓取过去一段时间内人流量与公交班次的数据,并对数据进行清洗与提取,结合实际情况,根据每条公交线路站点的特点,构建结构方程模型,例如,可以建立最少公交车模型:其模型数学表达式如下:The main function of the scheduling module is to establish an optimized bus scheduling model based on the passenger flow prediction model constructed by the passenger flow prediction module. The present invention uses a web crawler to capture the data of passenger flow and bus schedules in the past period of time, and cleans and extracts the data. Combined with the actual situation, according to the characteristics of each bus line station, a structural equation model is constructed. For example, a minimum bus model can be established: the mathematical expression of the model is as follows:

Figure BDA0002836008440000111
Figure BDA0002836008440000111

在该时间段内的车辆最小值为:The minimum value of vehicles in this time period is:

Figure BDA0002836008440000112
Figure BDA0002836008440000112

pi表示未来第i个公交线路沿线的未来时段内的最大断面客流量,Nl表示第i个公交线路沿线的第l个站台的上车人数,Yl表示第i个公交线路沿线的第l个站台的下车人数,Mi表示第i个公交线路沿线的的站台数量,L表示第i个公交线路沿线的前L个站台。p i represents the maximum cross-sectional passenger flow along the i-th bus line in the future time period, N l represents the number of passengers getting on the l-th platform along the i-th bus line, Y l represents the number of passengers getting off the l-th platform along the i-th bus line, M i represents the number of platforms along the i-th bus line, and L represents the first L platforms along the i-th bus line.

结构方程模型是基于变量来分析变量之间关系的一种统计方法,建立模型首先确立常用参数并对其计算,对各影响因素(早晚高峰、特殊时间点、路况、天气、乘客舒适度等)带入模型进行量化计算,得出所需最少车次,并根据模型结果提出优化策略及建议。如,以山西太原市1路公交车为例,对该公交路线、发车时刻表、站距表等数据进行确立,构建出上述模型,通过对模型结果的分析结合现实,从而对现行的公交线路调度方法进行调整和优化。通过调整1)是否需要增开班车,2)若需要增开班车,则需在哪个时间段增开多少次班车,制定出未来一段时间内的调度安排。Structural equation model is a statistical method based on variables to analyze the relationship between variables. To establish the model, the common parameters are first established and calculated. The influencing factors (peak hours, special time points, road conditions, weather, passenger comfort, etc.) are brought into the model for quantitative calculation to obtain the minimum number of buses required, and optimization strategies and suggestions are proposed based on the model results. For example, taking No. 1 bus in Taiyuan, Shanxi as an example, the bus route, departure schedule, station distance table and other data are established to construct the above model. By analyzing the model results and combining them with reality, the current bus route scheduling method is adjusted and optimized. By adjusting 1) whether it is necessary to add more buses, 2) if it is necessary to add more buses, how many buses need to be added in which time period, the scheduling arrangement for a period of time in the future is formulated.

具体的,所述调度模块,具体包括:根据未来时段内各个公交线路沿线的人流量,利用公式

Figure BDA0002836008440000113
计算各个公交线路沿线的未来时段内的最大断面客流量;其中,pi表示未来第i个公交线路沿线的未来时段内的最大断面客流量,Nl表示第i个公交线路沿线的人流量中的第l个站台的上车人数,Yl表示第i个公交线路沿线的人流量中的第l个站台的下车人数,Mi表示第i个公交线路沿线的的站台数量,L表示第i个公交线路沿线的前L个站台;最小车辆数计算子模块,用于根据各个公交线路沿线的未来时段内的最大断面客流量,利用公式
Figure BDA0002836008440000121
计算各个公交线路沿线的未来时段内的最小车辆数;其中,ni表示第i个公交线路沿线的未来时段内的最小车辆数。Specifically, the scheduling module specifically includes: according to the passenger flow along each bus line in the future period, using the formula
Figure BDA0002836008440000113
Calculate the maximum cross-sectional passenger flow in the future time period along each bus line; where pi represents the maximum cross-sectional passenger flow in the future time period along the i-th bus line, Nl represents the number of passengers boarding the l-th platform in the passenger flow along the i-th bus line, Yl represents the number of passengers getting off the l-th platform in the passenger flow along the i-th bus line, Mi represents the number of platforms along the i-th bus line, and L represents the first L platforms along the i-th bus line; the minimum vehicle number calculation submodule is used to calculate the maximum cross-sectional passenger flow in the future time period along each bus line using the formula
Figure BDA0002836008440000121
Calculate the minimum number of vehicles along each bus line in the future period; where ni represents the minimum number of vehicles along the ith bus line in the future period.

下面结合两个具体的实施例对本发明的技术方案进行说明。The technical solution of the present invention is described below in conjunction with two specific embodiments.

实施例1:Embodiment 1:

本实施例以山西省太原市870路公交线路为研究对象,利用本发明所提出的方法研究该条线路的调度策略。如图3所示,870路公交共包含26个站点,其中包括典型的人流量较大的站点,譬如:火车站、学校(山西大学、司法学校和财经大学等)、公司(富士康)、医院(山西省中医院与山西省人民医院位于并州北路并州东街口站点附近)和会议中心/酒店(山西省国际会议中心和多个酒店位于五一广场站点附近)等。This embodiment takes bus route 870 in Taiyuan, Shanxi Province as the research object, and uses the method proposed in the present invention to study the dispatching strategy of this route. As shown in Figure 3, bus route 870 includes 26 stops, including typical stops with large passenger flow, such as: railway station, schools (Shanxi University, Judicial School and University of Finance and Economics, etc.), companies (Foxconn), hospitals (Shanxi Provincial Hospital of Traditional Chinese Medicine and Shanxi Provincial People's Hospital are located near the Bingzhou East Street Station on Bingzhou North Road), and conference centers/hotels (Shanxi International Conference Center and multiple hotels are located near the Wuyi Square Station).

以2016年9月份为例,通过网络爬虫子模块搜索到的2016年10月份与870路公交沿线站点相关的,即将发生的事情为两个全国性学术会议分别于10月14-17日(全国复杂网络大会)和10月20-22日(全国计算机大会)在龙城国际饭店和湖滨国际大酒店(主会场,同时包括5个分会场)召开,会议地址均在五一广场站点附近。同时,网络爬虫子模块搜索到的信息显示:(1)上述两个会议的承办单位均为山西大学;(2)全国复杂网络大会的规模在1000人左右;全国计算机大会的规模在5000人左右。结合日常先验知识,可知在会议期间,将有大量师生将往返于会场与学校之间,山西大学亦在870路公交沿线上,因此可以推论会议期间870路公交的客流量将显著高于平时。Taking September 2016 as an example, the web crawler module searched for information related to bus stops along Route 870 in October 2016. The upcoming events are two national academic conferences to be held on October 14-17 (National Complex Network Conference) and October 20-22 (National Computer Conference) at Longcheng International Hotel and Lakeside International Hotel (main venue, including 5 branch venues), both of which are near the May Day Square station. At the same time, the information searched by the web crawler module shows that: (1) the organizer of the above two conferences is Shanxi University; (2) the scale of the National Complex Network Conference is about 1,000 people; the scale of the National Computer Conference is about 5,000 people. Combined with daily prior knowledge, it can be known that during the conference, a large number of teachers and students will travel between the venue and the school. Shanxi University is also along Route 870. Therefore, it can be inferred that the passenger flow of Route 870 during the conference will be significantly higher than usual.

此外,根据网络爬虫模块搜索到的会议日程可知,会议期间均为上午8:30开始,下午18:00结束。由先验知识模块可知,参会人员一般会在会议开始前半个小时内抵达会场,即上午入场高峰时间段为8:00-8:30。不失一般性,假设入场高峰时间段内的人流量满足正态分布,且上午两个会议期间往返于山西大学与五一广场间的参会人数占总人数的20%(分别为200人和1000人)。根据人流预测模块,可以得出在高峰时间段内各个时间点的出行人数,分别如图4和5所示。In addition, according to the meeting schedule searched by the web crawler module, it can be seen that the meetings all start at 8:30 in the morning and end at 18:00 in the afternoon. According to the prior knowledge module, participants generally arrive at the venue within half an hour before the meeting, that is, the peak time period for admission in the morning is 8:00-8:30. Without loss of generality, it is assumed that the flow of people during the peak time period satisfies the normal distribution, and the number of participants traveling between Shanxi University and May Day Square during the two meetings in the morning accounts for 20% of the total number of people (200 and 1000 people respectively). According to the crowd flow prediction module, the number of people traveling at each time point during the peak time period can be obtained, as shown in Figures 4 and 5 respectively.

此外,考虑到山西大学与五一广场区间内还存在其他的公交线路(譬如:103、812等)。因此,基于上述分析,可以制定出两个会议期间的870线路公交调度策略,如表1所列。In addition, considering that there are other bus routes (such as 103, 812, etc.) between Shanxi University and May Day Square, based on the above analysis, the bus dispatching strategy for route 870 during the two conferences can be formulated, as shown in Table 1.

表1满足两个会议期间参会人员出行需求的870路公交调度策略Table 1 The bus dispatching strategy for route 870 to meet the travel needs of participants during the two conferences

Figure BDA0002836008440000131
Figure BDA0002836008440000131

从表1中可以直观地看出,在全国复杂网络大会期间,基本上无需额外调度更多的公交车辆,因为该会议规模相对较小;在全国计算机大会期间,需要按照近似正态分布规律额外增开公交车辆,以满足参会人员的出行需求。需要说明的是,表1中的时间段指的是到达五一广场站点的时间,每条公交线路需根据线路全程时间提前制定发车策略。It can be seen intuitively from Table 1 that during the National Complex Network Conference, there is basically no need to dispatch more buses because the scale of the conference is relatively small; during the National Computer Conference, additional buses need to be added according to the law of approximate normal distribution to meet the travel needs of participants. It should be noted that the time period in Table 1 refers to the time to arrive at the Wuyi Square station, and each bus line needs to formulate a departure strategy in advance according to the full time of the line.

实施例2:Embodiment 2:

本实施例以山西省体育中心为研究对象,利用本发明所提出的方法研究该站点的公交调度策略。众所周知,山西省体育中心也是山西汾酒男篮的比赛主场。CBA赛季(每年的10月至次年2月)期间,均有密集的赛事。以2016年11月为例,网络爬虫模块搜索到的山西汾酒男篮的主场赛程如表2所列。从表中可以看出,所有的6场比赛开始时间均为19:35。This embodiment takes Shanxi Sports Center as the research object, and uses the method proposed in the present invention to study the bus dispatching strategy of the site. As is known to all, Shanxi Sports Center is also the home court of Shanxi Fenjiu Men's Basketball Team. During the CBA season (from October to February of the following year), there are intensive competitions. Taking November 2016 as an example, the home schedule of Shanxi Fenjiu Men's Basketball Team searched by the web crawler module is listed in Table 2. As can be seen from the table, the start time of all 6 games is 19:35.

同时,结合以下两点先验知识:(1)一般观众会提前30-60分钟入场,即可知观众的入场高峰时间段为18:30–19:30;(2)正常情况下(不包括加时赛)一场CBA比赛(含中场休息)大概持续2小时左右,因此可知观众退场高峰时间段为21:30–22:00。At the same time, combined with the following two prior knowledge: (1) the general public will enter the stadium 30-60 minutes in advance, so it can be known that the peak time for the audience to enter the stadium is 18:30-19:30; (2) under normal circumstances (excluding overtime), a CBA game (including halftime) lasts about 2 hours, so it can be known that the peak time for the audience to leave the stadium is 21:30-22:00.

表2 CBA2016-2017赛季山西汾酒男篮主场赛程表(2016年11月份)Table 2 CBA 2016-2017 season Shanxi Fenjiu men's basketball home schedule (November 2016)

轮次Round 对阵(主队在前)Matchup (home team first) 时间time 33 山西vs深圳Shanxi vs Shenzhen 11-04 19:3511-04 19:35 44 山西vs天津Shanxi vs Tianjin 11-06 19:3511-06 19:35 66 山西vs北京Shanxi vs Beijing 11-13 19:3511-13 19:35 77 山西vs辽宁Shanxi vs Liaoning 11-16 19:3511-16 19:35 1111 山西vs福建Shanxi vs Fujian 11-27 19:3511-27 19:35 1212 山西vs浙江Shanxi vs Zhejiang 11-30 19:3511-30 19:35

网络爬虫子模块搜索到的山西省体育中心周围的公交线路如表3所列。从表中可以看出,所有线路均在20:00之前结束运营,因此无法满足退场观众的出行需求。The bus routes around Shanxi Sports Center searched by the web crawler module are listed in Table 3. As can be seen from the table, all routes end their operations before 20:00, so they cannot meet the travel needs of the audience leaving the venue.

表3山西省体育中心周围公交线路表Table 3 Bus routes around Shanxi Sports Center

Figure BDA0002836008440000141
Figure BDA0002836008440000141

同时,网络爬虫子模块搜索到的关于山西汾酒男篮上座率的信息,经过数据清洗和特征分析后显示:可容纳观众总数为8000人,场均上座率约为7成,即场均约有5600名观众。保守假设约有60%的观众选择公共交通工具,因此可以推算出场均约有3360余人在入场和退场两个高峰事件段存在出行需求。At the same time, the web crawler module searched for information about the attendance rate of Shanxi Fenjiu Men's Basketball Team. After data cleaning and feature analysis, it showed that the total number of spectators that can be accommodated is 8,000, and the average attendance rate is about 70%, that is, there are about 5,600 spectators per game. Conservatively assuming that about 60% of the spectators choose public transportation, it can be inferred that there are about 3,360 people per game who have travel needs during the two peak event periods of entrance and exit.

此外,不失一般性,假设在入场和退场两个高峰时间段内,人流量满足近似正态分布,利用人流量预测模型,可以得到各个时间点的人流数量,此处以5分钟为间隔,结果如图6所示。In addition, without loss of generality, assuming that during the two peak time periods of entry and exit, the flow of people satisfies an approximate normal distribution, the flow of people at each time point can be obtained using the flow prediction model. Here, the interval is 5 minutes, and the results are shown in Figure 6.

因此,基于上述分析,可以制定出满足山西汾酒男篮观众入场需求的公交调度策略(这里,假设来自表3中5条公交线路的观众人数相等,即5条线路的调度策略相同),如表4所列,即公交调度策略也近似满足正态分布。需要说明的是,表4中的时间段指的是到达山西省体育中心的时间,每条公交线路需根据线路全程时间提前制定发车策略。Therefore, based on the above analysis, a bus dispatching strategy that meets the admission demand of the Shanxi Fenjiu Men's Basketball Team can be formulated (here, it is assumed that the number of spectators from the five bus routes in Table 3 is equal, that is, the dispatching strategies of the five routes are the same), as shown in Table 4, that is, the bus dispatching strategy also approximately satisfies the normal distribution. It should be noted that the time period in Table 4 refers to the time of arrival at the Shanxi Sports Center, and each bus route needs to formulate a departure strategy in advance according to the full journey time of the route.

表4满足山西汾酒男篮观众入场需求的公交调度策略Table 4 Bus dispatch strategy to meet the admission demand of Shanxi Fenjiu Men's Basketball Team spectators

时间段Time period 每条线路在该时间段内调度车辆的数量The number of vehicles dispatched on each route during this time period 18:30–18:4018:30–18:40 11 18:40–18:5518:40–18:55 22 18:55–19:0518:55–19:05 33 19:05–19:2019:05–19:20 22 19:20–19:3519:20–19:35 11

退场高峰时间段的公交调度策略与入场高峰时间段近似相同。与目前的运营计划相比,本实施例所给出的调度策略主要体现在两个方面:(1)在主场比赛日增开晚间班车(21:30-22:00);(2)在入场和退场高峰时间段内按照近似正态分布自适应调整班车发车频率与间隔。The bus dispatching strategy during the peak exit period is similar to that during the peak entrance period. Compared with the current operation plan, the dispatching strategy provided in this embodiment is mainly reflected in two aspects: (1) adding evening buses (21:30-22:00) on home game days; (2) adaptively adjusting the frequency and interval of shuttle buses during the peak entrance and exit periods according to an approximate normal distribution.

根据本发明提供的具体实施例,本发明公开了以下技术效果:According to the specific embodiments provided by the present invention, the present invention discloses the following technical effects:

本发明公开了一种基于沿线站点事件的公交调度方法及系统,所述公交调度方法:采用网络爬虫技术和先验知识学习方法获取未来时段内各个公交线路沿线及周围相关机构的预计发生的公交调度相关事件信息数据;对所述公交调度相关事件信息数据进行数据清洗与特征提取,获得公交调度相关事件特征数据;将公交调度相关事件特征数据输入用于人流预测的训练后的神经网络模型,获得未来时段内各个公交线路沿线的人流量;根据未来时段内各个公交线路沿线的人流量对各个公交线路沿线的公交车进行调度。本发明基于网络爬虫抓取未来一段时间内即将发生事情,同时结合日常地先验知识,利用神经网络模型实现人流量的预测,根据人流量预测结果进行调度,实现根据在未来一段时间内可能会出现的人流量大小预测结果,有针对性的提前调度。The present invention discloses a bus dispatching method and system based on line site events. The bus dispatching method: uses web crawler technology and prior knowledge learning methods to obtain bus dispatching related event information data that is expected to occur along each bus line and surrounding related institutions in the future period; performs data cleaning and feature extraction on the bus dispatching related event information data to obtain bus dispatching related event feature data; inputs the bus dispatching related event feature data into a trained neural network model for passenger flow prediction to obtain passenger flow along each bus line in the future period; dispatches buses along each bus line according to passenger flow along each bus line in the future period. The present invention is based on the web crawler to capture events that are about to occur in the future period, and at the same time combines daily prior knowledge, uses a neural network model to predict passenger flow, and dispatches according to the passenger flow prediction results, so as to achieve targeted advance dispatch according to the passenger flow size prediction results that may occur in the future period.

本说明书中各个实施例采用递进的方式描述,每个实施例重点说明的都是与其他实施例的不同之处,各个实施例之间相同相似部分互相参见即可。The various embodiments in this specification are described in a progressive manner, and each embodiment focuses on the differences from other embodiments. The same or similar parts between the various embodiments can be referenced to each other.

本文中应用了具体个例对发明的原理及实施方式进行了阐述,以上实施例的说明只是用于帮助理解本发明的方法及其核心思想,所描述的实施例仅仅是本发明的一部分实施例,而不是全部的实施例,基于本发明中的实施例,本领域普通技术人员在没有做出创造性劳动前提下所获得的所有其他实施例,都属于本发明保护的范围。This article uses specific examples to illustrate the principles and implementation methods of the invention. The description of the above embodiments is only used to help understand the method of the present invention and its core idea. The described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of the present invention.

Claims (6)

1. A bus scheduling method based on along-line station events is characterized by comprising the following steps:
acquiring predicted bus scheduling related event information data of related mechanisms along each bus route and around the bus route in a future period by adopting a web crawler technology and a priori knowledge learning method;
the method for acquiring the predicted bus scheduling related event information data of the related mechanisms along each bus route and around in the future period by adopting the web crawler technology and the priori knowledge learning method specifically comprises the following steps:
acquiring expected aperiodic bus dispatching related event information data of the related mechanisms along each bus route and around the bus route from websites of the related mechanisms along each bus route and around the bus route by adopting a web crawler technology;
analyzing historical periodic bus scheduling related events by adopting a priori knowledge learning method, and determining the distribution rule of the periodic bus scheduling related events along each bus route; comparing the future time period with the distribution rule, and determining the periodic bus scheduling related event information data of the future time period;
performing data cleaning and feature extraction on the bus scheduling related event information data to obtain bus scheduling related event feature data;
carrying out data cleaning and feature extraction on the public transportation scheduling related event information data to obtain public transportation scheduling related event feature data, and specifically comprising the following steps:
carrying out missing value processing, format conversion, repeated data removal processing and noise data removal processing on the bus scheduling related event information data to obtain cleaned bus scheduling related event information data;
verifying the cleaned bus scheduling related event information data by using a data fitting method to obtain verified bus scheduling related event information data;
carrying out data abnormal value processing on the public transport scheduling related event information data passing the verification by adopting a Lauda criterion to obtain the public transport scheduling related event information data after the abnormal value processing;
denoising and smoothing the public transportation scheduling related event information data after abnormal value processing to obtain the public transportation scheduling related event information data after denoising and smoothing;
carrying out data segmentation on the bus scheduling related event information data subjected to denoising and smoothing to obtain a plurality of data segments;
extracting the characteristics of each data segment to obtain the characteristic data of each data segment;
splicing the characteristic data of each data segment to obtain the characteristic data of the bus dispatching related events;
inputting the characteristic data of the bus scheduling related events into a trained neural network model for traffic prediction to obtain the traffic along each bus line in a future period;
and dispatching the buses along each bus line according to the pedestrian volume along each bus line in the future period.
2. The method of claim 1, wherein the neural network model is a least squares model of attenuation.
3. The bus scheduling method based on the bus stop events along the line as claimed in claim 1, wherein the bus scheduling method for the bus along each bus line according to the pedestrian volume along each bus line in the future time period specifically comprises:
according to the pedestrian volume along each bus line in the future period, a formula is utilized
Figure QLYQS_1
Calculating the maximum section passenger flow in the future time period along each bus line; wherein p is i Represents the maximum section passenger flow in the future time interval along the ith future bus route, N l The number of passengers getting on the bus at the first station in the passenger flow along the ith bus line is shown, Y l The number of people getting off the first platform in the flow of people along the ith bus line is represented, M i The number of the stations along the ith bus line is represented, and L represents the front L stations along the ith bus line;
according to the maximum section passenger flow in the future time interval along each bus line, the formula is utilized
Figure QLYQS_2
Calculating the future time interval along each bus lineMinimum number of vehicles in; wherein n is i Representing the minimum number of vehicles in a future period along the ith bus route.
4. A bus dispatching system based on station events along the line is characterized by comprising:
the knowledge acquisition module is used for acquiring the information data of the predicted bus dispatching related events of the related mechanisms along each bus route and around the bus route in the future period by adopting a web crawler technology and a priori knowledge learning method;
the knowledge acquisition module specifically comprises:
the network crawler submodule is used for acquiring the predicted aperiodic bus scheduling related event information data of the related mechanisms along each bus route and around from the websites of the related mechanisms along each bus route and around by adopting the network crawler technology;
the prior knowledge learning submodule is used for analyzing historical periodical bus scheduling related events by adopting a prior knowledge learning method and determining the distribution rule of the periodical bus scheduling related events along each bus route; comparing the future time period with the distribution rule, and determining the periodic bus scheduling related event information data of the future time period;
the data cleaning and feature extraction module is used for cleaning and extracting the data of the event information related to the bus dispatching to obtain the feature data of the event related to the bus dispatching;
the data cleaning and feature extraction module specifically comprises:
the data cleaning submodule is used for carrying out missing value processing, format conversion, repeated data removal processing and noise data removal processing on the public transportation scheduling related event information data to obtain cleaned public transportation scheduling related event information data;
the data verification submodule is used for verifying the cleaned bus dispatching related event information data by using a data fitting method to obtain the verified bus dispatching related event information data;
the data abnormal value processing submodule is used for carrying out data abnormal value processing on the verified bus dispatching related event information data by adopting a Lauda criterion to obtain the bus dispatching related event information data after the abnormal value processing;
the denoising and smoothing sub-module is used for denoising and smoothing the bus scheduling related event information data after the abnormal value processing to obtain the bus scheduling related event information data after the denoising and smoothing processing;
the data segmentation submodule is used for carrying out data segmentation on the bus scheduling related event information data subjected to denoising and smoothing processing to obtain a plurality of data segments;
the characteristic extraction submodule is used for extracting the characteristics of each data segment to obtain the characteristic data of each data segment;
the data splicing submodule is used for splicing the characteristic data of each data segment to obtain the characteristic data of the bus dispatching related events;
the passenger flow prediction module is used for inputting the characteristic data of the bus scheduling related events into a trained neural network model for passenger flow prediction to obtain the passenger flow along each bus line in a future period;
and the scheduling module is used for scheduling the buses along each bus line according to the pedestrian volume along each bus line in a future time period.
5. The bus dispatching system based on events along line stops of claim 4, wherein the neural network model is a least squares model of attenuation.
6. The bus scheduling system based on events along line stops as claimed in claim 4, wherein the scheduling module specifically comprises:
a maximum section passenger flow volume calculation submodule for utilizing a formula according to the passenger flow volume along each bus line in a future time period
Figure QLYQS_3
Calculating the maximum section passenger flow in the future time period along each bus line; wherein p is i Represents the maximum section passenger flow quantity N in the future time interval along the ith bus route l The number of passengers getting on the bus at the first station in the passenger flow along the ith bus line is shown, Y l The number of people getting off at the first platform in the pedestrian flow along the ith bus line is represented, M i The number of the stations along the ith bus line is represented, and L represents the front L stations along the ith bus line;
a minimum vehicle number calculation submodule for utilizing a formula according to the maximum section passenger flow in the future time period along each bus line
Figure QLYQS_4
Calculating the minimum number of vehicles in a future time period along each bus line; wherein n is i Representing the minimum number of vehicles in a future period along the ith bus route. />
CN202011477309.1A 2020-12-15 2020-12-15 Bus scheduling method and system based on station events along line Active CN112465396B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011477309.1A CN112465396B (en) 2020-12-15 2020-12-15 Bus scheduling method and system based on station events along line

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011477309.1A CN112465396B (en) 2020-12-15 2020-12-15 Bus scheduling method and system based on station events along line

Publications (2)

Publication Number Publication Date
CN112465396A CN112465396A (en) 2021-03-09
CN112465396B true CN112465396B (en) 2023-04-18

Family

ID=74802886

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011477309.1A Active CN112465396B (en) 2020-12-15 2020-12-15 Bus scheduling method and system based on station events along line

Country Status (1)

Country Link
CN (1) CN112465396B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113506461A (en) * 2021-07-07 2021-10-15 安徽富煌科技股份有限公司 Traffic scheduling system based on dynamic self-adaptive particle swarm algorithm

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4023753A (en) * 1974-11-22 1977-05-17 International Standard Electric Corporation Vehicle control system
CN102136190A (en) * 2011-05-03 2011-07-27 上海理工大学 Dispatching management system and method for event emergency response of urban bus passenger transport
CN102169606A (en) * 2010-02-26 2011-08-31 同济大学 Method for predicting influence of heavy passenger flow of urban rail transit network
US10167173B1 (en) * 2017-08-30 2019-01-01 International Business Machines Corporation Prioritizing the direction of a directional pedestrian mover (DPM) in real time, based on predicted pedestrian traffic flow
CN109558985A (en) * 2018-12-10 2019-04-02 南通科技职业学院 A kind of bus passenger flow amount prediction technique based on BP neural network
CN110390349A (en) * 2019-06-20 2019-10-29 浙江大学 Modeling method for forecasting bus passenger flow based on XGBoost model
CN111126681A (en) * 2019-12-12 2020-05-08 华侨大学 A bus route adjustment method based on historical passenger flow
CN112036670A (en) * 2020-11-03 2020-12-04 成都智元汇信息技术股份有限公司 Passenger flow comprehensive prediction system and prediction method

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102044149B (en) * 2011-01-12 2012-08-08 北京交通大学 City bus operation coordinating method and device based on time variant passenger flows
CN104573849A (en) * 2014-12-12 2015-04-29 安徽富煌和利时科技股份有限公司 Bus dispatch optimization method for predicting passenger flow based on ARIMA model
US9691275B2 (en) * 2015-11-06 2017-06-27 International Business Machines Corporation Adjusting vehicle timing in a transportation network
CN113643538B (en) * 2021-08-11 2023-05-12 昆山轨道交通投资置业有限公司 Bus passenger flow measuring and calculating method integrating IC card historical data and manual investigation data

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4023753A (en) * 1974-11-22 1977-05-17 International Standard Electric Corporation Vehicle control system
CN102169606A (en) * 2010-02-26 2011-08-31 同济大学 Method for predicting influence of heavy passenger flow of urban rail transit network
CN102136190A (en) * 2011-05-03 2011-07-27 上海理工大学 Dispatching management system and method for event emergency response of urban bus passenger transport
US10167173B1 (en) * 2017-08-30 2019-01-01 International Business Machines Corporation Prioritizing the direction of a directional pedestrian mover (DPM) in real time, based on predicted pedestrian traffic flow
CN109558985A (en) * 2018-12-10 2019-04-02 南通科技职业学院 A kind of bus passenger flow amount prediction technique based on BP neural network
CN110390349A (en) * 2019-06-20 2019-10-29 浙江大学 Modeling method for forecasting bus passenger flow based on XGBoost model
CN111126681A (en) * 2019-12-12 2020-05-08 华侨大学 A bus route adjustment method based on historical passenger flow
CN112036670A (en) * 2020-11-03 2020-12-04 成都智元汇信息技术股份有限公司 Passenger flow comprehensive prediction system and prediction method

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
Xiao-xia Rong.A Robust Optimization Approach to Emergency Vehicle Scheduling.《Mathematical Problems in Engineering》.2013,第1-8页. *
光志瑞 ; .城市轨道交通节假日客流预测研究.交通工程.2017,(03),第27-35页. *
王超 ; 曹新涛 ; .异常事件下的公交动态调度优化算法研究.公路交通科技(应用技术版).2013,(10),第339-341页. *

Also Published As

Publication number Publication date
CN112465396A (en) 2021-03-09

Similar Documents

Publication Publication Date Title
CN108053062B (en) A method for generating customized bus routes based on multi-source data
CN109033718B (en) A dynamic emergency evacuation method for urban rail transit line failure
De Bona et al. Analysis of Public Bus Transportation of a Brazilian City Based on the Theory of Complex Networks Using the P‐Space
CN107545730B (en) Bus IC card data-based station getting-on/off passenger number estimation method
CN103200114B (en) Metropolitan area network planing method
CN105046379A (en) City bus departure timetable optimization method
CN112766605B (en) Multi-source passenger flow prediction system and method based on container cloud platform
CN106960261A (en) A kind of track traffic for passenger flow Forecasting Methodology based on track IC-card and mobile phone signaling data
Hajduk Selected aspects of measuring performance of smart cities in spatial management
CN112465396B (en) Bus scheduling method and system based on station events along line
CN113256326A (en) Method for realizing prediction of commodity extra-large screen point position pedestrian volume based on deep learning
Liu et al. High‐speed railway and urban productivity disparities
Grabovyy Digitalization of the world economy-a factor in the development of society
CN116031918B (en) Dynamic elastic power supply restoration method and system for urban power system under typhoon disaster
Jiang et al. Identification of technology spillover among airport alliance from the perspective of efficiency evaluation: The case of China
Yang et al. Estimating the impacts of high-speed rail on service industry agglomeration in China: Advanced modelling with spatial difference-in-difference models and propensity score matching
CN119180525B (en) A method for optimizing bus schedule with maximum synchronous transfer considering passenger flow constraints
CN120087527A (en) Urban rail transit passenger flow prediction method based on multi-factor algorithm
CN113715875B (en) Train operation regulation and control method and system for initial delay and interval speed limit
CN111861219B (en) Regional rail transit global structure risk bottleneck identification method and system
Chang et al. STUDY ON POST EVALUATION OF HIGH-SPEED RAILWAY BASED ON FAHP AND MATLAB SIMULATION CALCULATION.
CN108074043A (en) A kind of mating Electric power network planning method of city integrated piping lane
CN111754071A (en) A global safety enhancement method for regional rail transit
Puri Effects of Mass Rapid Transit Systems (MRTS) on Changing Urban Landscape: A Remote Sensing-Based Study of Delhi Metro
CN113657672A (en) Dynamic planning-based comprehensive hub last bus connection method

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant